<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-11-09 12:27:10 PM" dc:source="Camtasia,9.1.0,enu" dc:title="k_31asq" tscDM:firstFrame="k_31asq_First_Frame.png" tscDM:originId="693765A9-5AAD-46AF-9EF3-544354460A8D" tscDM:project="k_31asq.tscproj">
         <xmpDM:duration xmpDM:scale="1/1000" xmpDM:value="3686733"/>
         <xmpDM:videoFrameSize stDim:unit="pixel" stDim:h="1080" stDim:w="1440"/>
         <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="Analysis of A Single Queue Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse567-17/" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Overview Birth Death Processes M/M/1 Queue M/M/m Queue M/M/m/B Queue with Finite Buffers Results for other Queueing systems" xmpDM:startTime="46500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Birth-Death Processes Jobs arrive one at a time (and not as a batch)." xmpDM:startTime="57267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="State = Number of jobs n in the system." xmpDM:startTime="57267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Arrival of a new job changes the state to n+1  birth Departure of a job changes the system state" xmpDM:startTime="57267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="to n-1  Death State-transition diagram: 0 1 2 j-1 j j+1 … l0 l1 l2 lj-1 lj lj+1 m1" xmpDM:startTime="57267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="m2 m3 mj j+1  j+2" xmpDM:startTime="57267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Birth-Death Processes(Cont) When the system is in state n, it has n jobs in it." xmpDM:startTime="149300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The new arrivals take place at a rate ln." xmpDM:startTime="149300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The service rate is mn." xmpDM:startTime="149300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="We assume that both the inter-arrival times and service times are exponentially distributed." xmpDM:startTime="149300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="0 1 2 j-1 j j+1 … l0 l1 l2 lj-1 lj lj+1 m1 m2 m3 mj j+1  j+2" xmpDM:startTime="149300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="149300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Theorem: State Probability The steady-state probability pn of a birth-death process being in state n is given by: Here, p0" xmpDM:startTime="174500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="is the probability of being in the zero state." xmpDM:startTime="174500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="TP_tmp 0 1 2 j-1 j j+1 … l0 l1 l2 lj-1 lj lj+1 m1 m2 m3 mj j+1 " xmpDM:startTime="174500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="j+2" xmpDM:startTime="174500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof Suppose the system is in state j at time t." xmpDM:startTime="220000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="There are j jobs in the system." xmpDM:startTime="220000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In the next time interval of a very small duration Dt, the system can move to state j-1 or j+1" xmpDM:startTime="220000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="with the following probabilities: TP_tmp TP_tmp TP_tmp" xmpDM:startTime="220000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof(Cont) If there are no arrivals or departures, the system will stay in state j and, thus: Dt = small" xmpDM:startTime="357967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name=" zero probability of two events (two arrivals, two departure, or a arrival and a departure) occurring during this interval" xmpDM:startTime="357967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="pj(t) = probability of being in state j at time t TP_tmp" xmpDM:startTime="357967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof Suppose the system is in state j at time t." xmpDM:startTime="377567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="There are j jobs in the system." xmpDM:startTime="377567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In the next time interval of a very small duration Dt, the system can move to state j-1 or j+1" xmpDM:startTime="377567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="with the following probabilities: TP_tmp TP_tmp TP_tmp" xmpDM:startTime="377567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof(Cont) If there are no arrivals or departures, the system will stay in state j and, thus: Dt = small" xmpDM:startTime="387300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name=" zero probability of two events (two arrivals, two departure, or a arrival and a departure) occurring during this interval" xmpDM:startTime="387300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="pj(t) = probability of being in state j at time t TP_tmp" xmpDM:startTime="387300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof(Cont) The jth equation above can be written as follows: Under steady state, pj(t) approaches a fixed value pj, that" xmpDM:startTime="441400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="is: TP_tmp TP_tmp TP_tmp" xmpDM:startTime="441400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof(Cont) If there are no arrivals or departures, the system will stay in state j and, thus: Dt = small" xmpDM:startTime="450600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name=" zero probability of two events (two arrivals, two departure, or a arrival and a departure) occurring during this interval" xmpDM:startTime="450600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="pj(t) = probability of being in state j at time t TP_tmp" xmpDM:startTime="450600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof(Cont) The jth equation above can be written as follows: Under steady state, pj(t) approaches a fixed value pj, that" xmpDM:startTime="453733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="is: TP_tmp TP_tmp TP_tmp" xmpDM:startTime="453733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof(Cont) Substituting these in the jth equation, we get: The solution to this set of equations is: TP_tmp TP_tmp TP_tmp" xmpDM:startTime="497767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="497767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof(Cont) The sum of all probabilities must be equal to one: TP_tmp" xmpDM:startTime="555667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof(Cont) Substituting these in the jth equation, we get: The solution to this set of equations is: TP_tmp TP_tmp TP_tmp" xmpDM:startTime="559533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="559533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof(Cont) The sum of all probabilities must be equal to one: TP_tmp" xmpDM:startTime="566900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/M/1 Queue M/M/1 queue is the most commonly used type of queue Used to model single processor systems or to" xmpDM:startTime="579400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="model individual devices in a computer system Assumes that the interarrival times and the service times are exponentially distributed and" xmpDM:startTime="579400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="there is only one server." xmpDM:startTime="579400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="No buffer or population size limitations and the service discipline is FCFS Need to know only the mean arrival rate" xmpDM:startTime="579400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="l and the mean service rate m." xmpDM:startTime="579400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="State = number of jobs in the system 0 1 2 J-1 J J+1 … l l l l l" xmpDM:startTime="579400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="l m m m m  " xmpDM:startTime="579400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof(Cont) The sum of all probabilities must be equal to one: TP_tmp" xmpDM:startTime="581600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/M/1 Queue M/M/1 queue is the most commonly used type of queue Used to model single processor systems or to" xmpDM:startTime="599400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="model individual devices in a computer system Assumes that the interarrival times and the service times are exponentially distributed and" xmpDM:startTime="599400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="there is only one server." xmpDM:startTime="599400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="No buffer or population size limitations and the service discipline is FCFS Need to know only the mean arrival rate" xmpDM:startTime="599400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="l and the mean service rate m." xmpDM:startTime="599400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="State = number of jobs in the system 0 1 2 J-1 J J+1 … l l l l l" xmpDM:startTime="599400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="l m m m m  " xmpDM:startTime="599400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Results for M/M/1 Queue Birth-death processes with Probability of n jobs in the system: The quantity l/m is called traffic" xmpDM:startTime="722533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="intensity and is usually denoted by symbol r." xmpDM:startTime="722533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Thus: TP_tmp TP_tmp TP_tmp" xmpDM:startTime="722533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Results for M/M/1 Queue(Cont) n is geometrically distributed." xmpDM:startTime="791433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Utilization of the server = Probability of having one or more jobs in the system: TP_tmp TP_tmp 0 5 10" xmpDM:startTime="791433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="15 20 # in system n pn" xmpDM:startTime="791433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Results for M/M/1 Queue(Cont) Mean number of jobs in the system: Variance of the number of jobs in the system:" xmpDM:startTime="916967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="TP_tmp TP_tmp" xmpDM:startTime="916967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Box 31.1:" xmpDM:startTime="997600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/M/1 Queue TP_tmp" xmpDM:startTime="997600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Box 31.1:" xmpDM:startTime="1054967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/M/1 Queue TP_tmp" xmpDM:startTime="1054967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Box 31.1:" xmpDM:startTime="1221133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/M/1 Queue (Cont) TP_tmp" xmpDM:startTime="1221133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Box 31.1:" xmpDM:startTime="1286633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/M/1 Queue TP_tmp" xmpDM:startTime="1286633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Box 31.1:" xmpDM:startTime="1556967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/M/1 Queue (Cont) TP_tmp" xmpDM:startTime="1556967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 31.1" xmpDM:startTime="1558733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="On a network gateway, measurements show that the packets arrive at a mean rate of 125 packets per second (pps)" xmpDM:startTime="1558733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and the gateway takes about two milliseconds to forward them." xmpDM:startTime="1558733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Using an M/M/1 model, analyze the gateway." xmpDM:startTime="1558733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="What is the probability of buffer overflow if the gateway had only 13 buffers? How many buffers do we need" xmpDM:startTime="1558733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="to keep packet loss below one packet per million? Arrival rate l = 125 pps Service rate m = 1/.002" xmpDM:startTime="1558733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= 500 pps Gateway Utilization r = l/m = 0.25" xmpDM:startTime="1558733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Probability of n packets in the gateway = (1-r)rn = 0.75(0.25)n)" xmpDM:startTime="1558733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1558733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 31.1(Cont)" xmpDM:startTime="1649800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Mean Number of packets in the gateway = r/(1-r) = 0.25/0.75" xmpDM:startTime="1649800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= 0.33" xmpDM:startTime="1649800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Mean time spent in the gateway = (1/m)/(1-r)= (1/500)/(1-0.25)" xmpDM:startTime="1649800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= 2.66" xmpDM:startTime="1649800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="milliseconds Probability of buffer overflow To limit the probability of loss to less than 10-6: We need about nine buffers." xmpDM:startTime="1649800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="TP_tmp" xmpDM:startTime="1649800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 31.1(Cont)" xmpDM:startTime="1790000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The last two results about buffer overflow are approximate." xmpDM:startTime="1790000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Strictly speaking, the gateway should actually be modeled as a finite buffer M/M/1/B queue." xmpDM:startTime="1790000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="However, since the utilization is low and the number of buffers is far above the mean queue length, the results" xmpDM:startTime="1790000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="obtained are a close approximation." xmpDM:startTime="1790000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1790000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 31.1(Cont)" xmpDM:startTime="1823167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Mean Number of packets in the gateway = r/(1-r) = 0.25/0.75" xmpDM:startTime="1823167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= 0.33" xmpDM:startTime="1823167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Mean time spent in the gateway = (1/m)/(1-r)= (1/500)/(1-0.25)" xmpDM:startTime="1823167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= 2.66" xmpDM:startTime="1823167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="milliseconds Probability of buffer overflow To limit the probability of loss to less than 10-6: We need about nine buffers." xmpDM:startTime="1823167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="TP_tmp" xmpDM:startTime="1823167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 31.1(Cont)" xmpDM:startTime="1829333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The last two results about buffer overflow are approximate." xmpDM:startTime="1829333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Strictly speaking, the gateway should actually be modeled as a finite buffer M/M/1/B queue." xmpDM:startTime="1829333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="However, since the utilization is low and the number of buffers is far above the mean queue length, the results" xmpDM:startTime="1829333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="obtained are a close approximation." xmpDM:startTime="1829333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1829333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 31 The average response time on a database system is three seconds." xmpDM:startTime="1835400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="During a one minute observation interval, the idle time on the system was measured to be ten seconds." xmpDM:startTime="1835400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Using an M/M/1 model for the system, determine the following: TP_tmp Key: TP_tmp" xmpDM:startTime="1835400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 31.1(Cont)" xmpDM:startTime="1837967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The last two results about buffer overflow are approximate." xmpDM:startTime="1837967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Strictly speaking, the gateway should actually be modeled as a finite buffer M/M/1/B queue." xmpDM:startTime="1837967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="However, since the utilization is low and the number of buffers is far above the mean queue length, the results" xmpDM:startTime="1837967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="obtained are a close approximation." xmpDM:startTime="1837967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1837967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 31 The average response time on a database system is three seconds." xmpDM:startTime="1839967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="During a one minute observation interval, the idle time on the system was measured to be ten seconds." xmpDM:startTime="1839967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Using an M/M/1 model for the system, determine the following: TP_tmp Key: TP_tmp" xmpDM:startTime="1839967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 31 The average response time on a database system is three seconds." xmpDM:startTime="1840767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="During a one minute observation interval, the idle time on the system was measured to be ten seconds." xmpDM:startTime="1840767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Using an M/M/1 model for the system, determine the following: TP_tmp Key: TP_tmp" xmpDM:startTime="1840767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 31 The average response time on a database system is three seconds." xmpDM:startTime="1842067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="During a one minute observation interval, the idle time on the system was measured to be ten seconds." xmpDM:startTime="1842067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Using an M/M/1 model for the system, determine the following: TP_tmp Key: TP_tmp" xmpDM:startTime="1842067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 31 The average response time on a database system is three seconds." xmpDM:startTime="2129467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="During a one minute observation interval, the idle time on the system was measured to be ten seconds." xmpDM:startTime="2129467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Using an M/M/1 model for the system, determine the following: TP_tmp Key: TP_tmp" xmpDM:startTime="2129467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 31 The average response time on a database system is three seconds." xmpDM:startTime="2350433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="During a one minute observation interval, the idle time on the system was measured to be ten seconds." xmpDM:startTime="2350433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Using an M/M/1 model for the system, determine the following: TP_tmp Key: TP_tmp" xmpDM:startTime="2350433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 31.1(Cont)" xmpDM:startTime="2350900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The last two results about buffer overflow are approximate." xmpDM:startTime="2350900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Strictly speaking, the gateway should actually be modeled as a finite buffer M/M/1/B queue." xmpDM:startTime="2350900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="However, since the utilization is low and the number of buffers is far above the mean queue length, the results" xmpDM:startTime="2350900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="obtained are a close approximation." xmpDM:startTime="2350900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2350900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 31.1(Cont)" xmpDM:startTime="2351333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Mean Number of packets in the gateway = r/(1-r) = 0.25/0.75" xmpDM:startTime="2351333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= 0.33" xmpDM:startTime="2351333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Mean time spent in the gateway = (1/m)/(1-r)= (1/500)/(1-0.25)" xmpDM:startTime="2351333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= 2.66" xmpDM:startTime="2351333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="milliseconds Probability of buffer overflow To limit the probability of loss to less than 10-6: We need about nine buffers." xmpDM:startTime="2351333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="TP_tmp" xmpDM:startTime="2351333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 31.1" xmpDM:startTime="2351600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="On a network gateway, measurements show that the packets arrive at a mean rate of 125 packets per second (pps)" xmpDM:startTime="2351600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and the gateway takes about two milliseconds to forward them." xmpDM:startTime="2351600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Using an M/M/1 model, analyze the gateway." xmpDM:startTime="2351600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="What is the probability of buffer overflow if the gateway had only 13 buffers? How many buffers do we need" xmpDM:startTime="2351600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="to keep packet loss below one packet per million? Arrival rate l = 125 pps Service rate m = 1/.002" xmpDM:startTime="2351600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= 500 pps Gateway Utilization r = l/m = 0.25" xmpDM:startTime="2351600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Probability of n packets in the gateway = (1-r)rn = 0.75(0.25)n)" xmpDM:startTime="2351600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2351600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Box 31.1:" xmpDM:startTime="2352133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/M/1 Queue (Cont) TP_tmp" xmpDM:startTime="2352133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Box 31.1:" xmpDM:startTime="2353233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/M/1 Queue TP_tmp" xmpDM:startTime="2353233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Box 31.1:" xmpDM:startTime="2378267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/M/1 Queue (Cont) TP_tmp" xmpDM:startTime="2378267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 31.1" xmpDM:startTime="2378667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="On a network gateway, measurements show that the packets arrive at a mean rate of 125 packets per second (pps)" xmpDM:startTime="2378667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and the gateway takes about two milliseconds to forward them." xmpDM:startTime="2378667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Using an M/M/1 model, analyze the gateway." xmpDM:startTime="2378667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="What is the probability of buffer overflow if the gateway had only 13 buffers? How many buffers do we need" xmpDM:startTime="2378667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="to keep packet loss below one packet per million? Arrival rate l = 125 pps Service rate m = 1/.002" xmpDM:startTime="2378667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= 500 pps Gateway Utilization r = l/m = 0.25" xmpDM:startTime="2378667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Probability of n packets in the gateway = (1-r)rn = 0.75(0.25)n)" xmpDM:startTime="2378667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2378667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 31.1(Cont)" xmpDM:startTime="2379167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Mean Number of packets in the gateway = r/(1-r) = 0.25/0.75" xmpDM:startTime="2379167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= 0.33" xmpDM:startTime="2379167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Mean time spent in the gateway = (1/m)/(1-r)= (1/500)/(1-0.25)" xmpDM:startTime="2379167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= 2.66" xmpDM:startTime="2379167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="milliseconds Probability of buffer overflow To limit the probability of loss to less than 10-6: We need about nine buffers." xmpDM:startTime="2379167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="TP_tmp" xmpDM:startTime="2379167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 31.1(Cont)" xmpDM:startTime="2379633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The last two results about buffer overflow are approximate." xmpDM:startTime="2379633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Strictly speaking, the gateway should actually be modeled as a finite buffer M/M/1/B queue." xmpDM:startTime="2379633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="However, since the utilization is low and the number of buffers is far above the mean queue length, the results" xmpDM:startTime="2379633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="obtained are a close approximation." xmpDM:startTime="2379633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2379633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 31 The average response time on a database system is three seconds." xmpDM:startTime="2380100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="During a one minute observation interval, the idle time on the system was measured to be ten seconds." xmpDM:startTime="2380100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Using an M/M/1 model for the system, determine the following: TP_tmp Key: TP_tmp" xmpDM:startTime="2380100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 31 The average response time on a database system is three seconds." xmpDM:startTime="2380933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="During a one minute observation interval, the idle time on the system was measured to be ten seconds." xmpDM:startTime="2380933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Using an M/M/1 model for the system, determine the following: TP_tmp Key: TP_tmp" xmpDM:startTime="2380933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/M/m Queue 0 1 2 m-1 m m+1 … l l l l l l m 2m 3m (m-1)m m" xmpDM:startTime="2381833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="m TP_tmp" xmpDM:startTime="2381833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 31 The average response time on a database system is three seconds." xmpDM:startTime="2387200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="During a one minute observation interval, the idle time on the system was measured to be ten seconds." xmpDM:startTime="2387200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Using an M/M/1 model for the system, determine the following: TP_tmp Key: TP_tmp" xmpDM:startTime="2387200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/M/m Queue 0 1 2 m-1 m m+1 … l l l l l l m 2m 3m (m-1)m m" xmpDM:startTime="2423233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="m TP_tmp" xmpDM:startTime="2423233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/M/m/B Queue 0 1 2 m-1 m m+1 … l l l l l l m 2m 3m (m-1)m m" xmpDM:startTime="2770333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="m TP_tmp B m m l m …" xmpDM:startTime="2770333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/M/m Queue 0 1 2 m-1 m m+1 … l l l l l l m 2m 3m (m-1)m m" xmpDM:startTime="2773633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="m TP_tmp" xmpDM:startTime="2773633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/M/m/B Queue 0 1 2 m-1 m m+1 … l l l l l l m 2m 3m (m-1)m m" xmpDM:startTime="2876800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="m TP_tmp B m m l m …" xmpDM:startTime="2876800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/M/m Queue 0 1 2 m-1 m m+1 … l l l l l l m 2m 3m (m-1)m m" xmpDM:startTime="2980800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="m TP_tmp" xmpDM:startTime="2980800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/M/m/B Queue 0 1 2 m-1 m m+1 … l l l l l l m 2m 3m (m-1)m m" xmpDM:startTime="3000367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="m TP_tmp B m m l m …" xmpDM:startTime="3000367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Other Queues M/G/1 M/G/1/1/1/Processor Sharing M/D/1 M/G/1 G/M/1 G/G/m The textbook has results for these queues." xmpDM:startTime="3001133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3001133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/M/m/B Queue 0 1 2 m-1 m m+1 … l l l l l l m 2m 3m (m-1)m m" xmpDM:startTime="3002400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="m TP_tmp B m m l m …" xmpDM:startTime="3002400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Other Queues M/G/1 M/G/1/1/1/Processor Sharing M/D/1 M/G/1 G/M/1 G/G/m The textbook has results for these queues." xmpDM:startTime="3207800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3207800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary Birth-death processes: Compute probability of having n jobs in the system M/M/1 Queue: Load-independent =&gt; Arrivals and service do" xmpDM:startTime="3291500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="not depend upon the number in the system ln= l, mn=m Traffic Intensity: r = l/ m Mean Number of" xmpDM:startTime="3291500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Jobs in the system = r/(1-r) Mean Response Time = (1/m)/(1-r)" xmpDM:startTime="3291500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 31 Submit answers to modified Exercise 31.3" xmpDM:startTime="3564267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The average response time on a database system is five seconds." xmpDM:startTime="3564267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="During a one minute observation interval, the idle time on the system was measured to be twelve seconds." xmpDM:startTime="3564267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Using an M/M/1 model for the system, determine the following: a." xmpDM:startTime="3564267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="System utilization b." xmpDM:startTime="3564267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Average service time per query c." xmpDM:startTime="3564267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Number of queries completed during the observation interval d." xmpDM:startTime="3564267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Average number of jobs in the system e." xmpDM:startTime="3564267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Probability of number of jobs in the system being greater than 10 f." xmpDM:startTime="3564267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="90-percentile response time g." xmpDM:startTime="3564267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="90-percentile waiting time" xmpDM:startTime="3564267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Reading List Chapter 31" xmpDM:startTime="3619567" 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="3620933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3620933" 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="Analysis of A Single Queue" xmpDM:startTime="0" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="0" tscDM:imageoffset="0" tscDM:imagerect="0, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Overview" xmpDM:startTime="46500" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="1" tscDM:imageoffset="0" tscDM:imagerect="75, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Birth-Death Processes" xmpDM:startTime="57267" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="2" tscDM:imageoffset="0" tscDM:imagerect="150, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Birth-Death Processes(Cont)" xmpDM:startTime="149300" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="3" tscDM:imageoffset="0" tscDM:imagerect="225, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Theorem: State Probability " xmpDM:startTime="174500" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="4" tscDM:imageoffset="0" tscDM:imagerect="300, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof " xmpDM:startTime="220000" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="5" tscDM:imageoffset="0" tscDM:imagerect="375, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof(Cont)" xmpDM:startTime="357967" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="6" tscDM:imageoffset="0" tscDM:imagerect="450, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof " xmpDM:startTime="377567" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="7" tscDM:imageoffset="0" tscDM:imagerect="525, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof(Cont)" xmpDM:startTime="387300" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="8" tscDM:imageoffset="0" tscDM:imagerect="600, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof(Cont)" xmpDM:startTime="441400" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="9" tscDM:imageoffset="0" tscDM:imagerect="675, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof(Cont)" xmpDM:startTime="450600" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="10" tscDM:imageoffset="0" tscDM:imagerect="750, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof(Cont)" xmpDM:startTime="453733" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="11" tscDM:imageoffset="0" tscDM:imagerect="825, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof(Cont)" xmpDM:startTime="497767" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="12" tscDM:imageoffset="0" tscDM:imagerect="900, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof(Cont)" xmpDM:startTime="555667" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="13" tscDM:imageoffset="0" tscDM:imagerect="975, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof(Cont)" xmpDM:startTime="559533" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="14" tscDM:imageoffset="0" tscDM:imagerect="1050, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof(Cont)" xmpDM:startTime="566900" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="15" tscDM:imageoffset="0" tscDM:imagerect="1125, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/M/1 Queue" xmpDM:startTime="579400" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="16" tscDM:imageoffset="0" tscDM:imagerect="1200, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Proof(Cont)" xmpDM:startTime="581600" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="17" tscDM:imageoffset="0" tscDM:imagerect="1275, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/M/1 Queue" xmpDM:startTime="599400" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="18" tscDM:imageoffset="0" tscDM:imagerect="1350, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Results for M/M/1 Queue" xmpDM:startTime="722533" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="19" tscDM:imageoffset="0" tscDM:imagerect="1425, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="     Results for M/M/1 Queue(Cont)" xmpDM:startTime="791433" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="20" tscDM:imageoffset="0" tscDM:imagerect="1500, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="     Results for M/M/1 Queue(Cont)" xmpDM:startTime="916967" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="21" tscDM:imageoffset="0" tscDM:imagerect="1575, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Box 31.1: M/M/1 Queue" xmpDM:startTime="997600" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="22" tscDM:imageoffset="0" tscDM:imagerect="1650, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="End of presentation" xmpDM:startTime="1015967" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="23" tscDM:imageoffset="0" tscDM:imagerect="1725, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Box 31.1: M/M/1 Queue" xmpDM:startTime="1054967" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="24" tscDM:imageoffset="0" tscDM:imagerect="1800, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="       Box 31.1: M/M/1 Queue (Cont)" xmpDM:startTime="1221133" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="25" tscDM:imageoffset="0" tscDM:imagerect="1875, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Box 31.1: M/M/1 Queue" xmpDM:startTime="1286633" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="26" tscDM:imageoffset="0" tscDM:imagerect="1950, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="       Box 31.1: M/M/1 Queue (Cont)" xmpDM:startTime="1556967" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="27" tscDM:imageoffset="0" tscDM:imagerect="2025, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 31.1" xmpDM:startTime="1558733" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="28" tscDM:imageoffset="0" tscDM:imagerect="2100, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 31.1(Cont)" xmpDM:startTime="1649800" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="29" tscDM:imageoffset="0" tscDM:imagerect="2175, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 31.1(Cont)" xmpDM:startTime="1790000" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="30" tscDM:imageoffset="0" tscDM:imagerect="2250, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 31.1(Cont)" xmpDM:startTime="1823167" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="31" tscDM:imageoffset="0" tscDM:imagerect="2325, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 31.1(Cont)" xmpDM:startTime="1829333" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="32" tscDM:imageoffset="0" tscDM:imagerect="2400, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 31" xmpDM:startTime="1835400" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="33" tscDM:imageoffset="0" tscDM:imagerect="2475, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 31.1(Cont)" xmpDM:startTime="1837967" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="34" tscDM:imageoffset="0" tscDM:imagerect="2550, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 31" xmpDM:startTime="1839967" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="35" tscDM:imageoffset="0" tscDM:imagerect="2625, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 31" xmpDM:startTime="1840767" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="36" tscDM:imageoffset="0" tscDM:imagerect="2700, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 31" xmpDM:startTime="1842067" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="37" tscDM:imageoffset="0" tscDM:imagerect="2775, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 31" xmpDM:startTime="2129467" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="38" tscDM:imageoffset="0" tscDM:imagerect="2850, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 31" xmpDM:startTime="2350433" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="39" tscDM:imageoffset="0" tscDM:imagerect="2925, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 31.1(Cont)" xmpDM:startTime="2350900" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="40" tscDM:imageoffset="0" tscDM:imagerect="3000, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 31.1(Cont)" xmpDM:startTime="2351333" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="41" tscDM:imageoffset="0" tscDM:imagerect="3075, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 31.1" xmpDM:startTime="2351600" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="42" tscDM:imageoffset="0" tscDM:imagerect="3150, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="       Box 31.1: M/M/1 Queue (Cont)" xmpDM:startTime="2352133" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="43" tscDM:imageoffset="0" tscDM:imagerect="3225, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Box 31.1: M/M/1 Queue" xmpDM:startTime="2353233" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="44" tscDM:imageoffset="0" tscDM:imagerect="3300, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="       Box 31.1: M/M/1 Queue (Cont)" xmpDM:startTime="2378267" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="45" tscDM:imageoffset="0" tscDM:imagerect="3375, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 31.1" xmpDM:startTime="2378667" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="46" tscDM:imageoffset="0" tscDM:imagerect="3450, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 31.1(Cont)" xmpDM:startTime="2379167" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="47" tscDM:imageoffset="0" tscDM:imagerect="3525, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example 31.1(Cont)" xmpDM:startTime="2379633" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="48" tscDM:imageoffset="0" tscDM:imagerect="3600, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quiz 31" xmpDM:startTime="2380100" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="49" tscDM:imageoffset="0" tscDM:imagerect="3675, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 31" xmpDM:startTime="2380933" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="50" tscDM:imageoffset="0" tscDM:imagerect="3750, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/M/m Queue" xmpDM:startTime="2381833" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="51" tscDM:imageoffset="0" tscDM:imagerect="3825, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Solution to Quiz 31" xmpDM:startTime="2387200" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="52" tscDM:imageoffset="0" tscDM:imagerect="3900, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/M/m Queue" xmpDM:startTime="2423233" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="53" tscDM:imageoffset="0" tscDM:imagerect="3975, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/M/m/B Queue" xmpDM:startTime="2770333" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="54" tscDM:imageoffset="0" tscDM:imagerect="50, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/M/m Queue" xmpDM:startTime="2773633" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="55" tscDM:imageoffset="0" tscDM:imagerect="125, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/M/m/B Queue" xmpDM:startTime="2876800" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="56" tscDM:imageoffset="0" tscDM:imagerect="200, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/M/m Queue" xmpDM:startTime="2980800" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="57" tscDM:imageoffset="0" tscDM:imagerect="275, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/M/m/B Queue" xmpDM:startTime="3000367" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="58" tscDM:imageoffset="0" tscDM:imagerect="350, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Other Queues" xmpDM:startTime="3001133" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="59" tscDM:imageoffset="0" tscDM:imagerect="425, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M/M/m/B Queue" xmpDM:startTime="3002400" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="60" tscDM:imageoffset="0" tscDM:imagerect="500, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Other Queues" xmpDM:startTime="3207800" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="61" tscDM:imageoffset="0" tscDM:imagerect="575, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary" xmpDM:startTime="3291500" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="62" tscDM:imageoffset="0" tscDM:imagerect="650, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 31" xmpDM:startTime="3564267" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="63" tscDM:imageoffset="0" tscDM:imagerect="725, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Reading List" xmpDM:startTime="3619567" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="64" tscDM:imageoffset="0" tscDM:imagerect="800, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Scan This to Download These Slides" xmpDM:startTime="3620933" tscDM:image="k_31asq_Thumbnails.png" tscDM:imageindex="65" tscDM:imageoffset="0" tscDM:imagerect="875, 56, 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_31asq.mp4"/><rdf:li xmpDM:name="1" xmpDM:value="k_31asq_First_Frame.png"/><rdf:li xmpDM:name="2" xmpDM:value="k_31asq_Thumbnails.png"/></rdf:Seq>
               </tscDM:files>
            </rdf:Description>
         </tscDM:contentList>
      </rdf:Description>
   </rdf:RDF>
</x:xmpmeta>