EED304 Assignment-2
EED304 Assignment-2
1. A collection of networks and subnetworks is shown in the following figure. All links are Ethernet
links. Lower case addresses are MAC addresses; Upper case are IP addresses. The networks are
in net.subnet notation: N1.1 is subnet 1 of net N1.
Fig: 1
(b) Specify the address in the Ethernet and IP headers of a packet from A to H, as it travels from
R2 to R3 .
2. The following three queues are served by a link in the Round-robin fashion. One packet is served
from each queue in sequence. An empty queue is skipped. A queue overflows if it is not served
fast enough. Calculate the maximum ‘A’ such that no packet from it is lost due to buffer overflow.
Fig: 2
1
3. Internet Protocol provides (mark the correct answer)
5. Use the shortest path (Dijkstra’s) algorithm (this is OSPF in TCP/IP architecture) to find the short-
est path from the source S to all the nodes. All links have length 1.
Fig: 3
7. Two hosts are connected via a link. The maximum window size for TCP used for transmission is
20 kB (20 k of TCP packets). The buffer at the receiver can store 10k of TCP packets. Assume
error-free transmission.
(a) Draw congestion window diagram during slow start. After how many RTT, there is a packet
drop at the receiver?
(b) Compute the average throughput (in TCP packet per RTT) in the congestion window.
(c) There will be packet drop at the receiver due to overflow causing congestion avoidance phase.
Compute the throughput in one congestion avoidance cycle.
(d) If RTT = 20 msec and link speed is 10 Mbps. Now maximum window size also needs to be
≤ number of transmissions in an RTT. Take IP datagram size as 50 bytes. Now, again draw
the congestion window diagram.