skip to main content
10.1145/2663761.2663763acmconferencesArticle/Chapter ViewAbstractPublication PagesracsConference Proceedingsconference-collections
research-article

FAMOUS: a novel fast multi-constrained multicast routing algorithm

Published: 05 October 2014 Publication History

Abstract

Multicast routing with multiple Quality-of-Service (QoS) constraints has been realized as an promising technology to meet the increasing bandwidth demand of multimedia services. Developing cost-effective multicast routing algorithm plays a crucial role in implementing multicast routing protocol successfully. However, most of prior multicast routing algorithms are dedicated to two QoS constraints, few researches focus on the case with three or more constraints. In this paper, we explore the multicast routing problem with K constraints where K > 2. To address this problem, we propose FAMOUS, a <u>f</u>ast <u>m</u>ulti-c<u>o</u>nstrained m<u>u</u>ltica<u>s</u>t routing algorithm. The algorithm leverages an entropy-based process to aggregate all weights into a comprehensive metric for simplifying the problem, and then applies this metric to search a multicast tree on the constructing shortest path tree basis. We conduct complexity analysis and extensive simulations for the proposed algorithm. Both analytical and experimental results demonstrate that FAMOUS is superior to a representative multi-constrained multicast routing algorithm in terms of both speed and accuracy, and thus it is applicable to realistic networking scenarios.

References

[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.

Cited By

View all
  • (2017)Topology Control for Building a Large-Scale and Energy-Efficient Internet of ThingsIEEE Wireless Communications10.1109/MWC.2017.1600193WC24:1(67-73)Online publication date: 1-Feb-2017

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
RACS '14: Proceedings of the 2014 Conference on Research in Adaptive and Convergent Systems
October 2014
386 pages
ISBN:9781450330602
DOI:10.1145/2663761
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 October 2014

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. entropy
  2. multi-constrained
  3. multicast tree
  4. routing algorithm
  5. shortest path tree

Qualifiers

  • Research-article

Funding Sources

Conference

RACS '14
Sponsor:

Acceptance Rates

RACS '14 Paper Acceptance Rate 59 of 251 submissions, 24%;
Overall Acceptance Rate 393 of 1,581 submissions, 25%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)1
Reflects downloads up to 17 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2017)Topology Control for Building a Large-Scale and Energy-Efficient Internet of ThingsIEEE Wireless Communications10.1109/MWC.2017.1600193WC24:1(67-73)Online publication date: 1-Feb-2017

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media