RSS
Twitter
Facebook
Assume
three packets corresponding to one message traverse same path
Minimum Delay = 3τ
+ 5(T/3) (single path assumed)
* Additional queueing delays possible at each link
* Packet pipelining enables message to arrive
sooner
In general the delay incurred using a datagram switch involving L hops
and consisting of k packets is L + LP+(k-1)P
0 comments