Throughput
• throughput: rate (bits/sec) at which bits transferred between
sender/receiver (Actual link capacity)
• Note: we can’t send data at different throughput rates, as every
link has its own throughput, we will choose the minimum one
• L/min[Rs,Rc] or L/min[…..
server,
server sends linkthat
with pipe capacity
can carry link that
pipe capacity
can carry
filebits
of F bits fluid at rate
Rs bits/sec Rfluid at rate
c bits/sec
to send
(fluid) to pipe
into client R bits/sec) Rc bits/sec)
s
Review Question
R19. Suppose Host A wants to send a large file to Host B. The path from Host A
to Host B has three links, of rates R1 = 500 kbps, R2 = 2 Mbps, and R3 = 1 Mbps.
a. Assuming no other traffic in the network, what is the throughput for the file
transfer?
b. Suppose the file is 4 million bytes. Dividing the file size by the throughput,
roughly how long will it take to transfer the file to Host B?
c. Repeat (a) and (b), but now with R2 reduced to 100 kbps.
a) 500 kbps
b) 4xx8/500x 64 seconds
c) 100kbps; 320 seconds
Review Question
R22. List five tasks that a layer can perform. Is it possible that one (or
more) of these tasks could be performed by two (or more) layers?
Five generic tasks are error control, flow control, segmentation and
reassembly, multiplexing, and connection setup. Yes, these tasks can be
duplicated at different layers. For example, error control is often provided
at more than one layer.
Review Question
R12. What advantage does a circuit-switched
network have over a packet-switched
network? What advantages does TDM have
over FDM in a circuit-switched network?
• A circuit-switched network can guarantee a certain amount of end-to-
end bandwidth for the duration of a call. Most packet-switched
networks today cannot make any end-to-end guarantees for bandwidth.
• FDM requires sophisticated analog hardware to shift signal into
appropriate frequency bands.
Problem
P10. Consider a packet of length L which begins at end system A and travels over three links
to a destination end system. These three links are connected by two packet switches. Let di,
si, and Ri denote the length, propagation speed, and the transmission rate of link i, for i = 1, 2,
3. The packet switch delays each packet by dproc . Assuming no queuing delays, in terms of
di, si, Ri, (i = 1,2,3), and L, what is the total end-to-end delay for the packet?
Note : 2 switches , so 2 processing delay ; 3 links, so 3 propagation delays
dend-end = dtrans + dprop + dproc
dend-end = L/R1 + L/R2 + L/R3 + d1/s1 + d2/s2 + d3/s3+ dproc+ dproc
Problem
Suppose now the packet is 1,500 bytes, the propagation speed on all three
links is 2.5 x m/s, the transmission rates of all three links are 2 Mbps, the
packet switch processing delay is 3 msec, the length of the first link is
5,000 km, the length of the second link is 4,000 km, and the length of the
last link is 1,000 km. For these values, what is the end-to-end delay?
(L/R1 + L/R2 +L/R3) = 3(L/R)
dend-end = 3(L/R) + d1/s1 + d2/s2 + d3/s3+ dproc+ dproc = 64msec
