A distributed multicast routing protocol for real-time multicast applications

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

9 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)101-109
Journal / PublicationComputer Networks
Volume31
Issue number1-2
Publication statusPublished - 14 Jan 1999

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 journalpeer-review