Routing Dynamically

1. BAIT2164 COMPUTER NETWORKS
1
Tutorial 7 (Part 2)
1. Describe the link-state routing process.
2. When does Link State Packet (LSP) flooding happen?
3. What information is included in Link State Packet (LSP)?
4. Based on the network topology below, answer the following questions:
a. Build the link-state database for R1.

2. BAIT2164 COMPUTER NETWORKS
2
b. Using SPF algorithm, calculate the shortest paths to reach each
individual network. Complete the resulting SPF tree of R1:
Destination Shortest Path Cost
192.168.2.0
192.168.3.0
192.168.4.0
192.168.5.0
192.168.6.0
172.1.4.0
172.1.3.0
172.1.5.0
172.1.6.0
172.1.7.0