Multiaccess Problem How to let distributed users (efficiently) share a single broadcast channel? ⇒ How to form a queue for distributed users? The protocols.

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

E&CE 418: Tutorial-4 Instructor: Prof. Xuemin (Sherman) Shen
Maciej Stasiak, Mariusz Głąbowski Arkadiusz Wiśniewski, Piotr Zwierzykowski Groups models Modeling and Dimensioning of Mobile Networks: from GSM to LTE.
Channel Allocation Protocols. Dynamic Channel Allocation Parameters Station Model. –N independent stations, each acting as a Poisson Process for the purpose.
EECC694 - Shaaban #1 lec #5 Spring Data Link In Broadcast Networks: The Media Access Sublayer Broadcast networks with multi-access (or random.
Lab Assignment 1 COP 4600: Operating Systems Principles Dr. Sumi Helal Professor Computer & Information Science & Engineering Department University of.
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)
1 ELEN 602 Lecture 8 Review of Last lecture –HDLC, PPP –TDM, FDM Today’s lecture –Wavelength Division Multiplexing –Statistical Multiplexing –Preliminary.
ECS 152A Acknowledgement: slides from S. Kalyanaraman & B.Sikdar
1 Performance Evaluation of Computer Networks Objectives  Introduction to Queuing Theory  Little’s Theorem  Standard Notation of Queuing Systems  Poisson.
Single queue modeling. Basic definitions for performance predictions The performance of a system that gives services could be seen from two different.
Rensselaer Polytechnic Institute © Shivkumar Kalvanaraman & © Biplab Sikdar1 ECSE-4730: Computer Communication Networks (CCN) Network Layer Performance.
Queueing Theory.
7/3/2015© 2007 Raymond P. Jefferis III1 Queuing Systems.
Introduction to Queuing Theory. 2 Queuing theory definitions  (Kleinrock) “We study the phenomena of standing, waiting, and serving, and we call this.
Internet Queuing Delay Introduction How many packets in the queue? How long a packet takes to go through?
8/28/2015  A. Orda, R. Rom, A. Segall, Design of Computer Networks Prof. Ariel Orda Room 914, ext 4646.
Introduction to Queuing Theory
Exponential and Chi-Square Random Variables
Network Analysis A brief introduction on queues, delays, and tokens Lin Gu, Computer Networking: A Top Down Approach 6 th edition. Jim Kurose.
Introduction to Queuing Theory
Copyright ©: Nahrstedt, Angrave, Abdelzaher, Caccamo1 Queueing Systems.
Queuing models Basic definitions, assumptions, and identities Operational laws Little’s law Queuing networks and Jackson’s theorem The importance of think.
Probability Review Thinh Nguyen. Probability Theory Review Sample space Bayes’ Rule Independence Expectation Distributions.
جلسه دهم شبکه های کامپیوتری به نــــــــــــام خدا.
CS433 Modeling and Simulation Lecture 13 Queueing Theory Dr. Anis Koubâa 03 May 2009 Al-Imam Mohammad Ibn Saud University.
MIT Fun queues for MIT The importance of queues When do queues appear? –Systems in which some serving entities provide some service in a shared.
Lecture 10: Queueing Theory. Queueing Analysis Jobs serviced by the system resources Jobs wait in a queue to use a busy server queueserver.
NETE4631:Capacity Planning (2)- Lecture 10 Suronapee Phoomvuthisarn, Ph.D. /
Introduction to Queueing Theory
Queuing Theory Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Chapter.
Queueing Theory What is a queue? Examples of queues: Grocery store checkout Fast food (McDonalds – vs- Wendy’s) Hospital Emergency rooms Machines waiting.
TexPoint fonts used in EMF.
Modeling and Analysis of Computer Networks
November 4, 2003APOC 2003 Wuhan, China 1/14 Demand Based Bandwidth Assignment MAC Protocol for Wireless LANs Presented by Ruibiao Qiu Department of Computer.
1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.
yahoo.com SUT-System Level Performance Models yahoo.com SUT-System Level Performance Models8-1 chapter11 Single Queue Systems.
Network Design and Analysis-----Wang Wenjie Queuing Theory III: 1 © Graduate University, Chinese academy of Sciences. Network Design and Performance Analysis.
Queuing Theory and Traffic Analysis Based on Slides by Richard Martin.
7-1 Introduction to Queueing Theory l Components of a queueing system n probability density function (pdf) of interarrival times n pdf of service times.
The M/M/ N / N Queue etc COMP5416 Advanced Network Technologies.
CS352 - Introduction to Queuing Theory Rutgers University.
Maciej Stasiak, Mariusz Głąbowski Arkadiusz Wiśniewski, Piotr Zwierzykowski Model of the Nodes in the Packet Network Chapter 10.
1 Chapter 4 Fundamental Queueing System. 2 3 Ref: Mischa Schwartz “Telecommunication Networks” Addison-Wesley publishing company 1988.
Internet Applications: Performance Metrics and performance-related concepts E0397 – Lecture 2 10/8/2010.
Copyright ©: Nahrstedt, Angrave, Abdelzaher, Caccamo1 Queueing Systems.
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)
Queuing Theory.  Queuing Theory deals with systems of the following type:  Typically we are interested in how much queuing occurs or in the delays at.
1 Chapter 4 Fundamental Queueing System
COMT 4291 Queuing Analysis COMT Call/Packet Arrival Arrival Rate, Inter-arrival Time, 1/ Arrival Rate measures the number of customer arrivals.
Chap 2 Network Analysis and Queueing Theory 1. Two approaches to network design 1- “Build first, worry later” approach - More ad hoc, less systematic.
Queueing Fundamentals for Network Design Application ECE/CSC 777: Telecommunications Network Design Fall, 2013, Rudra Dutta.
Mohammad Khalily Islamic Azad University.  Usually buffer size is finite  Interarrival time and service times are independent  State of the system.
Queuing Theory Important definition in Queuing Theory: We define various terms, which are used in our queue model. 1.Queue length: The number of customers.
Review of Useful Definitions Statistical multiplexing is a method of sharing a link among transmissions. When computers use store-and-forward packet switching,
Introduction to Queueing Theory
CTMCs & N/M/* Queues.
Internet Queuing Delay Introduction
B.Ramamurthy Appendix A
Lecture on Markov Chain
Internet Queuing Delay Introduction
Queuing models Basic definitions, assumptions, and identities
Delays Deterministic Stochastic Assumes “error free” type case
Queuing models Basic definitions, assumptions, and identities
Handling Routing Transport Haifa JFK TLV BGN To: Yishay From: Vered
TexPoint fonts used in EMF.
Queuing Analysis.
Queueing Theory 2008.
CSE 550 Computer Network Design
VIRTUE MARYLEE MUGURACHANI QUEING THEORY BIRTH and DEATH.
Presentation transcript:

Multiaccess Problem How to let distributed users (efficiently) share a single broadcast channel? ⇒ How to form a queue for distributed users? The protocols we used to solve this multiaccess problem are called multiaccess protocols. They are the lower sublayer of Data Link Control layer in the OSI model. The queueing theory studies properties of waiting queues. The mathematical formula of queueing theory can be used to evaluate the efficiency of different queueing system designs. In our applications, the efficiency of various multiaccess protocols.

Queueing Theory Parameter of interest to queueing analysis: λ average (avg, or mean) arrival rate (requests/sec) (packets/sec) µ avg service rate (requests/sec) (packets/sec) ρ=λ/µ utilization or traffic density, the ratio of system load to system capacity N avg no.of requests in the system, including those in buffers and in servers. Tw avg waiting time for a request at the buffer Ts avg service time for a request T avg delay in the system = Ts +Tw; its inverse is the avg system throughput. P B probability of request lost (due to buffer full situation)

Queueing Model Classification

Poisson Process The random process used most frequently to model the arrival pattern. The statistics of the Poisson process can be observed at any starting time: 1. Prob[instance occurrence in (τ, τ+∆t)] = λ∆t+o(∆t); λ is mean arrival rate; 2. Prob[no instance occurrence in (τ, τ+∆t)] = 1- λ∆t+o(∆t); 3. Arrivals are memoryless An arrival in one time interval of length ∆t is independent of arrivals in previous or future intervals. o(∆t) implies that other terms are higher order in ∆t and approaches 0 faster than ∆t. Prob[2 or more arrivals in (τ, τ+∆t)] = o(∆t). Note that the probability is independent of t.

M/M/1 Queue Poisson arrival process, exponential service time, single server p k =Prob[k customers in the system] To analyze M/M/1 Queue, let us examine its system behavior described by the following state transition diagram. State number represent the number of customers in the system. At equilibrium state the following equations hold Alternatively, Solving where by definition We get Mean number of customers in the system

M/M/1 Queue & Little’s Law Little’s Law where T is the mean delay inside the system. Mean delay for M/M/1 system where C= server service rate in # operations/sec (#bits/sec for transmission system) = mean # operations/customer (#bits/packet for TX system)

Evolution of Queues multiple queues→single queue multiple servers→single queue shared server

Why We Use Statistical Multiplexing? Advanced Queueing analysis presents the following interesting result: while where (m,λ,C) is a system with m servers, total capacity C, arrival rate λ, T is the total system delay and W is the waiting time in the queue. Sharing a single high speed server increase “contention” delay in the queue but decrease overall delay due to much shorter service time.

Scale factor of M/M/1 Queueing System if λ ↑ and C ↑ so that remains constant, then T↓. This benefit is in additional to economy of scale.

Application of Queueing Theory Case 1. Terminal Concentrators: mean packet length 1/µ’=1000bits/packet input lines traffic are Poisson process with mean arrival rate λi=2 packets/sec. Q1: What is the mean delay experienced by a packet from the time the last bit arrives at the concentrator until the moment that bit is retransmitted on the output line? Use, where λ = 4xλi=8, µ’C=9.6packets/sec. → T=1/(9.6–8)=0.625 sec. Q2: What is the mean number of packets in the concentrator, including the one in service? A: Use the little’s law N=λT=8x0.625=5!

Application of Queueing Theory Dedicated vs. Shared Channels: Eight parallel sessions using this 64kbps line. Each session generates Poisson traffic with λi=2 packets/sec. Packet lengths are exponentially distributed with a mean of 2000 bits. There are two design choices: a) Each session is given a dedicated 8kbps channel (via FDM or TDM). b) Packets of all sessions compete for a single 64kbp shared channel. Which one gives a better response time? A: a) For 8kbps channel, λ=2packets/sec, µ’=1/2000 packets/bit, C=8000bits/sec, µ’C=4 packets/sec, T=1/(µ’C-λ)=1/(4–2)=0.5 sec. b) For 64kbps shared channel, λ=8x2=16packets/sec, µ’=1/2000 packets/bit, C=64000bits/sec, µ’C=32 packets/sec, T=1/(µ’C-λ)=1/(32–16)=0.0667sec. Reason?