A distributed multicast routing protocol for real-time multicast applications
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
Original language | English |
---|---|
Pages (from-to) | 101-109 |
Journal / Publication | Computer Networks |
Volume | 31 |
Issue number | 1-2 |
Publication status | Published - 14 Jan 1999 |
Link(s)
Abstract
Multicast routing is establishing a tree which is rooted from the source node and contains all the multicast destinations. A delay bounded routing tree is a tree in which the accumulated delay from the source node to any destination along the tree does not exceed a pre-specified bound. This paper presents a distributed routing protocol which constructs delay bounded routing trees for real-time multicast connections. A constructed routing tree has a near optimal network cost under the delay bound constraint. The proposed algorithm is fully distributed, efficient in terms of the number of messages required, and flexible in multicast membership changes. A large number of simulations have been done to show the network cost of the routing trees generated by our method is better than the other major existing algorithms. © 1999 Elsevier Science B.V. All rights reserved.
Research Area(s)
- Delay bounded routing, Distributed routing, Multicast routing, Real-time communication
Citation Format(s)
A distributed multicast routing protocol for real-time multicast applications. / Jia, Xiaohua; Zhang, Yanchun; Pissinou, Niki; Makki, Kia.
In: Computer Networks, Vol. 31, No. 1-2, 14.01.1999, p. 101-109.Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review