FAMOUS: A novel fast multi-constrained multicast routing algorithm

Proceedings of the 2014 Research in Adaptive and Convergent Systems, RACS 2014

Volumn , Issue , 2014, Pages 149-154

  Huang, Jun ^a   Li, Xiang ^a   Ying, Yin ^a   Sun, Yi ^a   Duan, Qiang ^b   Xing, Cong Cong ^c  

^a CHONGQING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

^c NICHOLLS STATE UNIVERSITY   (United States)

Author keywords

Entropy; Multi constrained; Multicast tree; Routing algorithm; Shortest path tree

Indexed keywords

COST EFFECTIVENESS; ENTROPY; FORESTRY; MULTICASTING; MULTIMEDIA SERVICES; QUALITY OF SERVICE; ROUTING ALGORITHMS;

COMPLEXITY ANALYSIS; EXTENSIVE SIMULATIONS; MULTI-CONSTRAINED; MULTICAST ROUTING; MULTICAST ROUTING ALGORITHMS; MULTICAST ROUTING PROTOCOL; MULTICAST TREE; SHORTEST PATH TREE;

TREES (MATHEMATICS);

ALGORITHMS; TREES;

EID: 84910013235     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2663761.2663763     Document Type: Conference Paper

References (16)

1. B. Wang and J. C. Hou, "Multicast routing and its QoS extension: problems, algorithms, and protocols," IEEE Network, Vol. 14, no. 1, pp. 22-36, Jan/Feb, 2000.
2. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 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," in Proc. 11th Annu. ACM-SIAM SODA, San Francisco, California, pp. 770-779, Jan. 2000.
6. K. Bharath-Kumar and J.M. Jaffe, "Routing to multiple destinations in computer networks," IEEE Trans. Commun., Vol. 31, no. 3, pp. 343-351, Mar. 1983.
7. S. Khuller, B. Raghavachari, and N. Young, "Balancing minimum spanning and shortest path trees," in Proc. Third Annu. ACM/SIAM SODA, Austin, Texas, pp. 243-250, Jan. 1993.
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.
9. G. Xue, "Minimum-Cost QoS Multicast and Unicast Routing in Communication Networks," IEEE Trans. on 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. J. Huang, Y. Ma, and Y. Tanaka, "On Approximating a Multicast Tree with Multiple Quality-of-Service Constraints,", IEICE Transactions on Communications, Vol. E95-B, no. 6, pp. 2005-2012, June 2012.
12. J. Huang, C. Xu, Q. Duan, Y. Ma, and G.-M. Muntean, "Novel End-to-End Quality of Service Provisioning Algorithms for Multimedia Services in Virtualization-based Future Internet," IEEE Transactions on Broadcasting, Vol. 58, no. 4, pp. 569-579, Dec. 2012.
13. J. Huang and Y. Tanaka, "A Deployable E2E Quality-of-Service Routing Algorithm," in Proc. IEICE Gen. Conf 2011, Tokyo, No.BS-4-8, pp. S-23-S-24, Mar. 2011.
14. B. M. Waxman, "Routing of multipoint connections," IEEE J. Sel. Areas Commun., Vol. 6, no. 9, pp. 1617-1622, Dec. 1988.
15. Z. Wang and J. Crowcroft, "Quality-of-service routing for supporting multimedia applications," IEEE J. Sel. Areas. Com., Vol. 14, no. 7, pp. 1228-1234, Sep. 1996.
16. A. Ishizaka and P. Nemery, Multi-criteria Decision Analysis: Methods and Software, Wiley, 2013.