Affordable Access

A New Bandwidth Guaranteed Routing Approach for Online Calculation of LSPs for MPLS Traffic Engineering

IFIP Lecture Notes in Computer Science (LNCS)
Publication Date
  • Computer Science


This paper presents a fast on-line routing algorithm for dynamic routing of label switched paths (LSPs) with bandwidth guarantees in MPLS networks, which handles requests that arrive one at a time without exploiting a priori knowledge of the traffic characteristics. Trying to avoid exacting calculations for each on-demand LSP request (e.g., maximum flow computation), we introduce a new link weight function for path selection. The link weights are calculated as a function of residual network and link capacity, hence we call the approach (RNLC) routing algorithm.Full Text at Springer, may require registration or fee

There are no comments yet on this publication. Be the first to share your thoughts.