24 July 2001 Heuristics for dimensioning large-scale MPLS networks
Author Affiliations +
Proceedings Volume 4523, Internet Performance and Control of Network Systems II; (2001) https://doi.org/10.1117/12.434322
Event: ITCom 2001: International Symposium on the Convergence of IT and Communications, 2001, Denver, CO, United States
Abstract
MultiProtocol Label Switching (MPLS) technology allows the support of multiple services with different Quality of Service (QoS) requirements in classical IP networks. In an MPLS domain, packet flows belonging to a particular class are classified in the same Forward Equivalence Class (FEC). Based on different FECs, each service can be set up in the network through logical networks. Each logical network is a set of Label Switched Paths (LSPs), one for each service traffic trunk. The network-dimensioning problem is formulated as the determination of routes for all LSPs to achieve the least cost physical network. To solve this problem some widely known heuristics are used and two enhancement algorithms are proposed that allow for significant gains when compared with the basic heuristics. The heuristics tested include a genetic algorithm, a greedy based heuristic and a lagrangean relaxation based heuristic. The enhancements are proposed for application to the greedy based heuristic and to the lagrangean heuristic. The results show that the enhanced lagrangean heuristic is the best overall technique for the case studies presented. This technique yields significant average gains when compared to the basic lagrangean heuristic.
© (2001) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Carlos Miguel Borges, Amaro Fernandes de Sousa, Rui Jorge Morais Tomaz Valadas, "Heuristics for dimensioning large-scale MPLS networks", Proc. SPIE 4523, Internet Performance and Control of Network Systems II, (24 July 2001); doi: 10.1117/12.434322; https://doi.org/10.1117/12.434322
PROCEEDINGS
8 PAGES


SHARE
Back to Top