Documente Academic
Documente Profesional
Documente Cultură
structure
1-1
B
packets queueing (delay)
free (available) buffers: arriving packets
dropped (loss) if no free buffers
Introduction
1-2
2. queueing
transmission
propagation
B
nodal
processing
queueing
Introduction
1-3
Delay in packet-switched
networks
3. Transmission delay:
R=link bandwidth
(bps)
L=packet length (bits)
time to send bits into
link = L/R
4. Propagation delay:
d = length of physical
link
s = propagation speed in
medium (~2x108 m/sec)
propagation delay = d/s
Note: s and R are very different
quantities!
transmission
propagation
B
nodal
processing
queueing
Introduction
1-4
Caravan analogy
100 km
ten-car
caravan
toll
booth
100 km
toll
booth
cars propagate at
100 km/hr
toll booth takes 12 sec to
service car (transmission
time)
car~bit; caravan ~ packet
Q: How long until caravan
is lined up before 2nd toll
booth?
Introduction
1-5
100 km
toll
booth
toll
booth
1-6
Nodal delay
d nodal d proc d queue d trans d prop
dproc = processing delay
typically a few microsecs or less
1-7
3 probes
3 probes
Introduction
1-9
1-10
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
link
capacity
that
can carry
server,
server
sendswith
bits pipe
fluid
at rate
file of
F bits
(fluid)
into
pipe
Rs bits/sec
to send to client
Rs bits/sec)
Introduction
link that
capacity
pipe
can carry
at rate
Rfluid
c bits/sec
Rc bits/sec)
1-12
Throughput (more)
Rs < Rc What is average end-end throughput?
Rs bits/sec
Rs
Rc bits/sec
Rc bits/sec
bottleneck link
link on end-end path that constrains end-end throughput
Introduction
1-13
Throughput: Internet
scenario
per-connection
end-end
throughput:
min(Rc,Rs,R/10)
in practice: Rc
or Rs is often
bottleneck
Rs
Rs
Rs
R
Rc
Rc
Rc
1-14