1. 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 n the number of servers n the queueing disciplines n the amount of buffer

2. 7-2 Intro. to Queueing Theory (cont’d) l Notation n M: exponential density function n D: deterministic n G: general e.g. M/M/1, M/M/m/m, M/D/1/K, G/G/m n Little’s result: N=T. n M/G/1 queues are fully solvable (P-K formula) n M/M/m/m queueing models can be used to analyze the call blocking probability (Erlang B formula)

3. 7-3 Medium Access Sublayer l How to access a multiaccess/random access/ broadcast channel? l Static channel allocation n FDM n low throughput n example: M/M/1 with arrival rate l (frames per sec.) and service rate m (frames per sec.) –T shared =1/(m-l) for sharing the entire channel –T FDM =1/(m/n-l/n)=n/(m-l)=n T shared for distributing equally the traffic among n identical subchannels (same total cap.)

4. 7-4 Medium Access Sublayer (cont’d) l Dynamic channel allocation n station models: N independent Poisson sources (exponential interarrival times) n single channel n errors & retransmissions are caused solely by collisions n continuous time vs. slotted time n with and without carrier sense

5. 7-5 Medium Access Sublayer (cont’d) l ALOHA protocols n pure ALOHA –users transmit data whenever they have data to send –collisions can be detected –damaged frames are retransmitted after a random delay –fixed frame size (which leads to the max. throughput) Fig. 4-1, p. 247

6. 7-6 Medium Access Sublayer (cont’d) l ALOHA protocols (cont’d) n pure ALOHA (cont’d) –performance analysis S: normalized throughput/offered load (0  S  1) G: S + retransmissions Poisson arrival process with mean rate G (assumed) Pr{k arrivals in a time period of t}=P k (t)=(Gt) k e -Gt /k! Fig. 4-2, p. 249

7. 7-7 Medium Access Sublayer (cont’d) l ALOHA protocols (cont’d) n pure ALOHA (cont’d) Pr{a particular frame is successfully transmitted} = Pr{0 other transmission in its vulnerable period (2)} = e -2G Then, S = G e -2G. To maximize S dS/dG=e -2G -2G e -2G =(1-2G) e -2G =0. Consequently, G*=0.5 and S*=1/2e=18%.

8. 7-8 Medium Access Sublayer (cont’d) l ALOHA protocols (cont’d) n slotted ALOHA –the same as pure ALOHA except that data are transmitted at the beginning of a time slot –the vulnerable period is 1 –performance analysis Pr{a particular frame is successfully transmitted} = Pr{0 other transmission in its vulnerable period (1)} = e -G Then, S = G e -G. To maximize S, dS/dG=e -G -G e -G =(1-G) e -G =0. Consequently, G*=1 and S*=1/e=36%.

9. 7-9 Medium Access Sublayer (cont’d) l ALOHA protocols (cont’d) n slotted ALOHA (cont’d) –expected number of transmissions of a frame success probability = e -G failure probability = 1 - e -G Assume that the number of transmissions can be characterized by a geometric distribution Pr{k transmissions} = e -G (1- e -G ) k-1. mean value = 1/ e -G = e G (delay increases exponentially with G)

10. 7-10 Medium Access Sublayer (cont’d) l Carrier sense multiple access (CSMA) protocols n 1-persistent CSMA (0) Continue. (1) If the station is idle, go to (0). (2) Sense the channel. (3) If the channel is busy, go to (2) [with probability 1]. (4) Send the frame. (5) If there is no collision, go to (1). (6) Delay a random time and go to (2).

11. 7-11 Medium Access Sublayer (cont’d) l CSMA protocols (cont’d) n nonpersistent CSMA (0) Continue. (1) If the station is idle, go to (0). (2) Sense the channel. (3) If the channel is busy, delay a random time and go to (2). (4) Send the frame. (5) If there is no collision, go to (1). (6) Delay a random time and go to (2). Achieves better channel throughput but incurs larger delay than 1-persistent CSMA.

12. 7-12 Medium Access Sublayer (cont’d) l CSMA protocols (cont’d) n p-persistent CSMA (applied to slotted channels) (0) Continue. (1) If the station is idle, go to (0). (2) Sense the channel. (3) If the channel is busy, wait until the next time slot and go to (2). (4) Generate a uniformly distributed random variable R over interval [0,1]. (5) If p<=R<=1, then wait until the next time slot and sense the channel. If the channel is idle then go to (4). Else send the frame. If there is no collision, go to (1). (6) Delay a random time and go to (2).

13. 7-13 Medium Access Sublayer (cont’d) l CSMA protocols (cont’d) n CSMA/CD (CSMA with collision detection) – Fig. 4-5, p. 253 –channel seizure time is 2t, where t is the full cable propagation time AB t 0 +2t - t0t0 t 0 +t -

14. 7-14 Medium Access Sublayer (cont’d) l Collision-free protocols n bit-map protocol –N contention (reservation) slots, one for each station, before a transmission period –example Fig. 4-6, p. 254 –the length of each contention period is N

15. 7-15 Medium Access Sublayer (cont’d) l Collision-free protocols (cont’d) n binary countdown –example Fig. 4-7, p. 256 –the length of each contention period is log 2 N

16. 7-16 Medium Access Sublayer (cont’d) l Limited-contention protocols n objectives –low delay at low load (like contention protocols) –high throughput at high load (like contention-free protocols) n success probability analysis k stations, each transmitting with probability p Let g = Pr{some one transmits successfully} = kp(1-p) k-1. Find g* (optimal) by setting d/dp[kp(1-p) k-1 ] to 0. Then, p* = 1/k and g* = (1-1/k) k-1. Fig. 4-8, p. 258

17. 7-17 Medium Access Sublayer (cont’d) l Limited-contention protocols (cont’d) n basic approaches –divide stations into groups (trying to limit k) –only members of a group are allowed to transmit at a time n the adaptive tree walk protocol –binary trees with depth first search upon collisions –example Fig. 4-9, p. 259

18. 7-18 Medium Access Sublayer (cont’d) l Limited-contention protocols (cont’d) n the adaptive tree walk protocol (cont’d) –under low loads, the search should start from the top –under heavy loads, the search should start from the bottom –What is the optimal level to start the search? l Let q be the expected number of ready stations. l Label the levels from the top by 0,1,2,... l For a node at level i, a fraction of 1/2 i of the total stations is below it. l An optimal selection of i is to let q/2 i =1. l Consequently, i*=log 2 q. –ways to improve the performance: e.g. node 1: collision & node 2: idle, then skip node 3 (must be collision)