Algorithms for delay-constrained low-cost multicast tree construction

Computer Communications

Volumn 21, Issue 18, 1998, Pages 1693-1706

  Sriram, R ^a   Manimaran, G ^a,b,c   Siva Ram Murthy, C ^a,d,e,f,g,h  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

^b BHARATHIDASAN UNIVERSITY   (India)

^c INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^d NATIONAL INSTITUTE OF TECHNOLOGY   (India)

^e INDIAN INSTITUTE OF TECHNOLOGY   (India)

^f INDIAN INSTITUTE OF SCIENCE   (India)

^g FRAUNHOFER INSTITUTE FOR APPLIED INFORMATION TECHNOLOGY FIT   (Germany)

^h UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Constrained optimization; Group communication; Interactive multimedia; Multicast routing; Qos; Steiner trees

Indexed keywords

ALGORITHMS; BANDWIDTH; INTERACTIVE COMPUTER SYSTEMS; MULTIMEDIA SYSTEMS; OPTIMIZATION; TREES (MATHEMATICS);

CONSTRAINED OPTIMIZATION; GROUP COMMUNICATION; STEINER TREES;

MULTICASTING;

EID: 0032292943     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0140-3664(98)00208-4     Document Type: Article

References (23)

1. T. Ballardie, P. Francis, J. Growcroft, Core-based trees (CBT): an architecture for scalable inter-domain multicast routing, Comp. Commun. Rev. 23 (4) (1993) 85-95.
2. F. Bauer, A. Varma, Distributed algorithms for multicast path setup in data networks, IEEE/ACM Trans. Networking 4 (2) (1996) 181-191.
3. F. Bauer, A. Varma, ARIES: a rearrangeable inexpensive edge-based on-line Steiner algorithm, IEEE JSAC 15 (3) (1997) 382-397.
4. C.H. Chow, On multicast path finding algorithms, in: Proc. IEEE INFOCOMM '91, IEEE Communications Society, Bal Harbour, FL, 1991, pp. 1274-1283.
5. S. Deering, D. Estrin, D. Farinacci, V. Jacobson, C.-G. Liu, L. Wie, The PIM architecture for wide-area multicast routing, IEEE/ACM Trans. Networking 4 (2) (1996) 153-162.
6. S.E. Deering, D.R. Cheriton, Multicast routing in datagram internet-works and extended LANS, ACM Trans. Comp. Syst. 8 (2) (1990) 85-110.
7. C. Diot, W. Dabbous, J. Crowcroft, Multipoint communications: a survey of protocols, functions and mechanisms, IEEE JSAC 15 (3) (1997) 277-290.
8. Y.K. Dalal, R.M. Metcalfe, Reverse path forwarding of broadcast packets, Commun. ACM 21 (12) (1978) 1040-1048.
9. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, CA, 1979.
10. H.F. Salama, D.S. Reeves, Y. Viniotis, A distributed algorithm for delay-constrained unicast routing, in: Proc. IEEE INFOCOMM, IEEE Communications Society, Kobe, Japan, 1997.
11. F. Hwang, D. Richards, Steiner tree problems, Networks 22 (1992) 55-89.
12. B.K. Kadaba, J.M. Jaffe, Routing to multiple destinations in computer networks, IEEE Trans. Commun. 31 (3) (1993) 343-351.
13. V. Kompella, J.C. Pasquale, G.C. Polyzos, Multicast routing for multimedia communication, IEEE/ACM Trans. Networking 1 (3) (1993) 286-292.
14. V. Kompella, J.C. Pasquale, G.C. Polyzos, Two distributed algorithms for the constrained Steiner tree problem, in: Proc. Comp. Comm. Networks, San Diego, CA, June 1993, pp. 343-349.
15. L. Kou, G. Markowsky, L. Berman, A fast algorithm for Steiner trees, Acta Informatica 15 (1981) 141-1451.
16. F. Nicholas, Maxemchuck, Video distribution on multicast networks, IEEE JSAC 15 (3) (1997) 357-372.
17. R. Sriram, G. Manimaran, C.S.R. Murthy, Preferred link based delay-constrained least cost routing in wide area networks, Comp. Commun. 21 (1998) 1655-1669.
18. P. Winter, Steiner problem in networks: a survey, Networks 17 (2) (1987) 129-167.
19. S. Ramanathan, Multicast tree generation in networks with asymmetric links, IEEE/ACM Trans. Networking 4 (4) (1996) 558-568.
20. G.N. Rouskas, I. Baldine, Multicast routing with end-to-end delay and delay variation constraints, IEEE JSAC 15 (3) (1997) 346-355.
21. A. Shaikh, K. Shin, Destination driven routing for low-cost multicast, IEEE JSAC 15 (3) (1997) 373-381.
22. H. Takashami, A. Matsuyama, An approximate solution for the Steiner problem in graphs, Int. J. Math. Educ. Sci. Technol. 141 (1) (1983) 15-23.
23. B.M. Waxman, Routing of multipoint connections, IEEE JSAC 6 (1988) 1617-1622.