Scribd
Upload
75 views

IT3104-Computer Networks Assignment - 2

This document contains 7 questions for an assignment on computer networks. It provides details on topics like leaky bucket algorithms, distance-vector and link-state routing protocols, applying distance vector routing to sample networks, creating shortest path trees, tracking routing table updates in distance vector routing, and analyzing UDP packet headers. Students are instructed to submit their assignment responses in a hard-bound register by November 11, 2022.

Uploaded by

kartikay
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
75 views

IT3104-Computer Networks Assignment - 2

This document contains 7 questions for an assignment on computer networks. It provides details on topics like leaky bucket algorithms, distance-vector and link-state routing protocols, applying distance vector routing to sample networks, creating shortest path trees, tracking routing table updates in distance vector routing, and analyzing UDP packet headers. Students are instructed to submit their assignment responses in a hard-bound register by November 11, 2022.

Uploaded by

kartikay
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

School of Information Technology

IT3104- Computer Networks


Assignment-2
Due Date of Submission: November 11, 2022

Note: The assignment needs to submit in a hard-bound register. No loose paper will be accepted.

1. A leaky bucket is at the host network interface. The data rate on the network is 2MByte/s
and the data rate on the link from the host to the bucket is 2.5Mbyte/s.
a) Suppose the host has 250 Mbytes to send onto the network and it sends the data in
a burst. What should be the minimum capacity of the bucket (in bytes) in order that
no data is lost?
Suppose the capacity of the bucket is 100M bytes. What is the longest burst time from the
host in order that no data is lost?

2. Compare and contrast distance-vector and link-state routing protocols. Also, discuss the
problems and solution strategies associated with each.
3. Consider following network and apply Distance Vector Routing Algorithm to find
Optimum routing table for router A.

4. The network shown in the below figure use link state routing protocol. Create a shortest
path tree for the Node A.
5. See the below two networks and are using Distance Vector Routing Protocol
Network 1 has three nodes A, B and C.
Network 2 has three nodes D, E and F.

D
B

A
C

E F
Network 1

Network 2

Assume advertisements are sent every 5 time steps, all links are fully functional and there
is no delay in the links. Nodes take zero time to process advertisements once they receive
them. The HELLO protocol runs in the background every time step in a way that any
changes in link connectivity are reflected in the next DV advertisement. We count time
steps from t=0 time steps.
A. Please fill in the following table:
Events Number of time steps taken
A's routing table has an entry for B
A's routing table has an entry for C
D's routing table has an entry for E
F's routing table has an entry for D
B. Now assume the link B-C fails at t = 51 and link D-E fails at t = 71 time steps.
Please fill in this table:

Events Number of time steps taken

B's advertisements reflect that C is unreachable


A's routing table reflects C is unreachable
D's routing table reflects a new route for E
6. Compute the value of UDP checksum for given pseudoheader plus UDP datagram. The
values of T and E are (01010100)2 and (01000101)2 respectively.
153.18.8.105
171.2.14.10
All 0’s 17 15
1087 13
15 All 0’s
T E E T
T E T Pad with 0’s
7. The following is a dump of a UDP header in hexadecimal format.
0045DF000058FE20
a. What is the source port number?
b. What is the destination port number?
c. What is the total length of the user datagram?
d. What is the length of the data?
e. Is the packet directed from a client to a server or vice versa?
f. What is the client process?

You might also like