ospf-5----Page:22
1  2  3  4  5  6  7  8  9  10  11  12  13  14  15  16  17  18  19  20  21  22  23 

Conclusions from Simulations
While the number of edges (and rate of new edges) increases quadratically with the number of nodes, the number of adjacencies (and rate of new adjacencies) with the CDS algorithm increases only linearly.
Also, the number of DRs and BDRs increases only slightly as the number of nodes increases from 100 to 300.
Therefore, the CDS approach is more scalable than the approach of forming adjacencies with all neighbors.
Main conclusion: The DR/BDR approach of OSPF generalizes naturally and efficiently to MANETs. Therefore, it is not necessary to replace this approach with something completely different.

PPT Version