Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows

Authors:
Su-Wei Tan;Sze-Wei Lee;Benoit Vaillaint
Affiliations:
Center for High Speed Broadband Network, Multimedia University, Cyberjaya, Malaysia;Center for High Speed Broadband Network, Multimedia University, Cyberjaya, Malaysia;Center for High Speed Broadband Network, Multimedia University, Cyberjaya, Malaysia
Venue:
Computer Communications
Year:
2002

Citing 15
Cited 1

Approximation schemes for the restricted shortest path problem

Mathematics of Operations Research
On-line load balancing with applications to machine scheduling and virtual circuit routing

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
QoS routing in networks with uncertain parameters

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

IEEE/ACM Transactions on Networking (TON)
Competitive routing of virtual circuits with unknown duration

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A randomized algorithm for finding a path subject to multiple QoS requirements

Computer Networks: The International Journal of Computer and Telecommunications Networking
Evaluating the Overheads of Source-Directed Quality-of-Service Routing

ICNP '98 Proceedings of the Sixth International Conference on Network Protocols
Routing and Admission Control in General Topology Networks

Routing and Admission Control in General Topology Networks
Throughput-competitive on-line routing

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
How to model an internetwork

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Network path caching

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

IEEE Journal on Selected Areas in Communications
Competitive routing of virtual circuits in ATM networks

IEEE Journal on Selected Areas in Communications
An overview of quality of service routing for next-generation high-speed networks: problems and solutions

IEEE Network: The Magazine of Global Internetworking
Intradomain QoS routing in IP networks: a feasibility and cost/benefit analysis

IEEE Network: The Magazine of Global Internetworking

A new hybrid traffic engineering routing algorithm for bandwidth guaranteed traffic

AINTEC'06 Proceedings of the Second Asian international conference on Technologies for Advanced Heterogeneous Networks

Quantified Score

Hi-index	0.24

Visualization

Abstract

This paper presents a new non-greedy routing and admission control algorithm for the dynamic routing of bandwidth-guaranteed tunnels. The algorithm operates online that is handling requests which arrive one at a time without prior knowledge of the traffic pattern. It combines the key concepts in the minimum interference routing algorithm and the algorithms developed based on theoretic competitive analysis to provide efficient routing. Using extensive simulations, we show that our algorithm out-performs several previously proposed algorithms on several metrics such as the acceptance rate of the tunnel set-up requests, fairness and the capability of providing priorities to tunnel requests of certain source-destination pairs in the network.