COMPUTER COMMUNICATION

NETWORKS

Dr. Pramod M S
Department of Electronics and Communication
Engineering
COMPUTER COMMUNICATION NETWORKS

Performance Parameters

Dr. Pramod M S
Department of Electronics and Communication Engineering
COMPUTER COMMUNICATION NETWORKS
Performance parameters
End to End Delay
❑ It is the total delay occurring in a packet transmission
from a source host to the destination host
❑ The end-to-end delay is computed in terms of the
following delays incurred along the path
⮚ Packetization delay, Transmission delay,
Propagation delay, Processing delay and Queuing
delay
User R1 R3 User
A B
Propagation
User A delay
Packetization
delay
Transmission delay Processing delay + Queuing delay
Packet of length L bits
COMPUTER COMMUNICATION NETWORKS
Performance parameters
Definitions
Packetization delay: Depends on the end-user application and
processing speed

Transmission delay: Depends on the packet size (L bits) and link rate (R
bits/sec)

Propagation delay: Depends on the length of the link (d meters) and

propagation speed of the physical medium (s meters/sec)
transmission
A propagation

B
nodal
processing queueing
COMPUTER COMMUNICATION NETWORKS
Performance parameters
Definitions (contd.)

Processing delay: Depends on processor in the router/link layer switch

Queuing delay: Depends on transmission rate of the router, no. of waiting

packets and arrival rate of packets

transmission
A propagation

B
nodal
processing queueing
COMPUTER COMMUNICATION NETWORKS
Performance parameters
Mathematical expressions for delays
● Transmission delay

● Propagation delay

● Queuing delay

○ L is packet size in bits and R is link rate

○ d is link length in meters and s is propagation speed
of the physical media
○ is average queue length and λ is mean packet
arrival rate
COMPUTER COMMUNICATION NETWORKS
Performance parameters
Packet loss
● Each switching device has finite buffer to store packets
before processing and forwarding them one-by-one
● So a queue builds up based on link rates of the arriving
links and departing links
● Arriving packets are lost when buffer is full
● Lost packet may be retransmitted by previous node, by
source (end-user), or not at all
buffer
(waiting area) packet being transmitted
A

B
packet arriving to
full buffer is lost
COMPUTER COMMUNICATION NETWORKS
Performance parameters

Throughput
❑ Packet transmission rate (bits/sec) between a pair of
sender-receiver
❑ Instantaneous: transmission rate at given point in time
❑ Average: transmission rate over longer period of time

server,
server withbits
sends link that can carry
pipe link that can carry
pipe
file of into
(fluid) F bits
pipe capacity
fluid at rate capacity
fluid at rate
to send to client Rs bits/sec
R bits/sec) Rc bits/sec
Rc bits/sec)
s
COMPUTER COMMUNICATION NETWORKS
Performance parameters

❖Rs < Rc the bits pumped by the server will “flow” right through the
router and arrive at the client at a rate of Rs bps, giving a
throughput of Rs bps.

Rs bits/sec Rc bits/sec

❖ Rs > Rc The router will not be able to forward bits as quickly as it

receives them. In this case, bits will only leave the router at rate Rc ,
giving an end-to-end throughput of Rc .

Rs bits/sec Rc bits/sec
COMPUTER COMMUNICATION NETWORKS
Performance parameters

Throughput (contd.)
● Note also that if bits continue to arrive at the router at rate Rs , and
continue to leave the router at RC , the backlog of bits at the router
waiting for transmission to the client will grow and eventually
packet loss will occur

● Thus, for this simple two-link network, the throughput is min{RC ,

Rs}, that is, it is the transmission rate of the bottleneck link

Rs bits/sec Rc bits/sec
COMPUTER COMMUNICATION NETWORKS
Performance parameters
Throughput (contd.)

Consider 10 clients
downloading from 10
servers

Assume bottleneck
link is shared equally
among different
packet flows

Per-connection end-
end throughput:
min(Rc,Rs,R/10)
COMPUTER COMMUNICATION NETWORKS
Performance of packet switched networks

● R: link bandwidth (bps)

● L: packet length (bits)
● a: average packet arrival rate
(packets/s)

● La/R ~ 0: avg. queueing delay small

● La/R -> 1: avg. queueing delay large
● La/R > 1: more “work” arriving than can be
serviced, average delay infinite!
(Traffic Intensity = La/R )
THANK YOU

Dr. Pramod M S
Department of Electronics and Communication
Engineering
pramodms@pes.edu