HCASP: A hop-constrained adaptive shortest-path algorithm for routing bandwidth-guaranteed tunnels in MPLS networks


We present an efficient low-cost algorithm for routing of MPLS bandwidth-guaranteed tunnels in general topology networks. The HCASP algorithm tries to achieve two objectives: the first is to limit the length of the chosen path for a certain tunnel so as not to largely exceed the length of the shortest-hop path between the ingress-egress pair; the second… (More)
DOI: 10.1109/ISCC.2004.1358646

3 Figures and Tables


  • Presentations referencing similar topics