QueuingTheoryandTrafficAnalysis.ppt

Queuing Theoryand Traffic Analysis Queuing theory View network as collections of queues FIFO data-structures Queuing theory provides probabilistic analysis of these queues Examples: Average length Probability queue is at a certain length Probability a packet will be lost Little’s Law Little’s Law: Mean number tasks in system = arrival rate x mean response time Observed before, Little was first to prove Applies to any system in equilibrium, as long as nothing in black box is creating or destroying tasks Proving Little’s Law Definitions J: “Area” from previous slide N: Number of jobs (packets) T: Total time l: Average arrival rate N/T W: Average time job is in the system = J/N L: Average number of jobs in the system = J/T Proof: Method 1: Definition Proof: Method 2: Substitution Example using Little’s law Observe 120 cars in front of the Lincoln Tunnel Observe 32 cars/minute depart over a period where no cars in the tunnel at the start or end (e.g. security checks) What is average waiting time before and in the tunnel? Model Queuing System Strategy: Use Little’s law on both the complete system and its parts to reason about average time in the queue Kendal Notation Six parameters in shorthand First three typically used, unless specified Arrival Distribution Probability of a new packet arrives in time t Service Distribution Probability distribution packet is serviced in time t Number of servers Total Capacity (infinite if not specified) Population Size (infinite) Service Discipline (FCFS/FIFO) Distributions M: Exponential D: Deterministic (e.g. fixed constant) Ek: Erlang with parameter k Hk: Hyperexponential with param. k G: General (anything) M/M/1 is the simplest ‘realistic’ queue Kendal Notation Examples M/M/1: Exponential arrivals and service, 1 server, infinite capacity and population, FCFS (FIFO) M/M/m Same, but M servers G/G/3/20/1500/SPF General arrival and service distributions, 3 servers, 17 queue slots (20-3),