A new path selection algorithm for MPLS networks based on available bandwidth estimation

Authors:
Tricha Anjali;Caterina Scoglio;Jaudelice C. De Oliveira;Leonardo C. Chen;Ian F. Akyildiz;Jeff A. Smith;George Uhl;Agatino Sciuto
Affiliations:
Broadband and Wireless Networking Laboratory, School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA;Broadband and Wireless Networking Laboratory, School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA;Broadband and Wireless Networking Laboratory, School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA;Broadband and Wireless Networking Laboratory, School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA;Broadband and Wireless Networking Laboratory, School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA;NASA Goddard Space Flight Center, Greenbelt, MD;NASA Goddard Space Flight Center, Greenbelt, MD;NASA Goddard Space Flight Center, Greenbelt, MD
Venue:
QofIS'02/ICQT'02 Proceedings of the 3rd international conference on quality of future internet services and internet charging and QoS technologies 2nd international conference on From QoS provisioning to QoS charging
Year:
2002

Citing 10
Cited 7

A control-theoretic approach to flow control

SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
A framework for robust measurement-based admission control

IEEE/ACM Transactions on Networking (TON)
QoS routing in networks with inaccurate information: theory and algorithms

IEEE/ACM Transactions on Networking (TON)
Optimal policy for label switched path setup in MPLS Networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
NetLets: Measurement-Based Routing for End-to-End Performance over the Internet

ICN '01 Proceedings of the First International Conference on Networking-Part 1
Nettimer: a tool for measuring bottleneck link, bandwidth

USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
Invited Practical connection admission control for ATM networks based on on-line measurements

Computer Communications
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications
Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications

IEEE Journal on Selected Areas in Communications

The stability of paths in a dynamic network

CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
A minimum interference routing algorithm with reduced computational complexity

Computer Networks: The International Journal of Computer and Telecommunications Networking
TRIDENT: an automated approach to traffic engineering in IP/MPLS over ASON/GMPLS networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
A comparative study of the statistical methods suitable for network traffic estimation

ICCOM Proceedings of the 13th WSEAS international conference on Communications
Prediction based link state update

International Journal of Computers and Applications
Reducing the effects of routing inaccuracy by means of prediction and an innovative link-state cost

IEEE Communications Letters
Optimizing routing decisions under inaccurate network state information

QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.