QROUTE: an QoS-guaranteed multicast routing

Authors:
Jinquan Dai;Touchai Angchuan;Hung Keng Pung
Affiliations:
Department of Computer Science, National University of Singapore, 3 Science Drive 2, Singapore, Singapore 117543;Department of Computer Science, National University of Singapore, 3 Science Drive 2, Singapore, Singapore 117543;Department of Computer Science, National University of Singapore, 3 Science Drive 2, Singapore, Singapore 117543
Venue:
Computer Communications
Year:
2004

Citing 8
Cited 1

The PIM architecture for wide-area multicast routing

IEEE/ACM Transactions on Networking (TON)
Building shared trees using a one-to-many joining mechanism

ACM SIGCOMM Computer Communication Review
Latency-rate servers: a general model for analysis of traffic scheduling algorithms

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Multicast routing with end-to-end delay and delay variation constraints

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
A QoS-aware multicast routing protocol

IEEE Journal on Selected Areas in Communications
Routing of multipoint connections

IEEE Journal on Selected Areas in Communications
An overview of quality of service routing for next-generation high-speed networks: problems and solutions

IEEE Network: The Magazine of Global Internetworking
Multicast routing and its QoS extension: problems, algorithms, and protocols

IEEE Network: The Magazine of Global Internetworking

Construction of an optimal multicast tree for group communication in a cellular network using genetic algorithm

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

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.