Efficient Internet Multicast Routing Using Anycast Path Selection

Authors:
Weijia Jia; Gaochao Xu; Wei Zhao; Pui-On Au
Affiliations:
Department of Computer Science, City University of Hong Kong, SRC, China/;Department of Computer Science, Jilin University, Changchun, China;Department of Computer Science, Texas A&/M University, College Station, Texas;Research student, Department of Computer Engineering and Information Technology, City University of Hong Kong, SRC, China
Venue:
Journal of Network and Systems Management
Year:
2002

Citing 13
Cited 2

Routing in the Internet

Routing in the Internet
The PIM architecture for wide-area multicast routing

IEEE/ACM Transactions on Networking (TON)
High-speed networks: TCP/IP and ATM design principles

High-speed networks: TCP/IP and ATM design principles
A 50-Gb/s IP router

IEEE/ACM Transactions on Networking (TON)
An Efficient Fault-Tolerant Multicast Routing Protocol with Core-Based Tree Techniques

IEEE Transactions on Parallel and Distributed Systems
A Routing Protocol for Anycast Messages

IEEE Transactions on Parallel and Distributed Systems
OSPF: Anatomy of an Internet Routing Protocol

OSPF: Anatomy of an Internet Routing Protocol
Application-Layer Anycasting

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Core selection methods for multicast routing

ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
Scalable Internet multicast routing

ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
Integrated routing algorithms for anycast messages

IEEE Communications Magazine
Distributed center-location algorithms

IEEE Journal on Selected Areas in Communications
Performance and resource cost comparisons for the CBT and PIM multicast routing protocols

IEEE Journal on Selected Areas in Communications

Landscape analysis for multicast routing

Computer Communications
Minicast: a multicast-anycast protocol for message delivery

ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A novel efficient and dynamic multicast routing protocol based on anycast routing techniques is presented. The contributions of the protocol differ from well-known shared-tree systems in two aspects: (1) Off-tree anycast routing: The nodes in the shared tree are formed into a virtual anycast group and multicast sources use anycast routing to select a better path from the source to one router in the group to achieve short delay and fault-tolerance. (2) On-tree dynamic routing: The shared-tree approach is extended with capability of alternative path selections. If a node becomes absent from the shared tree, some predefined backup path(s) is (are) used to bypass the node and enable dynamic multicast routing to continue. The protocol requires only the routers near the faulty node to be reconfigured, thus reducing the runtime overhead as compared with global reconfiguration. The simulation data demonstrates the efficiency of our routing protocol.