Computer Networks CS301

Introduction to Computer
Module 1 Networks

Dr. Sunandita Debnath, IIIT Vadodara

Store-and-Forward

➢ The packet switch must receive the entire packet before it can start to transmit the
first bit of the packet onto the outbound link. Instead it must store the packets' bits.
➢ Suppose the source is transmitting 3 packets of equal length of L bits and the link
has a transmission rate of R bits/sec
➢ Until the entire bits of packet #1 will reaches at the router, the router will not begin
transmission. So, the time required for the packet #1 to reach the destination is
(L/R+L/R)secs i.e. 2L/R secs.
Store-and-Forward
➢ Now for reaching all the three packets for reaching the destination is (3L/R+L/R)
secs.
➢ Here we have considered that the router has only one incoming and out going link.
➢ Now for sending one packet from source to destination over a path consists of N
links (means N-1 routers have to crossed) each of transmission rate of R bits/sec.
➢ Then the total end to end delay is
𝑳
𝒅𝒆𝒏𝒅−𝒕𝒐−𝒆𝒏𝒅 = 𝑵
𝑹
Queuing delay and Packet loss

➢ For each attached link packet switch has an output buffer (also known as output
queue) which stores packet which the router is about to send into that link.
➢ This queueing occurs when the arrival rate on the link exceeds the trasmmission
rate of the link for a period of time.
➢ Two things happens in such situations:
➢ Packet will be queued, wait to be transmitted on the link
➢ Packets can be dropped (lost) if memory (buffer) fills
 Four source of Packet delay

➢ A packet starts in a host (the source e.g. A or B), passes through a series of routers,
ends its journey in another host (destination e.g. C or D). As packet travels from a
node (host or router) to the subsequent node (host or router) along this path, suffers
from several types of delay.
𝒅𝒏𝒐𝒅𝒂𝒍 = 𝒅𝒑𝒓𝒐𝒄 + 𝒅𝒒𝒖𝒆𝒖𝒆 + 𝒅𝒕𝒓𝒂𝒏𝒔 + 𝒅𝒑𝒓𝒐𝒑
Processing Delay (𝒅𝒑𝒓𝒐𝒄 ) Processing delay in high speed routers are typically on the order of
microseconds or less.

Queueing Delay (𝒅𝒒𝒖𝒆𝒖𝒆 ) packets will be transmitted in a first-come-first-served manner.

waiting Time at the output link for transmission depends on congestion level of routers.

Transmission Delay (𝒅𝒕𝒓𝒂𝒏𝒔 ) If the length f packet is L bits and the transmission rate of the
link from router A to B is R bits/sec then the transmission delay is
𝐿
𝑑𝑡𝑟𝑎𝑛𝑠 = 𝑠𝑒𝑐
𝑅
It is the amount of delay or time required to push all the bits of a packet into the link.
It is order of milisecs or microsecs.
Propagation Delay (𝒅𝒑𝒓𝒐𝒑 )
The propagation delay is given by

𝐷𝑖𝑠𝑡𝑎𝑛𝑐𝑒 𝑏𝑒𝑡𝑤𝑒𝑒𝑛 𝑡ℎ𝑒 𝑡𝑤𝑜 𝑟𝑜𝑢𝑡𝑒𝑟 (𝑝ℎ𝑦𝑖𝑠𝑖𝑐𝑎𝑙 𝐿𝑒𝑛𝑔𝑡ℎ) 𝑑

𝑑𝑝𝑟𝑜𝑝 = =
𝑃𝑟𝑜𝑝𝑎𝑔𝑎𝑡𝑖𝑜𝑛 𝑠𝑝𝑒𝑒𝑑 𝑜𝑓 𝑡ℎ𝑒 𝑙𝑖𝑛𝑘 𝑠
Caravan Analogy

➢ In a highway each of the tollbooths are 100 kms away.

➢ Suppose there are 10 cars travelling together as caravan, follow each other in a fixed order.
➢ Assume that the car travels on the highway at a rate of 100kms/hours.

𝐷𝑖𝑠𝑡𝑎𝑛𝑐𝑒 𝑏𝑒𝑡𝑤𝑒𝑒𝑛 𝑡ℎ𝑒 𝑡𝑤𝑜 𝑟𝑜𝑢𝑡𝑒𝑟 (𝑝ℎ𝑦𝑖𝑠𝑖𝑐𝑎𝑙 𝐿𝑒𝑛𝑔𝑡ℎ) 𝑑 100 𝐾𝑚𝑠

