Note: b denotes bits and B denotes Bytes (1 Byte = 8 bits). When a node transmits a packet, it doesnt need to wait for the last packet to be propagated along the link. As soon as one packet is transmitted into the link, the node can start transmitting the next packet

Part1:

For each of the following cases, calculate the latency (from first bit sent to the last bit received). Assume the bandwidth of each link is 2Gbps, and the size of each packet is 120 Kb (Kilo-bits). Note that little b is bit and big B is Byte.Assume the length of each link is 40meters, and propagation speed is 2*10⁶meters per second. There is no queuing or processing delay.

a. If the source sends a message containing 1packet and there are 2routers on the path.

b. If the source sends a message containing 1packet and there are 4routers on the path.

c. If the source sends a message containing 10packets and there are 2routers on the path.

d. If the source sends a message containing 10packets and there are 4routers on the path.

Part2:

Now keep all assumptions from part1 except processing delay. Assume each router begins retransmitting a packet after it has finished receiving the packet and processed it for 4microseconds (d-proc = 4s). Processing delay is zero at source. Solve the problem for each of the 4 above-mentioned cases with this assumption.