Efficient and reliable link state information dissemination

Distributing link state information may place a heavy burden on the network resource. In this letter, based on the tree-based reliable topology (TRT), we propose a simple but efficient and reliable scheme for disseminating link state information. We show that the computational complexity of computing the subnet topology over which link state information is distributed is the same as that of computing the minimum spanning tree.

[1]  John A. Copeland,et al.  Hamiltonian cycle protection: a novel approach to mesh WDM optical network protection , 2001, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).

[2]  M. N. S. Swamy,et al.  Graphs: Theory and Algorithms: Thulasiraman/Graphs , 1992 .

[3]  M. N. Shanmukha Swamy,et al.  Graphs: Theory and Algorithms , 1992 .

[4]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[5]  John Moy.  Flooding Over a Subset Topology , 2001 .

[6]  Mike Shand,et al.  Flooding optimizations in link-state routing protocols , 2001 .

[7]  Richard G. Ogier,et al.  A reliable, efficient topology broadcast protocol for dynamic networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).