Title :
Efficient and reliable link state information dissemination
Author :
Ansari, Nirwan ; Cheng, Gang ; Krishnan, Ram N.
Author_Institution :
Dept. of Electr. & Comput. Eng., New Jersey Inst. of Technol., Newark, NJ, USA
fDate :
5/1/2004 12:00:00 AM
Abstract :
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.
Keywords :
computational complexity; network topology; quality of service; telecommunication links; telecommunication network reliability; telecommunication network routing; trees (mathematics); QoS; computational complexity; distributing link state information; minimum spanning tree; network resource; protection; quality-of-service; reliable link state information dissemination; routing; subnet topology; tree-based reliable topology; Computational complexity; Convergence; Distributed computing; Floods; Network topology; Protection; Protocols; Quality of service; Routing; Scalability; Link state update; QoS; minimum spanning tree; protection; quality-of-service; routing;
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/LCOMM.2004.827446
