Applying tabu search to backup path planning for multicast networks

Computers and Operations Research

Volumn 32, Issue 11, 2005, Pages 2875-2889

  Yang, Chyi Bao ^a   Wen, Ue Pyng ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Multicast communication; Network survivability; QoS; Tabu search

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTER NETWORKS; COST EFFECTIVENESS; DATABASE SYSTEMS; FAILURE ANALYSIS; INFORMATION ANALYSIS; QUALITY OF SERVICE; REAL TIME SYSTEMS;

MULTICAST COMMUNICATION; NETWORK SURVIVABILITY; SELF-HEALING NETWORKS; TABU SEARCH;

MULTICASTING;

EID: 13844266925     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2004.04.018     Document Type: Article

References (30)

1. Lee H, Chung J, Chung SJ. A state-dependent preplanned ATM VP restoration scheme. IEEE INFOCOM'98, 1998. p. 1766-71.
2. Anderson J., Doshi B.T., Dravida S., Harsha-Vardhana P. Fast restoration of ATM networks. IEEE Journal on Selected Areas in Communications. 12(1):1994;128-138
3. Xiong Y., Mason L. Restoration strategies and spare capacity requirements in self-healing ATM networks. IEEE/ACM Transactions on Networking. 7:1999;98-110
4. Kawamura R., Sato K., Tokizawa I. Self-healing ATM networks based on virtual path concept. IEEE Journal on Selected Areas in Communications. 12(1):1994;120-127
5. Wang Y.F., Chang R.F. Self-healing on ATM multicast tree. IEIEC Transactions on Communications. E81-B(8):1998;1590-1598
6. Wang Y.F., Huang J.F. Preplanned restoration and optimal capacity placement on ATM multicast tree. IEIEC Transactions on Communications. E83-B(10):2000;281-292
7. Wu C.S., Lee S.W. Backup VP planning for multicast connections in ATM networks. Computer Communications. 22(10):1999;898-906
8. Kwong S., Lam D.W.F., Tang K.S., Man K.F. Optimization of spare capacity in self-healing multicast ATM network using genetic algorithm. IEEE Transactions on Industrial Electronics. 47(6):2000;1334-1343
9. Feng G., Siew C.K. Restorable VP-layout design in ATM networks for efficient support for multicast traffic. IEE Proceedings - Communications. 148(5):2001;290-300
10. Rouskas G.N., Baldine I. Multicast routing with end-to-end delay and delay variation constraints. IEEE Journal on Selected Areas in Communications. 15(3):1997;346-356
11. Sheu P.R., Chen S.T. A fast and efficient heuristic algorithm for the delay- and delay variation-bounded multicast tree problem. Computer Communications. 25(8):2002;825-833
12. Bettahar H., Bouabdallah A. A new approach for delay-constrained routing. Computer Communications. 25(18):2002;1751-1764
13. Zhu Q, Parsa M, Garcia-Luna-Aceves J. A source-based algorithm for delay-constrained minimum-cost multicasting. Proceedings of IEEE INFOCOM'95, 1995. p. 377-85.
14. Asaka T., Miyoshi T., Tanaka Y. Label algorithm for delay-constrained dynamic multicast routing. IEICE Transactions on Communications. E84-B(1):2001;55-62
15. Wang Z., Shi B., Zhao E. Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm. Computer Communications. 24(7-8):2001;685-692
16. Wang Z., Crowcroft J. Quality-of-Service routing for supporting multimedia applications. IEEE Journal on Selected Areas in Communications. 14(7):1996;1228-1234
17. Novak R., Rugelj J., Kandus G. A note on distributed multicast routing in point-to-point networks. Computers and Operations Research. 28(12):2001;1149-1164
18. Tawfig A., Taieb Z. Delay-constrained, low-cost multicast routing in multimedia networks. Journal of Parallel and Distributed Computing. 61:2001;1307-1336
19. Roohy L.E., Abdou E., Hopkins J., Wagner M.A. A procedure for designing a low connected survivable fiber network. IEEE Journal on Selected Areas in Communications. 4(7):1986;1112-1117
20. Glover F. Future paths for integer programming and linkage to artificial intelligence. Computers and Operations Research. 13:1986;533-549
21. Glover F. Tabu search - part I. ORSA Journal on Computing. 1:1989;190-206
22. Glover F. Tabu search - part II. ORSA Journal on Computing. 2:1990;4-32
23. Liaw C.F. An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. Computers and Operations Research. 30(14):2003;2081-2095
24. Anderson C.A., Fraughnaugh K., Parker M., Ryan J. Path assignment for call routing. an application of tabu search Annals of Operations Research. 41:1993;301-312
25. Laguna M., Glover F. Bandwidth packing. a tabu search approach Management Science. 39(4):1993;492-500
26. Youssef H., Al-Mulhem A., Sait S.M., Tahir M.A. QoS-driven multicast tree generation using tabu search. Computer Communications. 25(11-12):2002;1140-1149
27. Wu CS, Lee SW, Hou YT. Backup VP preplanning strategies for survivable multicast ATM networks. Proceedings of IEEE ICC'97, 1997. p. 267-71.
28. Shyur C.C., Lu T.C., Wen U.P. Applying tabu search to spare capacity planning for network restoration. Computers and Operations Research. 26(12):1999;1175-1194
29. Waxman B.M. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications. 6(9):1988;128-138
30. Kompella V.P., Pasquale J.C., Polyzos G.C. Multicast routing for multimedia communication. IEEE/ACM Transactions on Networking. 1(3):1993;286-292