A New Path Computation Algorithm and Its Implementation in NS2
Davide Adami, Christian Callegari, Stefano Giordano, Michele Pagano · 2007
Originally conceived as a fast forwarding technique, MPLS provides support for traffic engineering and network survivability. Constrained-based path computation is a key building block for traffic engineering in MPLS networks, since it allows to select a path that satisfies assigned QoS requirements. In this paper, we introduce a novel path computation procedure which aims at improving the performance of the well-known Wang-Crowcroft algorithm by means of some heuristics. Moreover, the two algorithms have been developed in NS2 as an extension of OSPF-TE s and integrated with RSVP-TE s. Finally, the paper shows how the developed software module can be used to satisfy a set of LSP allocation requests with multiple QoS constraints.