\$30.00

Category:

## Description

Problem 1

Consider the following network of routers where the numbers above each link indicate link costs:

Considering calculations from the perspective of node z:

1. Show a table showing iterations of the Link State routing algorithm.

1. Show a resulting routing table (next hop for each destination).

Step N y x v t w u

1.

Destination Next Hop

2.

Problem 2

Consider a network of 4 routers running Distance Vector routing algorithm where the numbers above each link indicate link costs.

1. Suppose, the link between C and D fails. Show that split horizon will not eliminate the count-to-in nity problem.

1. How can split horizon with poisoned reverse help in eliminating the count-to-in nity problem when the link between C and D fails?

Problem 3

Consider a simple network with one WiFi router and 3 hosts on the Figure. Host A and B are connected to the router over wireless interface, host C is connected using wired Ethernet interface.

1. Assign IP (IPv4) addresses, network masks, and next hop gateways (where applicable) addresses so that all of them can communicate with each other.

Consider that have been given 131.179.196.32/27 address block and all assignments should be made from that block. Your assignment must use the most conservative IP address allocation. That is, assign IP addresses to hosts using as many network bits (the largest possible subnet mask) as possible.

1. Fill the content of the Host C’s routing table, without using the default route.

eth0

wlan1

wlan1

eth0

Node A

Node C Routing Table

Node B

Problem 4

1. Suppose Host A receives an IP datagram. How does the network layer in Host A know it should pass the segment (that is, the payload of the datagram) to TCP rather than to UDP or to something else?

1. How does Skype work between two hosts which are behind two di erent NAT boxes?

1. Compare IPv4 and IPv6 headers. What are the common elds?