Abstract

In multiprotocol label switching (MPLS) networks, data packets are forwarded through label-switched paths (LSPs) which are set up using a label distribution protocol. Since any label distribution protocol makes use of information obtained from the layer 3 routing protocol, and the routing protocol may not be loop-free, there is a possibility of an LSP forming a loop. This article focuses on MPLS loop prevention by which LSPs are prevented from forming loops. Especially, two loop prevention algorithms that have been proposed to the IETF are simulated to investigate the number of control messages required for setting up or reconfiguring LSPs over an actual routing protocol.

Full Text

Published Version

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

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.