Maximum Data Rate

• Data Rate depends upon 3 factors

1) Available Bandwidth of the transmission medium.
2) Level of the signals to be used.
3) Quality of the channel (level of the Noise)
• For the Noiseless Channel ,Nyquist suggest the
Maximum data rate = 2 * Bandwidth * log2(L) bps

– Where L = the number of signal levels.

By the above formulae we can conclude that

Maximum Data Rate is directly proptional to Number of signal levels
Maximum Data rate can be acheivable by increasing th eNumber of
Signal Levels.

But it is not So?

There is limit on the number of signal level(s) to be used.
• If we introduce only two signal levels then the receiver will be
able to differentiate between signal level 0 and 1,
but if there are 64 signal levels then the receiver should be well
trained enough to differentiate among 64 levels
• As we go on increasing the signal level the difference between
each signal level is reduced and the resultant signal becomes
vulnerable to the incorrect identification.
• Increasing the level of the signal reduces the reliability of
the system
• Consider a noiseless channel with a bandwidth of
3000 Hz transmitting a signal with two signal levels.
The maximum bit rate can be calculated as
• For the Noisy Channel ,Shannon suggest that
Maximum data rate (in bps) = B x log2(1 + SNR)
B = bandwidth of the transmission medium
SNR = Signal to Noise Ratio.

• SNR is the ratio of signal power to the Noise Power

• SNR = 10 log Ps/PN
• Maximum data rate (in bps) = B x log2(1 + SNR)

• In Shanon formula there is no indication of the signal level

which means that no matter how many levels we used
we cannot achieve a data rate greater than the capacity of the
transmission medium or the transmission channel.
• A telephone line normally has a bandwidth of 3000 Hz. The
signal-to-noise ratio is usually 3162.Calculate the capacity.
• Consider an extremely noisy channel in which the value of the
signal-to-noise ratio is almost zero. In other words, the noise
is so strong that the signal is faint. For this channel the
capacity C is calculated as
• This means that the capacity
of this channel is zero
regardless of the bandwidth.
• In other words, we cannot
receive any data through
this channel.
 The Shannon capacity gives us the upper limit;
Nyquist formula tells us how many signal levels we need.
• Suppose there is a signal with frequency 4000 Hz .
What will be Maximum Data Rate of the channel if
the SNR is 31 db.
• Compute the Number of Signal levels that can be
used to achieve Maximum Data Rate in presence of
Noise.
• Shanon tells about the Maximum Data Rate that can be acheivable in the
presence of the Noise.
• MDR = Band width * log2(1 +SNR)
= 4000 * log 2( 1+ 31) = 4000 * log 2 32= 4000 * log 2 2 5
= 40000 * 5 = 20000 bps.
For Determining the Number of Signal levels , we use Nyquist.
For L =2 , MDR = 2 * Bandwidth * Log 2 L.
= 2 * 4000 * Log 2 2 = 8000 bps.
L = 4 MDR = 2 * 4000 * Log 2 4 = 16000 bps
L = 8 MDR = 2 * 4000 * Log 2 8 = 24000 bps.
We cannot go beyond MDR( Determined by the Shanon in the presence of Noise)
Thus No of Signal level = 4.
• Throughput : It measures the amount of data successfully
sent through a link.
• Throughput and Bandwidth seems to be same but they are
different.
• A link may have bandwidth of B bps but we can send only T
bps through the Link with T always less than of B.
• Analogy to a Highway that is capable enough to
accommodate 1000 vehicles per minute but if there is a
congestion the figure may reduced to 200 vehicles per minute.
Here
• Bandwidth =1000Vehicles per minute .
• Throughput is 200 vehicles per minute.
• Throughput = Amount of Information Sent through a Link in unit time
____________________________
Maximum possible information

Network throughput refers to the average data rate of successful data or

message delivery over a specific communications link.
Network throughput is measured in bits per second (bps).
Problem : A network with a bandwidth of 60 Mbps can pass only
an average of 12000 frames per seconds with each frame
carrying an average of 10,000 bits . Calculate the throughput
of the network.
Through put = 12000* 10000
___________ ____________
60

Throughput = 2 Mbps
• Latency(Delay) : It defines how long it takes for a complete
message to reach at the destination .
Latency is made up of 4 components:
a) Propagation Time b) Transmission Time
c) Queuing Time d) Processing Delay
Propagation Time measures the time taken by a bit to travel from
the source to the destination.
Propagation Time(Delay)
= Distance between the source and destinaation
________________________________
Propagation Speed
• What is the Propagation time if the distance between the
two points is 12000 km. Assume the Propagation speed to be
2.4 * 10 8 m/s in cable.
Propagation Time = 12,000 *1000
______________________

2 .4 * 10 8

= 50 ms
• In the data communication we not only send just 1 bit but we
send a message( is composed of many number of bits).
• Transmission Time : It is time between the first bit of the
message leaving the sender and last bit of the message
arriving at the receiver or in other words we can say that
• The transmission time, is the amount of time from the
beginning until the end of a message transmission or Packet
Transmission.
• The packet transmission time in seconds can be obtained from
the packet size in bit and the bit rate in bit/s as:

• Packet transmission time = Packet size / Bandwidth or Bit rate

• What are the propagation time and transmission time for a
2.5 Kbyte message if the bandwidth of the network is 1 Gbps
Assume the distance between the sender and the receiver is
12000 km and the propagation speed at 2.4 * 10 8m/s
• Propagation Time = 12000 * 1000
_____________ = 50 ms
2.4 * 10 8

•Transmission Time = 2500 * 8

_____________ = 0.020 ms
10 9

What does above values conveys?

The message is short and the Bandwidth is high so the
dominating factor is Propagation Time.
• What are the propagation time and transmission time for a 5
Mbyte message if the bandwidth of the network is 1 Mbps
Assume the distance between the sender and the receiver is
12000 km and the propagation speed at 2.4 * 10 8m/s .

• What information it conveys .

• Which time is the dominating one.

• Propagation Time = 12000 * 1000
_____________ = 50 ms
2.4 * 10 8

•Transmission Time = 5,00,000 * 8

_____________ = 40s
10 6
• The message is long and the Bandwidth is
not so high so the dominating factor is
Transmission Time.
Let us assume that the device
A wants to send the Packet to
device B. The packet visits the
intermediate nodes (Routers)
before it reaches to device B.
The task of each intermediate
node or router is to store the
incoming Packet in its buffer
implemented in the form of the
queue and then forward it to
the next destination i.e
another router or to the
receving machine itself.
• Router has to process each packets coming from different
devices on the network. It might be the case that router is
busy in processing other packets when the packet from the
device A arrives so the Packet from A have to wait in the
buffer( implemented in the form of Queue) for the Router to
process it.
The time for which the data packet waited in a buffer or Queue is
called as Queuing Delay.
Queuing delay varies from router to router. Queuing delay is not
constant but it varies.
• Processing delay: Router takes the packet out of the queue
and process it in order to find the next intermediate node to
whom the packet has to send so that it can be forwarded to
the destination device.
• For this routers takes the help of routing table that are
constructed with the help of routing algoritms.
• The time spent in Processing the Packet at the router and
forwarding it is called as Processing delay.
Queuing Time : Time needed for each intermediate node to hold the message
before it can be processed.
Queuing Time is not a fixed factor It changes with the load imposed on the
network. If there is a heavy load on the network , the queuing time
increasing as a result of it Processing time at the intermediate node or
router also increases.