Asst I Part B

Download as pdf or txt
Download as pdf or txt
You are on page 1of 3

Asst I Part B:

Instructions :

1. Total questions to be solved: 5


2. You may find the solutions on the internet or from your friends. However, you must write the
answers in your own words.
3. Only handwritten answers will be accepted.
4. Combine Part A and Part B into one single file and upload on Taxila.

Q1:

Consider a router that interconnects three subnets: Subnet 1, Subnet 2, and Subnet 3. Suppose all of
the interfaces in each of these three subnets are required to have the prefix 223.1.17/24. Also
suppose that Subnet 1 is required to support at least 60 interfaces, Subnet 2 is to support at least 90
interfaces, and Subnet 3 is to support at least 12 interfaces. Provide three network addresses (of the
form a.b.c.d/x) that satisfy these constraints.

Q2:

Consider sending a 2400-byte datagram into a link that has an MTU of 700 bytes. Suppose the
original datagram is stamped with the identification number 422. How many fragments are
generated? What are the values in the various fields in the IP datagram(s) generated related to
fragmentation?

Q3:

Consider the network setup in Figure 4.22 (reproduced below). Suppose that the ISP instead assigns
the router the address 24.34.112.235 and that the network address of the home network is
192.168.1/24.

• Assign addresses to all interfaces in the home network.


• Suppose each host has two ongoing TCP connections, all to port 80 at host 128.119.40.86.
Provide the six corresponding entries in the NAT translation table.

Q4:
Consider the following network. With the indicated link costs, use Dijkstra’s shortest-path algorithm
to compute the shortest path from x to all network nodes. Show how the algorithm works by
computing a routing table.

Using Dijkstra’s algorithm, do the following:

a. Compute the shortest path from t to all network nodes.

b. Compute the shortest path from u to all network nodes.

c. Compute the shortest path from v to all network nodes.

d. Compute the shortest path from w to all network nodes.

e. Compute the shortest path from y to all network nodes.

f. Compute the shortest path from z to all network nodes.


Q5:

Consider the network shown below. Suppose AS3 and AS2 are running OSPF for their intra-AS
routing protocol. Suppose AS1 and AS4 are running RIP for their intra-AS routing protocol. Suppose
eBGP and iBGP are used for the inter-AS routing protocol. Initially suppose there is no physical link
between AS2 and AS4.

a. Router 3c learns about prefix x from which routing protocol: OSPF, RIP, eBGP, or iBGP?

b. Router 3a learns about x from which routing protocol?

c. Router 1c learns about x from which routing protocol?

d. Router 1d learns about x from which routing protocol?

You might also like