A distributed multicast routing protocol for real-time multicast applications Article

Jia, X, Zhang, Y, Pissinou, N et al. (1999). A distributed multicast routing protocol for real-time multicast applications . 31(1-2), 101-110. 10.1016/s0169-7552(98)00234-7

cited authors

  • Jia, X; Zhang, Y; Pissinou, N; Makki, K

fiu authors

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.

publication date

  • January 14, 1999

Digital Object Identifier (DOI)

start page

  • 101

end page

  • 110

volume

  • 31

issue

  • 1-2