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.
All Science Journal Classification (ASJC) codes
- Modeling and Simulation
- Computer Science Applications
- Electrical and Electronic Engineering
- Link state update
- Minimum spanning tree
- Quality-of-service (QoS) routing