Scribd
Upload
5 views1 page

CSITFormula 2

Uploaded by

Ramana Kumar karnati
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views1 page

CSITFormula 2

Uploaded by

Ramana Kumar karnati
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

P a g e |3

5.3. Maximum data throughput = =


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,
7.1.1.Channel utilization, u

={

7.2. Selective reject,

7.2.1.Channel utilization ,u ={

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) = ,


a. where S= Signal strength and N = noise strength.

2. Signal Attenuation (in decibels, dB) = ,

Data Rate and Channel Capacity Calculations:

1. Nyquist Theorem: Maximum data rate = 2H bits/sec, where H is bandwidth in hertz (Hz)
and V is number of levels.
2. Shannon’s theorem: Channel capacity = ( ) bits/sec, where H is bandwidth in hertz

(Hz). (Note: here 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)
= no. of bits per frame, then

You might also like