CEE 320 Spring 2007 Queuing CEE 320 Steve Muench.

Slides:



Advertisements
Similar presentations
Traffic and routing. Network Queueing Model Packets are buffered in egress queues waiting for serialization on line Link capacity is C bps Average packet.
Advertisements

Lab Assignment 1 COP 4600: Operating Systems Principles Dr. Sumi Helal Professor Computer & Information Science & Engineering Department University of.
CEE 320 Winter 2006 Traffic Forecasting CEE 320 Steve Muench.
CEE 320 Winter 2006 Route Choice CEE 320 Steve Muench.
1 Chapter 8 Queueing models. 2 Delay and Queueing Main source of delay Transmission (e.g., n/R) Propagation (e.g., d/c) Retransmission (e.g., in ARQ)
Chapter 3 Probability Distribution. Chapter 3, Part A Probability Distributions n Random Variables n Discrete Probability Distributions n Binomial Probability.
Nur Aini Masruroh Queuing Theory. Outlines IntroductionBirth-death processSingle server modelMulti server model.
Final Exam Tuesday, December 9 2:30 – 4:20 pm 121 Raitt Hall Open book
Model Antrian By : Render, ect. Outline  Characteristics of a Waiting-Line System.  Arrival characteristics.  Waiting-Line characteristics.  Service.
Waiting Lines and Queuing Theory Models
HW # Due Day: Nov 23.
ECS 152A Acknowledgement: slides from S. Kalyanaraman & B.Sikdar
CTC-340 Signals - Basics. Terms & Definitions (review) Cycle - Cycle Length - Interval -. change interval - clearance interval- change + clearance = Yi.
Queuing Systems Chapter 17.
Queuing CEE 320 Anne Goodchild.
Queuing and Transportation
CEE 320 Fall 2008 Queuing CEE 320 Anne Goodchild.
Lec13, Ch.6, pp : Gap acceptance and Queuing Theory (Objectives)
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 14-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 14.
7/3/2015© 2007 Raymond P. Jefferis III1 Queuing Systems.
HW # Due Day: Nov 23.
Operations Management Waiting-Line Models Module D
Signalized Intersections
Chapter 9: Queuing Models
Traffic Concepts CEE 320 Steve Muench.
Group members  Hamid Ullah Mian  Mirajuddin  Safi Ullah.
Graduate Program in Engineering and Technology Management
Location Models For Airline Hubs Behaving as M/D/C Queues By: Shuxing Cheng Yi-Chieh Han Emile White.
Queuing Theory (Waiting Line Models)
Spreadsheet Modeling & Decision Analysis
CEE 320 Fall 2008 Course Logistics HW7 due today (9 total) Midterm next Friday (Wednesday review) Signalized Intersections (Chapter 7 of text) Last material.
Queueing Theory Models Training Presentation By: Seth Randall.
Asst. Prof. Dr. Mongkut Piantanakulchai
Terminal Design Passenger Processing. errata  Consider TSA impacts.
OREGON TECH CIV475 Lindgren1 CIV 475 Traffic Engineering Mannering / Kilareski Chapter 5 Queuing Theory.
CEE 320 Winter 2006 Trip Generation and Mode Choice CEE 320 Steve Muench.
Queuing Theory Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Chapter.
Queuing Theory. Introduction Queuing is the study of waiting lines, or queues. The objective of queuing analysis is to design systems that enable organizations.
1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.
Traffic Flow Fundamentals
Queueing System Provide a mean to estimate important measures of Highway Performance Travel time Speed Affects Roadway Design Required left-turn bay length.
Chapter 20 Queuing Theory to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole,
Hcm 2010: BASIC CONCEPTS praveen edara, ph.d., p.e., PTOE
Maciej Stasiak, Mariusz Głąbowski Arkadiusz Wiśniewski, Piotr Zwierzykowski Model of the Nodes in the Packet Network Chapter 10.
Structure of a Waiting Line System Queuing theory is the study of waiting lines Four characteristics of a queuing system: –The manner in which customers.
1 CEE 8207 Summer 2013 L#6 Queue. 2 Queueing System Provide a mean to estimate important measures of Highway Performance  Travel time  Speed Affects.
1 1 Slide Chapter 12 Waiting Line Models n The Structure of a Waiting Line System n Queuing Systems n Queuing System Input Characteristics n Queuing System.
1 Queuing Delay and Queuing Analysis. RECALL: Delays in Packet Switched (e.g. IP) Networks End-to-end delay (simplified) = End-to-end delay (simplified)
Delays  Deterministic Assumes “error free” type case Delay only when demand (known) exceeds capacity (known)  Stochastic Delay may occur any time Random.
Random Variables r Random variables define a real valued function over a sample space. r The value of a random variable is determined by the outcome of.
Queuing Models.
Mohammad Khalily Islamic Azad University.  Usually buffer size is finite  Interarrival time and service times are independent  State of the system.
Simple Queueing Theory: Page 5.1 CPE Systems Modelling & Simulation Techniques Topic 5: Simple Queueing Theory  Queueing Models  Kendall notation.
1 BIS 3106: Business Process Management (BPM) Lecture Nine: Quantitative Process Analysis (2) Makerere University School of Computing and Informatics Technology.
Topic V. Multiple-Channel Queuing Model
Models of Traffic Flow 1.
Chapter 9: Queuing Models
Trip Generation and Mode Choice
Demo on Queuing Concepts
Solutions Queueing Theory 1
Delays Deterministic Stochastic Assumes “error free” type case
System Performance: Queuing
Transportation Engineering Basic Queuing Theory February 18, 2011
Queuing Analysis Two analytical techniques can be employed to study queuing processes: Shock wave analysis Demand-capacity process is deterministic Suited.
Mitchell Jareo MAT4340 – Operations Research Dr. Bauldry
Delays Deterministic Stochastic Assumes “error free” type case
Discrete Event “Hand” Simulation of a GI/GI/1 Queue
Waiting Line Models Waiting takes place in virtually every productive process or service. Since the time spent by people and things waiting in line is.
Queuing Models J. Mercy Arokia Rani Assistant Professor
Traffic Concepts CEE 320 Steve Muench.
Presentation transcript:

