Scribd
Upload
42 views6 pages

1 4network

The document discusses different types of delays that can occur in packet-switched networks including processing delay, queuing delay, transmission delay, and propagation delay. It then discusses factors that influence queuing delay and packet loss such as traffic intensity. The document also covers end-to-end delay calculation and factors that influence throughput in computer networks.

Uploaded by

نجلاء محمد
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
42 views6 pages

1 4network

The document discusses different types of delays that can occur in packet-switched networks including processing delay, queuing delay, transmission delay, and propagation delay. It then discusses factors that influence queuing delay and packet loss such as traffic intensity. The document also covers end-to-end delay calculation and factors that influence throughput in computer networks.

Uploaded by

نجلاء محمد
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

ABEER

1.4: Delay, loss, and throughput in packet-switched Networks

Types of delays:

- Nodal processing delay


- Queuing delay
- Transmission delay
- Propagation delay

1- Processing delay
 It is the time required to examine the packet's header and
determine where to direct the packet.
 Also, the time needed to check for bit-level errors in the
packet that occurred in transmitting the packet's bits from
the upstream node to the first router .
 After nodal processing the router directs the packet to the
queue that precedes the link to the next router. ]

2- Queuing delay
The waits to be transmitted onto the link .
 The length of the queuing delay of a specific packet depend
on the number of earlier arriving packets that are queued and
waiting for transmission acress the link

3-Transmission delay
Another name for it is store and forward delay " I discuss it in
section 1.3 "

Which is : the amount of time required for the router to push out
the packet .
ABEER
Note : It is a function of the packet's length and the transmission
rate of the link .

Denote :

- L : the length of the packets ( bits )


- R : the transmission rate of the link from the first to the second
router ( bits/sec )

Example : for 10Mbps Ethernet link , the rate is R=100Mbps.

The transmission delay = L/R , which is the amount of time


required to push all of the packets' bits into the link .

4-Propagation delay
It is the time required to propagate from the beginning of the
first link to the second router.

OR : it is the time it takes a bit to propagate from one router to


the next .
Note : It is function of the distance between two routers .

Note : the bit propagates at the propagation speed of the link


and it depends on the physical medium of the link ( fiber optic ,
twisted pair , ….. )

Propagation delay = d/s


( d : distance between the two routers , s : propagation speed of
the link )
ABEER

1.4.2 : Queuing delay and packet loss


For example if 10 packets arrive at an empty queue at the same time ,
the first packet transmitted will suffer no queuing delay , while the last
packet transmitted will suffer a relatively large queuing delay ( while it
wants for the other nine packets to be transmitted ) .

When is the queuing delay large and when is it insignificant ?

 It depends on : the rate at which traffic arrives at the queue ,


the transmission rate of the link and the nature of the arriving
traffic ( traffic arrives periodically \ in bursts ) .
 Denote :
- a : average rate at which packet arrive at the queue ( packets/sec
)
- R : transmission rate ( bit/sec )
- All the packets consist of L bits
-
ABEER
 The average rate at which bits arrive at queue = L a ( bits\sec )
 The traffic intensity = L a \ R , which is the ratio

-> 1: delays become large


1: more “work” arriving than can be serviced, average delay
infinite!

 When you have 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 second ; the nth packet transmitted has a queuing delay
of ( n-1 ) L\R seconds .

- If the traffic intensity is close to zero , then the packet arrivals


are few , so the average queuing delay will be close to zero
- When the traffic intensity is close to 1 , there will be intervals of
time when the arrival rate exceeds the transmission capacity
- When the traffic intensity approaches 1 , the average queue
length gets larger and larger .
- The fact that as the traffic intensity approaches 1 , the average
queuing delay increases rapidly .
ABEER
1.4.3: End-to-End delay

Suppose there are N-1 routers between the source host and the
destination host , the network is uncongested , the processing delay at
each router and at the source host is D proc and the propagation on
each link is D prop :

D end-end = N ( D proc + D trans + D prop ) , where D trans = L \ R and


L is the size of a packet

 Traceroute : is a simple program that can run in any internet


host .
( when the user specifies a destination hostname , the
program in the source host send multiple , special packets
toward the destination )

Other delays :

- Dial-up modems introduce a modulation \ encoding delay


- An end system wanting to transmit a packet into a shared
medium ( Wi-Fi )
- Media packetization delay ( which is present in Voice-over-IP
applications )

1.4.4 Throughput in computer networks

It is the rate (bits/time unit) at which bits transferred between


sender/receiver

 Instantaneous throughput : the rate in bits\sec at wich the


second host is receiving a file .
 Average throughput = F\T bits\sec , where F : ize of file in bits
, T: time to transfer .
 Denote :
- Rs : rate of the link between the server and the router
- Rc : rate of the link between the router and the client
- Bits = fluid ( only think about it like this )
- Communication links = pipes
ABEER

# if Rs < Rc , then the bits pumped by the server will " flow " right
through the router and arrive at the client at a rate of Rs bps

# if Rc<Rs , then the router will not be able to forward bits as


quickly as it receives them , so bits will leave the router at rate
Rc

 bottleneck link : link on end-end path that constrains end-end


throughput

You might also like