FAMOUS: A novel fast multi-constrained multicast routing algorithm

Jun Huang, Xiang Li, Yin Ying, Yi Sun, Qiang Duan, Cong Cong Xing

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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 fast multi-constrained multicast 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.

Original languageEnglish (US)
Title of host publicationProceedings of the 2014 Research in Adaptive and Convergent Systems, RACS 2014
PublisherAssociation for Computing Machinery, Inc
Pages149-154
Number of pages6
ISBN (Electronic)9781450330602
DOIs
StatePublished - Oct 5 2014
Event2014 Conference on Research in Adaptive and Convergent Systems, RACS 2014 - Towson, United States
Duration: Oct 5 2014Oct 8 2014

Publication series

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

Other

Other2014 Conference on Research in Adaptive and Convergent Systems, RACS 2014
CountryUnited States
CityTowson
Period10/5/1410/8/14

Fingerprint

Routing algorithms
Quality of service
Multimedia services
Routing protocols
Entropy
Bandwidth
Costs

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Computer Science(all)

Cite this

Huang, J., Li, X., Ying, Y., Sun, Y., Duan, Q., & Xing, C. C. (2014). FAMOUS: A novel fast multi-constrained multicast routing algorithm. In Proceedings of the 2014 Research in Adaptive and Convergent Systems, RACS 2014 (pp. 149-154). (Proceedings of the 2014 Research in Adaptive and Convergent Systems, RACS 2014). Association for Computing Machinery, Inc. https://doi.org/10.1145/2663761.2663763
Huang, Jun ; Li, Xiang ; Ying, Yin ; Sun, Yi ; Duan, Qiang ; Xing, Cong Cong. / FAMOUS : A novel fast multi-constrained multicast routing algorithm. Proceedings of the 2014 Research in Adaptive and Convergent Systems, RACS 2014. Association for Computing Machinery, Inc, 2014. pp. 149-154 (Proceedings of the 2014 Research in Adaptive and Convergent Systems, RACS 2014).
@inproceedings{8995990a9c71482db730478cbb645952,
title = "FAMOUS: A novel fast multi-constrained multicast routing algorithm",
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 fast multi-constrained multicast 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.",
author = "Jun Huang and Xiang Li and Yin Ying and Yi Sun and Qiang Duan and Xing, {Cong Cong}",
year = "2014",
month = "10",
day = "5",
doi = "10.1145/2663761.2663763",
language = "English (US)",
series = "Proceedings of the 2014 Research in Adaptive and Convergent Systems, RACS 2014",
publisher = "Association for Computing Machinery, Inc",
pages = "149--154",
booktitle = "Proceedings of the 2014 Research in Adaptive and Convergent Systems, RACS 2014",

}

Huang, J, Li, X, Ying, Y, Sun, Y, Duan, Q & Xing, CC 2014, FAMOUS: A novel fast multi-constrained multicast routing algorithm. in Proceedings of the 2014 Research in Adaptive and Convergent Systems, RACS 2014. Proceedings of the 2014 Research in Adaptive and Convergent Systems, RACS 2014, Association for Computing Machinery, Inc, pp. 149-154, 2014 Conference on Research in Adaptive and Convergent Systems, RACS 2014, Towson, United States, 10/5/14. https://doi.org/10.1145/2663761.2663763

FAMOUS : A novel fast multi-constrained multicast routing algorithm. / Huang, Jun; Li, Xiang; Ying, Yin; Sun, Yi; Duan, Qiang; Xing, Cong Cong.

Proceedings of the 2014 Research in Adaptive and Convergent Systems, RACS 2014. Association for Computing Machinery, Inc, 2014. p. 149-154 (Proceedings of the 2014 Research in Adaptive and Convergent Systems, RACS 2014).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - FAMOUS

T2 - A novel fast multi-constrained multicast routing algorithm

AU - Huang, Jun

AU - Li, Xiang

AU - Ying, Yin

AU - Sun, Yi

AU - Duan, Qiang

AU - Xing, Cong Cong

PY - 2014/10/5

Y1 - 2014/10/5

N2 - 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 fast multi-constrained multicast 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.

AB - 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 fast multi-constrained multicast 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.

UR - http://www.scopus.com/inward/record.url?scp=84910013235&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84910013235&partnerID=8YFLogxK

U2 - 10.1145/2663761.2663763

DO - 10.1145/2663761.2663763

M3 - Conference contribution

AN - SCOPUS:84910013235

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

SP - 149

EP - 154

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

PB - Association for Computing Machinery, Inc

ER -

Huang J, Li X, Ying Y, Sun Y, Duan Q, Xing CC. FAMOUS: A novel fast multi-constrained multicast routing algorithm. In Proceedings of the 2014 Research in Adaptive and Convergent Systems, RACS 2014. Association for Computing Machinery, Inc. 2014. p. 149-154. (Proceedings of the 2014 Research in Adaptive and Convergent Systems, RACS 2014). https://doi.org/10.1145/2663761.2663763