Share Email Print

Proceedings Paper

Scalable group-tree matching algorithm in aggregated multicast
Author(s): Junrui Hao; Shaohua Yu
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

IP multicast suffers from scalability problems when the number of simultaneously active multicast groups is very large. In this paper, we propose an algorithm called SGTM (Scalable Group-Tree Match algorithm) which reduces the number of trees by allowing several groups to be aggregated to the same delivery tree with controllable cost and introduce metrics to measure multicast state and tree management overhead for multicast schemes. SGTM performs faster aggregations than previous aggregation algorithms by evaluating fewer trees for each group, while keeping the same performance. We then show the scalability and the fastness of SGTM by several simulations and we compare its performance to the previous algorithm.

Paper Details

Date Published: 28 September 2006
PDF: 9 pages
Proc. SPIE 6354, Network Architectures, Management, and Applications IV, 63542K (28 September 2006); doi: 10.1117/12.688221
Show Author Affiliations
Junrui Hao, Huazhong Univ. of Science and Technology (China)
Shaohua Yu, Wuhan Research Institute of Posts and Telecommunications (China)

Published in SPIE Proceedings Vol. 6354:
Network Architectures, Management, and Applications IV
Yong Hyub Won; Gee-Kung Chang; Ken-ichi Sato; Jian Wu, Editor(s)

© SPIE. Terms of Use
Back to Top