<x:xmpmeta tsc:version="2.0.1" xmlns:x="adobe:ns:meta/" xmlns:tsc="http://www.techsmith.com/xmp/tsc/">
   <rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:xmp="http://ns.adobe.com/xap/1.0/" xmlns:xmpDM="http://ns.adobe.com/xmp/1.0/DynamicMedia/" xmlns:xmpG="http://ns.adobe.com/xap/1.0/g/" xmlns:xmpMM="http://ns.adobe.com/xap/1.0/mm/" xmlns:tscDM="http://www.techsmith.com/xmp/tscDM/" xmlns:tscIQ="http://www.techsmith.com/xmp/tscIQ/" xmlns:tscHS="http://www.techsmith.com/xmp/tscHS/" xmlns:stDim="http://ns.adobe.com/xap/1.0/sType/Dimensions#" xmlns:stFnt="http://ns.adobe.com/xap/1.0/sType/Font#" xmlns:exif="http://ns.adobe.com/exif/1.0" xmlns:dc="http://purl.org/dc/elements/1.1/">
      <rdf:Description dc:date="2017-10-27 12:25:27 AM" dc:source="Camtasia,9.0.5,enu" dc:title="k_30iqt2" tscDM:firstFrame="k_30iqt2_First_Frame.png" tscDM:originId="2625EA67-814F-4A0C-B4C7-2902396CFF3B" tscDM:project="k_30iqt2.tscproj">
         <xmpDM:duration xmpDM:scale="1/1000" xmpDM:value="4711566"/>
         <xmpDM:videoFrameSize stDim:unit="pixel" stDim:h="600" stDim:w="800"/>
         <tsc:langName>
            <rdf:Bag>
               <rdf:li xml:lang="en-US">English</rdf:li></rdf:Bag>
         </tsc:langName>
         <xmpDM:Tracks>
            <rdf:Bag>
               <rdf:li>
                  <rdf:Description xmpDM:trackType="ScreenText" xmpDM:frameRate="f1000" xmpDM:trackName="Screen Text">
                     <xmpDM:markers>
                        <rdf:Seq>
                           <rdf:li><rdf:Description xmpDM:name="Basic Components of a Queue 1." xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Arrival process 6." xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Service discipline 2." xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Service time distribution 4." xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Waiting positions 3." xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Number of servers 5." xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Population Size" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Kendall Notation A/S/m/B/K/SD A: Arrival process S: Service time distribution m: Number of servers B: Number of buffers (system capacity)" xmpDM:startTime="24267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="K: Population size, and SD: Service discipline" xmpDM:startTime="24267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Arrival Process Arrival times: Interarrival times: tj form a sequence of Independent and Identically Distributed (IID) random variables Notation: M" xmpDM:startTime="24633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= Memoryless Þ Exponential E = Erlang H = Hyper-exponential D = Deterministic  constant G = General  Results" xmpDM:startTime="24633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="valid for all distributions TP_tmp TP_tmp" xmpDM:startTime="24633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Kendall Notation A/S/m/B/K/SD A: Arrival process S: Service time distribution m: Number of servers B: Number of buffers (system capacity)" xmpDM:startTime="25667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="K: Population size, and SD: Service discipline" xmpDM:startTime="25667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Arrival Process Arrival times: Interarrival times: tj form a sequence of Independent and Identically Distributed (IID) random variables Notation: M" xmpDM:startTime="66700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= Memoryless Þ Exponential E = Erlang H = Hyper-exponential D = Deterministic  constant G = General  Results" xmpDM:startTime="66700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="valid for all distributions TP_tmp TP_tmp" xmpDM:startTime="66700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Service Time Distribution Time each student spends at the terminal." xmpDM:startTime="67400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Service times are IID." xmpDM:startTime="67400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Distribution: M, E, H, D, or G Device = Service center = Queue Buffer = Waiting positions" xmpDM:startTime="67400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Service Disciplines First-Come-First-Served (FCFS) Last-Come-First-Served (LCFS) = Stack (used in 9-1-1 calls) Last-Come-First-Served with Preempt and Resume (LCFS-PR) Round-Robin (RR)" xmpDM:startTime="67700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="with a fixed quantum." xmpDM:startTime="67700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Small Quantum  Processor Sharing (PS) Infinite Server: (IS) = fixed delay Shortest Processing Time first (SPT) Shortest Remaining Processing" xmpDM:startTime="67700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Time first (SRPT) Shortest Expected Processing Time first (SEPT) Shortest Expected Remaining Processing Time first (SERPT)." xmpDM:startTime="67700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Biggest-In-First-Served (BIFS) Loudest-Voice-First-Served (LVFS)" xmpDM:startTime="67700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example M/M/3/20/1500/FCFS Time between successive arrivals is exponentially distributed." xmpDM:startTime="68233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Service times are exponentially distributed." xmpDM:startTime="68233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Three servers 20 Buffers = 3 service + 17 waiting After 20, all arriving jobs are lost Total of 1500" xmpDM:startTime="68233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="jobs that can be serviced." xmpDM:startTime="68233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Service discipline is first-come-first-served." xmpDM:startTime="68233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Defaults: Infinite buffer capacity Infinite population size FCFS service discipline." xmpDM:startTime="68233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="G/G/1 = G/G/1/1/1/FCFS" xmpDM:startTime="68233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Service Disciplines First-Come-First-Served (FCFS) Last-Come-First-Served (LCFS) = Stack (used in 9-1-1 calls) Last-Come-First-Served with Preempt and Resume (LCFS-PR) Round-Robin (RR)" xmpDM:startTime="79367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="with a fixed quantum." xmpDM:startTime="79367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Small Quantum  Processor Sharing (PS) Infinite Server: (IS) = fixed delay Shortest Processing Time first (SPT) Shortest Remaining Processing" xmpDM:startTime="79367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Time first (SRPT) Shortest Expected Processing Time first (SEPT) Shortest Expected Remaining Processing Time first (SERPT)." xmpDM:startTime="79367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Biggest-In-First-Served (BIFS) Loudest-Voice-First-Served (LVFS)" xmpDM:startTime="79367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Service Time Distribution Time each student spends at the terminal." xmpDM:startTime="79600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Service times are IID." xmpDM:startTime="79600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Distribution: M, E, H, D, or G Device = Service center = Queue Buffer = Waiting positions" xmpDM:startTime="79600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Arrival Process Arrival times: Interarrival times: tj form a sequence of Independent and Identically Distributed (IID) random variables Notation: M" xmpDM:startTime="79833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= Memoryless Þ Exponential E = Erlang H = Hyper-exponential D = Deterministic  constant G = General  Results" xmpDM:startTime="79833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="valid for all distributions TP_tmp TP_tmp" xmpDM:startTime="79833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Kendall Notation A/S/m/B/K/SD A: Arrival process S: Service time distribution m: Number of servers B: Number of buffers (system capacity)" xmpDM:startTime="80033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="K: Population size, and SD: Service discipline" xmpDM:startTime="80033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Basic Components of a Queue 1." xmpDM:startTime="80333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Arrival process 6." xmpDM:startTime="80333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Service discipline 2." xmpDM:startTime="80333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Service time distribution 4." xmpDM:startTime="80333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Waiting positions 3." xmpDM:startTime="80333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Number of servers 5." xmpDM:startTime="80333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Population Size" xmpDM:startTime="80333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Kendall Notation A/S/m/B/K/SD A: Arrival process S: Service time distribution m: Number of servers B: Number of buffers (system capacity)" xmpDM:startTime="81700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="K: Population size, and SD: Service discipline" xmpDM:startTime="81700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Basic Components of a Queue 1." xmpDM:startTime="83900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Arrival process 6." xmpDM:startTime="83900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Service discipline 2." xmpDM:startTime="83900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Service time distribution 4." xmpDM:startTime="83900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Waiting positions 3." xmpDM:startTime="83900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Number of servers 5." xmpDM:startTime="83900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Population Size" xmpDM:startTime="83900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Kendall Notation A/S/m/B/K/SD A: Arrival process S: Service time distribution m: Number of servers B: Number of buffers (system capacity)" xmpDM:startTime="85067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="K: Population size, and SD: Service discipline" xmpDM:startTime="85067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Arrival Process Arrival times: Interarrival times: tj form a sequence of Independent and Identically Distributed (IID) random variables Notation: M" xmpDM:startTime="85833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= Memoryless Þ Exponential E = Erlang H = Hyper-exponential D = Deterministic  constant G = General  Results" xmpDM:startTime="85833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="valid for all distributions TP_tmp TP_tmp" xmpDM:startTime="85833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Service Time Distribution Time each student spends at the terminal." xmpDM:startTime="278133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Service times are IID." xmpDM:startTime="278133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Distribution: M, E, H, D, or G Device = Service center = Queue Buffer = Waiting positions" xmpDM:startTime="278133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Service Disciplines First-Come-First-Served (FCFS) Last-Come-First-Served (LCFS) = Stack (used in 9-1-1 calls) Last-Come-First-Served with Preempt and Resume (LCFS-PR) Round-Robin (RR)" xmpDM:startTime="350467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="with a fixed quantum." xmpDM:startTime="350467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Small Quantum  Processor Sharing (PS) Infinite Server: (IS) = fixed delay Shortest Processing Time first (SPT) Shortest Remaining Processing" xmpDM:startTime="350467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Time first (SRPT) Shortest Expected Processing Time first (SEPT) Shortest Expected Remaining Processing Time first (SERPT)." xmpDM:startTime="350467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Biggest-In-First-Served (BIFS) Loudest-Voice-First-Served (LVFS)" xmpDM:startTime="350467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example M/M/3/20/1500/FCFS Time between successive arrivals is exponentially distributed." xmpDM:startTime="694333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Service times are exponentially distributed." xmpDM:startTime="694333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Three servers 20 Buffers = 3 service + 17 waiting After 20, all arriving jobs are lost Total of 1500" xmpDM:startTime="694333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="jobs that can be serviced." xmpDM:startTime="694333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Service discipline is first-come-first-served." xmpDM:startTime="694333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Defaults: Infinite buffer capacity Infinite population size FCFS service discipline." xmpDM:startTime="694333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="G/G/1 = G/G/1/1/1/FCFS" xmpDM:startTime="694333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 30A Key: A/S/m/B/K/SD T F   The number of servers in a M/M/1/3 queue is 3  " xmpDM:startTime="881167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="G/G/1/30/300/LCFS queue is like a stack   M/D/3/30 queue has 30 buffers   G/G/1 queue has 1 population" xmpDM:startTime="881167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="size   D/D/1 queue has FCFS discipline" xmpDM:startTime="881167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 30A Key: A/S/m/B/K/SD T F   The number of servers in a M/M/1/3 queue is 3" xmpDM:startTime="917400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="  G/G/1/30/300/LCFS queue is like a stack   M/D/3/30 queue has 30 buffers   G/G/1 queue has" xmpDM:startTime="917400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1 population size   D/D/1 queue has FCFS discipline" xmpDM:startTime="917400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Exponential Distribution Probability Density Function (pdf): Cumulative Distribution Function (cdf): Mean: a Variance: a2 Coefficient of Variation = (Std Deviation)/mean" xmpDM:startTime="917600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= 1 Memoryless: Expected time to the next arrival is always a regardless of the time since the last arrival" xmpDM:startTime="917600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Remembering the past history does not help." xmpDM:startTime="917600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="TP_tmp TP_tmp x f(x) x F(x) TP_tmp 1" xmpDM:startTime="917600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 30A Key: A/S/m/B/K/SD T F   The number of servers in a M/M/1/3 queue is 3" xmpDM:startTime="918767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="  G/G/1/30/300/LCFS queue is like a stack   M/D/3/30 queue has 30 buffers   G/G/1 queue has" xmpDM:startTime="918767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1 population size   D/D/1 queue has FCFS discipline" xmpDM:startTime="918767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Exponential Distribution Probability Density Function (pdf): Cumulative Distribution Function (cdf): Mean: a Variance: a2 Coefficient of Variation = (Std Deviation)/mean" xmpDM:startTime="965300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= 1 Memoryless: Expected time to the next arrival is always a regardless of the time since the last arrival" xmpDM:startTime="965300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Remembering the past history does not help." xmpDM:startTime="965300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="TP_tmp TP_tmp x f(x) x F(x) TP_tmp 1" xmpDM:startTime="965300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Erlang Distribution Sum of k exponential random variables Series of k servers with exponential service times Probability Density Function (pdf):" xmpDM:startTime="1185833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Expected Value: ak Variance: a2k CoV: 1/k TP_tmp TP_tmp 1 k …" xmpDM:startTime="1185833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hyper-Exponential Distribution The variable takes ith value with probability pi xi is exponentially distributed with mean ai Higher variance than" xmpDM:startTime="1342000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="exponential Coefficient of variation &gt; 1 x1 x2 xm x …" xmpDM:startTime="1342000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Erlang Distribution Sum of k exponential random variables Series of k servers with exponential service times Probability Density Function (pdf):" xmpDM:startTime="1387233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Expected Value: ak Variance: a2k CoV: 1/k TP_tmp TP_tmp 1 k …" xmpDM:startTime="1387233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hyper-Exponential Distribution The variable takes ith value with probability pi xi is exponentially distributed with mean ai Higher variance than" xmpDM:startTime="1392667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="exponential Coefficient of variation &gt; 1 x1 x2 xm x …" xmpDM:startTime="1392667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Erlang Distribution Sum of k exponential random variables Series of k servers with exponential service times Probability Density Function (pdf):" xmpDM:startTime="1432767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Expected Value: ak Variance: a2k CoV: 1/k TP_tmp TP_tmp 1 k …" xmpDM:startTime="1432767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hyper-Exponential Distribution The variable takes ith value with probability pi xi is exponentially distributed with mean ai Higher variance than" xmpDM:startTime="1434967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="exponential Coefficient of variation &gt; 1 x1 x2 xm x …" xmpDM:startTime="1434967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Group Arrivals/Service Bulk arrivals/service M[x]: x represents the group size G[x]: a bulk arrival or service process with general inter-group" xmpDM:startTime="1447433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="times." xmpDM:startTime="1447433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Examples: M[x]/M/1 : Single server queue with bulk Poisson arrivals and exponential service times M/G[x]/m: Poisson arrival process, bulk service" xmpDM:startTime="1447433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="with general service time distribution, and m servers." xmpDM:startTime="1447433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1447433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 30B Exponential distribution is denoted as ___ ____________ distribution represents a set of parallel exponential servers Erlang distribution Ek" xmpDM:startTime="1550233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="with k=1 is same as ________ distribution" xmpDM:startTime="1550233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 30B Exponential distribution is denoted as M Hyperexponential distribution represents a set of parallel exponential servers Erlang" xmpDM:startTime="1593100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="distribution Ek with k=1 is same as Exponential distribution" xmpDM:startTime="1593100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables 1 2 m Previous Arrival Arrival Begin Service End Service t w s r n nq ns l" xmpDM:startTime="1608567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="m Time" xmpDM:startTime="1608567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont) t = Inter-arrival time = time between two successive arrivals." xmpDM:startTime="1681033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="l = Mean arrival rate = 1/E[t] May be a function of the state of the system, e.g.," xmpDM:startTime="1681033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="number of jobs already in the system." xmpDM:startTime="1681033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="s = Service time per job." xmpDM:startTime="1681033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="m = Mean service rate per server = 1/E[s] Total service rate for m servers is mm n = Number" xmpDM:startTime="1681033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of jobs in the system." xmpDM:startTime="1681033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="This is also called queue length." xmpDM:startTime="1681033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Note: Queue length includes jobs currently receiving service as well as those waiting in the queue." xmpDM:startTime="1681033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1681033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables 1 2 m Previous Arrival Arrival Begin Service End Service t w s r n nq ns l" xmpDM:startTime="1731600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="m Time" xmpDM:startTime="1731600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont) t = Inter-arrival time = time between two successive arrivals." xmpDM:startTime="1788433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="l = Mean arrival rate = 1/E[t] May be a function of the state of the system, e.g.," xmpDM:startTime="1788433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="number of jobs already in the system." xmpDM:startTime="1788433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="s = Service time per job." xmpDM:startTime="1788433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="m = Mean service rate per server = 1/E[s] Total service rate for m servers is mm n = Number" xmpDM:startTime="1788433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of jobs in the system." xmpDM:startTime="1788433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="This is also called queue length." xmpDM:startTime="1788433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Note: Queue length includes jobs currently receiving service as well as those waiting in the queue." xmpDM:startTime="1788433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1788433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont) nq = Number of jobs waiting ns = Number of jobs receiving service r = Response time" xmpDM:startTime="1798233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="or the time in the system = time waiting + time receiving service w = Waiting time = Time between" xmpDM:startTime="1798233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="arrival and beginning of service" xmpDM:startTime="1798233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1804933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues (cont) 3." xmpDM:startTime="1811800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Number versus Time: If jobs are not lost due to insufficient buffers, Mean number of jobs in the system =" xmpDM:startTime="1811800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Arrival rate  Mean response time 4." xmpDM:startTime="1811800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Similarly, Mean number of jobs in the queue = Arrival rate  Mean waiting time This is known as Little's" xmpDM:startTime="1811800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="law." xmpDM:startTime="1811800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="5." xmpDM:startTime="1811800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Time in System versus Time in Queue r = w + s r, w, and s are random variables." xmpDM:startTime="1811800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="E[r] = E[w] + E[s]" xmpDM:startTime="1811800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1813267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2044333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues (cont) 3." xmpDM:startTime="2077800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Number versus Time: If jobs are not lost due to insufficient buffers, Mean number of jobs in the system =" xmpDM:startTime="2077800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Arrival rate  Mean response time 4." xmpDM:startTime="2077800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Similarly, Mean number of jobs in the queue = Arrival rate  Mean waiting time This is known as Little's" xmpDM:startTime="2077800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="law." xmpDM:startTime="2077800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="5." xmpDM:startTime="2077800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Time in System versus Time in Queue r = w + s r, w, and s are random variables." xmpDM:startTime="2077800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="E[r] = E[w] + E[s]" xmpDM:startTime="2077800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2150433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont) nq = Number of jobs waiting ns = Number of jobs receiving service r = Response time" xmpDM:startTime="2151000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="or the time in the system = time waiting + time receiving service w = Waiting time = Time between" xmpDM:startTime="2151000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="arrival and beginning of service" xmpDM:startTime="2151000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont) t = Inter-arrival time = time between two successive arrivals." xmpDM:startTime="2151500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="l = Mean arrival rate = 1/E[t] May be a function of the state of the system, e.g.," xmpDM:startTime="2151500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="number of jobs already in the system." xmpDM:startTime="2151500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="s = Service time per job." xmpDM:startTime="2151500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="m = Mean service rate per server = 1/E[s] Total service rate for m servers is mm n = Number" xmpDM:startTime="2151500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of jobs in the system." xmpDM:startTime="2151500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="This is also called queue length." xmpDM:startTime="2151500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Note: Queue length includes jobs currently receiving service as well as those waiting in the queue." xmpDM:startTime="2151500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2151500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables 1 2 m Previous Arrival Arrival Begin Service End Service t w s r n nq ns l" xmpDM:startTime="2151900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="m Time" xmpDM:startTime="2151900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont) t = Inter-arrival time = time between two successive arrivals." xmpDM:startTime="2185067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="l = Mean arrival rate = 1/E[t] May be a function of the state of the system, e.g.," xmpDM:startTime="2185067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="number of jobs already in the system." xmpDM:startTime="2185067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="s = Service time per job." xmpDM:startTime="2185067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="m = Mean service rate per server = 1/E[s] Total service rate for m servers is mm n = Number" xmpDM:startTime="2185067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of jobs in the system." xmpDM:startTime="2185067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="This is also called queue length." xmpDM:startTime="2185067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Note: Queue length includes jobs currently receiving service as well as those waiting in the queue." xmpDM:startTime="2185067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2185067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont) nq = Number of jobs waiting ns = Number of jobs receiving service r = Response time" xmpDM:startTime="2185333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="or the time in the system = time waiting + time receiving service w = Waiting time = Time between" xmpDM:startTime="2185333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="arrival and beginning of service" xmpDM:startTime="2185333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2185733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues (cont) 3." xmpDM:startTime="2186167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Number versus Time: If jobs are not lost due to insufficient buffers, Mean number of jobs in the system =" xmpDM:startTime="2186167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Arrival rate  Mean response time 4." xmpDM:startTime="2186167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Similarly, Mean number of jobs in the queue = Arrival rate  Mean waiting time This is known as Little's" xmpDM:startTime="2186167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="law." xmpDM:startTime="2186167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="5." xmpDM:startTime="2186167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Time in System versus Time in Queue r = w + s r, w, and s are random variables." xmpDM:startTime="2186167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="E[r] = E[w] + E[s]" xmpDM:startTime="2186167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2228267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont) nq = Number of jobs waiting ns = Number of jobs receiving service r = Response time" xmpDM:startTime="2228567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="or the time in the system = time waiting + time receiving service w = Waiting time = Time between" xmpDM:startTime="2228567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="arrival and beginning of service" xmpDM:startTime="2228567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont) t = Inter-arrival time = time between two successive arrivals." xmpDM:startTime="2228900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="l = Mean arrival rate = 1/E[t] May be a function of the state of the system, e.g.," xmpDM:startTime="2228900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="number of jobs already in the system." xmpDM:startTime="2228900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="s = Service time per job." xmpDM:startTime="2228900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="m = Mean service rate per server = 1/E[s] Total service rate for m servers is mm n = Number" xmpDM:startTime="2228900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of jobs in the system." xmpDM:startTime="2228900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="This is also called queue length." xmpDM:startTime="2228900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Note: Queue length includes jobs currently receiving service as well as those waiting in the queue." xmpDM:startTime="2228900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2228900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables 1 2 m Previous Arrival Arrival Begin Service End Service t w s r n nq ns l" xmpDM:startTime="2229233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="m Time" xmpDM:startTime="2229233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 30B Exponential distribution is denoted as M Hyperexponential distribution represents a set of parallel exponential servers Erlang" xmpDM:startTime="2229467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="distribution Ek with k=1 is same as Exponential distribution" xmpDM:startTime="2229467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables 1 2 m Previous Arrival Arrival Begin Service End Service t w s r n nq ns l" xmpDM:startTime="2230567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="m Time" xmpDM:startTime="2230567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont) t = Inter-arrival time = time between two successive arrivals." xmpDM:startTime="2262633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="l = Mean arrival rate = 1/E[t] May be a function of the state of the system, e.g.," xmpDM:startTime="2262633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="number of jobs already in the system." xmpDM:startTime="2262633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="s = Service time per job." xmpDM:startTime="2262633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="m = Mean service rate per server = 1/E[s] Total service rate for m servers is mm n = Number" xmpDM:startTime="2262633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of jobs in the system." xmpDM:startTime="2262633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="This is also called queue length." xmpDM:startTime="2262633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Note: Queue length includes jobs currently receiving service as well as those waiting in the queue." xmpDM:startTime="2262633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2262633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont) nq = Number of jobs waiting ns = Number of jobs receiving service r = Response time" xmpDM:startTime="2263167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="or the time in the system = time waiting + time receiving service w = Waiting time = Time between" xmpDM:startTime="2263167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="arrival and beginning of service" xmpDM:startTime="2263167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2263500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues (cont) 3." xmpDM:startTime="2263867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Number versus Time: If jobs are not lost due to insufficient buffers, Mean number of jobs in the system =" xmpDM:startTime="2263867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Arrival rate  Mean response time 4." xmpDM:startTime="2263867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Similarly, Mean number of jobs in the queue = Arrival rate  Mean waiting time This is known as Little's" xmpDM:startTime="2263867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="law." xmpDM:startTime="2263867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="5." xmpDM:startTime="2263867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Time in System versus Time in Queue r = w + s r, w, and s are random variables." xmpDM:startTime="2263867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="E[r] = E[w] + E[s]" xmpDM:startTime="2263867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2299133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont) nq = Number of jobs waiting ns = Number of jobs receiving service r = Response time" xmpDM:startTime="2299800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="or the time in the system = time waiting + time receiving service w = Waiting time = Time between" xmpDM:startTime="2299800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="arrival and beginning of service" xmpDM:startTime="2299800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont) t = Inter-arrival time = time between two successive arrivals." xmpDM:startTime="2300300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="l = Mean arrival rate = 1/E[t] May be a function of the state of the system, e.g.," xmpDM:startTime="2300300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="number of jobs already in the system." xmpDM:startTime="2300300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="s = Service time per job." xmpDM:startTime="2300300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="m = Mean service rate per server = 1/E[s] Total service rate for m servers is mm n = Number" xmpDM:startTime="2300300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of jobs in the system." xmpDM:startTime="2300300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="This is also called queue length." xmpDM:startTime="2300300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Note: Queue length includes jobs currently receiving service as well as those waiting in the queue." xmpDM:startTime="2300300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2300300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables 1 2 m Previous Arrival Arrival Begin Service End Service t w s r n nq ns l" xmpDM:startTime="2300733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="m Time" xmpDM:startTime="2300733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont) t = Inter-arrival time = time between two successive arrivals." xmpDM:startTime="2312233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="l = Mean arrival rate = 1/E[t] May be a function of the state of the system, e.g.," xmpDM:startTime="2312233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="number of jobs already in the system." xmpDM:startTime="2312233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="s = Service time per job." xmpDM:startTime="2312233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="m = Mean service rate per server = 1/E[s] Total service rate for m servers is mm n = Number" xmpDM:startTime="2312233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of jobs in the system." xmpDM:startTime="2312233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="This is also called queue length." xmpDM:startTime="2312233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Note: Queue length includes jobs currently receiving service as well as those waiting in the queue." xmpDM:startTime="2312233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2312233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont) nq = Number of jobs waiting ns = Number of jobs receiving service r = Response time" xmpDM:startTime="2312800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="or the time in the system = time waiting + time receiving service w = Waiting time = Time between" xmpDM:startTime="2312800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="arrival and beginning of service" xmpDM:startTime="2312800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2313567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues (cont) 3." xmpDM:startTime="2314133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Number versus Time: If jobs are not lost due to insufficient buffers, Mean number of jobs in the system =" xmpDM:startTime="2314133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Arrival rate  Mean response time 4." xmpDM:startTime="2314133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Similarly, Mean number of jobs in the queue = Arrival rate  Mean waiting time This is known as Little's" xmpDM:startTime="2314133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="law." xmpDM:startTime="2314133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="5." xmpDM:startTime="2314133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Time in System versus Time in Queue r = w + s r, w, and s are random variables." xmpDM:startTime="2314133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="E[r] = E[w] + E[s]" xmpDM:startTime="2314133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues(cont) 6." xmpDM:startTime="2314667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If the service rate is independent of the number of jobs in the queue, Cov(w,s)=0 TP_tmp" xmpDM:startTime="2314667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues (cont) 3." xmpDM:startTime="2315533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Number versus Time: If jobs are not lost due to insufficient buffers, Mean number of jobs in the system =" xmpDM:startTime="2315533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Arrival rate  Mean response time 4." xmpDM:startTime="2315533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Similarly, Mean number of jobs in the queue = Arrival rate  Mean waiting time This is known as Little's" xmpDM:startTime="2315533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="law." xmpDM:startTime="2315533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="5." xmpDM:startTime="2315533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Time in System versus Time in Queue r = w + s r, w, and s are random variables." xmpDM:startTime="2315533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="E[r] = E[w] + E[s]" xmpDM:startTime="2315533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues(cont) 6." xmpDM:startTime="2378533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If the service rate is independent of the number of jobs in the queue, Cov(w,s)=0 TP_tmp" xmpDM:startTime="2378533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues (cont) 3." xmpDM:startTime="2379733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Number versus Time: If jobs are not lost due to insufficient buffers, Mean number of jobs in the system =" xmpDM:startTime="2379733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Arrival rate  Mean response time 4." xmpDM:startTime="2379733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Similarly, Mean number of jobs in the queue = Arrival rate  Mean waiting time This is known as Little's" xmpDM:startTime="2379733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="law." xmpDM:startTime="2379733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="5." xmpDM:startTime="2379733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Time in System versus Time in Queue r = w + s r, w, and s are random variables." xmpDM:startTime="2379733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="E[r] = E[w] + E[s]" xmpDM:startTime="2379733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2380167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues (cont) 3." xmpDM:startTime="2388400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Number versus Time: If jobs are not lost due to insufficient buffers, Mean number of jobs in the system =" xmpDM:startTime="2388400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Arrival rate  Mean response time 4." xmpDM:startTime="2388400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Similarly, Mean number of jobs in the queue = Arrival rate  Mean waiting time This is known as Little's" xmpDM:startTime="2388400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="law." xmpDM:startTime="2388400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="5." xmpDM:startTime="2388400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Time in System versus Time in Queue r = w + s r, w, and s are random variables." xmpDM:startTime="2388400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="E[r] = E[w] + E[s]" xmpDM:startTime="2388400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues(cont) 6." xmpDM:startTime="2394733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If the service rate is independent of the number of jobs in the queue, Cov(w,s)=0 TP_tmp" xmpDM:startTime="2394733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 30C If a queue has 2 jobs waiting for service, the number is system is ____ If the arrival" xmpDM:startTime="2494333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="rate is 2 jobs/second, the mean inter-arrival time is _____ second." xmpDM:startTime="2494333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In a 3 server queue, the jobs arrive at the rate of 1 jobs/second, the service time should be less" xmpDM:startTime="2494333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="than ____ second/job for the queue to be stable." xmpDM:startTime="2494333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2494333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 30C If a queue has 2 jobs waiting for service, the number is system is m+2." xmpDM:startTime="2542967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If the arrival rate is 2 jobs/second, the mean inter-arrival time is 0.5" xmpDM:startTime="2542967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="second." xmpDM:startTime="2542967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In a 3 server queue, the jobs arrive at the rate of 1 jobs/second, the service time should be less" xmpDM:startTime="2542967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="than 3 second/job for the queue to be stable." xmpDM:startTime="2542967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2542967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Little's Law Mean number in the system = Arrival rate  Mean response time This relationship applies to all systems" xmpDM:startTime="2571700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="or parts of systems in which the number of jobs entering the system is equal to those completing service." xmpDM:startTime="2571700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Named after Little (1961) Based on a black-box view of the system: In systems in which some jobs are lost" xmpDM:startTime="2571700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="due to finite buffers, the law can be applied to the part of the system consisting of the waiting and" xmpDM:startTime="2571700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="serving positions Black Box Arrivals Departures" xmpDM:startTime="2571700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 30C If a queue has 2 jobs waiting for service, the number is system is m+2." xmpDM:startTime="2573333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If the arrival rate is 2 jobs/second, the mean inter-arrival time is 0.5" xmpDM:startTime="2573333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="second." xmpDM:startTime="2573333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In a 3 server queue, the jobs arrive at the rate of 1 jobs/second, the service time should be less" xmpDM:startTime="2573333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="than 3 second/job for the queue to be stable." xmpDM:startTime="2573333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2573333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 30C If a queue has 2 jobs waiting for service, the number is system is ____ If the arrival" xmpDM:startTime="2577900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="rate is 2 jobs/second, the mean inter-arrival time is _____ second." xmpDM:startTime="2577900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In a 3 server queue, the jobs arrive at the rate of 1 jobs/second, the service time should be less" xmpDM:startTime="2577900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="than ____ second/job for the queue to be stable." xmpDM:startTime="2577900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2577900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues(cont) 6." xmpDM:startTime="2578433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If the service rate is independent of the number of jobs in the queue, Cov(w,s)=0 TP_tmp" xmpDM:startTime="2578433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 30C If a queue has 2 jobs waiting for service, the number is system is ____ If the arrival" xmpDM:startTime="2583067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="rate is 2 jobs/second, the mean inter-arrival time is _____ second." xmpDM:startTime="2583067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In a 3 server queue, the jobs arrive at the rate of 1 jobs/second, the service time should be less" xmpDM:startTime="2583067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="than ____ second/job for the queue to be stable." xmpDM:startTime="2583067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2583067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 30C If a queue has 2 jobs waiting for service, the number is system is m+2." xmpDM:startTime="2641633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If the arrival rate is 2 jobs/second, the mean inter-arrival time is 0.5" xmpDM:startTime="2641633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="second." xmpDM:startTime="2641633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In a 3 server queue, the jobs arrive at the rate of 1 jobs/second, the service time should be less" xmpDM:startTime="2641633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="than 3 second/job for the queue to be stable." xmpDM:startTime="2641633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2641633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Little's Law Mean number in the system = Arrival rate  Mean response time This relationship applies to all systems" xmpDM:startTime="2642333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="or parts of systems in which the number of jobs entering the system is equal to those completing service." xmpDM:startTime="2642333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Named after Little (1961) Based on a black-box view of the system: In systems in which some jobs are lost" xmpDM:startTime="2642333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="due to finite buffers, the law can be applied to the part of the system consisting of the waiting and" xmpDM:startTime="2642333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="serving positions Black Box Arrivals Departures" xmpDM:startTime="2642333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof of Little's Law If T is large, arrivals = departures = N Arrival rate = Total arrivals/Total time= N/T" xmpDM:startTime="2725467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hatched areas = total time spent inside the system by all jobs = J Mean time in the system= J/N" xmpDM:startTime="2725467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Mean Number in the system = J/T = = Arrival rate£ Mean time in the system 1 2 3 4" xmpDM:startTime="2725467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="5 6 7 8 1 2 3 4 Job number Arrival Departure 1 2 3 4 5 6 7 8" xmpDM:startTime="2725467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1 2 3 4 Number in System Time Time 1 2 3 1 2 3 4 Time in System Job" xmpDM:startTime="2725467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="number TP_tmp" xmpDM:startTime="2725467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Little's Law Mean number in the system = Arrival rate  Mean response time This relationship applies to all systems" xmpDM:startTime="2727167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="or parts of systems in which the number of jobs entering the system is equal to those completing service." xmpDM:startTime="2727167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Named after Little (1961) Based on a black-box view of the system: In systems in which some jobs are lost" xmpDM:startTime="2727167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="due to finite buffers, the law can be applied to the part of the system consisting of the waiting and" xmpDM:startTime="2727167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="serving positions Black Box Arrivals Departures" xmpDM:startTime="2727167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 30C If a queue has 2 jobs waiting for service, the number is system is m+2." xmpDM:startTime="2739800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If the arrival rate is 2 jobs/second, the mean inter-arrival time is 0.5" xmpDM:startTime="2739800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="second." xmpDM:startTime="2739800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In a 3 server queue, the jobs arrive at the rate of 1 jobs/second, the service time should be less" xmpDM:startTime="2739800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="than 3 second/job for the queue to be stable." xmpDM:startTime="2739800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2739800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 30C If a queue has 2 jobs waiting for service, the number is system is ____ If the arrival" xmpDM:startTime="2740133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="rate is 2 jobs/second, the mean inter-arrival time is _____ second." xmpDM:startTime="2740133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In a 3 server queue, the jobs arrive at the rate of 1 jobs/second, the service time should be less" xmpDM:startTime="2740133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="than ____ second/job for the queue to be stable." xmpDM:startTime="2740133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2740133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues(cont) 6." xmpDM:startTime="2740500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If the service rate is independent of the number of jobs in the queue, Cov(w,s)=0 TP_tmp" xmpDM:startTime="2740500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues (cont) 3." xmpDM:startTime="2740767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Number versus Time: If jobs are not lost due to insufficient buffers, Mean number of jobs in the system =" xmpDM:startTime="2740767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Arrival rate  Mean response time 4." xmpDM:startTime="2740767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Similarly, Mean number of jobs in the queue = Arrival rate  Mean waiting time This is known as Little's" xmpDM:startTime="2740767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="law." xmpDM:startTime="2740767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="5." xmpDM:startTime="2740767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Time in System versus Time in Queue r = w + s r, w, and s are random variables." xmpDM:startTime="2740767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="E[r] = E[w] + E[s]" xmpDM:startTime="2740767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2741033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont) nq = Number of jobs waiting ns = Number of jobs receiving service r = Response time" xmpDM:startTime="2741300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="or the time in the system = time waiting + time receiving service w = Waiting time = Time between" xmpDM:startTime="2741300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="arrival and beginning of service" xmpDM:startTime="2741300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont) t = Inter-arrival time = time between two successive arrivals." xmpDM:startTime="2741567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="l = Mean arrival rate = 1/E[t] May be a function of the state of the system, e.g.," xmpDM:startTime="2741567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="number of jobs already in the system." xmpDM:startTime="2741567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="s = Service time per job." xmpDM:startTime="2741567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="m = Mean service rate per server = 1/E[s] Total service rate for m servers is mm n = Number" xmpDM:startTime="2741567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of jobs in the system." xmpDM:startTime="2741567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="This is also called queue length." xmpDM:startTime="2741567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Note: Queue length includes jobs currently receiving service as well as those waiting in the queue." xmpDM:startTime="2741567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2741567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables 1 2 m Previous Arrival Arrival Begin Service End Service t w s r n nq ns l" xmpDM:startTime="2741800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="m Time" xmpDM:startTime="2741800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 30B Exponential distribution is denoted as M Hyperexponential distribution represents a set of parallel exponential servers Erlang" xmpDM:startTime="2742000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="distribution Ek with k=1 is same as Exponential distribution" xmpDM:startTime="2742000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables 1 2 m Previous Arrival Arrival Begin Service End Service t w s r n nq ns l" xmpDM:startTime="2743000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="m Time" xmpDM:startTime="2743000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont) t = Inter-arrival time = time between two successive arrivals." xmpDM:startTime="2770100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="l = Mean arrival rate = 1/E[t] May be a function of the state of the system, e.g.," xmpDM:startTime="2770100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="number of jobs already in the system." xmpDM:startTime="2770100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="s = Service time per job." xmpDM:startTime="2770100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="m = Mean service rate per server = 1/E[s] Total service rate for m servers is mm n = Number" xmpDM:startTime="2770100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of jobs in the system." xmpDM:startTime="2770100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="This is also called queue length." xmpDM:startTime="2770100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Note: Queue length includes jobs currently receiving service as well as those waiting in the queue." xmpDM:startTime="2770100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2770100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont) nq = Number of jobs waiting ns = Number of jobs receiving service r = Response time" xmpDM:startTime="2770500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="or the time in the system = time waiting + time receiving service w = Waiting time = Time between" xmpDM:startTime="2770500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="arrival and beginning of service" xmpDM:startTime="2770500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2770833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues (cont) 3." xmpDM:startTime="2771200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Number versus Time: If jobs are not lost due to insufficient buffers, Mean number of jobs in the system =" xmpDM:startTime="2771200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Arrival rate  Mean response time 4." xmpDM:startTime="2771200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Similarly, Mean number of jobs in the queue = Arrival rate  Mean waiting time This is known as Little's" xmpDM:startTime="2771200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="law." xmpDM:startTime="2771200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="5." xmpDM:startTime="2771200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Time in System versus Time in Queue r = w + s r, w, and s are random variables." xmpDM:startTime="2771200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="E[r] = E[w] + E[s]" xmpDM:startTime="2771200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues(cont) 6." xmpDM:startTime="2771533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If the service rate is independent of the number of jobs in the queue, Cov(w,s)=0 TP_tmp" xmpDM:startTime="2771533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 30C If a queue has 2 jobs waiting for service, the number is system is ____ If the arrival" xmpDM:startTime="2771900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="rate is 2 jobs/second, the mean inter-arrival time is _____ second." xmpDM:startTime="2771900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In a 3 server queue, the jobs arrive at the rate of 1 jobs/second, the service time should be less" xmpDM:startTime="2771900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="than ____ second/job for the queue to be stable." xmpDM:startTime="2771900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2771900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 30C If a queue has 2 jobs waiting for service, the number is system is m+2." xmpDM:startTime="2772267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If the arrival rate is 2 jobs/second, the mean inter-arrival time is 0.5" xmpDM:startTime="2772267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="second." xmpDM:startTime="2772267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In a 3 server queue, the jobs arrive at the rate of 1 jobs/second, the service time should be less" xmpDM:startTime="2772267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="than 3 second/job for the queue to be stable." xmpDM:startTime="2772267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2772267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Little's Law Mean number in the system = Arrival rate  Mean response time This relationship applies to all systems" xmpDM:startTime="2772633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="or parts of systems in which the number of jobs entering the system is equal to those completing service." xmpDM:startTime="2772633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Named after Little (1961) Based on a black-box view of the system: In systems in which some jobs are lost" xmpDM:startTime="2772633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="due to finite buffers, the law can be applied to the part of the system consisting of the waiting and" xmpDM:startTime="2772633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="serving positions Black Box Arrivals Departures" xmpDM:startTime="2772633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof of Little's Law If T is large, arrivals = departures = N Arrival rate = Total arrivals/Total time= N/T" xmpDM:startTime="2773000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hatched areas = total time spent inside the system by all jobs = J Mean time in the system= J/N" xmpDM:startTime="2773000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Mean Number in the system = J/T = = Arrival rate£ Mean time in the system 1 2 3 4" xmpDM:startTime="2773000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="5 6 7 8 1 2 3 4 Job number Arrival Departure 1 2 3 4 5 6 7 8" xmpDM:startTime="2773000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1 2 3 4 Number in System Time Time 1 2 3 1 2 3 4 Time in System Job" xmpDM:startTime="2773000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="number TP_tmp" xmpDM:startTime="2773000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Application of Little's Law Applying to just the waiting facility of a service center Mean number in the queue =" xmpDM:startTime="3031300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Arrival rate  Mean waiting time Similarly, for those currently receiving the service, we have: Mean number in service =" xmpDM:startTime="3031300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Arrival rate  Mean service time Arrivals Departures" xmpDM:startTime="3031300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 30.3" xmpDM:startTime="3054933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A monitor on a disk server showed that the average time to satisfy an I/O request was 100 milliseconds." xmpDM:startTime="3054933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The I/O rate was about 100 requests per second." xmpDM:startTime="3054933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="What was the mean number of requests at the disk server? Using Little's law: Mean number in the disk server" xmpDM:startTime="3054933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= Arrival rate  Response time = 100 (requests/second) (0.1" xmpDM:startTime="3054933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="seconds) = 10 requests" xmpDM:startTime="3054933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 30D Key: n = ¸ R During a 1 minute observation, a server received 120 requests." xmpDM:startTime="3167500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The mean response time was 1 second." xmpDM:startTime="3167500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The mean number of queries in the server is _____" xmpDM:startTime="3167500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 30D Key: n = ¸ R During a 1 minute observation, a server received 120 requests." xmpDM:startTime="3230067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The mean response time was 1 second." xmpDM:startTime="3230067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The mean number of queries in the server is 2." xmpDM:startTime="3230067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="¸ = 120/60 = 2 R = 1 n = 2" xmpDM:startTime="3230067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 30D Key: n = ¸ R During a 1 minute observation, a server received 120 requests." xmpDM:startTime="3322600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The mean response time was 1 second." xmpDM:startTime="3322600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The mean number of queries in the server is _____" xmpDM:startTime="3322600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 30.3" xmpDM:startTime="3323233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A monitor on a disk server showed that the average time to satisfy an I/O request was 100 milliseconds." xmpDM:startTime="3323233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The I/O rate was about 100 requests per second." xmpDM:startTime="3323233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="What was the mean number of requests at the disk server? Using Little's law: Mean number in the disk server" xmpDM:startTime="3323233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= Arrival rate  Response time = 100 (requests/second) (0.1" xmpDM:startTime="3323233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="seconds) = 10 requests" xmpDM:startTime="3323233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Application of Little's Law Applying to just the waiting facility of a service center Mean number in the queue =" xmpDM:startTime="3323833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Arrival rate  Mean waiting time Similarly, for those currently receiving the service, we have: Mean number in service =" xmpDM:startTime="3323833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Arrival rate  Mean service time Arrivals Departures" xmpDM:startTime="3323833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 30.3" xmpDM:startTime="3446967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A monitor on a disk server showed that the average time to satisfy an I/O request was 100 milliseconds." xmpDM:startTime="3446967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The I/O rate was about 100 requests per second." xmpDM:startTime="3446967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="What was the mean number of requests at the disk server? Using Little's law: Mean number in the disk server" xmpDM:startTime="3446967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= Arrival rate  Response time = 100 (requests/second) (0.1" xmpDM:startTime="3446967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="seconds) = 10 requests" xmpDM:startTime="3446967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 30D Key: n = ¸ R During a 1 minute observation, a server received 120 requests." xmpDM:startTime="3447267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The mean response time was 1 second." xmpDM:startTime="3447267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The mean number of queries in the server is _____" xmpDM:startTime="3447267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 30D Key: n = ¸ R During a 1 minute observation, a server received 120 requests." xmpDM:startTime="3447567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The mean response time was 1 second." xmpDM:startTime="3447567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The mean number of queries in the server is 2." xmpDM:startTime="3447567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="¸ = 120/60 = 2 R = 1 n = 2" xmpDM:startTime="3447567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Stochastic Processes Process: Function of time Stochastic Process: Random variables, which are functions of time Example 1: n(t) = number" xmpDM:startTime="3447800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of jobs at the CPU Observe n(t) at several identical systems The number n(t) is a random variable." xmpDM:startTime="3447800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Find the probability distribution functions for n(t) at each t." xmpDM:startTime="3447800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 2: w(t) = waiting time in a queue xt t" xmpDM:startTime="3447800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 30D Key: n = ¸ R During a 1 minute observation, a server received 120 requests." xmpDM:startTime="3449233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The mean response time was 1 second." xmpDM:startTime="3449233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The mean number of queries in the server is 2." xmpDM:startTime="3449233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="¸ = 120/60 = 2 R = 1 n = 2" xmpDM:startTime="3449233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Stochastic Processes Process: Function of time Stochastic Process: Random variables, which are functions of time Example 1: n(t) = number" xmpDM:startTime="3450100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="of jobs at the CPU Observe n(t) at several identical systems The number n(t) is a random variable." xmpDM:startTime="3450100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Find the probability distribution functions for n(t) at each t." xmpDM:startTime="3450100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 2: w(t) = waiting time in a queue xt t" xmpDM:startTime="3450100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Types of Stochastic Processes Discrete or Continuous State Processes Markov Processes Birth-death Processes Poisson Processes" xmpDM:startTime="3620900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Discrete/Continuous State Processes Discrete = Finite or Countable Number of jobs in a system n(t) = 0, 1, 2, ...." xmpDM:startTime="3631933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="n(t) is a discrete state process The waiting time w(t) is a continuous state process." xmpDM:startTime="3631933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Stochastic Chain: discrete state stochastic process Note: Time can also be discrete or continuous Þ Discrete/continuous time processes Here we" xmpDM:startTime="3631933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="will consider only continuous time processes State Time" xmpDM:startTime="3631933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Markov Processes Future states are independent of the past and depend only on the present." xmpDM:startTime="3701200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Named after A." xmpDM:startTime="3701200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A." xmpDM:startTime="3701200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Markov who defined and analyzed them in 1907." xmpDM:startTime="3701200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Markov Chain: discrete state Markov process Markov  It is not necessary to history of the previous states of the" xmpDM:startTime="3701200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="process  Future depends upon the current state only M/M/m queues can be modeled using Markov processes." xmpDM:startTime="3701200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The time spent by a job in such a queue is a Markov process and the number of jobs in" xmpDM:startTime="3701200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="the queue is a Markov chain." xmpDM:startTime="3701200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3701200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Discrete/Continuous State Processes Discrete = Finite or Countable Number of jobs in a system n(t) = 0, 1, 2, ...." xmpDM:startTime="3702733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="n(t) is a discrete state process The waiting time w(t) is a continuous state process." xmpDM:startTime="3702733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Stochastic Chain: discrete state stochastic process Note: Time can also be discrete or continuous Þ Discrete/continuous time processes Here we" xmpDM:startTime="3702733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="will consider only continuous time processes State Time" xmpDM:startTime="3702733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Markov Processes Future states are independent of the past and depend only on the present." xmpDM:startTime="3771367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Named after A." xmpDM:startTime="3771367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A." xmpDM:startTime="3771367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Markov who defined and analyzed them in 1907." xmpDM:startTime="3771367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Markov Chain: discrete state Markov process Markov  It is not necessary to history of the previous states of the" xmpDM:startTime="3771367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="process  Future depends upon the current state only M/M/m queues can be modeled using Markov processes." xmpDM:startTime="3771367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The time spent by a job in such a queue is a Markov process and the number of jobs in" xmpDM:startTime="3771367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="the queue is a Markov chain." xmpDM:startTime="3771367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3771367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Birth-Death Processes The discrete space Markov processes in which the transitions are restricted to neighboring states Process in state n" xmpDM:startTime="3939300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="can change only to state n+1 or n-1." xmpDM:startTime="3939300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example: the number of jobs in a queue with a single server and individual arrivals (not bulk arrivals) 0 1" xmpDM:startTime="3939300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="2 j-1 j j+1 … l0 l1 l2 lj-1 lj lj+1 m1 m2 m3 mj j+1  j+2" xmpDM:startTime="3939300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Poisson Distribution If the inter-arrival times are exponentially distributed, number of arrivals in any given interval are Poisson distributed M" xmpDM:startTime="4050367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= Memoryless arrival = Poisson arrivals Example: ¸=4 Þ 4 jobs/sec or 0.25" xmpDM:startTime="4050367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="sec between jobs on average ¿ ~ Exponential time n ~ Poisson TP_tmp" xmpDM:startTime="4050367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Poisson Processes Interarrival time s = IID and exponential  number of arrivals n over a given interval (t, t+x)" xmpDM:startTime="4160633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="has a Poisson distribution  arrival = Poisson process or Poisson stream Properties: 1.Merging:" xmpDM:startTime="4160633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="2.Splitting:" xmpDM:startTime="4160633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If the probability of a job going to ith substream is pi, each substream is also Poisson with a mean" xmpDM:startTime="4160633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="rate of pi l TP_tmp TP_tmp TP_tmp TP_tmp TP_tmp ." xmpDM:startTime="4160633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="." xmpDM:startTime="4160633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="." xmpDM:startTime="4160633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="." xmpDM:startTime="4160633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="." xmpDM:startTime="4160633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="." xmpDM:startTime="4160633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="TP_tmp TP_tmp TP_tmp TP_tmp TP_tmp TP_tmp TP_tmp ." xmpDM:startTime="4160633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="." xmpDM:startTime="4160633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="." xmpDM:startTime="4160633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="." xmpDM:startTime="4160633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="." xmpDM:startTime="4160633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="." xmpDM:startTime="4160633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4160633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4229567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4261633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="PASTA Property Poisson Arrivals See Time Averages Poisson arrivals Þ Random arrivals from a large number of independent sources If" xmpDM:startTime="4291800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="an external observer samples a system at a random instant: P(System state = x) = P(State as seen by a" xmpDM:startTime="4291800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Poisson arrival is x) Example: D/D/1 Queue: Arrivals = 1 job/sec, Service =2 jobs/sec All customers see an empty system." xmpDM:startTime="4291800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/D/1 Queue: Arrivals = 1 job/sec (avg), Service = 2 jobs/sec Randomly sample the system." xmpDM:startTime="4291800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="System is busy half of the time." xmpDM:startTime="4291800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="pasta 0 1 2 3 4 5 0 1 2 3 4 5" xmpDM:startTime="4291800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Relationship Among Stochastic Processes chp_30_07" xmpDM:startTime="4295967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="PASTA Property Poisson Arrivals See Time Averages Poisson arrivals Þ Random arrivals from a large number of independent sources If" xmpDM:startTime="4297100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="an external observer samples a system at a random instant: P(System state = x) = P(State as seen by a" xmpDM:startTime="4297100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Poisson arrival is x) Example: D/D/1 Queue: Arrivals = 1 job/sec, Service =2 jobs/sec All customers see an empty system." xmpDM:startTime="4297100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/D/1 Queue: Arrivals = 1 job/sec (avg), Service = 2 jobs/sec Randomly sample the system." xmpDM:startTime="4297100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="System is busy half of the time." xmpDM:startTime="4297100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="pasta 0 1 2 3 4 5 0 1 2 3 4 5" xmpDM:startTime="4297100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Relationship Among Stochastic Processes chp_30_07" xmpDM:startTime="4565267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="PASTA Property Poisson Arrivals See Time Averages Poisson arrivals Þ Random arrivals from a large number of independent sources If" xmpDM:startTime="4567167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="an external observer samples a system at a random instant: P(System state = x) = P(State as seen by a" xmpDM:startTime="4567167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Poisson arrival is x) Example: D/D/1 Queue: Arrivals = 1 job/sec, Service =2 jobs/sec All customers see an empty system." xmpDM:startTime="4567167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/D/1 Queue: Arrivals = 1 job/sec (avg), Service = 2 jobs/sec Randomly sample the system." xmpDM:startTime="4567167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="System is busy half of the time." xmpDM:startTime="4567167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="pasta 0 1 2 3 4 5 0 1 2 3 4 5" xmpDM:startTime="4567167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Relationship Among Stochastic Processes chp_30_07" xmpDM:startTime="4599033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 30E T F Birth-death process can have bulk service Merger of Poisson processes results in a _______ Process The" xmpDM:startTime="4599533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="number of jobs in a M/M/1 queue is Markov ______ T F A discrete time process is also called a" xmpDM:startTime="4599533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="chain" xmpDM:startTime="4599533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Relationship Among Stochastic Processes chp_30_07" xmpDM:startTime="4600367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 30E T F Birth-death process can have bulk service Merger of Poisson processes results in a _______ Process The" xmpDM:startTime="4628000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="number of jobs in a M/M/1 queue is Markov ______ T F A discrete time process is also called a" xmpDM:startTime="4628000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="chain" xmpDM:startTime="4628000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 30E T F Birth-death process can have bulk service Merger of Poisson processes results in a Poisson" xmpDM:startTime="4652500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Process The number of jobs in a M/M/1 queue is Markov Chain T F A discrete time process is also" xmpDM:startTime="4652500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="called a chain  " xmpDM:startTime="4652500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary Kendall Notation: A/S/m/B/k/SD, M/M/1 Number in system, queue, waiting, service Service rate, arrival rate, response time, waiting time, service" xmpDM:startTime="4654933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="time Little’s Law: Mean number in system = Arrival rate £ Mean time in system Processes: Markov  Only one" xmpDM:startTime="4654933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="state required, Birth-death  Adjacent states Poisson  IID and exponential inter-arrival" xmpDM:startTime="4654933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 30 Updated Exercise 30.4" xmpDM:startTime="4686367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="During a one-hour observation interval, the name server of a distributed system received 12,960 requests." xmpDM:startTime="4686367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The mean response time of these requests was observed to be one-third of a second." xmpDM:startTime="4686367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="What is the mean number of queries in the server? What assumptions have you made about the system? Would the" xmpDM:startTime="4686367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="mean number of queries be different if the service time was not exponentially distributed?" xmpDM:startTime="4686367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Reading List If you need to refresh your probability concepts, read chapter 12 Read Chapter 30 Refer to Chapter 29" xmpDM:startTime="4706733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="for various distributions" xmpDM:startTime="4706733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Scan This to Download These Slides thankyou Raj Jain http://rajjain.com" xmpDM:startTime="4709467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4709467" xmpDM:duration="1000"/></rdf:li></rdf:Seq>
                     </xmpDM:markers>
                  </rdf:Description>
               </rdf:li>
               <rdf:li>
                  <rdf:Description xmpDM:trackType="TableOfContents" xmpDM:frameRate="f1000" xmpDM:trackName="Table of Contents">
                     <xmpDM:markers>
                        <rdf:Seq>
                           <rdf:li><rdf:Description xmpDM:name="        Basic Components of a Queue" xmpDM:startTime="0" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="0" tscDM:imageoffset="0" tscDM:imagerect="0, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="     Kendall Notation A/S/m/B/K/SD" xmpDM:startTime="24267" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="1" tscDM:imageoffset="0" tscDM:imagerect="75, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Arrival Process" xmpDM:startTime="24633" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="2" tscDM:imageoffset="0" tscDM:imagerect="150, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="     Kendall Notation A/S/m/B/K/SD" xmpDM:startTime="25667" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="3" tscDM:imageoffset="0" tscDM:imagerect="225, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Arrival Process" xmpDM:startTime="66700" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="4" tscDM:imageoffset="0" tscDM:imagerect="300, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Service Time Distribution" xmpDM:startTime="67400" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="5" tscDM:imageoffset="0" tscDM:imagerect="375, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Service Disciplines" xmpDM:startTime="67700" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="6" tscDM:imageoffset="0" tscDM:imagerect="450, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="      Example M/M/3/20/1500/FCFS " xmpDM:startTime="68233" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="7" tscDM:imageoffset="0" tscDM:imagerect="525, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Service Disciplines" xmpDM:startTime="79367" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="8" tscDM:imageoffset="0" tscDM:imagerect="600, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Service Time Distribution" xmpDM:startTime="79600" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="9" tscDM:imageoffset="0" tscDM:imagerect="675, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Arrival Process" xmpDM:startTime="79833" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="10" tscDM:imageoffset="0" tscDM:imagerect="750, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="     Kendall Notation A/S/m/B/K/SD" xmpDM:startTime="80033" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="11" tscDM:imageoffset="0" tscDM:imagerect="825, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="        Basic Components of a Queue" xmpDM:startTime="80333" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="12" tscDM:imageoffset="0" tscDM:imagerect="900, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="     Kendall Notation A/S/m/B/K/SD" xmpDM:startTime="81700" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="13" tscDM:imageoffset="0" tscDM:imagerect="975, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="        Basic Components of a Queue" xmpDM:startTime="83900" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="14" tscDM:imageoffset="0" tscDM:imagerect="1050, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="     Kendall Notation A/S/m/B/K/SD" xmpDM:startTime="85067" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="15" tscDM:imageoffset="0" tscDM:imagerect="1125, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Arrival Process" xmpDM:startTime="85833" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="16" tscDM:imageoffset="0" tscDM:imagerect="1200, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Service Time Distribution" xmpDM:startTime="278133" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="17" tscDM:imageoffset="0" tscDM:imagerect="1275, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Service Disciplines" xmpDM:startTime="350467" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="18" tscDM:imageoffset="0" tscDM:imagerect="1350, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="      Example M/M/3/20/1500/FCFS " xmpDM:startTime="694333" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="19" tscDM:imageoffset="0" tscDM:imagerect="1425, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 30A" xmpDM:startTime="881167" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="20" tscDM:imageoffset="0" tscDM:imagerect="1500, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 30A" xmpDM:startTime="917400" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="21" tscDM:imageoffset="0" tscDM:imagerect="1575, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Exponential Distribution" xmpDM:startTime="917600" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="22" tscDM:imageoffset="0" tscDM:imagerect="1650, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 30A" xmpDM:startTime="918767" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="23" tscDM:imageoffset="0" tscDM:imagerect="1725, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Exponential Distribution" xmpDM:startTime="965300" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="24" tscDM:imageoffset="0" tscDM:imagerect="1800, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Erlang Distribution" xmpDM:startTime="1185833" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="25" tscDM:imageoffset="0" tscDM:imagerect="1875, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="     Hyper-Exponential Distribution" xmpDM:startTime="1342000" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="26" tscDM:imageoffset="0" tscDM:imagerect="1950, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Erlang Distribution" xmpDM:startTime="1387233" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="27" tscDM:imageoffset="0" tscDM:imagerect="2025, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="     Hyper-Exponential Distribution" xmpDM:startTime="1392667" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="28" tscDM:imageoffset="0" tscDM:imagerect="2100, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Erlang Distribution" xmpDM:startTime="1432767" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="29" tscDM:imageoffset="0" tscDM:imagerect="2175, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="     Hyper-Exponential Distribution" xmpDM:startTime="1434967" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="30" tscDM:imageoffset="0" tscDM:imagerect="2250, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Group Arrivals/Service" xmpDM:startTime="1447433" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="31" tscDM:imageoffset="0" tscDM:imagerect="2325, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 30B" xmpDM:startTime="1550233" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="32" tscDM:imageoffset="0" tscDM:imagerect="2400, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 30B" xmpDM:startTime="1593100" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="33" tscDM:imageoffset="0" tscDM:imagerect="2475, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables" xmpDM:startTime="1608567" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="34" tscDM:imageoffset="0" tscDM:imagerect="2550, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont)" xmpDM:startTime="1681033" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="35" tscDM:imageoffset="0" tscDM:imagerect="2625, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables" xmpDM:startTime="1731600" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="36" tscDM:imageoffset="0" tscDM:imagerect="2700, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont)" xmpDM:startTime="1788433" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="37" tscDM:imageoffset="0" tscDM:imagerect="2775, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont)" xmpDM:startTime="1798233" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="38" tscDM:imageoffset="0" tscDM:imagerect="2850, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues" xmpDM:startTime="1804933" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="39" tscDM:imageoffset="0" tscDM:imagerect="2925, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues (cont)" xmpDM:startTime="1811800" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="40" tscDM:imageoffset="0" tscDM:imagerect="3000, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues" xmpDM:startTime="1813267" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="41" tscDM:imageoffset="0" tscDM:imagerect="3075, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="End of presentation" xmpDM:startTime="2016633" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="42" tscDM:imageoffset="0" tscDM:imagerect="3150, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues" xmpDM:startTime="2044333" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="43" tscDM:imageoffset="0" tscDM:imagerect="3225, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues (cont)" xmpDM:startTime="2077800" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="44" tscDM:imageoffset="0" tscDM:imagerect="3300, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues" xmpDM:startTime="2150433" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="45" tscDM:imageoffset="0" tscDM:imagerect="3375, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont)" xmpDM:startTime="2151000" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="46" tscDM:imageoffset="0" tscDM:imagerect="3450, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont)" xmpDM:startTime="2151500" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="47" tscDM:imageoffset="0" tscDM:imagerect="3525, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables" xmpDM:startTime="2151900" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="48" tscDM:imageoffset="0" tscDM:imagerect="3600, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont)" xmpDM:startTime="2185067" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="49" tscDM:imageoffset="0" tscDM:imagerect="3675, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont)" xmpDM:startTime="2185333" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="50" tscDM:imageoffset="0" tscDM:imagerect="3750, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues" xmpDM:startTime="2185733" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="51" tscDM:imageoffset="0" tscDM:imagerect="3825, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues (cont)" xmpDM:startTime="2186167" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="52" tscDM:imageoffset="0" tscDM:imagerect="3900, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues" xmpDM:startTime="2228267" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="53" tscDM:imageoffset="0" tscDM:imagerect="3975, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont)" xmpDM:startTime="2228567" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="54" tscDM:imageoffset="0" tscDM:imagerect="50, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont)" xmpDM:startTime="2228900" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="55" tscDM:imageoffset="0" tscDM:imagerect="125, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables" xmpDM:startTime="2229233" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="56" tscDM:imageoffset="0" tscDM:imagerect="200, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 30B" xmpDM:startTime="2229467" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="57" tscDM:imageoffset="0" tscDM:imagerect="275, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables" xmpDM:startTime="2230567" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="58" tscDM:imageoffset="0" tscDM:imagerect="350, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont)" xmpDM:startTime="2262633" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="59" tscDM:imageoffset="0" tscDM:imagerect="425, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont)" xmpDM:startTime="2263167" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="60" tscDM:imageoffset="0" tscDM:imagerect="500, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues" xmpDM:startTime="2263500" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="61" tscDM:imageoffset="0" tscDM:imagerect="575, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues (cont)" xmpDM:startTime="2263867" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="62" tscDM:imageoffset="0" tscDM:imagerect="650, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues" xmpDM:startTime="2299133" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="63" tscDM:imageoffset="0" tscDM:imagerect="725, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont)" xmpDM:startTime="2299800" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="64" tscDM:imageoffset="0" tscDM:imagerect="800, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont)" xmpDM:startTime="2300300" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="65" tscDM:imageoffset="0" tscDM:imagerect="875, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables" xmpDM:startTime="2300733" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="66" tscDM:imageoffset="0" tscDM:imagerect="950, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont)" xmpDM:startTime="2312233" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="67" tscDM:imageoffset="0" tscDM:imagerect="1025, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont)" xmpDM:startTime="2312800" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="68" tscDM:imageoffset="0" tscDM:imagerect="1100, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues" xmpDM:startTime="2313567" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="69" tscDM:imageoffset="0" tscDM:imagerect="1175, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues (cont)" xmpDM:startTime="2314133" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="70" tscDM:imageoffset="0" tscDM:imagerect="1250, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues(cont)" xmpDM:startTime="2314667" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="71" tscDM:imageoffset="0" tscDM:imagerect="1325, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues (cont)" xmpDM:startTime="2315533" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="72" tscDM:imageoffset="0" tscDM:imagerect="1400, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues(cont)" xmpDM:startTime="2378533" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="73" tscDM:imageoffset="0" tscDM:imagerect="1475, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues (cont)" xmpDM:startTime="2379733" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="74" tscDM:imageoffset="0" tscDM:imagerect="1550, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues" xmpDM:startTime="2380167" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="75" tscDM:imageoffset="0" tscDM:imagerect="1625, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues (cont)" xmpDM:startTime="2388400" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="76" tscDM:imageoffset="0" tscDM:imagerect="1700, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues(cont)" xmpDM:startTime="2394733" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="77" tscDM:imageoffset="0" tscDM:imagerect="1775, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 30C" xmpDM:startTime="2494333" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="78" tscDM:imageoffset="0" tscDM:imagerect="1850, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 30C" xmpDM:startTime="2542967" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="79" tscDM:imageoffset="0" tscDM:imagerect="1925, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Little's Law" xmpDM:startTime="2571700" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="80" tscDM:imageoffset="0" tscDM:imagerect="2000, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 30C" xmpDM:startTime="2573333" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="81" tscDM:imageoffset="0" tscDM:imagerect="2075, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 30C" xmpDM:startTime="2577900" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="82" tscDM:imageoffset="0" tscDM:imagerect="2150, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues(cont)" xmpDM:startTime="2578433" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="83" tscDM:imageoffset="0" tscDM:imagerect="2225, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 30C" xmpDM:startTime="2583067" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="84" tscDM:imageoffset="0" tscDM:imagerect="2300, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 30C" xmpDM:startTime="2641633" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="85" tscDM:imageoffset="0" tscDM:imagerect="2375, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Little's Law" xmpDM:startTime="2642333" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="86" tscDM:imageoffset="0" tscDM:imagerect="2450, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof of Little's Law" xmpDM:startTime="2725467" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="87" tscDM:imageoffset="0" tscDM:imagerect="2525, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Little's Law" xmpDM:startTime="2727167" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="88" tscDM:imageoffset="0" tscDM:imagerect="2600, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 30C" xmpDM:startTime="2739800" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="89" tscDM:imageoffset="0" tscDM:imagerect="2675, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 30C" xmpDM:startTime="2740133" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="90" tscDM:imageoffset="0" tscDM:imagerect="2750, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues(cont)" xmpDM:startTime="2740500" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="91" tscDM:imageoffset="0" tscDM:imagerect="2825, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues (cont)" xmpDM:startTime="2740767" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="92" tscDM:imageoffset="0" tscDM:imagerect="2900, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues" xmpDM:startTime="2741033" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="93" tscDM:imageoffset="0" tscDM:imagerect="2975, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont)" xmpDM:startTime="2741300" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="94" tscDM:imageoffset="0" tscDM:imagerect="3050, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont)" xmpDM:startTime="2741567" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="95" tscDM:imageoffset="0" tscDM:imagerect="3125, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables" xmpDM:startTime="2741800" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="96" tscDM:imageoffset="0" tscDM:imagerect="3200, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 30B" xmpDM:startTime="2742000" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="97" tscDM:imageoffset="0" tscDM:imagerect="3275, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables" xmpDM:startTime="2743000" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="98" tscDM:imageoffset="0" tscDM:imagerect="3350, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont)" xmpDM:startTime="2770100" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="99" tscDM:imageoffset="0" tscDM:imagerect="3425, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key Variables (cont)" xmpDM:startTime="2770500" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="100" tscDM:imageoffset="0" tscDM:imagerect="3500, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues" xmpDM:startTime="2770833" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="101" tscDM:imageoffset="0" tscDM:imagerect="3575, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues (cont)" xmpDM:startTime="2771200" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="102" tscDM:imageoffset="0" tscDM:imagerect="3650, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Rules for All Queues(cont)" xmpDM:startTime="2771533" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="103" tscDM:imageoffset="0" tscDM:imagerect="3725, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 30C" xmpDM:startTime="2771900" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="104" tscDM:imageoffset="0" tscDM:imagerect="3800, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 30C" xmpDM:startTime="2772267" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="105" tscDM:imageoffset="0" tscDM:imagerect="3875, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Little's Law" xmpDM:startTime="2772633" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="106" tscDM:imageoffset="0" tscDM:imagerect="3950, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof of Little's Law" xmpDM:startTime="2773000" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="107" tscDM:imageoffset="0" tscDM:imagerect="25, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Application of Little's Law" xmpDM:startTime="3031300" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="108" tscDM:imageoffset="0" tscDM:imagerect="100, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 30.3" xmpDM:startTime="3054933" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="109" tscDM:imageoffset="0" tscDM:imagerect="175, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 30D" xmpDM:startTime="3167500" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="110" tscDM:imageoffset="0" tscDM:imagerect="250, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 30D" xmpDM:startTime="3230067" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="111" tscDM:imageoffset="0" tscDM:imagerect="325, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 30D" xmpDM:startTime="3322600" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="112" tscDM:imageoffset="0" tscDM:imagerect="400, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 30.3" xmpDM:startTime="3323233" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="113" tscDM:imageoffset="0" tscDM:imagerect="475, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Application of Little's Law" xmpDM:startTime="3323833" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="114" tscDM:imageoffset="0" tscDM:imagerect="550, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 30.3" xmpDM:startTime="3446967" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="115" tscDM:imageoffset="0" tscDM:imagerect="625, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 30D" xmpDM:startTime="3447267" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="116" tscDM:imageoffset="0" tscDM:imagerect="700, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 30D" xmpDM:startTime="3447567" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="117" tscDM:imageoffset="0" tscDM:imagerect="775, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Stochastic Processes" xmpDM:startTime="3447800" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="118" tscDM:imageoffset="0" tscDM:imagerect="850, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 30D" xmpDM:startTime="3449233" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="119" tscDM:imageoffset="0" tscDM:imagerect="925, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Stochastic Processes" xmpDM:startTime="3450100" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="120" tscDM:imageoffset="0" tscDM:imagerect="1000, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="         Types of Stochastic Processes" xmpDM:startTime="3620900" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="121" tscDM:imageoffset="0" tscDM:imagerect="1075, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name=" Discrete/Continuous State Processes" xmpDM:startTime="3631933" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="122" tscDM:imageoffset="0" tscDM:imagerect="1150, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Markov Processes" xmpDM:startTime="3701200" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="123" tscDM:imageoffset="0" tscDM:imagerect="1225, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name=" Discrete/Continuous State Processes" xmpDM:startTime="3702733" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="124" tscDM:imageoffset="0" tscDM:imagerect="1300, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Markov Processes" xmpDM:startTime="3771367" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="125" tscDM:imageoffset="0" tscDM:imagerect="1375, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Birth-Death Processes" xmpDM:startTime="3939300" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="126" tscDM:imageoffset="0" tscDM:imagerect="1450, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Poisson Distribution" xmpDM:startTime="4050367" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="127" tscDM:imageoffset="0" tscDM:imagerect="1525, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Poisson Processes" xmpDM:startTime="4160633" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="128" tscDM:imageoffset="0" tscDM:imagerect="1600, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Poisson Processes (Cont)" xmpDM:startTime="4229567" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="129" tscDM:imageoffset="0" tscDM:imagerect="1675, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Poisson Process(cont)" xmpDM:startTime="4261633" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="130" tscDM:imageoffset="0" tscDM:imagerect="1750, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="            PASTA Property" xmpDM:startTime="4291800" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="131" tscDM:imageoffset="0" tscDM:imagerect="1825, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Relationship Among  Stochastic Processes" xmpDM:startTime="4295967" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="132" tscDM:imageoffset="0" tscDM:imagerect="1900, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="            PASTA Property" xmpDM:startTime="4297100" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="133" tscDM:imageoffset="0" tscDM:imagerect="1975, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Relationship Among  Stochastic Processes" xmpDM:startTime="4565267" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="134" tscDM:imageoffset="0" tscDM:imagerect="2050, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="            PASTA Property" xmpDM:startTime="4567167" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="135" tscDM:imageoffset="0" tscDM:imagerect="2125, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Relationship Among  Stochastic Processes" xmpDM:startTime="4599033" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="136" tscDM:imageoffset="0" tscDM:imagerect="2200, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 30E" xmpDM:startTime="4599533" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="137" tscDM:imageoffset="0" tscDM:imagerect="2275, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Relationship Among  Stochastic Processes" xmpDM:startTime="4600367" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="138" tscDM:imageoffset="0" tscDM:imagerect="2350, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 30E" xmpDM:startTime="4628000" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="139" tscDM:imageoffset="0" tscDM:imagerect="2425, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 30E" xmpDM:startTime="4652500" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="140" tscDM:imageoffset="0" tscDM:imagerect="2500, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary" xmpDM:startTime="4654933" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="141" tscDM:imageoffset="0" tscDM:imagerect="2575, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 30" xmpDM:startTime="4686367" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="142" tscDM:imageoffset="0" tscDM:imagerect="2650, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Reading List" xmpDM:startTime="4706733" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="143" tscDM:imageoffset="0" tscDM:imagerect="2725, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Scan This to Download These Slides" xmpDM:startTime="4709467" tscDM:image="k_30iqt2_Thumbnails.png" tscDM:imageindex="144" tscDM:imageoffset="0" tscDM:imagerect="2800, 112, 75, 56"/></rdf:li></rdf:Seq>
                     </xmpDM:markers>
                  </rdf:Description>
               </rdf:li>
            </rdf:Bag>
         </xmpDM:Tracks>
         <tscDM:controller>
            <rdf:Description xmpDM:name="tscplayer">
               <tscDM:parameters>
                  <rdf:Bag>
                     <rdf:li xmpDM:name="autohide" xmpDM:value="true"/><rdf:li xmpDM:name="autoplay" xmpDM:value="false"/><rdf:li xmpDM:name="loop" xmpDM:value="false"/><rdf:li xmpDM:name="searchable" xmpDM:value="true"/><rdf:li xmpDM:name="captionsenabled" xmpDM:value="false"/><rdf:li xmpDM:name="sidebarenabled" xmpDM:value="false"/><rdf:li xmpDM:name="unicodeenabled" xmpDM:value="false"/><rdf:li xmpDM:name="backgroundcolor" xmpDM:value="000000"/><rdf:li xmpDM:name="sidebarlocation" xmpDM:value="left"/><rdf:li xmpDM:name="endaction" xmpDM:value="stop"/><rdf:li xmpDM:name="endactionparam" xmpDM:value="true"/><rdf:li xmpDM:name="locale" xmpDM:value="en-US"/></rdf:Bag>
               </tscDM:parameters>
               <tscDM:controllerText>
                  <rdf:Bag>
                  </rdf:Bag>
               </tscDM:controllerText>
            </rdf:Description>
         </tscDM:controller>
         <tscDM:contentList>
            <rdf:Description>
               <tscDM:files>
                  <rdf:Seq>
                     <rdf:li xmpDM:name="0" xmpDM:value="k_30iqt2.mp4"/><rdf:li xmpDM:name="1" xmpDM:value="k_30iqt2_First_Frame.png"/><rdf:li xmpDM:name="2" xmpDM:value="k_30iqt2_Thumbnails.png"/></rdf:Seq>
               </tscDM:files>
            </rdf:Description>
         </tscDM:contentList>
      </rdf:Description>
   </rdf:RDF>
</x:xmpmeta>