The branch and bound algorithm for a backup virtual path assignment in survivable atm networks
International Journal of Applied Mathematics and Computer Science, Tome 12 (2002) no. 2, pp. 257-267
Cet article a éte moissonné depuis la source Library of Science
Issues of network survivability are important, since users of computer networks should be provided with some guarantees of data delivery. A large amount of data may be lost in high-speed Asynchronous Transfer Mode (ATM) due to a network failure and cause significant economic loses. This paper addresses problems of network survivability. The characteristics of virtual paths and their influence on network restoration are examined. A new problem of Backup Virtual Path Routing is presented for the local-destination rerouting strategy. The function of the flow lost due to a failure of a single link is chosen as the performance index. The problem of finding the optimal virtual path assignment is NP-complete. Therefore we develop an exact algorithm based on the branch and bound approach. Moreover, two heuristic algorithms are proposed. Numerical results are presented.
Keywords:
survivable networks, ATM, branch and bound algorithm
Mots-clés : automatyka
Mots-clés : automatyka
@article{IJAMCS_2002_12_2_a11,
author = {Walkowiak, K.},
title = {The branch and bound algorithm for a backup virtual path assignment in survivable atm networks},
journal = {International Journal of Applied Mathematics and Computer Science},
pages = {257--267},
year = {2002},
volume = {12},
number = {2},
language = {en},
url = {http://geodesic.mathdoc.fr/item/IJAMCS_2002_12_2_a11/}
}
TY - JOUR AU - Walkowiak, K. TI - The branch and bound algorithm for a backup virtual path assignment in survivable atm networks JO - International Journal of Applied Mathematics and Computer Science PY - 2002 SP - 257 EP - 267 VL - 12 IS - 2 UR - http://geodesic.mathdoc.fr/item/IJAMCS_2002_12_2_a11/ LA - en ID - IJAMCS_2002_12_2_a11 ER -
%0 Journal Article %A Walkowiak, K. %T The branch and bound algorithm for a backup virtual path assignment in survivable atm networks %J International Journal of Applied Mathematics and Computer Science %D 2002 %P 257-267 %V 12 %N 2 %U http://geodesic.mathdoc.fr/item/IJAMCS_2002_12_2_a11/ %G en %F IJAMCS_2002_12_2_a11
Walkowiak, K. The branch and bound algorithm for a backup virtual path assignment in survivable atm networks. International Journal of Applied Mathematics and Computer Science, Tome 12 (2002) no. 2, pp. 257-267. http://geodesic.mathdoc.fr/item/IJAMCS_2002_12_2_a11/