A proactive approach to reconstructing overlay multicast trees

Proceedings - IEEE INFOCOM

Volumn 4, Issue , 2004, Pages 2743-2753

  Yang, Mengkun ^a   Fei, Zongming ^a  

^a UNIVERSITY OF KENTUCKY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

IP MULTICASTS; MULTICAST TREES; NODE DEPARTURES; PROACTIVE APPROACH;

BANDWIDTH; COMPUTER SIMULATION; CONSTRAINT THEORY; FAILURE ANALYSIS; NETWORK PROTOCOLS; PROBABILITY; ROUTERS;

MULTICASTING;

EID: 8344267514     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Y. Chu, S. Rao, and H. Zhang, "A case for end system multicast," in Proceedings of ACM Sigmetrics, June 2000, Santa Clara, CA.
2. P. Francis, "Yoid: Extending the Internet multicast architecture," http://www.icir.org/yoid/docs/yoidArch.ps.
3. Y. Chawathe, S. McCanne, and E. A. Brewer, "An architecture for Internet content distribution as an infrastructure service," Feb. 2000, available at http://www.cs.berkeley.edu/ yatin/papers/scattercast.ps.
4. M. Bawa, H. Deshpande, and H. Garcia-Molina, "Transience of peers and streaming media," in Proceedings of HotNets 2002, October 2002, princeton, NJ.
5. H. Deshpande, M. Bawa, and H. Garcia-Molina, "Streaming live media over a peer-to-peer network," 2001, technical Report CS-2001-31, CS Dept. Stanford University.
6. S. Banerjee, S. Lee, B. Bhattacharjee, and A. Srinivasan, "Resilient multicast using overlays," in Proceedings of ACM Sigmetrics 2003, June 2003, san Diego, CA.
7. W. Jia, W. Zhao, D. Xuan, and G. Xu, "An efficient fault-tolerant multicast routing protocol with core-based tree techniques," IEEE Transactions on Parallel and Distributed Systems, vol. 10, pp. 984-999, October 1999.
8. G. Raidi, "An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem," in Proceedings of the 2000 Congress on Evolutionary Computation CEC00. La Jolla, California, USA: IEEE Press, 6-9, pp. 104-111.
9. S. C. Narula and C. A. Ho, "Degree-constrained minimum spanning trees," Computers and Operations Research, vol. 7, pp. 239-249, 1980.
10. F. Bauer and A. Varma, "Degree-constrained multicasting in point-to-point networks," in Proceedings of INFOCOM'95, April 1995, boston, MA.
11. M. R. Garey and D. S. Johnson, Eds., Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.
12. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, second edition. The MIT Press, 2001.
13. Z. Fei, E. Zegura, and M. Ammar, "Multicast server selection: problems, complexity and solutions," IEEE Journal on Selected Areas in Communications, vol. 20, pp. 1399-1413, September 2002.
14. E. W. Zegura, K. Calvert, and S. Bhattacharjee, "How to model an internetwork," in Proceedings of INFOCOM'96, 1996, pp. 594-602, san Francisco, CA.
15. S. Y. Shi, J. S. Turner, and M. Waldvogel, "Dimensioning server access bandwidth and multicast routing in overlay networks," in Proceedings of NOSSDAV, June 2001.
16. S. Y. Shi and J. S. Turner, "Routing in overlay multicast networks," in Proceedings of INFOCOM 2002, June 2002, new York, NY.
17. S. Banerjee, C. Kommareddy, K. Kar, B. Bhattacharjee, and S. Khuller, "Construction of an efficient overlay multicast infrastructure for real-time applications," in Proceedings of IEEE INFOCOM 2003, March 2003, san Francisco, CA.
18. A. Fei, J. Cui, M. Gerla, and D. Cavendish, "A dual-tree scheme for fault-tolerant multicast," in Proceedings of ICC 2001, June 2001, helsinki, Finland.