Scalable group-tree matching algorithm in aggregated multicast

Junrui Hao; Shaohua Yu

doi:10.1117/12.688221

28 September 2006 Scalable group-tree matching algorithm in aggregated multicast

Junrui Hao, Shaohua Yu

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.

Citation Download Citation

Junrui Hao and Shaohua Yu "Scalable group-tree matching algorithm in aggregated multicast", Proc. SPIE 6354, Network Architectures, Management, and Applications IV, 63542K (28 September 2006); https://doi.org/10.1117/12.688221

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available