×
FOCUS ON THE DESTINATION NOT THE DIFFICULTIES

# Note for Computer Network - CN By Devesh Sharma

• Computer Network - CN
• Note
• 12 Views
0 User(s)

#### Text from page-2

P a g e |3 • ×" = • ×! ! 6. For Simplex positive acknowledgement with retransmission (PAR) protocol: 6.1. Maximum channel utilization and throughput is similar to stop-and-wait protocol when the effect of errors is ignored. 7. For Sliding Window Protocols with window size of w, 7.1. Go-Back-N, 5.3. Maximum data throughput = u 1−% , '( *'-./* ('003 4ℎ6 %'%6 '. 6. , * ≥ 2& + 1 1+2&% =# *(1−%) , '( *'-./* ./63 -/4 ('003 4ℎ6 %'%6 '. 6. , * < (1+2&)(1−%+*%) 7.1.1.Channel utilization, 7.2. Selective reject, 7.2.1.Channel utilization 2& + 1 (1 − %), '( *'-./* ('003 4ℎ6 %'%6 '. 6. , * ≥ 2& + 1 ,u =;*(1−%) , '( *'-./* ./63 -/4 ('003 4ℎ6 %'%6 '. 6. , * < 2& + 1 (1+2&) [='>6 4/ 4?&-3>'4 @ (?&>63] ≥ [A/B-. =?'% ='>6] 7.3. Condition for maximum utilization or throughput is: Throughput Calculations: Throughput = Channel Utilization × Channel Bandwidth Signal and Noise Calculations: 1. Signal to Noise Ratio (in decibels, dB) = 10logDE F , G a. where S= Signal strength and N = noise strength. HIJKLMNOOP• QRSPI , 2. Signal Attenuation (in decibels, dB) = 10logDE !PTPNUP• QRSPI Data Rate and Channel Capacity Calculations: 1. Nyquist Theorem: Maximum data rate = 2Hlog V W bits/sec, where H is bandwidth in hertz (Hz) and V is number of levels. Z 2. Shannon’s theorem: Channel capacity = X log2 Y1 + ^ bits/sec, where H is bandwidth in hertz \ (Hz). (Note: here F G is not in decibels). Baud rate: A baud is the number of changes per second in the signal. · For Manchester encoding, baud rate = 2 × bit-rate MAC Sub layer: Static channel allocation in LANs and MANs. If C = channel capacity in bps _ = arrival rate of frames (frames/sec) D ` = no. of bits per frame, then

#### Text from page-3

P a g e |4 Mean time to delay, T = • !−# , Now, if the channel is divided into N sub channels each with capacity each of the N channels is T’(fdm) = • − ' ( ) ( = & % \$ % and arrival rate or input rate on then, % !−# Dynamic Channel Allocation: + ,-./0/12134 .5 0 5-067 = = #Δ3 , where # is the arrival rate of frames. /7189 9787-037: 18 0 ;7-1.: .5 27893ℎ Δ3 Multiple access protocol: Pure ALLOHA protocol · Infinite senders assumed. · Poisson distribution with mean rate S frames per frame time · Combined frame rate with retransmission G frames per frame time. · ‘t’ is the time required to transmit a frame. · In multiple access protocol, a frame is successful if no other frames are transmitted in the vulnerable period. · Probability of k frames being generated during a frame transmission time: ,? = · · @ A B CD ?! Hence, probability of zero frames in 2 frame periods is, ,F = 7 GH@ Therefore, for pure ALLOHA, - Mean rate I = J,0 = J7−2J which becomes maximum at G = ½, Max(S) = · • HB = 0.184 = 18.4% throughput. Vulnerability period in pure ALLOHA: For successful frame transmission, no other frame should be on the channel for vulnerability period equal to twice the time to transmit one frame. That is, NO287-0/12134 ;7-1.: Y = 23 , where t is the time to transmit one frame. M 18 P0Q7 .5 ,RST UVVWXU Slotted ALLOHA protocol · Time is divided into discrete frame slots. · A station is required to wait for the beginning of the next slot to transmit a frame. · Vulnerability period is halved as opposed to pure ALLOHA protocol. That is, · NO287-0/12134 ;7-1.: Y = 3 , where t is the time to transmit one frame. M 18 P0Q7 .5 IVWZZT[ UVVWXU Probability of k frames being generated during a frame transmission time: ,? = 7 G@ (1 − 7 G@ )?G•