An efficient distributed multicast routing protocol with delay and delay variation constraints

Authors:
T. Prasad;R. C. Hansdah
Affiliations:
Design Engineer, Texas Instruments India Pvt. Ltd., Bangalore, India;Dept. of Computer Sc. & Automation, Indian Institute of Science, Bangalore- 560 012, India
Venue:
ICCC '02 Proceedings of the 15th international conference on Computer communication
Year:
2002

Citing 5
Cited 0

Steiner problem in networks: a survey

Networks
QoSMIC: quality of service sensitive multicast Internet protocol

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
A distributed multicast routing protocol for real-time multicast applications

IC3N '97 Selected papers of the 6th international conference on Computer communications and networks
Distributed multicast routing, with end-to-end delay and delay variation constraints

Computer Communications
Multicast routing with end-to-end delay and delay variation constraints

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multicast routing consists of a tree which is rooted at the source node and contains all the multicast destinations. We study the problem of constructing a multicast tree that satisfies end-to-end delay along the paths from the source to each destination and bounded variations among the delays along these paths. The proposed protocol is distributed in nature, efficient in terms of complexity, and flexible in dealing with dynamic multicast membership changes. The routing tree so constructed has near optimal network cost.