Distributed multicast routing for delay and delay variation-bounded Steiner tree using simulated annealing

Computer Communications

Volumn 28, Issue 11, 2005, Pages 1356-1370

  Zhang, Kun ^a   Wang, Heng ^a   Liu, Feng Yu ^a  

^a NANJING UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Constrained Steiner tree; Delay and delay variation bounded; Distributed algorithm; Dynamic reorganization; Multicast routing; Quality of Service; Simulated annealing

Indexed keywords

ALGORITHMS; ANNEALING; COMPUTER SIMULATION; MULTICASTING; PROBLEM SOLVING; QUALITY OF SERVICE; ROUTERS; TREES (MATHEMATICS);

CONSTRAINED STEINER TREE; DELAY AND DELAY VARIATION-BOUNDED; DISTRIBUTED ALGORITHMS; DYNAMIC REORGANIZATION; MULTICAST ROUTING; STIMULATED ANNEALING;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 20444436850     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2004.12.003     Document Type: Article

References (25)

1. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-completeness 1979 Freeman New York
2. V.P. Kompella, J.C. Pasquale, and G.C. Polyzos Multicast routing for multimedia communication IEEE/ACM Transactions Networking 1 3 1993 286 292
3. Q. Zhu, M. Parsa, and J.J. Garcia-Luna-Aceves A source-based algorithm for delay-constrained mimimum-cost multicasting in: IEEE INFOCOM'95, Boston, MA 1995 pp. 452-458
4. R. Widyono, The design and evaluation of routing algorithms for real-time channels, Technical Report TR-94-024, University of California at Berkeley, International Computer Science Institute, June 1994.
5. H. Youssef, A. Al-Mulhem, S.M. Sait, and M.A. Tahir QoS-driven multicast tree generation using Tabu search Computer Communications 25 11/12 2002 1140 1149
6. X.H. Jia A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks IEEE/ACM Transactions Networking 6 6 1998 828 837
7. C.P. Low, and Y.J. Lee Distributed multicast routing with end-to-end delay and delay variation constrains Computer Communications 23 9 2000 848 862
8. M.Z. Wang, J.Y. Xie, and J.Y. Zhang Strategy of constructing minimum cost multicast routing tree with delay and delay variation bounds Chinese Journal of Computers 25 5 2002 534 541
9. H.Y. Lee, and C.H. Youn Scalable Multicast Routing Algorithm for Delay-variation Constrained Minimum-cost Tree in: ICC2000 vol. 3 2000 pp. 1343-1347
10. W. Guo, and Y.G. Xi Minimal cost multicast routing problem with end-to-end delay and delay variation constraints Journal of China Institute of Communications 22 6 2001 13 20
11. G.N. Rouskas, and I. Baldine Multicast routing with end-to-end delay and delay variation constraints IEEE Journal on Selected Areas in Communications 15 3 1997 346 356
12. P.R. Sheu, and S.T. Chen A fast and efficient heuristic algorithm for the delay- and delay variation-bounded multicast tree problem Computer Communications 25 8 2002 825 833
13. A.T. Haghighat, K. Faez, M. Dehghan, A. Mowlaei, and Y. Ghahremani GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing Computer Communications 27 2004 111 127
14. Z.Y. Wang, B.X. Shi, and E.D. Zhao Bandwidth-delay-constrainted least-cost multicast routing based on heuristic genetic algorithm Computer Communications 24 2001 685 692
15. E.I. Oyman, and C. Ersoy Multicast routing using simulated annealing in: The Fifth International Conference Advances in Communications and Control, Crete 1995 pp. 419-424
16. J.T. Park, J.H. Do, and C.M. Han Multicasting VP design methodology using simulated annealing in an ATM network Journal of Network System Management 4 2 1996 133 153
17. X.W. Wang, H. Cheng, J.N. Cao, L. W. Zheng, M. Huang, A simulated-annealing-based QoS multicasting algorithm, in: ICCT2003, Beijing, 2003, pp. 469-473.
18. N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, and E. Teller Equation of state calculations by fast computing machines Journal of Chemical Physics 21 6 1953 1087 1092
19. S. Kirkpatrick, C.D. Gelatt Jr., and M.P. Vecchi Optimization by simulated annealing Science 220 4598 1983 671 680
20. Z.F. Jia, P. Varaiya, Heuristic methods for delay constrained least cost routing using k-shortest-paths, in: INFOCOM, Anchorage, 2001.
21. F. Xiang, L. Junzhou, W. Jieyi, and G. Guanqun QoS routing based on genetic algorithm Computer Communications 22 15 1999 1394 1399
22. V. Starck, Implementation of simulated annealing optimization method for APLAC circuit simulator, Master Dissertation, Helsinki University of Technology, Department of Electrical Engineering, October 1996.
23. R.E. Bellman Dynamic programming 1957 Princeton University Princeton, NJ
24. B.M. Waxman Routing of multipoint connections IEEE Journal on Selected Areas in Communications 6 9 1988 1617 1622
25. H.F. Salama, Multicast routing for real-time communication on high-speed networks, PhD Dissertation, North Carolina State University, Department of Electrical and Computer Engineering, 1996.