An oriented diffusion algorithm for routing paths in MPLS network

Abstract

We propose a new algorithm for guaranteed bandwidth routing. The problem is motivated by the needs of service providers to set-up bandwidth guaranteed paths quickly in their backbone or transport networks. For that, one way to provide a routing bandwidth is to use MPLS (multiprotocol label switching). An important context in which these problems arise is that of a dynamic label switched path (LSP) set up in MPLS between ingress and egress nodes. The routes of the LSPs can be specified explicitly. In addition, with the establishment of backup LSPs, a network will be able to cope with failure in nodes and links.