On approximating a multicast routing tree with multiple Quality-of-Service constraints

IEICE Transactions on Communications

Volumn E95-B, Issue 6, 2012, Pages 2005-2012

  Huang, Jun ^a,b   Tanaka, Yoshiaki ^b   Ma, Yan ^a  

^a BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

^b WASEDA UNIVERSITY   (Japan)

Author keywords

Approximation algorithm; Heuristic; Multicast tree; Nonlinear combination; QoS routing

Indexed keywords

APPROXIMATION ALGORITHMS; FORESTRY; MULTICASTING; NETWORK ROUTING; POLYNOMIAL APPROXIMATION; ROUTING ALGORITHMS; TREES (MATHEMATICS);

CONTENT DISTRIBUTION; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; HEURISTIC; MULTICAST ROUTING ALGORITHMS; MULTICAST TREE; NONLINEAR COMBINATION; QOS ROUTING; QUALITY OF SERVICE (QOS) GUARANTEES;

QUALITY OF SERVICE;

ALGORITHMS; HEURISTIC METHODS; NETWORKS; NONLINEAR PROGRAMING; QUALITY; RESTRAINTS; TELECOMMUNICATIONS;

EID: 84861826176     PISSN: 09168516     EISSN: 17451345     Source Type: Journal    
DOI: 10.1587/transcom.E95.B.2005     Document Type: Article

References (18)

1. J. Huang and Y. Liu, "MOEAQ: A QoS-aware multicast routing algorithm for MANET," Expert Systems with Application, vol.37, no.2, pp.1391-1399, March 2010.
2. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.
3. H. Takahashi and A. Matsuyama, "An approximate solution for the Steiner problem in graphs," Math. Japonica, vol.24, no.6, pp.573- 577, Nov. 1980.
4. A. Zelikovsky, "An 11/6-approximation algorithm for the network steiner problem," Algorithmica, vol.9, no.5, pp.463-470, May 1993.
5. G. Robins and A. Zelikovsky, "Improved Steiner tree approximation in graphs," Proc. 11th Annu. ACM-SIAM SODA, pp.770-779, San Francisco, California, Jan. 2000. (Pubitemid 30549328)
6. K. Bharath-Kumar and J.M. Jaffe, "Routing to multiple destinations in computer networks," IEEE Trans. Commun., vol.C-31, no.3, pp.343-351, March 1983. (Pubitemid 13556103)
7. S. Khuller, B. Raghavachari, and N. Young, "Balancing minimum spanning and shortest path trees," Proc. Third Annu. ACM/SIAM SODA, pp.243-250, Austin, Texas, Jan. 1993. (Pubitemid 23612722)
8. M. Parsa, Q. Zhu, and J.J. Garcia-Luna-Aceves, "An iterative algorithm for delay-constrained minimum-cost multicasting," IEEE/ACM Trans. Netw., vol.6, no.4, pp.461-474, Aug. 1998. (Pubitemid 128747931)
9. G. Xue, "Minimum-Cost QoS multicast and unicast routing in communication networks," IEEE Trans. Commun., vol.51, no.5, pp.817-824, May 2003.
10. F.K. Hwang, "Steiner tree problem," Networks, vol.22, no.1, pp.55-89, Jan. 1992.
11. B. Wang and J.C. Hou, "Multicast routing and Its QoS extension: Problems, algorithms, and protocols," IEEE Netw., vol.14, no.1, pp.22-36, Jan./Feb. 2000. (Pubitemid 30553490)
12. J. Huang, X. Huang, and Y. Ma, "An effective approximation scheme for multiconstrained quality-of-service routing," Proc. IEEE GLOBECOM 2010, pp.1-6, Miami, Florida, Dec. 2010.
13. J. Huang and Y. Tanaka, "QoS routing algorithms using fully polynomial time approximation scheme," Proc. ACM/IEEE IWQoS2011, pp.1-3, San Jose, California, June 2011.
14. J. Huang and Y. Tanaka, "A deployable E2E quality-of-service routing algorithm," Proc. IEICE Gen. Conf. 2011, BS-4-8, March 2011.
15. B.M. Waxman, "Routing of multipoint connections," IEEE J. Sel. Areas Commun., vol.6, no.9, pp.1617-1622, Dec. 1988.
16. http://www.isi.edu/nsnam/ns/
17. Z. Wang and J. Crowcroft, "Quality-of-service routing for supporting multimedia applications," IEEE J. Sel. Areas Commun., vol.14, no.7, pp.1228-1234, Sept. 1996. (Pubitemid 126561535)
18. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, 1979.