COMPUTER NETWORKS
Dr. Veena S
Department of Computer Applications
COMPUTER NETWORKS
Delay, Loss and Throughput
Dr. Veena S
Department of Computer Applications
COMPUTER NETWORKS
Network Core – Delay or Latency
▪ Performance metrics in networks is delay, packet loss and
throughput
▪ Latency is the time taken to transmit the packet from sending
host to receiving host
▪Total Delay is the sum of all the four components
▪ Total Delay = Processing Delay + Transmission Delay +
Propagation Delay + Queuing Delay
COMPUTER NETWORKS
Network Core – Delay or Latency
As we all know in a network
▪ Processing delay is typically a few microsecs or less (Today’s
processors are very fast)
▪ Queuing delay depends on congestion in the network
▪ Transmission delay depends on link bandwidth and
▪ Propagation delay depends on the distance between the two
nodes
COMPUTER NETWORKS
Network Core – Traffic Intensity (Queuing delay)
Let R=link bandwidth (bps)
L=packet length (bits)
a=average packet arrival rate
Then Traffic Intensity – La/R
La/R ~ 0: average queueing delay small
La/R -> 1: delays become large
La/R > 1: more “work” arriving than can be serviced,
average delay infinite!
Design your system so that the traffic intensity is
no greater than one
COMPUTER NETWORKS
Network Core – Packet Loss
▪ Here queue or buffer has finite capacity
▪ If a packet arrives towards a full queue then dropped (aka lost)
▪ lost packet may be retransmitted by previous node, by source
end system, or not at all - depending on the requirement
COMPUTER NETWORKS
Network Core – Throughput
▪ Throughput: rate (bits/time unit) at which bits received by the
receiver
instantaneous: rate at given point in time
average: rate over longer period of time
▪ Bandwidth: It is the capacity of the link. In other words it is
the width of the frequency band
COMPUTER NETWORKS
Network Core – Throughput
Let Rs – Rate of the link between the server and the router
Rc - Rate of the link between the router and the client
COMPUTER NETWORKS
Network Core – Throughput
If Rs < Rc What is average end-end throughput? (no delay)
Rs bits/sec Rc bits/sec
Rs > Rc What is average end-end throughput? (packets
queues up in buffer)
Rs bits/sec Rc bits/sec
bottleneck link
link on end-end path that constrains end-end throughput – min (Rs, Rc)
COMPUTER NETWORKS
Network Core – Throughput
An Example:
We need to download an MP3 file of size 32 million bits.
Let Rs = 2 Mbps and Rc = 1 Mbps
The total time required to transfer the file is 32 secs. (F / min(Rs, Rc))
For n links - (F / min(R1, R2, …. , Rn))
COMPUTER NETWORKS
Network Core – Throughput Internet Scenario
▪ Normally core has high
transmission rate R
▪ In practice: Rc or Rs is often
bottleneck
▪ If there are 10 simultaneous
downloads, then per-connection
end-end throughput:
min(Rc,Rs,R/10)
COMPUTER NETWORKS
End to End Throughput
An Example:
▪ Let Rs = 2 Mbps and Rc = 1 Mbps and R = 5 Mbps, common link
divides the transmission rate equally among 10 downloads
▪ The end to end throughput for each download is 500 kbps
▪ Note: Throughput depends on the transmission rate of the links
over which the data flows
THANK YOU
Dr. Veena S, Chairperson
Department of Computer Applications
sveena@[Link]
+91 80 26721983 Extn 829