\relax 
\select@language{english}
\@writefile{toc}{\select@language{english}}
\@writefile{lof}{\select@language{english}}
\@writefile{lot}{\select@language{english}}
\@writefile{toc}{\contentsline {section}{\numberline {1}Previews of selected examples and case studies...}{6}}
\@writefile{toc}{\contentsline {subsection}{\numberline {1.1}Example 1: A Simple TP server}{7}}
\newlabel{Pqueue}{{1.1}{7}}
\@writefile{toc}{\contentsline {subsection}{\numberline {1.2}Example 2: A simple TP server}{8}}
\newlabel{Pqueue}{{1.2}{8}}
\@writefile{toc}{\contentsline {subsection}{\numberline {1.3}Example 3: A simple multiprocessor TP system}{9}}
\newlabel{simplemult}{{1.3}{9}}
\newlabel{twodisks}{{10}{10}}
\@writefile{toc}{\contentsline {subsection}{\numberline {1.4}Example 5: A Simple Computer Model}{11}}
\newlabel{simpleCPU}{{1.4}{11}}
\newlabel{simpleCPUbatch}{{12}{12}}
\newlabel{simpleCPUbatch}{{13}{13}}
\newlabel{lifetime1chart}{{14}{14}}
\@writefile{toc}{\contentsline {subsection}{\numberline {1.5}Example 8: A multiaccess multiprogramming system with virtual memory}{15}}
\newlabel{multiprogterm1}{{1.5}{15}}
\@writefile{toc}{\contentsline {section}{\numberline {2}Stochastic Processes}{17}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.1}Introduction}{17}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.2}Example: The Poisson process}{19}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.3}Memoryless Property of the (negative) exponential distribution}{20}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.4}More properties of the Poisson process}{22}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.5}Derivation of the Poisson process}{24}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.6}Derivation of the interarrival time distribution}{27}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.7}Superposition Property}{28}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.8}Decomposition Property}{30}}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces Superposition and decomposition of a Poisson process}}{31}}
\newlabel{equivalent-open-network}{{1}{31}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.9}Markov Chains and Markov Processes}{33}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.10}Markov Chains}{34}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.10.1}Examples}{36}}
\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces Telephone line example }}{36}}
\newlabel{telephone-line}{{2}{36}}
\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces  I/O buffer example}}{38}}
\newlabel{io-buffer}{{3}{38}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.10.2}Multi-step transition probabilities}{40}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.10.3}Definitions and properties of MCs}{43}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.10.4}Recurrent states}{45}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.10.5}Further properties of MCs}{47}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.10.6}Null \& positive recurrence}{50}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.10.7}Steady state theorem for Markov chains}{52}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.11}Markov Processes}{54}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.11.1}Time homogeneous Markov Processes}{56}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.11.2}Instantaneous transition rates}{56}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.11.3}Examples}{57}}
\@writefile{lof}{\contentsline {figure}{\numberline {4}{\ignorespaces  Buffer problem }}{59}}
\newlabel{buffer }{{4}{59}}
\@writefile{lof}{\contentsline {figure}{\numberline {5}{\ignorespaces  Telephone exchange }}{61}}
\newlabel{telephone}{{5}{61}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.11.4}The Generator Matrix}{63}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.11.5}Transition probabilities \& rates}{63}}
\@writefile{lof}{\contentsline {figure}{\numberline {6}{\ignorespaces  (Ir)reducible Markov chains}}{64}}
\newlabel{irreducible}{{6}{64}}
\@writefile{lof}{\contentsline {figure}{\numberline {7}{\ignorespaces  Transition rates in Markov chains}}{66}}
\newlabel{transition}{{7}{66}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.12}Steady state results}{69}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.12.1}Steady State Theorem for Markov Processes}{69}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.12.2}Justification of the Balance Equation}{70}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.12.3}Buffer example (DTMC)}{72}}
\@writefile{lof}{\contentsline {figure}{\numberline {8}{\ignorespaces  I/O buffer. }}{72}}
\newlabel{no-overtaking}{{8}{72}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.12.4}Examples (CTMC)}{75}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.12.5}Birth-Death processes and the single server queue (SSQ)}{77}}
\@writefile{lof}{\contentsline {figure}{\numberline {9}{\ignorespaces  Single server queue. }}{77}}
\newlabel{ssq}{{9}{77}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.12.6}The memoryless property in the M/M/1 queue}{79}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.12.7}State transition diagram for the SSQ}{81}}
\@writefile{lof}{\contentsline {figure}{\numberline {10}{\ignorespaces  Single server queue state diagram. }}{81}}
\newlabel{ssq}{{10}{81}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.12.8}Response times}{86}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.12.9}Distribution of the waiting time, $F_W(x)$}{88}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.13}Multiple parallel servers - M/M/m queue}{91}}
\@writefile{lof}{\contentsline {figure}{\numberline {11}{\ignorespaces  Multiple parallel servers. }}{91}}
\newlabel{ssq}{{11}{91}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.13.1}Waiting times}{94}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.13.2}The infinite server}{96}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.14}M/M/m queues with finite state space}{97}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.14.1}Terminal system with parallel processing}{99}}
\@writefile{lof}{\contentsline {figure}{\numberline {12}{\ignorespaces  Terminals with parallel processors. }}{99}}
\newlabel{ssq}{{12}{99}}
\@writefile{lof}{\contentsline {figure}{\numberline {13}{\ignorespaces  State transition diagram. }}{101}}
\newlabel{ssq}{{13}{101}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.14.2}The case of ``always sufficient processors'' - $m\geq N$}{104}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.14.3}Analogy with a queueing network}{106}}
\@writefile{lof}{\contentsline {figure}{\numberline {14}{\ignorespaces  Original and equivalent network. }}{106}}
\newlabel{ssq}{{14}{106}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.15}Little's result/formula/law (J.D.C. Little, 1961)}{107}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.15.1}Application of Little's law}{109}}
\@writefile{lof}{\contentsline {figure}{\numberline {15}{\ignorespaces  Little's law. }}{109}}
\newlabel{little}{{15}{109}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.16}Single Server Queue with general service times - M/G/1 queue}{111}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.16.1}The fourth equation}{112}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.17}Embedded Markov Chain}{114}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.18}Balance equations for the M/G/1 queue}{116}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.18.1}Solutions to the balance equations}{117}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.18.2}Solution for $p(z)$ and the Pollaczek-Khinchine result}{121}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.18.3}Derivation of P-K formula}{122}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.18.4}Waiting time distribution}{125}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.19}Example: Paging fixed head disk}{127}}
\@writefile{lof}{\contentsline {figure}{\numberline {16}{\ignorespaces  Paging fixed head disk. }}{127}}
\newlabel{paging-drum}{{16}{127}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.19.1}Solution and asymptotic behaviour}{128}}
\@writefile{toc}{\contentsline {section}{\numberline {3}Queueing Networks}{130}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.1}Introduction}{130}}
\@writefile{lof}{\contentsline {figure}{\numberline {17}{\ignorespaces  Network example }}{130}}
\newlabel{network-example}{{17}{130}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.2}Types of network}{132}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.3}Types of server}{133}}
\@writefile{toc}{\contentsline {section}{\numberline {4}Open networks (single class)}{134}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.1}Traffic equations}{136}}
\@writefile{lof}{\contentsline {figure}{\numberline {18}{\ignorespaces  Traffic equations }}{136}}
\newlabel{traffic}{{18}{136}}
\@writefile{lof}{\contentsline {figure}{\numberline {19}{\ignorespaces  Traffic example. }}{137}}
\newlabel{traffic-example}{{19}{137}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.2}Steady state queue length probabilities}{139}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.3}Mean Value analysis}{141}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.4}An alternative formulation}{142}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.5}Distribution of time delays}{146}}
\@writefile{lof}{\contentsline {figure}{\numberline {20}{\ignorespaces  A network with no overtaking. }}{146}}
\newlabel{no-overtaking}{{20}{146}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.6}Time delays in general networks}{149}}
\@writefile{lof}{\contentsline {figure}{\numberline {21}{\ignorespaces  A network with overtaking. }}{149}}
\newlabel{overtaking}{{21}{149}}
\@writefile{toc}{\contentsline {section}{\numberline {5}Closed Queueing Networks}{152}}
\newlabel{sec:closed-qn}{{5}{152}}
\newlabel{eq:route}{{5}{152}}
\newlabel{eq:traffic}{{5}{152}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.1}Steady state probability distribution for $S$}{154}}
\newlabel{eq:prob}{{1}{154}}
\newlabel{eq:G}{{2}{154}}
\newlabel{eq:prob}{{3}{155}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.2}Computation of the normalising constant}{158}}
\newlabel{sec:G}{{5.2}{158}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.3}Marginal queue length probabilities and performance measures}{161}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.4}Alternative Formulation: Cumulative Probabilities}{163}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.5}Equivalent open networks and the use of mean value analysis}{167}}
\@writefile{lof}{\contentsline {figure}{\numberline {22}{\ignorespaces  Equivalent open network. }}{167}}
\newlabel{equivalent-open-network}{{22}{167}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.6}Visitation rates and application of Little's result}{169}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.7}Mean waiting times}{171}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.8}Recurrence relations for throughput, mean waiting times and mean queue length}{173}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.9}Alternative formulation}{175}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.10}A faster approximate algorithm}{178}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.11}Example: Multiprogramming computer system}{180}}
\@writefile{lof}{\contentsline {figure}{\numberline {23}{\ignorespaces  A multiprogrammed computer. }}{180}}
\newlabel{multi-programming-computer}{{23}{180}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.12}Application: A batch system with virtual memory}{182}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {5.12.1}Representation of paging}{182}}
\@writefile{lof}{\contentsline {figure}{\numberline {24}{\ignorespaces  Lifetime functions }}{184}}
\newlabel{lifetimea}{{24}{184}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.13}Solution}{186}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.14}Choice of lifetime function}{188}}
\@writefile{lof}{\contentsline {figure}{\numberline {25}{\ignorespaces  Lifetime function example. }}{188}}
\newlabel{lifetime-example}{{25}{188}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.15}Thrashing curves}{188}}
\@writefile{lof}{\contentsline {figure}{\numberline {26}{\ignorespaces  Mean job processing time vs. number of jobs.}}{188}}
\newlabel{mean-job-processing-time}{{26}{188}}
\@writefile{lof}{\contentsline {figure}{\numberline {27}{\ignorespaces Throughput vs. number of Jobs. }}{189}}
\newlabel{/throughput-v-number-of-jobs}{{27}{189}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.16}Decomposition}{191}}
\@writefile{lof}{\contentsline {figure}{\numberline {28}{\ignorespaces  Flow equivalent server. }}{191}}
\newlabel{jobtime-job}{{28}{191}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.17}Method}{194}}
\@writefile{lof}{\contentsline {figure}{\numberline {29}{\ignorespaces  Flow equivalent server - step 1. }}{194}}
\newlabel{fes-step1}{{29}{194}}
\@writefile{lof}{\contentsline {figure}{\numberline {30}{\ignorespaces  Flow equivalent server - step 2. }}{194}}
\newlabel{fes-step2}{{30}{194}}
\@writefile{lof}{\contentsline {figure}{\numberline {31}{\ignorespaces  Flow equivalent server - step 3. }}{195}}
\newlabel{fes-step3}{{31}{195}}
\@writefile{lof}{\contentsline {figure}{\numberline {32}{\ignorespaces  Flow equivalent server - step 5. }}{196}}
\newlabel{fes-step5}{{32}{196}}
\@writefile{lof}{\contentsline {figure}{\numberline {33}{\ignorespaces  Flow equivalent server - trick. }}{196}}
\newlabel{fes-trick}{{33}{196}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.18}Application: A multiprogramming system with virtual memory}{198}}
\@writefile{lof}{\contentsline {figure}{\numberline {34}{\ignorespaces Multiprogramming system with virtual memory }}{198}}
\newlabel{mpvm-system}{{34}{198}}
\@writefile{lof}{\contentsline {figure}{\numberline {35}{\ignorespaces Multiprogramming system with virtual memory - step 1}}{199}}
\newlabel{mpvm-system-step1}{{35}{199}}
\@writefile{lof}{\contentsline {figure}{\numberline {36}{\ignorespaces Multiprogramming system with virtual memory - FES}}{201}}
\newlabel{mpvm-system-fes}{{36}{201}}
\@writefile{lof}{\contentsline {figure}{\numberline {37}{\ignorespaces  Throughput vs. number of terminals. }}{204}}
\newlabel{mpvm-system-tau-v-K}{{37}{204}}
\@writefile{lof}{\contentsline {figure}{\numberline {38}{\ignorespaces  Mean response time vs. number of terminals. }}{205}}
\newlabel{mpvm-system-W-v-K}{{38}{205}}
\@writefile{lof}{\contentsline {figure}{\numberline {39}{\ignorespaces  Central server population vs. number of terminals. }}{205}}
\newlabel{mpvm-system-L-v-K}{{39}{205}}
\@writefile{toc}{\contentsline {section}{\numberline {6}Markov Modulated Poisson Process (MMPP)}{206-1}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.1}Introduction}{207}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.2}Definition of MMPP}{208}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.3}State at Arrival Instants}{211}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.4}The MMPP/M/1 queue}{212}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.5}Exact solution methods}{217}}
\citation{Mitrani}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.6}Approximate solution methods}{220}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.7}Fitting MMPPs}{221}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.8}Autocorrelation function of the MMPP}{222}}
\newlabel{eq:acfm}{{4}{222}}
\citation{Leland}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.9}Interlude: self-similarity}{229}}
\bibcite{Mitrani}{IM}