By Topic

Many-to-Many Multicast Routing under a Fixed Topology: Basic Architecture, Problems and Algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Wei Ding ; Dept. of Basic Educ., Zhejiang Water Conservancy & Hydropower Coll., Hangzhou, China

Many-to-many multicast can be widely used in computer and communication networks supporting various continuous multi-media applications. This paper assumes each user is both a source and a receiver as well as a terminal in many-to-many multicasting. Under this assumption a many-to-many multicast tree appears as a terminal Steiner tree (TeST). This paper uses a heuristic idea of under a fixed TeST topology to compute a good many-to-many multicast tree. Based on this novel idea two basic problems are proposed, the minimum cost/delay many-to-many multicast tree under a fixed TeST topology problem (MCMP/MDMP). Further both of them are distributed into two types, the centralized and decentralized. This paper presents a polynomial-time exact algorithm for the centralized and decentralized MCMP/MDMP respectively.

Published in:

2010 First International Conference on Networking and Distributed Computing

Date of Conference:

21-24 Oct. 2010