Question: consider a source and a destination connected by n links...
Consider a source and a destination connected by N links (i.e., N-1 packet switches). Each link has capacity R bps, and propagation delay d seconds. Ignore processing delays and assume that initially all the buffers are empty.
Now suppose the links (in the order from source to destination) have capacities R1 < R2 < ... < RN and propagation delays d1 < d2 < ... < dN (with arbitrary values).
a) Give formula for the end-to-end delay of sending P packets of Length L bits each.
b) Repeat a), but assume R1 > R2 > ... > RN (still arbitrary values for d1, d2, ..., dN)