View the step-by-step solution to:

# Problem 1 Consider a datagram network using 8-bit host addresses. Suppose a router uses longest prex match and has the following forwarding table:...

Problem 1 Consider a datagram network using 8-bit host addresses. Suppose a router uses longest preﬁx match and has the following forwarding table: Prefix Match Interface 00 0 0100 1 0110 2 01 3 1000 4 100 5 10 6 11 7 For each of the eight interfaces, give the associated range of destination host addresses, and the number of addresses in the range. Problem 2 An ISP is assigned the address block 10 . 1 . 8 . 0 / 22 by IANA. The ISP needs to subdivide the address block among four diﬀerent customers, requiring 2 9 , 2 8 , 2 7 , and 2 6 hosts respectively. Using CIDR notation show how to subdivide the address block assigned to the provider into four diﬀerent address blocks assigned to each of the four customers so that each customer can support the required number of hosts and none of the address blocks overlap. Problem 3 Find the shortest path from A to every other vertex in the graph in Figure 1 using Dijkstra’s Algorithm. 1 A B C D G H F E 3 2 1 5 2 1 4 6 3 1 Figure 1 Problem 4 Suppose a network has eight nodes A,B,C,D,E,F,G,H. B is a neighbor of A. The cost of the link from A to B is 3. A now receives a distance vector from neighbor B with the following information: 1
Dest Shortest Path A 3 B 0 C 14 D 6 E 7 F 6 G 12 H 8 Show how A would update it’s own distance vector. 2

We need you to clarify your question for our tutors! Clarification request:... View the full answer

### Why Join Course Hero?

Course Hero has all the homework and study help you need to succeed! We’ve got course-specific notes, study guides, and practice tests along with expert tutors.

### -

Educational Resources
• ### -

Study Documents

Find the best study resources around, tagged to your specific courses. Share your own to gain free Course Hero access.

Browse Documents