Algorithms for delay constrained group multicast routing

International Journal of Communication Systems

Volumn 18, Issue 10, 2005, Pages 905-933

  Tsai, Kun Cheng ^a   Chen, Chyouhwa ^a  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Group multicast routing; Steiner tree

Indexed keywords

CONSTRAINT THEORY; DELAY CONTROL SYSTEMS; MULTICASTING; ROUTERS; TREES (MATHEMATICS);

DELAY CONSTRAINTS; GROUP MULTICAST ROUTING; ROUTING ALGORITHMS; STEINER TREE;

ALGORITHMS;

EID: 28844501939     PISSN: 10745351     EISSN: None     Source Type: Journal    
DOI: 10.1002/dac.736     Document Type: Article

References (33)

1. Lua EK, Crowcroft J, Pias M, Sharma R, Lim S. A survey and comparison of peer-to-peer overlay network schemes. IEEE Communications Survey and Tutorial, March 2004.
2. Cui Y, Li B, Nahrstedt Ostream K. Asynchronous streaming multicast in application-layer overlay networks. IEEE Journal on Selected Areas in Communications (Special Issue on Recent Advances in Service Overlay, Networks) 2004; 22(1):91-106.
3. Hua TK, Do T. ZIGZAG. An efficient peer-to-peer scheme for media streaming. Proceedings of IEEE INFOCOM, San Francisco, March 2003.
4. Garey MR, Johnson DS. Computers and Intractability - A Guide to the Theory of NP-completeness. W.H. Freeman: San Francisco, CA, 1979.
5. Bern M, Plassmann P. The Steiner problems with edge lengths 1 and 2. Information Processing Letters 1989; 32: 171-176.
6. Kou L, Markowsky G, Berman L. A fast algorithm for Steiner trees. Acta Informatica 1981; 15:141-145.
7. Takahashi H, Matsuyama A. An approximate solution for the Steiner problem in graphs. Mathematica Japonica 1980; 24(6):573-577.
8. Shaikh A, Shin KG. Destination-driven routing for low-cost multicast. IEEE Journal on Selected Areas in Communications 1997; 15(3):373-381.
9. Low CP, Wang N. An efficient algorithm for group multicast routing problem with bandwidth reservations. Computer Communications 2000; 23(18):1740-1746.
10. Low CP, Wang N. On finding feasible solutions to group multicast routing problem. IEICE Transactions on Communications 2002; E85-B(1):268-277.
11. Jia X, Wang L. Group multicast routing algorithm by using multiple minimum Steiner trees. Computer Communications 1997; 20:750-758.
12. Low CP, Song X. On finding feasible solutions for the delay constrained group multicast routing problem. IEEE Transactions on Computers 2002; 51(5):581-588.
13. Song X, Low CP. On finding feasible solutions for delay and bandwidth constrained group multicast routing problem. Proceedings of the 9th IEEE International Conference on Telecommunications (ICT 2002), Beijing, China, 2002.
14. Tanioka H, Kinoshita K, Murakami K. Multipoint-to-multipoint routing for multimedia communication service. Proceedings of the IEEE International Conference on Communications, New York, U.S.A., vol. C13-3, 2002.
15. Low CP, Wang N, Ng JM. Dynamic group multicast routing with bandwidth reservations. International Journal of Communication Systems 2002; 15(8):655-682.
16. Casetti C, Lo Cigno R, Mellia M, Munafo M, Zsoka Z. A new class of QoS routing strategies based on network graph reduction. IEEE INFOCOM, New York, U.S.A., June 2002.
17. Karpinski M, Zelikovsky A. New approximation algorithms for the Steiner tree problems. Journal of Combinatorial Optimization 1997; 1(1):47-65.
18. Berman P, Ramaiyer V. Improved approximations for the Steiner tree problem. Journal of Algorithms November 1994; 17(3):381-408.
19. Zelikovsky A. Better approximation bounds for the network and Euclidean Steiner tree problems. Technical Report CS-96-06, University of Virginia, 1996.
20. Zelikovsky A. An 11/6 approximation algorithm for the network Steiner problem. Algorithmica 1993; 9:463-470.
21. Charikar M, Chekuri C, Cheung TY, Dai Z, Goel A, Guha S, Li M. Approximation algorithms for directed Steiner problems. Journal of Algorithms 1999; 33(1):73-91.
22. Roos S. Scheduling for ReMove and other partially connected architectures. Technical Report 1-68340-44(2001)-05. Delft University of Technology, July 2001.
23. Cormen TH, Leiserson CE, Rivest RL. Introduction to Algorithms. MIT Press: Cambridge, MA, 1990.
24. Zhu Q, Parsa M, Garcia-Luna-Aceves JJ. A source-based algorithm for delay-constrained minimum-cost multicasting. Proceedings of IEEE INFOCOM, Boston, March-April 1995; 377-385.
25. Widyonon R. The design and evaluation of routing algorithms for real-time channels. Technical Report ICSI TR-94-024, International Computer Science Institute, University of California at Berkeley, June 1994.
26. Kompella VP, Pasquale JC, Polyzos GC. Multicast routing for multimedia communication. IEEE/ACM Transactions on Networking 1993; 1(3):286-292.
27. Sun Q, Langendoerfer H. An efficient delay-constrained multicast routing algorithm. Journal of High-Speed Networks 1998; 7(1):43-55.
28. Matta I, Guo L. QDMR: an efficient QoS dependent multicast routing algorithm. Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium (RTAS'99), Vancouver, British Columbia, Canada, June 1999; 213-222.
29. Dijkstra EW. A note on two problems in connection with graphs. Numerical Mathematics 1959; 1:269-271.
30. Fredman ML, Tarjan RE. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM 1987; 34:596-615.
31. Tsai K-C, Chen C. Algorithms for delay constrained group multicast routing. Technical Report, Department of Electronic Engineering, NTUST, 2004. Available as: http://cchen1.csie.ntust.edu.tw/students/tsai/DCGM/tsai-tr-2005.doc.
32. Waxman BM. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications 1988; 6(9):1617-1622.
33. Phillips G, Shenker S, Tangmunarunkit H. Scaling of multicast trees: comments on the Chuang-Sirbu scaling law. Proceedings of the ACM SIGCOMM'99, Cambridge, Massachusetts, U.S.A., September 1999; 41-52.