Scalable multicast routing protocol using anycast and hierarchical-trees

Author

Jia, Weijia ; Au, Pui-On ; Xu, Gaochao ; Zhao, Wei

Author_Institution

Dept. of Comput. Eng. & Inf. Technol., City Univ. of Hong Kong, China

fYear

2002

fDate

6-8 Nov. 2002

Firstpage

572

Lastpage

581

Abstract

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.

Keywords

Internet; bandwidth allocation; delays; multicast protocols; packet switching; performance evaluation; quality of service; routing protocols; telecommunication traffic; trees (mathematics); Internet; MST protocol; anycast group; anycasting; delay; hierarchical trees; multicast group; multicast packets; multiple shared trees; performance; resource utilization; routing service; scalable multicast routing protocol; simulations; throughput; tree roots; Computer science; Delay; Internet; Multicast algorithms; Multicast protocols; Resource management; Routing protocols; Scalability; Throughput; Unicast;

fLanguage

English

Publisher

ieee

Conference_Titel

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

ISSN

0742-1303

Print_ISBN

0-7695-1591-6

Type

conf

DOI

10.1109/LCN.2002.1181832

Filename

1181832