Abstract
An algorithm is presented for the reliable broadcast of routing information throughout a network. The algorithm anticipates the possibility of long-delayed packets, line and node outages, network partitions, hardware failures, and a history of arbitrarily corrupted databases throughout the network. After any failure, the algorithm stabilizes in reasonable time without human intervention, once any malfunctioning equipment is repaired or disconnected. The algorithm also has the advantages of not requiring frequent control traffic in the absence of topological changes, not imposing artificial delays on nodes upon startup, and not relying on timers in ordinary operation. The algorithm is compared to a functionally similar algorithm in the ARPANET.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
