An On-Line Routing Algorithm of Locally Protected Paths with Exact Reservations

L. Jorge and T. Gomes (Portugal)


MPLS, protection, bandwidth sharing, dynamic routing.


Routing locally protected Label Switched Paths (LSPs) in MultiProtocol Label Switching (MPLS) networks, achiev ing efficient shared path protection under distributed con trol and partial information, is a difficult problem. An estimate of the additional protection bandwidth re quired in every link of the protection paths is deduced from an equivalent parameter defined in the context of global protection. A method for minimal allocation of protection bandwidth in the context of local shared protection will also be proposed. On-line routing algorithms solutions should be obtained in a very short time, therefore an improved version of the heuristic in [1] is presented, resulting in an new version of this on-line routing algorithm of locally pro tected paths. The performance of the algorithm in [1] and of the proposed algorithm were evaluated, using minimal alloca tion of protection bandwidth. Experimental results show that the new algorithm has significant advantages regard ing the total bandwidth used, the average number of hops of the active path and the probability of the rejection of new requests.

Important Links:

Go Back