𝑑𝑝𝑟𝑜𝑝 = = =
𝑃𝑟𝑜𝑝𝑎𝑔𝑎𝑡𝑖𝑜𝑛 𝑠𝑝𝑒𝑒𝑑 𝑜𝑓 𝑡ℎ𝑒 𝑙𝑖𝑛𝑘 𝑠 100𝑘𝑚𝑠/ℎ𝑜𝑢𝑟
= 60 𝑚𝑖𝑛𝑠
Caravan Analogy Contd…

➢ Let the tollbooth services the one car at 12 secs. On the other way in 60 secs it will be able
to service all the 10 cars.
➢ So the transmission delay of the caravan

𝐿𝑒𝑛𝑔𝑡ℎ 𝑜𝑓 𝑝𝑎𝑐𝑘𝑒𝑡 𝐿 10 𝑐𝑎𝑟𝑠

𝑑𝑡𝑟𝑎𝑛𝑠 = = = = 2𝑚𝑖𝑛𝑠
𝑇𝑟𝑎𝑛𝑠𝑚𝑖𝑠𝑠𝑖𝑜𝑛 𝑟𝑎𝑡𝑒 𝑜𝑓 𝑡ℎ𝑒 𝑙𝑖𝑛𝑘 𝑅 5 𝑐𝑎𝑟𝑠/𝑚𝑖𝑛
➢ Also assume that whenever the first car arrives at the tollbooth it waits at the entrance of the
tollbooth until the other 9 cars arrives and lined up in sequence.
Caravan Analogy Contd…

➢ So finally the time from when the caravan is stored infront of a tollbooth until the caravan is
stored infront of the next tollbooth is the sum of the
𝑑𝑡𝑟𝑎𝑛𝑠 + 𝑑𝑝𝑟𝑜𝑝 = 60 + 2 = 62𝑚𝑖𝑛𝑠
Caravan Analogy

➢ In a highway each of the tollbooths are 100 kms away.

➢ Suppose there are 10 cars travelling together as caravan, follow each other in a fixed order.
➢ Assume that the car travels on the highway at a rate of 1000kms/hours.

𝐷𝑖𝑠𝑡𝑎𝑛𝑐𝑒 𝑏𝑒𝑡𝑤𝑒𝑒𝑛 𝑡ℎ𝑒 𝑡𝑤𝑜 𝑟𝑜𝑢𝑡𝑒𝑟 (𝑝ℎ𝑦𝑖𝑠𝑖𝑐𝑎𝑙 𝐿𝑒𝑛𝑔𝑡ℎ) 𝑑 100 𝐾𝑚𝑠

𝑑𝑝𝑟𝑜𝑝 = = =
𝑃𝑟𝑜𝑝𝑎𝑔𝑎𝑡𝑖𝑜𝑛 𝑠𝑝𝑒𝑒𝑑 𝑜𝑓 𝑡ℎ𝑒 𝑙𝑖𝑛𝑘 𝑠 1000𝑘𝑚𝑠/ℎ𝑜𝑢𝑟
= 6 𝑚𝑖𝑛𝑠
Caravan Analogy Case2 Contd…

➢ Let the tollbooth services the one car at 1 mins secs.

➢ So the transmission delay of the caravan

𝐿𝑒𝑛𝑔𝑡ℎ 𝑜𝑓 𝑝𝑎𝑐𝑘𝑒𝑡 𝐿 10 𝑐𝑎𝑟𝑠

