1st International ICST Conference on Simulation Tools and Techniques for Communications, Networks and Systems

Research Article

Path computation algorithms in NS2

Download302 downloads
  • @INPROCEEDINGS{10.4108/ICST.SIMUTOOLS2008.2930,
        author={Davide  Adami and Christian  Callegari and Stefano  Giordano and Michele  Pagano},
        title={Path computation algorithms in NS2},
        proceedings={1st International ICST Conference on Simulation Tools and Techniques for Communications, Networks and Systems},
        publisher={ICST},
        proceedings_a={SIMUTOOLS},
        year={2010},
        month={5},
        keywords={MPLS-TE NS2 Path computation Wang-Crowcroft CSPF DBCTE EBMP MPBF},
        doi={10.4108/ICST.SIMUTOOLS2008.2930}
    }
    
  • Davide Adami
    Christian Callegari
    Stefano Giordano
    Michele Pagano
    Year: 2010
    Path computation algorithms in NS2
    SIMUTOOLS
    ICST
    DOI: 10.4108/ICST.SIMUTOOLS2008.2930
Davide Adami1,*, Christian Callegari2,*, Stefano Giordano2,*, Michele Pagano2,*
  • 1: CNIT Research Unit, Dept. of Information Engineering, University of Pisa (ITALY).
  • 2: Dept. of Information Engineering, University of Pisa (ITALY).
*Contact email: davide.adami@cnit.it, christian.callegari@iet.unipi.it, s.giordano@iet.unipi.it, m.pagano@iet.unipi.it

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.