28 September 2006 Scalable group-tree matching algorithm in aggregated multicast
Author Affiliations +
Proceedings Volume 6354, Network Architectures, Management, and Applications IV; 63542K (2006) https://doi.org/10.1117/12.688221
Event: Asia-Pacific Optical Communications, 2006, Gwangju, South Korea
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.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Junrui Hao, Shaohua Yu, "Scalable group-tree matching algorithm in aggregated multicast", Proc. SPIE 6354, Network Architectures, Management, and Applications IV, 63542K (28 September 2006); doi: 10.1117/12.688221; https://doi.org/10.1117/12.688221
PROCEEDINGS
9 PAGES


SHARE
Back to Top