𝑑𝑡𝑟𝑎𝑛𝑠 = = = = 10 𝑚𝑖𝑛𝑠
𝑇𝑟𝑎𝑛𝑠𝑚𝑖𝑠𝑠𝑖𝑜𝑛 𝑟𝑎𝑡𝑒 𝑜𝑓 𝑡ℎ𝑒 𝑙𝑖𝑛𝑘 𝑅 1 𝑐𝑎𝑟𝑠/𝑚𝑖𝑛
➢ So the transmission delay > propagation delay. In this case the first car will reach the next
tollbooth before the last care in the caravan leaves the first tollbooth.
Queuing Delay and Packet Loss
Queuing Delay:
➢ Let a = average rate at which packet arrives at the queue a packets/sec
➢ R = transmission rate (in bits/sec) at which the bits are pushed out of the queue and loaded
to the outbound link of the router.
➢ Assume each of the packet is consists of L bits. So, the total size of traffic in bits La.
𝐿𝑎
𝑇𝑎𝑟𝑓𝑓𝑖𝑐 𝐼𝑛𝑡𝑒𝑛𝑠𝑖𝑡𝑦 = (𝑡ℎ𝑒 𝑑𝑒𝑠𝑖𝑟𝑒𝑑 𝑡𝑟𝑎𝑓𝑓𝑖𝑐 𝑖𝑛𝑡𝑒𝑛𝑠𝑖𝑡𝑦 𝑠ℎ𝑜𝑢𝑙𝑑 𝑛𝑜𝑡 𝑏𝑒 𝑔𝑟𝑒𝑎𝑡𝑒𝑟 𝑡ℎ𝑎𝑛 1)
𝑅
𝐿𝑎
➢ If > 1, 𝑡ℎ𝑒 𝑎𝑟𝑟𝑖𝑣𝑎𝑙 𝑟𝑎𝑡𝑒 𝑖𝑠 𝑔𝑟𝑒𝑎𝑡𝑒𝑟 𝑡ℎ𝑎𝑛 𝑡𝑟𝑎𝑛𝑠𝑚𝑖𝑖𝑠𝑜𝑛 𝑟𝑎𝑡𝑒.
𝑅
𝐿𝑎
➢ If < 1, 𝑡ℎ𝑒 𝑎𝑟𝑟𝑖𝑣𝑎𝑙 𝑟𝑎𝑡𝑒 𝑖𝑠 𝑙𝑒𝑠𝑠𝑒𝑟 𝑡ℎ𝑎𝑛 𝑡𝑟𝑎𝑛𝑠𝑚𝑖𝑖𝑠𝑜𝑛 𝑟𝑎𝑡𝑒.
𝑅
➢ If packets arrive in bursts but periodically, there can be a significant average queuing delay.
For example, suppose N packets arrive simultaneously every (L/R)N seconds. Then the first
packet transmitted has no queuing delay; the second packet transmitted has a queuing delay
of L/R seconds; and more generally, the Nth packet transmitted has a queuing delay of
(N-1)L/R seconds.
Queuing Delay and Packet Loss
Queuing Delay

La/R~𝟎 La/R> 𝟏
Queuing Delay and Packet Loss
Packet Loss:
➢ Queue (buffer) has finite capacity
➢ If the queue is full, then any new packet arriving at the router will be lost or dropped.
➢ Lost packet may be retransmitted
➢ The fraction of lost packet increasing as the traffic intensity increases.
Throughput
➢ The rate (bits/sec) at which bits transferred from sender to receiver.
➢ suppose the rate of the link between server and router is 𝑅𝑠 𝑏𝑖𝑡𝑠/𝑠𝑒𝑐, and the rate of the link
between the router and the client is 𝑅𝑐 𝑏𝑖𝑡𝑠/𝑠𝑒𝑐.
➢ Two cases and occur 𝑅𝑠 < 𝑅𝑐 and 𝑅𝑠 > 𝑅𝑐
Throughput contd..
➢ 𝑅𝑠 < 𝑅𝑐 : the bits pumped by the server will flow right through the router and arrive at the
client at a rate of 𝑅𝑠 bits/sec, giving a throughput of 𝑅𝑠 bps.
➢ 𝑅𝑠 > 𝑅𝑐 : the router will not be able to forward bits as quickly as it receives them from the
server. In this case bits will only leave the router at a rate of 𝑅𝑐 bits/sec, giving a throughput
of 𝑅𝑐 bps.
➢ Because of this condition the backlog of bits at the router waiting for transmission to the
client will grow and grow –which is a most undesirable condition
Throughput= 𝒎𝒊𝒏 𝑹𝒔 , 𝑹𝒄
If there are N no. of links and transmission rates 𝒐𝒇 𝑹𝟏 , … . . 𝑹𝑵 , then the throughput will be
Throughput= 𝒎𝒊𝒏 𝑹𝟏 , 𝑹𝟐 , 𝑹𝟑 … … … 𝑹𝑵
Throughput contd..
➢ Suppose there are 10 downloads from the
server to client and these are the only traffic
in the network.
➢ All server access link have a rate of 𝑅𝑠 , and
all client access links a have a rate of 𝑅𝑐
bps.
➢ The common link has a transmission rate of
R bps.
➢ Suppose 𝑹𝒔 = 2 Mbps, 𝑹𝒄 = 1 Mbps and R
= 5 Mbps. The R will be equally shared
among the 10 links 5Mbps/10 = 500 Kbps.
Throughput= 𝟓𝟎𝟎 𝑲𝒃𝒑𝒔.

Note: Packet switches can be both routers

and link layer switches.