A fast topology update algorithm for restoration under multiple failures in broadband networks

E Ayanoglu

doi:10.1109/icc.1993.397499

A fast topology update algorithm for restoration under multiple failures in broadband networks

E Ayanoglu

https://doi.org/10.1109/icc.1993.397499

Copy DOI

Publication Date: May 23, 1993

Citations: 6

#Multiple Failures #Times For Failure + Show 8 more

Abstract
Full-Text
Similar Papers

Abstract

A topology update algorithm, a particular flooding algorithm, against multiple link, path, or node failures is proposed. The algorithm accomplishes restoration faster than a similar algorithm proposed by up to three times for the first failure, up to five times for the second failure, and up to 2n + 1 times for the nth failure. The algorithm simplifies the protocol used in restoration, and reduces the number of messages passed in the network. >

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 call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

Disclaimer: 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.