ospf-5----Page:9
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
|
Link State Advertisements Since a network LSA cannot describe a general topology, each router originates a router LSA that represents neighbors as point-to-point links. The choice of which neighbors to include in LSAs is flexible, allowing partial or full topology information to be disseminated. Each router MUST include all fully adjacent neighbors in its router LSA. (Provides suboptimal paths to all nodes.) Each router may include any “synchronized” neighbor in its router LSA, where a neighbor j is considered synchronized if a path to node j can be calculated from the link-state database (implying there exists a path to node j via fully adjacent links). To disseminate partial topology information from which min-hop paths can be computed, each router may include all “Min-Hop Dependent Neighbors” in its LSA (computed using the ANP algorithm as described in the draft). To disseminate full topology information, each router may include all synchronized neighbors in its router LSA. |