Loading [MathJax]/extensions/TeX/extpfeil.js
Improved agent based explicit path computation algorithm for MPLS-TE | IEEE Conference Publication | IEEE Xplore

Improved agent based explicit path computation algorithm for MPLS-TE


Abstract:

A well-known traffic engineering technology in MPLS network is the constraint-based routed label distribution protocol (CR-LDP). In case of conflict, CR-LDP coordinates L...Show More

Abstract:

A well-known traffic engineering technology in MPLS network is the constraint-based routed label distribution protocol (CR-LDP). In case of conflict, CR-LDP coordinates LSPs that causes conflict, which would result in other conflicts and may cause chain of rerouting. Multi agent based path rerouting method avoids this chain of rerouting. In case of conflict MPRM co-ordinates all LSPs not only the conflicting LSP. We propose an algorithm which finds out the most optimized path without having any conflict. Our algorithm will also find out the most efficient alternate path through which the traffic can reroute in case of failure of link.
Date of Conference: 12-14 December 2008
Date Added to IEEE Xplore: 02 February 2009
Print ISBN:978-1-4244-3805-1

ISSN Information:

Conference Location: New Delhi, India

References

References is not available for this document.