Path computation algorithms in NS2

  • Authors:

  • Davide Adami;Stefano Giordano;Christian Callegari;Michele Pagano

  • Affiliations:

  • University of Pisa, Italy;University of Pisa, Italy;University of Pisa, Italy;University of Pisa, Italy

  • Venue:
  • Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Originally designed to improve the efficiency of packets forwarding, MPLS provides support for Traffic Engineering and network resilience. Constrained-based path computation is a key building block for Traffic Engineering in MPLS networks, since it allows to set-up LSPs along paths that satisfy QoS constraints. This paper deals with two distinct categories of path computation algorithms: on-line path computation algorithms adn on-line multi path algorithms. All these algorithms have been implemented in NS2 as an extension of OSPF-TE\ns and integrated with RSVP-TE\ns.