CCNET Lect 8 Data Rate LimitsPerformance PDF
CCNET Lect 8 Data Rate LimitsPerformance PDF
Physical Layer
Data Rate Limits and Performance
Nyquist Theorem
• Defines theoretical max bit rate in noiseless channel in 1924.
C = 2 B log2L
C= capacity in bps
B = bandwidth in Hz
Shannon Capacity
• In reality, we cannot have a noiseless channel; the channel is
always noisy.
• In 1944, Claude Shannon introduced a formula, called the
Shannon capacity, to determine the theoretical highest data
rate for a noisy channel:
C = B log2(1 + SNR)
Bandwidth
• Bandwidth is the raw capability of a communications channel to
move data through that channel.
Throughput
• The throughput is a measure of how fast we can actually send
data through a network.
Latency
• The latency or delay defines how long it takes for an entire
message to completely arrive at the destination from the time
the first bit is sent out from the source.
• Latency is made of four components:
– Propagation time
– Transmission time
– Queuing time
– Processing delay.
Latency
• Propagation Delay
– This is simply the time it takes for a bit to travel between one place (Source) and
another (Destination).
• Transmission Time
– How long does it take to transmit the whole message from one place to another.
• Queuing Time
– The third component in latency is the queuing time, the time needed for each intermediate
or end device to hold the message before it can be processed.
– It is not a fixed factor; it changes with the load imposed on the network.
• Processing Delay:
– Time taken to process the message
Jitter
• Jitter is a problem if different packets of data encounter different
delays.
• If the delay for the first packet is 20 ms, for the second is 45
ms, and for the third is 40 ms, then the real-time application that
uses the packets endures jitter.
Reference
• Data Communications and Networking (Chapter 3),
5th Edition or Higher by BEHROUZ A. FOROUZAN