COMPUTER E
Queueng Theory 2013

# Queueng Theory 2013 - Queuing Theory Our goals understand...

• Notes
• 81

This preview shows pages 1–13. Sign up to view the full content.

3: Delay Models in Data Networks - 1 Queuing Theory Our goals: understand principles of queueing systems: o Poisson Process o Markov process o Little’s theorem o Network of queues Determine Performance measures o Response time o Throughput o ?

This preview has intentionally blurred sections. Sign up to view the full version.

3: Delay Models in Data Networks - 2 Introduction- Motivation How to analyze changes in network workloads? o Should I add new terminals? How much? What percentage of calls will be blocked? o Adding more lines would solve the problem? Analysis of system (network) load and performance characteristics o response time o throughput Performance tradeoffs are often not intuitive Queuing theory, although mathematically complex, often makes analysis very straightforward
3: Delay Models in Data Networks - 3 Queueing Theory Operations Research The study of waiting Back to early twentieth century o Danish mathematician A. K. Erlang (telephone networks), why? o Russian mathematician A. A. Markov Applied in a broad variety of applications

This preview has intentionally blurred sections. Sign up to view the full version.

3: Delay Models in Data Networks - 4 Queueing Jargons Queueing system o Customers o Queue(s) (waiting room) o Server(s) Kendall’s notation o Standard notation to describe queueing containing single queue: X / Y / m / n/ y InterArrival process Service process Servers # Queue capacity Target group
3: Delay Models in Data Networks - 5 Common distributions G = general distribution if interarrival times or service times GI = general distribution of interarrival time with the restriction that they are independent M = negative exponential distribution (Poisson arrivals) D = deterministic arrivals or fixed length service M/M/1? M/D/1?

This preview has intentionally blurred sections. Sign up to view the full version.

3: Delay Models in Data Networks - 6 General Characteristics of Network Queuing Models Item population o generally assumed to be infinite therefore, arrival rate is persistent Queue size o infinite , therefore no loss o finite, more practical, but often immaterial Dispatching discipline o FIFO , typical o LIFO o Relative/Preferential, based on QoS o Processor sharing (PS) discipline Useful for modeling multiprogramming
3: Delay Models in Data Networks - 7 Multiserver Queue Comments: 1. Assuming N identical servers, and is the utilization of each server. 2. Then, N is the utilization of the entire system, and the maximum utilization is N x 100%. 3. Therefore, the maximum supportable arrival rate that the system can handle is: max = N / T s

This preview has intentionally blurred sections. Sign up to view the full version.

3: Delay Models in Data Networks - 8 Multiple Single-Server Queues
3: Delay Models in Data Networks - 9 Network of Queues

This preview has intentionally blurred sections. Sign up to view the full version.

3: Delay Models in Data Networks - 10 Elements of Queuing Networks
3: Delay Models in Data Networks - 11 Delay Components A B propagation transmission nodal processing queueing

This preview has intentionally blurred sections. Sign up to view the full version.

3: Delay Models in Data Networks - 12 Delay Components (Cont.) Packet delay the sum of delays on each link on the path traversed by the packet.
This is the end of the preview. Sign up to access the rest of the document.
• Fall '08
• MuhamedMudawar
• Poisson Distribution, Exponential distribution, Poisson process, Markov chain, Queueing theory, data networks

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern