Dynamic online QoS routing schemes: Performance and bounds

Authors:
Antonio Capone;Luigi Fratta;Fabio Martignon
Affiliations:
Department of Electronics and Information (DEI), Politecnico di Milano, Piazza Leonardo da Vinci 32, Room 330, Third Floor, 20133 Milan, Italy;Department of Electronics and Information (DEI), Politecnico di Milano, Piazza Leonardo da Vinci 32, Room 330, Third Floor, 20133 Milan, Italy;Department of Management and Information Technology, University of Bergamo, 24044 Dalmine, Italy
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2006

Citing 12
Cited 1

Data networks

Data networks
An inversion algorithm to compute blocking probabilities in loss networks with state-dependent rates

IEEE/ACM Transactions on Networking (TON)
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm

SIAM Journal on Computing
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms

Journal of the ACM (JACM)
Throughput-competitive on-line routing

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Profile-based routing and traffic engineering

Computer Communications
Generalized multiprotocol label switching: an overview of signaling enhancements and recovery techniques

IEEE Communications Magazine
An architectural framework for support of quality of service in packet networks

IEEE Communications Magazine
QoS online routing and MPLS multilevel protection: a survey

IEEE Communications Magazine
Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications

IEEE Journal on Selected Areas in Communications
Equivalent capacity and its application to bandwidth allocation in high-speed 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

A novel approach for the performance bound of QoS-aware data networks under greedy CAC policy

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is available in the literature. In this paper, after a short review of the major dynamic QoS routing schemes, we analyze and compare their performance referring to several networks scenarios. In order to set an absolute evaluation of the performance quality we have obtained the ideal performance of any routing scheme using a novel and flexible mathematical programming model that assumes the knowledge of arrival times and duration of the connections offered to the network. This model is based on an extension of the maximum multi-commodity flow problem. Being an integer linear programming model, its complexity is quite high and its evaluation is constrained to networks of limited size. To overcome the computational complexity we have defined an approximate model, based on the multi-class Erlang formula and the minimum multi-commodity cut problem, that provides an upper bound to the routing scheme performance. The performance presented in the paper, evaluated by measuring the connection rejection probability, shows that the schemes considered reach, in several scenarios, the ideal performance, showing that no much gain is left for alternate new schemes.