Dynamic Routing of Bandwidth Guaranteed Connections in MPLS Networks

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 optical networks based on label forwarding techniques such as Generalized Multiprotocol Label Switching (GMPLS). 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 one path satisfying the bandwidth demand exists, the selection of the path aims at minimizing 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. This new algorithm, in most scenarios, achieves remarkable reduction in the blocking probability with respect to previously proposed schemes.