Professional Documents
Culture Documents
Lecture 06 CN Bcs 5e Smi Fall 2022
Lecture 06 CN Bcs 5e Smi Fall 2022
Lecture 06 CN Bcs 5e Smi Fall 2022
CS3001
(Section BCS-5E)
Lecture 06
Instructor: Dr. Syed Mohammad Irteza
Assistant Professor, Department of Computer Science
08 September, 2022
Previous Lecture
• Network core and edge
• Access networks and physical media
• Packet switching store and forward
• Packet switching queuing delay and loss
• Routing and forwarding things that go on in the routers
• TDM numerical example
• Internet structure: hierarchy of ISPs, peering and IXPs
• Four source of delay (nodal delay calculation, prop. delay)
2
Propagation Delay
• In a communications system, propagation delay refers to the
time lag between the departure of a signal from the source and
the arrival of the signal at the destination.
• This can range from a few nanoseconds or microseconds in
local area networks (LANs) up to about 0.25 seconds in
geostationary-satellite communications systems
3
Caravan analogy
100 km 100 km
ten-car toll toll
caravan booth booth
Introduction 1-4
Caravan analogy (more)
100 km 100 km
ten-car toll toll
caravan booth booth
Introduction 1-5
Traffic Intensity
average queueing
• R: link bandwidth (bps)
delay
• L: packet length (bits)
• a: average packet arrival
rate
traffic intensity
= La/R
La/R ~ 0: avg. queueing delay small La/R ~ 0
* Check out the Java applet for an interactive animation on queuing and loss La/R -> 1
Introduction 1-6
Packet loss
• queue (aka buffer) preceding link in buffer has finite
capacity
• packet arriving to full queue dropped (aka lost)
• lost packet may be retransmitted by previous node, by
source end system, or not at all
buffer
(waiting area) packet being transmitted
A
B
packet arriving to
full buffer is lost
Introductionon queuing and loss
* Check out the Java applet for an interactive animation 1-7
Throughput
• throughput: rate (bits/time unit) at which bits
transferred between sender/receiver
• instantaneous: rate at given point in time
• average: rate over longer period of time
Introduction 1-8
Throughput (more)
• Rs < Rc What is average end-end throughput?
Rs bits/sec Rc bits/sec
Rs bits/sec Rc bits/sec
bottleneck link
link on end-end path that constrains end-end throughput
Introduction 1-9
Throughput: Internet scenario
• per-connection end-end
throughput: min(Rc,Rs,R/10) Rs
• in practice: Rc or Rs is often Rs Rs
bottleneck
R
Rc Rc
Rc
Introduction 1-12
“Real” Internet delays and routes
• traceroute program: provides delay
measurement from source to router along end-
end Internet path towards destination. For all i:
• sends three packets that will reach router i on path
towards destination
• router i will return packets to sender
• sender times interval between transmission and reply.
3 probes 3 probes
3 probes
Introduction 1-13