DocumentCode
2380725
Title
Optimized constraint-based scheduling of OSPF graceful restarts for maintenance purposes
Author
Benchaita, Walid ; Ghamri-Doudane, Samir
Author_Institution
Alcatel-Lucent Bell Labs., Nozay, France
fYear
2012
fDate
10-15 June 2012
Firstpage
2801
Lastpage
2805
Abstract
This paper proposes a solution for the automation and optimized orchestration of maintenance operations in IP/MPLS transport networks by capitalizing on the standardized graceful restart mechanisms. The operator is only responsible for setting maintenance targets and constraints, and then assessing progress reports. In this context, the maintenance planning issue is formulated as a Constraint Satisfaction Optimization Problem (CSOP). In order to provide effective solutions to this problem, two different algorithmic approaches are described and evaluated: a glutton heuristic and an evolutionary method. The experimentation results show that the combination of these two methods allows to significantly reduce the convergence time towards an optimized solution.
Keywords
IP networks; evolutionary computation; heuristic programming; maintenance engineering; multiprotocol label switching; routing protocols; scheduling; telecommunication network planning; CSOP; IP-MPLS transport networks; OSPF graceful restart mechanism; OSPF routing protocol; constraint satisfaction optimization problem; evolutionary method; glutton heuristic method; maintenance operations; maintenance planning; optimized constraint-based scheduling; standardized graceful restart mechanisms; Linear programming; Maintenance engineering; Optimization; Planning; Routing protocols; Sociology; Statistics;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications (ICC), 2012 IEEE International Conference on
Conference_Location
Ottawa, ON
ISSN
1550-3607
Print_ISBN
978-1-4577-2052-9
Electronic_ISBN
1550-3607
Type
conf
DOI
10.1109/ICC.2012.6364539
Filename
6364539
Link To Document