On Group Multicast Routing with Bandwidth Constraint: A Lower Bound and Performance Evaluation

IEICE Transactions on Communications

Volumn E87-B, Issue 13, 2004, Pages 124-131

  Low, Chor Ping ^a   Wang, Ning ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Heuristic algorithm; Lower bound techniques; Multicast routing; NP completeness

Indexed keywords

ALGORITHMS; BANDWIDTH; GRAPH THEORY; HEURISTIC METHODS; MATHEMATICAL MODELS; POLYNOMIALS; ROUTERS; SET THEORY;

HEURISTIC ALGORITHMS; MULTICAST ROUTING;

MULTICASTING;

EID: 0842310513     PISSN: 09168516     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (10)

1. T. Ballardie, P. Francis, and J. Crowcroft, "Core Based Trees (CBT)," Proc. SIGCOMM'93 Conf., ACM, pp.85-95, 1993.
2. M. Doar and I. Leslie, "How bad is Naïve multicasting?" Proc. IEEE Infocomm'93, pp.82-89, USA, 1993.
3. M.R. Garey and D.S. Johnson, Computers and Intractability - A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
4. X. Jia and L. Wang, "Group multicast routing algorithm by using multiple minimum Steiner trees," Comput. Commun., vol.20, pp.750-758, 1997.
5. R.M. Karp, "Reducibility among combinatorial problems," in Complexity of Computer Computations, Miller & Thatcher, pp.85-103, Plenum Press, New York, 1972.
6. L. Kou, G. Markowsky, and L. Berman, "A fast algorithm for Steiner trees," Acta Informatica, vol.15, pp.141-145, 1981.
7. C.P. Low and N. Wang, "An efficient algorithm for group multicast routing with bandwidth reservation," Proc. IEEE International Conf. on Networks (ICON'99), 1999.
8. C.R. Reeves, Modern heuristic techniques for combinatorial problems, John Wiley & Sons, 1993.
9. H. Takahashi and A. Matsuyama, "An approximate solution for the Steiner problem in graphs," Math. Japonica, vol.6, pp.573-577, 1980.
10. B.M. Waxman, "Routing of multipoint connections," IEEE J. Sel. Areas Commun., vol.6, no.9, pp.1617-1622, 1988.