DIRA: distributed insertion and relocation routing algorithm for overlay multicast in diffserv domain

Authors:
Xiao Chen;Huagang Shao;Weinong Wang
Affiliations:
Regional Network Center of East China, Department of Computer Science and Technology, Shanghai Jiao Tong University, China;Regional Network Center of East China, Department of Computer Science and Technology, Shanghai Jiao Tong University, China;Regional Network Center of East China, Department of Computer Science and Technology, Shanghai Jiao Tong University, China
Venue:
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Year:
2005

Citing 4
Cited 0

Multicast routing in internetworks and extended LANs

SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
A case for end system multicast (keynote address)

Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Dimensioning server access bandwidth and multicast routing in overlay networks

NOSSDAV '01 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
QRON: QoS-aware routing in overlay networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traditional multicast routing algorithms require routers to be specially designed such that they can forward the same copy of packet onto different output links simultaneously. This idea conflicts severely with the core-stateless principle in most QoS network architectures, such as Diffserv. Meanwhile, overlay multicast emerges as an effective alternative to the traditional approaches. In this paper, we combine the overlay multicast technique with the Diffserv architecture seamlessly and design an overlay multicast routing algorithm, which generates a multicast tree at a pretty low cost incrementally. Owing to its distributed nature, the computation of the tree can be executed efficiently. Through a large amount of simulations, we have shown that our algorithm is quite competitive in terms of network resource utilization and other metrics.