A New Path Selection Algorithm for MPLS Networks Based on Available Bandwidth Estimation

A network should deploy QoS-aware path selection algorithms for efficient routing. To this end, measurements of the various characteristics of the network can provide insight into the state and performance of the network. In this paper, we present a new QoS-aware path selection algorithm for flows requiring bandwidth guarantees based on an estimation algorithm for the available bandwidth on the links of the network. The estimation algorithm for the available bandwidth predicts the available bandwidth and also tells the duration for which the estimate is valid with a high degree of confidence. Thus, the path selection algorithm is adaptive and not very computationally intensive.

[1]  Ian F. Akyildiz,et al.  Optimal policy for label switched path setup in MPLS networks , 2002, Comput. Networks.

[2]  Koushik Kar,et al.  Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications , 2000, IEEE Journal on Selected Areas in Communications.

[3]  Mary Baker,et al.  Nettimer: A Tool for Measuring Bottleneck Link Bandwidth , 2001, USITS.

[4]  Simon Crosby,et al.  Practical connection admission control for ATM networks based on on-line measurements , 1998, Comput. Commun..

[5]  David Tse,et al.  A framework for robust measurement-based admission control , 1999, TNET.

[6]  Srinivasan Keshav.  A control-theoretic approach to flow control , 1991, SIGCOMM 1991.

[7]  Azer Bestavros,et al.  A load profiling approach to routing guaranteed bandwidth flows , 1997, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[8]  Ariel Orda,et al.  QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.

[9]  Simon Crosby,et al.  Measurement-based resource allocation for multimedia applications , 1997, Electronic Imaging.

[10]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[11]  Ian F. Akyildiz,et al.  A new preemption policy for DiffServ-aware traffic engineering to minimize rerouting , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[12]  Manish Jain,et al.  Pathload: A Measurement Tool for End-to-End Available Bandwidth , 2002 .

[13]  Nageswara S. V. Rao,et al.  NetLets: Measurement-Based Routing for End-to-End Performance over the Internet , 2001, ICN.

[14]  Ariel Orda,et al.  QoS routing in networks with inaccurate information: theory and algorithms , 1999, TNET.