DocumentCode
614814
Title
A heuristic for the Network Migration Scheduling Problem
Author
Balma, Ali ; Hadj-Alouane, Nejib ; Hadj-Alouane, Atidel B.
Author_Institution
Nat. Eng. Sch., Tunis Univ. of Tunis El Manar, Rommana, Tunisia
fYear
2013
fDate
28-30 April 2013
Firstpage
1
Lastpage
6
Abstract
In the present paper, we consider the Network Migration Scheduling Problem which consists of finding an order of migration of the nodes from an outdated network to a new one. It has been shown that this problem is very difficult to solve exactly even for small instances. We give a simple heuristic based on sorting the demands according to the decreasing order of their size. Through computational experiments, we show that this heuristic is computationally rapid and provides near optimal solutions.
Keywords
computer networks; scheduling; sorting; computational experiments; network migration scheduling problem; outdated network; sorting; Bridge circuits; Bridges; Educational institutions; Electronic mail; Heuristic algorithms; Sorting;
fLanguage
English
Publisher
ieee
Conference_Titel
Modeling, Simulation and Applied Optimization (ICMSAO), 2013 5th International Conference on
Conference_Location
Hammamet
Print_ISBN
978-1-4673-5812-5
Type
conf
DOI
10.1109/ICMSAO.2013.6552639
Filename
6552639
Link To Document