Broadcasting Topology and Routing Information in Computer Networks
Abstract
An efficient algorithm is presented which 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. The algorithm is extended to allow nodes to maintain congestion measurements used in making routing decisions.
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 1986
- Accession Number
- ADA166663
Entities
People
- John M. Spinelli
Organizations
- Massachusetts Institute of Technology