Paper Info
Title
Distributed and Centralized Path Computation Algorithms: Implementation in NS2 and Performance Comparison
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 on-line and off-line path computation algorithms and, more specifically, introduces and compares the performance of three novel off-line path computation algorithms which aim at improving the performance of their standard version by means of some heuristics. All these algorithms have been developed in NS2 as an extension of OSPF-TE\ns and integrated with RSVP-TE\ns.
Year
DOI
Venue
2008
10.1109/ICC.2008.12
ICC
Keywords
Field
DocType
distributed algorithms,graph theory,multiprotocol label switching,quality of service,telecommunication network topology,telecommunication traffic,MPLS network,NS2 simulator,QoS constraint,centralized path computation algorithm,constrained shortest path first algorithm,constrained-based path computation,distributed path computation algorithm,network resilience,network topology,packet forwarding,traffic engineering
Multiprotocol Label Switching,Computer science,Computer network,Algorithm,Quality of service,Network topology,Heuristics,Distributed algorithm,Traffic engineering,Packet forwarding,Computation,Distributed computing
Conference
ISSN
Citations 
PageRank 
1550-3607
0
0.34
References 
Authors
3
4
Name
Order
Citations
PageRank
Davide Adami110319.32
C. Callegari29814.23
Giordano, S.3729.11
Michele Pagano419831.51