Virtual Flow Deviation: Dynamic Routing of Bandwidth Guaranteed Connections

Authors:
Antonio Capone;Luigi Fratta;Fabio Martignon
Affiliations:
-;-;-
Venue:
QoS-IP 2003 Proceedings of the Second International Workshop on Quality of Service in Multiservice IP Networks
Year:
2003

Citing 2
Cited 2

Data networks

Data networks
Throughput-competitive on-line routing

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science

Autonomic interference avoidance with extended shortest path algorithm

ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing
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

Finding a path in the network for a new incoming connection able to guarantee some quality parameters such as bandwidth and delay is the task of QoS routing techniques developed for new IP networks based on label forwarding.In this paper we focus on the routing of bandwidth guaranteed flows in a dynamic scenario where new connection requests arrive at the network edge nodes. When more than a path satisfying the bandwidth demand exists, the selection of the path is done in order to minimize the blocking probability of future requests.We propose a new routing algorithm named Virtual Flow Deviation (VFD) which exploits the information of the ingress and egress nodes of the network and the traffic statistics. We show that this new algorithm allows to reduce remarkably the blocking probability in most scenarios with respect to previously proposed schemes.