Distributed algorithm of delay bounded multicast routing for multimedia applications
Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45) › 32_Refereed conference paper (with ISBN/ISSN) › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the International Conference on Computer Communications and Networks, ICCCN |
| Publisher | IEEE |
| Pages | 208-213 |
| Publication status | Published - 1997 |
Conference
| Title | Proceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97 |
|---|---|
| City | Las Vegas, NV, USA |
| Period | 22 - 25 September 1997 |
Link(s)
Abstract
Multicast routing is to find a tree which is rooted from the source node and contains all the multicast destinations. A delay bounded routing tree is a tree that the accumulated delay from the source node to any destination along the tree shall not exceed a pre-specified bound. This paper presents a distributed heuristic algorithm which generates routing trees with sub-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 amount of simulations have been done to show the network cost of the routing trees generated by our algorithm is better than the major existing algorithms.
Citation Format(s)
Distributed algorithm of delay bounded multicast routing for multimedia applications. / Jia, Xiaohua; Pissinou, Niki; Makki, Kia.
Proceedings of the International Conference on Computer Communications and Networks, ICCCN. IEEE, 1997. p. 208-213.Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45) › 32_Refereed conference paper (with ISBN/ISSN) › peer-review
