By Topic

Scalable multicast routing protocol using anycast and hierarchical-trees

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
$31 $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

4 Author(s)
Weijia Jia ; Dept. of Comput. Eng. & Inf. Technol., City Univ. of Hong Kong, China ; Pui-On Au ; Gaochao Xu ; Wei Zhao

A novel efficient and effective Internet multicast routing protocol is presented with short delay, high throughput, resource utilization and scalability for a single multicast group g. The protocol has two features: (1) multiple shared-trees (MST) are configured to provide efficient, dynamic and quality multicast routing; (2) an anycasting approach is used to form the tree roots into an anycast group so that the multicast packets can be anycast to the nearest node at one of the shared trees to achieve the best routing service for the multicast packets. The performance of the MST protocol is analyzed through extensive simulations and compared with well-known source tree and shared-tree routing.

Published in:

Local Computer Networks, 2002. Proceedings. LCN 2002. 27th Annual IEEE Conference on

Date of Conference:

6-8 Nov. 2002