0% found this document useful (0 votes)
8 views2 pages

EED304 Assignment-2

The document is an assignment for a Communication Networks course, focusing on various networking concepts such as routing tables, packet addressing, queue management, and TCP behavior. It includes questions on routing, congestion effects, and the application of Dijkstra's algorithm for finding shortest paths. Additionally, it covers TCP window size, throughput calculations, and the impact of transmission errors.

Uploaded by

sai teja g
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
8 views2 pages

EED304 Assignment-2

The document is an assignment for a Communication Networks course, focusing on various networking concepts such as routing tables, packet addressing, queue management, and TCP behavior. It includes questions on routing, congestion effects, and the application of Dijkstra's algorithm for finding shortest paths. Additionally, it covers TCP window size, throughput calculations, and the impact of transmission errors.

Uploaded by

sai teja g
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Department of Electrical Engineering

Communication Networks (EED304) - Monsoon 2022


Instructor: Prof. Vinod Sharma
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

(a) Write the Routing table of R2 .


Address Next hop Port
N1.1 R1 r22

(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)

(a) Reliable datagram delivery between internet hosts.


(b) Unreliable datagram delivery between internet hosts.
(c) Reliable datagram delivery between hosts on same LAN or link.
(d) Unreliable datagram delivery between hosts on same LAN or link.

4. The effect of congestion on TCP is to (select one or more)

(a) Increase the loss rate seen by applications


(b) Limit the number of connections that can be set up at one time.
(c) Reduce the throughput of the connections.

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

6. What is the effect of transmission error on the throughput of the TCP?

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.

You might also like