Download - Random Access Networks
![Page 1: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/1.jpg)
RANDOM ACCESS NETWORKS
CSMA FAMILIES
1
![Page 2: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/2.jpg)
References
Chapter 9 of the book.
Throughput Analysis for Persistent CSMA Systems, HIDEAKI TAKAGI AND LEONARD KLEINROCK. IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. COM-33, NO. 7, JULY 1985
Performance Analysis and Enhancement of MAC Protocols, Chuan Heng Foh, A Thesis submitted in total fulfillment of the requirements of the degree of Doctor of Philosophy. Department of Electrical and Electronic Engineering, The University of Melbourne, 2002.
2
![Page 3: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/3.jpg)
CSMA Motivation
In Aloha and slotted Aloha: a station initiates a transmission without making sure that the broadcast channel is clear for transmission.
Therefore,
During a data frame transmission, there is a chance of collision.
Carrier Sense Multiple Access (CSMA) protocol was proposed as a refinement over SLOTTED ALLOHA by providing Carrier Sensing.
The main Objective of this added functionality is to minimize the length of the collision period. 3
![Page 4: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/4.jpg)
CSMA Motivation
If all stations initiate transmissions only when the broadcast channel is sensed idle, the chances of collisions can be reduced.
“listen before transmit”.
NOTE:
Due to signal propagation delay, tow or more stations may not be aware of other transmissions even after the channel is sensed idle.
Therefore,
If two or more stations start their transmissions at the same time, Collisions are still possible !! 4
![Page 5: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/5.jpg)
CSMA Motivation
In the case that a ready station senses a busy channel, the transmission may defer based on various schemes described in the following:
5
![Page 6: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/6.jpg)
CSMA Transmission Modes
1) Non-persistent CSMA (NP):If channel is sensed idle then transmit packetElse (channel busy) use backoff algorithm to delay transmission.
6
![Page 7: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/7.jpg)
CSMA Transmission Modes
1-persistent CSMA (p-persistent and P=1):
If the channel is sensed busy, a ready station will keep sensing the busy channel until the channel turns idle. As soon as the channel is sensed idle, the station starts its transmission immediately, that is, with probability one.
7
![Page 8: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/8.jpg)
CSMA Transmission Modes
p-persistent CSMA (NP):
If the broadcast channel is sensed busy by a ready station, it will persist in sensing the channel until the channel becomes idle. As soon as the channel is sensed idle, with probability p, the station transmits the data frame, or with probability (1-p), it waits for a predefined time period before sensing the channel again. The same process is repeated then.
If channel is sensed idle then Transmit packet with probability of p.Else Wait for end to end delay (time slot) with probability (1-p) & repeat.Else (channel busy) keep spin sensing until channel is idle in which case repeat the algorithm. 8
![Page 9: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/9.jpg)
CSMA Transmission Modes
p-persistent CSMA (NP):
wait
9
![Page 10: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/10.jpg)
10
![Page 11: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/11.jpg)
Flow diagram of CSMA
11
![Page 12: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/12.jpg)
Assumption for throughput analysis:
• Infinite # of stations, arrivals are following Poisson distribution.
• Propagation delay between stations is τ. That is the one –way propagation delay for bus.
• Fixed packet length and transmission time is Δt.• Each ST has at most one packet ready for transmission• In the case of slotted protocols Δt = k τ. Where k is integer.• No overhead for sensing, channel is noiseless. • Any packet time overlap is destructive.
Throughput Analysis CSMA
12
![Page 13: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/13.jpg)
THROUGHPUT ANALYSIS CSMA
13
![Page 14: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/14.jpg)
THROUGHPUT ANALYSIS CSMA
Let the arrival rate of the combined load and retransmission trafficbe G data frames per data frame transmission time
In non-persistent CSMA protocol, the broadcast channel is repeating two periods: an idle period and a busy period
14
![Page 15: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/15.jpg)
THROUGHPUT ANALYSIS
15
![Page 16: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/16.jpg)
THROUGHPUT ANALYSIS CSMA
Busy Period: (B)
During this there are no attempts to access the network
May contain busy packets and or not colliding packets
Idle Period: (I)
Depends on the load of the network, it maybe empty and maybe start of transmission
Duration of a cycle: (B+I) :
Useful period (U)
The duration that the channel carries useful information within a cycle. It is the average time in Busy period during which there is a successful transmission
B and I variables are two independent random variables.
16
![Page 17: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/17.jpg)
Using the results from the renewal theory:
The throughput can be expressed as
THROUGHPUT ANALYSIS
17
![Page 18: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/18.jpg)
THROUGHPUT ANALYSIS CSMA, E[U]
When a transmission occurs, it takes a units of time to reach all other stations.
To get a successful transmission, it is required to have no other stations initiating transmissions during vulnerable period, a, when a transmission is started.
Since the arrival process is a Poisson process
Therefore,
18
![Page 19: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/19.jpg)
THROUGHPUT ANALYSIS CSMA, E[I]
The idle period, I,
is the duration from the end of a transmission to the arrival of the next transmission.
In other words, I is the inter-arrival time of the arrival process. Since the arrival process is a Poisson process
Thus the
idle period is exponentially distributed, and its mean value is given by
t19
![Page 20: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/20.jpg)
The busy period, BIs the sum of
the time difference between the first and the last arrivals within a vulnerable period, denoted Y,
plus
The data frame transmission time and the signal propagation time.
How to find Y ???
THROUGHPUT ANALYSIS CSMA, E[B]
20
![Page 21: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/21.jpg)
0 arrival in -y0 y
THROUGHPUT ANALYSIS CSMA, E[B]
21
![Page 22: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/22.jpg)
THROUGHPUT ANALYSIS CSMA, E[B]
( )
0
(1 )G y
ty y e dy
.
(1 )G
tty e
G
22
![Page 23: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/23.jpg)
THROUGHPUT ANALYSIS CSMA
By substituting the expressions for E[U], E[I], E[B]
the throughput for the non-persistent CSMA protocol is thus
a : The normalized propagation delay.
It is clear that non-persistent CSMA performs better for small values of a.
( )
.
.
( (1 ))
G y
t
G
t
t eS
t tt e
G G
23
![Page 24: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/24.jpg)
As (a) approaches 0 == > S = G/G+1
As (a) approaches 0 & G >>1 == > S=1
For (a) = 1: S is the lowest, this is because time & are equal, and by the time we get information about the status of channel, the actual status may have changed.
24
![Page 25: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/25.jpg)
Slotted CSMA
25
![Page 26: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/26.jpg)
SLOTTED CSMA
Since
Therefore
26
![Page 27: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/27.jpg)
SLOTTED CSMA
27
![Page 28: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/28.jpg)
SLOTTED CSMA
Similarly:
Therefore:
28
![Page 29: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/29.jpg)
SLOTTED CSMA
29
![Page 30: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/30.jpg)
SLOTTED CSMA
Substituting all the previous terms back in S:
30
![Page 31: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/31.jpg)
31
THROUGHPUT ANALYSIS CSMA
Notes:For small G the persistent CSMA is the best.For large G the non persistent CSMA is the best.
![Page 32: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/32.jpg)
32
THROUGHPUT ANALYSIS CSMA
![Page 33: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/33.jpg)
33
THROUGHPUT ANALYSIS CSMA
Notes:
• ALOHA protocols are not sensitive to varying (a) since it does not depend on it (constant).
• 1-persistant (slotted/un-slotted) are not sensitive to varying (a) for small (a). however, as (a) increases the sensitivity increases as well-this goes for non-persistent also-.
• For large (a) ALOHA gives highest S because sensing became useless as 2τ is very large.
• p-persistent performance is between S-NP & NP. p-persistent is optimized for a given (a)
![Page 34: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/34.jpg)
34
AVG. NORMALIZED DELAY VS THROUGHPUT
![Page 35: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/35.jpg)
35
NOTES
• The Previous figure was a result of simulation for the throughput average delay tradeoffs for the ALOHA and CSMA procedures for a = 0.01
• For each value of S, the average delay was optimized with respect to the mean backoff time.
![Page 36: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/36.jpg)
CSMA/CD
36
![Page 37: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/37.jpg)
CSMA/CD
Collision Detection: Listen while transmitting the Packet
A Timer is used to broadcast t jamming signal in case a collision is detected. This will take J seconds
If the Jamming is heard, other transmitting stations back-off.
37
![Page 38: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/38.jpg)
CSMA/DC Flow Chart38
![Page 39: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/39.jpg)
CSMA/CD: BACK OFF
Truncated binary Exponential Back off:
Initial Transmission + 15 attempts: If this happens == > give up ( report a failure network)
i=1Step i: k = min(10,i)
r = rand[0, ]wait for: r * 2
Exit
39
![Page 40: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/40.jpg)
40
TIMING DIAGRAM OF CSMA /CD:
Notes: Time during which channel is idle as seen by each station is :
Where J is jamming time
WHY ??
![Page 41: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/41.jpg)
41
![Page 42: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/42.jpg)
THROUGHPUT ANALYSIS
The contention Period 𝐶ҧ= 2𝜏+ 𝐽+ 𝑧ҧ
z: Arrival time of the first packet that collided with the ref. packet.
A distribution function of z is then needed. i.e. Prሾ𝑍≤ 𝑧ሿ 𝑖𝑛 𝑡ℎ𝑒 𝑝𝑒𝑟𝑖𝑜𝑑 ሾ0,𝜏ሿ Or Equivalently: 𝐶𝐷𝐹:𝐹𝑧ሺ𝑧ሻ= Prሾ𝑍≤ 𝑧ሿ= 1− Prሾ𝑍> 𝑧ሿ ∵ Prሾ𝑍> 𝑧ሿ= Prሾ𝑛𝑜 𝑎𝑟𝑟𝑖𝑣𝑎𝑙 𝑖𝑛 ሺ0,𝑧ሻȁ#𝑡ℎ𝑒𝑟𝑒 𝑖𝑠 𝑎𝑡 𝑙𝑒𝑎𝑠𝑡 𝑜𝑛 𝑎𝑟𝑟𝑖𝑣𝑎𝑙 𝑖𝑛 (0,𝜏)]
42
![Page 43: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/43.jpg)
THROUGHPUT ANALYSIS
Prሾ𝑍> 𝑧ሿ= Prൣ�𝑛𝑜 𝑎𝑟𝑟𝑖𝑣𝑎𝑙 ሾ0,𝑧ሿ∩𝑎𝑡 𝑙𝑒𝑎𝑠𝑡 𝑜𝑛𝑒 𝑎𝑟𝑟𝑖𝑣𝑎𝑙 𝑖𝑛 ሾ0,𝜏ሿ൧Prൣ�𝑎𝑡 𝑙𝑒𝑎𝑠𝑡 𝑜𝑛𝑒 𝑎𝑟𝑟𝑖𝑣𝑎𝑙 𝑖𝑛 ሾ0,𝜏ሿ൧
= Prൣ�𝑛𝑜 𝑎𝑟𝑟𝑖𝑣𝑎𝑙 ሾ0,𝑧ሿ]∗Pr [𝑎𝑡 𝑙𝑒𝑎𝑠𝑡 𝑜𝑛𝑒 𝑎𝑟𝑟𝑖𝑣𝑎𝑙 𝑖𝑛 ሾ𝑧,𝜏ሿ൧Prൣ�𝑎𝑡 𝑙𝑒𝑎𝑠𝑡 𝑜𝑛𝑒 𝑎𝑟𝑟𝑖𝑣𝑎𝑙 𝑖𝑛 ሾ0,𝜏ሿ൧
= 𝑒−ቀ𝐺∆𝑡ቁ.𝑧 ∗൬1− 𝑒−ቀ𝐺∆𝑡ቁ.ሺ𝜏−𝑧ሻ൰1− 𝑒−ቀ𝐺∆𝑡ቁ.𝜏
43
![Page 44: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/44.jpg)
44
![Page 45: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/45.jpg)
THROUGHPUT ANALYSIS
𝐶𝐷𝐹 = 1− 𝑒−ቀ𝐺∆𝑡ቁ.𝑧− 𝑒−ቀ𝐺∆𝑡ቁ.ሺ𝜏ሻ1− 𝑒−ቀ𝐺∆𝑡ቁ.𝜏
𝑙𝑒𝑡: 𝑔 = 𝐺∆𝑡𝜏 𝑧ҧ= 𝜏1𝑔− 𝑒−𝑔1− 𝑒−𝑔൨
And Therefore,
𝑐ҧ= 𝐽+ 𝜏2+ 1𝑔− 𝑒−𝑔1− 𝑒−𝑔൨
45
![Page 46: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/46.jpg)
THROUGHPUT ANALYSIS𝑃𝑠 = Prሺ𝑠𝑢𝑐𝑐𝑒𝑠𝑠𝑓𝑢𝑙 𝑡𝑟𝑎𝑛𝑠𝑚𝑖𝑠𝑠𝑖𝑜𝑛ሻ = Pr [ 0 𝑎𝑟𝑟𝑖𝑣𝑎𝑙 𝑖𝑛 ሾ0,𝜏ሿ= 𝑒−ቀ𝐺∆𝑡ቁ.ሺ𝜏ሻ= e−g
The Busy Period is then: 𝐵ത= 𝑃𝑠ሺ∆𝑡+ 𝜏ሻ+ ሺ1− 𝑃𝑠ሻ.𝑐ҧ
The Idle period is given by:
𝐼ҧ= ∆𝑡𝐺
And 𝑈ഥ= 𝑃𝑠.∆𝑡 46
![Page 47: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/47.jpg)
THROUGHPUT ANALYSIS
𝑆= UഥIҧ+ Bഥ
𝑆= ∆𝑡𝑒−𝑔 ሺ∆𝑡+ 𝜏ሻ𝑒−𝑔 + 𝐽+ 𝜏൬2+ 1𝑔− 𝑒−𝑔1− 𝑒−𝑔൰൨.ሺ1− 𝑒−𝑔ሻ+ 𝜏𝑔
47
![Page 48: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/48.jpg)
SLOTTED CSMA/CD
𝑈ഥ= 𝑃𝑠.∆𝑡 ∵ 𝑃𝑠 = Prሺ1 𝑎𝑟𝑟𝑖𝑣𝑎𝑙 𝑖𝑛 𝜏ሻPrሺ𝑠𝑜𝑚𝑒 𝐴𝑟𝑟𝑖𝑣𝑎𝑙 𝑖𝑛 𝜏ሻ == > 𝑃𝑠 = 𝑎𝐺𝑒−𝑎𝐺1− 𝑒−𝑎𝑔 𝐶ҧ= 2𝜏+ 𝑗 𝐵ത= 𝑃𝑠ሺ∆𝑡+ 𝜏ሻ+ ሺ1− 𝑃𝑠ሻ𝐶ҧ 𝐼ҧ= 𝑎 Δ𝑡.𝑒−𝑔1− 𝑒−𝑔
𝑆= 𝑔𝑒−𝑔𝑔𝑒−𝑔 + 𝑎𝛾ሺ1− 𝑒−𝑔 − 𝑔𝑒−𝑔ሻ+ 𝑎ሺ2− 𝑒−𝑔 − 𝑔𝑒−𝑔ሻ
𝛾 = 𝐽𝜏 𝑎 = 𝜏Δ𝑡
48
![Page 49: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/49.jpg)
49
PERFORMANCE ANALYSIS CSMA/CD
Notes:
• γ is normalized Jamming time (in plot γ=1).
• SNP is better for low value of (a) (slotted is good for high G).
• Slotting time has negligible effect for low G.
![Page 50: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/50.jpg)
50
PERFORMANCE ANALYSIS CSMA/CD
![Page 51: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/51.jpg)
51
NOTES
The previous figure plots the throughput S versus offered Traffic G, for various schemes. The normalized jamming time is unity in all cases, and a takes several shown values.
• Non-persistence CSMA/CD both slotted and un-slotted give for small a greater maximum throughput than 1-persistence CSMA/CD
• Slotting the time access tend to increase throughput at higher values of G but has negligible effects for small values.
![Page 52: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/52.jpg)
52
![Page 53: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/53.jpg)
53
NOTES
The previous figure shows the sensitivity of throughput S for the jamming time γ for 3 values of normalized propagation delay.
• minimizing the jamming time, maximizes S.
![Page 54: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/54.jpg)
54
PERFORMANCE ANALYSIS CSMA/CD
![Page 55: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/55.jpg)
55
NOTES
The previous figure shows the effect of propagation delay on throughput S, by plotting max throughput versus normalized propagation delay a, for normalized jamming time equal to unity.
• Increasing a decreases S for all cases, with the least effect felt by slotted non-persistence CSMA/CD.
• That is due to the fact that:
longer propagation delays cause the contention period to become:
A) larger because collision detection occurs later. B) more numerous. because carrier sensing is based on less current information.
![Page 56: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/56.jpg)
56
PERFORMANCE ANALYSIS CSMA/CD
![Page 57: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/57.jpg)
57
NOTES
The previous figure assumes the backoff times are drown from exponential distribution.
• The infinite population of CSMA/CD is unstable.
• The finite population networks, practical, can be made stable by increasing the mean backoff time to sufficiently very large value.
![Page 58: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/58.jpg)
58
PERFORMANCE ANALYSIS CSMA/CD
![Page 59: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/59.jpg)
59
NOTES
In the previous figure, a = 0.01 and γ =1
• For CD protocols, the figure shows the improvement in maximum throughput achieved by CSMA/CD over all others.
• Since CSMA/CD maintain a throughput relatively high and close to the maximum over a large range of offered Load suggests that CSMA/CD is probably more stable than other random access protocols
• Notice that: this improvement is to a large extent depend on a. this is shown in the next figure.
![Page 60: Random Access Networks](https://reader035.vdocuments.site/reader035/viewer/2022062500/56814eee550346895dbc7c4e/html5/thumbnails/60.jpg)
60
PERFORMANCE ANALYSIS CSMA/CD