Proactive rearrangement in delay constrained dynamic membership multicast

Computer Communications

Volumn 31, Issue 10, 2008, Pages 2566-2580

  Yong, Keen Mun ^a   Poo, Gee Swee ^a   Cheng, Tee Hiang ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Delay constraint; Dynamic membership multicast; Member disruptions; Multicast tree cost; Rearrangement

Indexed keywords

COMPUTER SIMULATION; COST EFFECTIVENESS; MULTICASTING; QUALITY OF SERVICE; RESOURCE ALLOCATION; TREES (MATHEMATICS);

DELAY CONSTRAINT; DYNAMIC MEMBERSHIP MULTICAST; MEMBER DISRUPTIONS; MULTICAST TREE COSTS; RESOURCE UTILIZATION;

HEURISTIC ALGORITHMS;

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

References (17)

1. Karp R.M. Reducibility among combinatorial problems. In: Miller R.E., and Thatcher J.W. (Eds). Complexity of Computer Computations (1972), Plenum Press, New York 85-103
2. Kou L., Markowsky G., and Berman L. A fast algorithm for Steiner Trees. Acta Informatica 15 (1981) 141-145
3. Ramanathan S. Multicast tree generation in networks with asymmetric links. IEEE/ACM Transactions on Networking 4 4 (1996) 558-568
4. Shaikh A. Destination-driven routing for low-cost multicast. IEEE Journal on Selected Areas in Communication 15 3 (1997) 373-381
5. V.P. Kompella, J.C. Pasquale, Polyzos, Two distributed algorithm for multicasting multimedia information, in: Proc. Computer Comm. and Networks, 1993, pp.343-349.
6. Lee Y.-J., and Atiquzzaman M. Least cost heuristic for the delay-constrained capacitated minimum spanning tree problem. Computer Communications 28 11 (2005) 1371-1379
7. Li S., Melhem R., and Znati T. An efficient algorithm for constructing delay bounded minimum cost multicast trees. Journal of parallel and distributed computing 64 12 (2004) 399-1413
8. Raghavan S., Manimaran G., and Siva Ram Murthy C. A rearrangeable algorithm for the construction of delay-constrained dynamic multicast trees. IEEE/ACM Transactions on Networking 7 4 (1999) 514-529
9. Bauer F., and Verma A. ARIES: a rearrangeable inexpensive edge-based on-line Steiner algorithm. IEEE Journal on Selected Areas in Communication 15 (1997) 382-397
10. Li X., Li X., and Li X. A dynamic algorithm used in multicast routing. IEEE CACWD 2004 2 (2004) 1-6
11. Chakrabarti A., and Manimaran G. A case for scalable multicast tree migration. IEEE GLOBECOM 2001 3 (2001) 2026-2030
12. H.F. Salama, D.S. Reeves, Y. Viniotis, A distributed algorithm for delay-constrained unicast routing, in: Proc. IEEE INFOCOM, 1997, pp.84-91.
13. S. Hong, H. Lee, B.H. Park, An efficient multicast routing algorithm for delay-sensitive applications with dynamic membership, in: Proc. IEEE INFOCOM, 1998, pp.1433-1440.
14. Sriram R., Manimaran G., and Siva Ram Murthy C. Preferred link based delay-constrained least cost routing in wide area networks. Computer Communications 21 18 (1998) 1655-1669
15. Rammohan N., and Siva Ram Murthy C. On-line multicast routing with QoS constraints in WDM networks with no wavelength converters. Computer Networks 50 18 (2006) 3666-3685
16. Waxman B. Routing of multipoint connections. IEEE Journal on Selected Areas in Communication 6 (1988) 1617-1622
17. Dijkstra E.W. A note on two problems in connection with graphs. Numerische Mathematik 1 (1959) 267-271