DocumentCode :
975225
Title :
Event driven topology broadcast without sequence numbers
Author :
Spinelli, John M. ; Gallager, Robert G.
Author_Institution :
Lab. for Inf. & Decision Syst., MIT, Cambridge, MA, USA
Volume :
37
Issue :
5
fYear :
1989
fDate :
5/1/1989 12:00:00 AM
Firstpage :
468
Lastpage :
474
Abstract :
An algorithm is presented that allows each node in a computer network to maintain a correct view of the network topology despite link and node failures. Reliability is achieved without transmitting any information other than the operational status of links. Messages are only sent in response to topological changes: periodic retransmission is not required
Keywords :
broadcasting; computer networks; data communication systems; network topology; reliability; computer network; event driven topology broadcast; fault tolerance; link failures; node failures; operational status; reliability; shortest path topology algorithm; time complexity; topological changes; ARPANET; Algorithm design and analysis; Broadcasting; Computer network reliability; Data communication; Delay effects; Maintenance; Network topology; Routing; Telecommunication network reliability;
fLanguage :
English
Journal_Title :
Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
0090-6778
Type :
jour
DOI :
10.1109/26.24597
Filename :
24597
Link To Document :
بازگشت