Integrated routing protocol for multicast and anycast messages

Author

Jia, Weijia ; Xu, Gaochao ; Zhao, Wei

Author_Institution

Dept. of Comput. Sci., City Univ. of Hong Kong, Kowloon, China

fYear

2001

fDate

3-7 Sept. 2001

Firstpage

561

Lastpage

568

Abstract

A novel efficient and dynamic integrated routing protocol for multicast and anycast messages is presented. The contributions of the protocol differ from well-known shared-tree systems in two aspects: (1) Off-tree anycast configuration and routing: multicast sources use anycast routing to select a better path from the source to one router in the group in order to avoid congestion or any fault in the network. (2) On-tree router anycast configurations: The nodes in the shared-tree are formed into a virtual anycast group. The shared-tree approach is extended with capability of a group cores (anycast group). The simulation data demonstrates the efficiency of the protocol.

Keywords

protocols; telecommunication congestion control; telecommunication network routing; anycast messages; congestion; integrated routing protocol; multicast messages; simulation data; virtual anycast group; Computer science; Delay; Heuristic algorithms; Multicast communication; Multicast protocols; Network servers; Routing protocols; Scalability; Telecommunication traffic; Web and internet services;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Processing, 2001. International Conference on

Conference_Location

Valencia, Spain

ISSN

0190-3918

Print_ISBN

0-7695-1257-7

Type

conf

DOI

10.1109/ICPP.2001.952104

Filename

952104