ospf-5----Page:6
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
|
Family of Interoperable CDS Algorithms A larger CDS may be preferred in some cases, e.g., to provide flooding along shorter paths (smaller stretch factor). The following optional algorithms are interoperable because the CDS computed by each algorithm contains the CDS computed by the Essential CDS algorithm. Maximum Priority Neighbor (MPN) CDS algorithm: Requires that the path computed from the neighbor with largest (RtrPri, RID) to each other neighbor in the Essential algorithm, be at most k hops. All Neighbor Pairs (ANP) CDS algorithm: Requires that the path computed from each neighbor to each other neighbor be at most k hops. Simulation results show that the MPN and ANP algorithms (with k = 2 and 3) reduce stretch factor at the cost of a larger CDS. |