Please use this identifier to cite or link to this item:
https://doi.org/10.1016/S0140-3664(03)00213-5
Title: | QROUTE: An QoS-guaranteed multicast routing | Authors: | Dai, J. Angchuan, T. Pung, H.K. |
Keywords: | Flooding Network implementation Network simulation modeling Performance measurements QoS multicast QoS routing Resource reservation |
Issue Date: | 2004 | Citation: | Dai, J., Angchuan, T., Pung, H.K. (2004). QROUTE: An QoS-guaranteed multicast routing. Computer Communications 27 (2) : 171-186. ScholarBank@NUS Repository. https://doi.org/10.1016/S0140-3664(03)00213-5 | Abstract: | In this paper, we propose QROUTE, an integrated framework for QoS-guaranteed multicast routing, in which a feasible multicast tree meeting multiple QoS constraints can be constructed in a distributed fashion using local states at routers. Compared with existing QoS-based multicast routing protocols, QROUTE is much simpler to design and implement; and its simplicity and feasibility is demonstrated through the construction of a prototype router testbed. In addition, it is more effective as it avoids flooding the network blindly, while searching all the available feasible paths in parallel so as to ensure a better chance of successful routing and a more efficient use of network resources. We also evaluate the performance of QROUTE by comparing it with other related protocols through simulations, and find that QROUTE has lower blocking probability, lower routing overhead, lower connection set-up latency, and the resulting multicast trees of QROUTE also generally require fewer links than those of the related protocols. In addition it is fairly scalable with the network sizes. © 2003 Published by Elsevier B.V. | Source Title: | Computer Communications | URI: | http://scholarbank.nus.edu.sg/handle/10635/42067 | ISSN: | 01403664 | DOI: | 10.1016/S0140-3664(03)00213-5 |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.