A group multicast routing algorithm by using multiple minimum Steiner trees

Computer Communications

Volumn 20, Issue 9, 1997, Pages 750-758

  Jia, Xiaohua ^a   Wang, Lusheng ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Computer network; Computer supported cooperative work; Distributed systems; Group communication; Minimum Steiner tree; Multicast routing

Indexed keywords

ALGORITHMS; COMMUNICATION; COST EFFECTIVENESS; DISTRIBUTED COMPUTER SYSTEMS; OPTIMIZATION; TREES (MATHEMATICS);

GROUP COMMUNICATION;

COMPUTER NETWORKS;

EID: 0031559621     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0140-3664(97)00081-9     Document Type: Article

References (16)

1. M.H. Ammar, S.Y. Cheung, C.M. Scoglio, Routing multipoint connections using virtual paths in an ATM network, in: IEEE INFOCOM'93, IEEE Computer Society, 1993, pp. 98-105.
2. K. Bharath-Kumar, J.M. Jaffe, Routing to multiple destinations in computer networks, IEEE Trans. Commun. COM-31 (1983) 343-351.
3. J. Moy, Multicast routing extensions for OSPF, Communications of the ACM 37 (8) (1994) 61-66.
4. S.E. Deering, D.R. Cheriton, Multicast routing in datagram internetworks and extended LANs, ACM Trans. Comput. Syst. 8 (2) (1990) 85-110.
5. B.M. Waxman, Routing of multipoint connections, IEEE J. Selected Areas Commun. 6 (9) (1988) 1617-1622.
6. F.K. Hwang, D.S. Richards, Steiner tree problems, Networks 22 (1992) 55-89.
7. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.
8. D. Wall, Mechanisms for broadcast and selective broadcast, Ph.D. Thesis, Stanford University, June 1980.
9. L. Wei, D. Estrin, The trade-offs of multicast trees and algorithms, CS Dept, Univ. of South California, Technical Report 93-560. (http:// www.usc.edu/dept/cs/tech.html.).
10. F. Bauer, A. Varma, Distributed algorithms for multicast path setup in data networks, IEEE/ACM Trans. Networking 4 (2) (1996) 181-191.
11. T.P. Ng, Ordered broadcasts for large applications, in: Proc. of the 10th Symp. on Reliable Distributed Systems, IEEE Computer Society, 1991, pp. 188-197.
12. S. Ahn, D.H. Du, A load balancing multicast tree approach for group-based multimedia applications, in: Proc. IEEE 18th Conf. on Local Computer Networks, IEEE Computer Society, Minnesota, September 1993, pp. 327-336.
13. M. Dror, B. Gavish, J. Choquette, Directed Steiner tree problem on a graph: models, relaxations and algorithms, INFOR 28 (3) (1990) 266-281.
14. P. Winter, Steiner problem in networks: a survey, Networks 17 (1987) 129-167.
15. R.T. Wong, A dual ascent approach for Steiner tree problems on a directed graphs, Mathematical Programming 28 (1984) 271-287.
16. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, The MIT Press, 1992.