Dynamic Routing of Bandwidth Guaranteed Connections in MPLS Networks

Abstract

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 tra#c statistics. This new algorithm, in most scenarios, achieves remarkable reduction in the blocking probability with respect to previously proposed schemes