tailieunhanh - File Routing Protocols and Concepts: Chapter 10

Link-State Routing Process 1. Each router learns about its own links, its own directly connected networks. (Interface is “up”) 2. Each router is responsible for meeting its neighbors on directly connected networks. (OSPF Hello packets) 3. Each router builds a link-state packet (LSP) containing the state of each directly connected link. (neighbor ID, link type, and bandwidth) 4. Each router floods the LSP to all neighbors, who then store all LSPs received in a database. Neighbors then flood the LSPs to their neighbors until all routers in the area have received the LSPs. 5. Each router uses the database to construct a complete map of the topology and computes the best path. | Chapter 10 Link State Routing Protocols quangkien@ For further information This presentation is an overview of what is covered in the curriculum book. For further explanation and details please read the chapter curriculum. Book Routing Protocols and Concepts By Rick Graziani and Allan Johnson ISBN 1-58713-206-0 ISBN-13 978-58713206-3 Topics Link-State Routing Link-State Routing Protocols Introduction to the SPF Algorithm Link-State Routing Process Step 1 Learning About Directly Connected Networks Step 2 Sending Hello Packets to Neighbors Step 3 Building the Linkstate Packet Step 4 Flooding Linkstate Packets to Neighbors step 5 Constructing a Linkstate Database Shortest-Path First SPF Tree Implementing Link-State Routing Protocols Advantages of a Link-State Routing Protocol Requirements of a Link-State Routing Protocol Comparison of Link-State Routing Protocol