CEE 320 Spring 2007 Queuing CEE 320 Steve Muench

CEE 320 Spring 2007 Outline 1.Fundamentals 2.Poisson Distribution 3.Notation 4.Applications 5.Analysis a.Graphical b.Numerical 6.Example

CEE 320 Spring 2007 Fundamentals of Queuing Theory Microscopic traffic flow Arrivals –Uniform or random Departures –Uniform or random Service rate –Departure channels Discipline –FIFO and LIFO are most popular –FIFO is more prevalent in traffic engineering

CEE 320 Spring 2007 Poisson Distribution Count distribution –Uses discrete values –Different than a continuous distribution P(n)=probability of exactly n vehicles arriving over time t n=number of vehicles arriving over time t λ=average arrival rate t=duration of time over which vehicles are counted

CEE 320 Spring 2007 Poisson Ideas Probability of exactly 4 vehicles arriving –P(n=4) Probability of less than 4 vehicles arriving –P(n<4) = P(0) + P(1) + P(2) + P(3) Probability of 4 or more vehicles arriving –P(n≥4) = 1 – P(n<4) = 1 - P(0) + P(1) + P(2) + P(3) Amount of time between arrival of successive vehicles

CEE 320 Spring 2007 Poisson Distribution Example From HCM 2000 Vehicle arrivals at the Olympic National Park main gate are assumed Poisson distributed with an average arrival rate of 1 vehicle every 5 minutes. What is the probability of the following: 1.Exactly 2 vehicles arrive in a 15 minute interval? 2.Less than 2 vehicles arrive in a 15 minute interval? 3.More than 2 vehicles arrive in a 15 minute interval?

CEE 320 Spring 2007 Example Calculations Exactly 2: Less than 2: More than 2:

CEE 320 Spring 2007 Example Graph

CEE 320 Spring 2007 Example Graph

CEE 320 Spring 2007 Example: Arrival Intervals

CEE 320 Spring 2007 Queue Notation Popular notations: –D/D/1, M/D/1, M/M/1, M/M/N –D = deterministic distribution –M = exponential distribution Arrival rate nature Departure rate nature Number of service channels

CEE 320 Spring 2007 Queuing Theory Applications D/D/1 –Use only when absolutely sure that both arrivals and departures are deterministic M/D/1 –Controls unaffected by neighboring controls M/M/1 or M/M/N –General case Factors that could affect your analysis: –Neighboring system (system of signals) –Time-dependent variations in arrivals and departures Peak hour effects in traffic volumes, human service rate changes –Breakdown in discipline People jumping queues! More than one vehicle in a lane! –Time-dependent service channel variations Grocery store counter lines

CEE 320 Spring 2007 Queue Analysis – Graphical Arrival Rate Departure Rate Time Vehicles t1t1 Queue at time, t 1 Maximum delay Maximum queue D/D/1 Queue Delay of n th arriving vehicle Total vehicle delay

CEE 320 Spring 2007 Queue Analysis – Numerical M/D/1 –Average length of queue –Average time waiting in queue –Average time spent in system λ = arrival rateμ = departure rate

CEE 320 Spring 2007 Queue Analysis – Numerical M/M/1 –Average length of queue –Average time waiting in queue –Average time spent in system λ = arrival rateμ = departure rate

CEE 320 Spring 2007 Queue Analysis – Numerical M/M/N –Average length of queue –Average time waiting in queue –Average time spent in system λ = arrival rateμ = departure rate

CEE 320 Spring 2007 M/M/N – More Stuff –Probability of having no vehicles –Probability of having n vehicles –Probability of being in a queue λ = arrival rateμ = departure rate

CEE 320 Spring 2007 Example 1 You are entering Bank of America Arena at Hec Edmunson Pavilion to watch a basketball game. There is only one ticket line to purchase tickets. Each ticket purchase takes an average of 18 seconds. The average arrival rate is 3 persons/minute. Find the average length of queue and average waiting time in queue assuming M/M/1 queuing.

CEE 320 Spring 2007 Example 2 You are now in line to get into the Arena. There are 3 operating turnstiles with one ticket-taker each. On average it takes 3 seconds for a ticket-taker to process your ticket and allow entry. The average arrival rate is 40 persons/minute. Find the average length of queue, average waiting time in queue assuming M/M/N queuing. What is the probability of having exactly 5 people in the system?

CEE 320 Spring 2007 Example 3 You are now inside the Arena. They are passing out Harry the Husky doggy bags as a free giveaway. There is only one person passing these out and a line has formed behind her. It takes her exactly 6 seconds to hand out a doggy bag and the arrival rate averages 9 people/minute. Find the average length of queue, average waiting time in queue, and average time spent in the system assuming M/D/1 queuing.

CEE 320 Spring 2007 Primary References Mannering, F.L.; Kilareski, W.P. and Washburn, S.S. (2003). Principles of Highway Engineering and Traffic Analysis, Third Edition (Draft). Chapter 5 Transportation Research Board. (2000). Highway Capacity Manual National Research Council, Washington, D.C.