Efficient Internet Multicast Routing Using Anycast Path Selection

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

doi:10.1023/A:1021108104572

Efficient Internet Multicast Routing Using Anycast Path Selection

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

Department of Computer Science

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

7 Citations (Scopus)

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.
© 2002 Plenum Publishing Corporation

Original language	English
Pages (from-to)	417-438
Journal	Journal of Network and Systems Management
Volume	10
Issue number	4
DOIs	https://doi.org/10.1023/A:1021108104572
Publication status	Published - Dec 2002

Bibliographical note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

Funding

This work was partially sponsored by RGC Hong Kong under Grants No. CityU 1076/00E and CityU 1055/01E. The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of the RGC Hong Kong or the City University of Hong Kong.

Research Keywords

Anycast
Core-based tree
Dynamic routing
Fault-tolerant routing
Local router reconfiguration
Multicast
PIM
Shared tree
Source routing

RGC Funding Information

RGC-funded

Access Output

10.1023/A:1021108104572

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{21951a4aea5145a89340b826eba26854,

title = "Efficient Internet Multicast Routing Using Anycast Path Selection",

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. {\textcopyright} 2002 Plenum Publishing Corporation",

keywords = "Anycast, Core-based tree, Dynamic routing, Fault-tolerant routing, Local router reconfiguration, Multicast, PIM, Shared tree, Source routing",

author = "Weijia Jia and Gaochao Xu and Wei Zhao and Pui-On Au",

note = "Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].",

year = "2002",

month = dec,

doi = "10.1023/A:1021108104572",

language = "English",

volume = "10",

pages = "417--438",

journal = "Journal of Network and Systems Management",

issn = "1064-7570",

publisher = "Springer New York",

number = "4",

}

TY - JOUR

T1 - Efficient Internet Multicast Routing Using Anycast Path Selection

AU - Jia, Weijia

AU - Xu, Gaochao

AU - Zhao, Wei

AU - Au, Pui-On

N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

PY - 2002/12

Y1 - 2002/12

N2 - 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. © 2002 Plenum Publishing Corporation

AB - 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. © 2002 Plenum Publishing Corporation

KW - Anycast

KW - Core-based tree

KW - Dynamic routing

KW - Fault-tolerant routing

KW - Local router reconfiguration

KW - Multicast

KW - PIM

KW - Shared tree

KW - Source routing

UR - https://www.scopus.com/pages/publications/1942421837

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-1942421837&origin=recordpage

U2 - 10.1023/A:1021108104572

DO - 10.1023/A:1021108104572

M3 - RGC 21 - Publication in refereed journal

SN - 1064-7570

VL - 10

SP - 417

EP - 438

JO - Journal of Network and Systems Management

JF - Journal of Network and Systems Management

IS - 4

ER -

Efficient Internet Multicast Routing Using Anycast Path Selection

Abstract

Bibliographical note

Funding

Research Keywords

RGC Funding Information

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this