QoS driven online multicast routing algorithm

Authors:
R. Manoharan;P. Thambidurai;S. Pradhiba
Affiliations:
Department of Computer Science & Engineering and Information Technology, Pondicherry Engineering College, Pondicherry, India;Department of Computer Science & Engineering and Information Technology, Pondicherry Engineering College, Pondicherry, India;Department of Computer Science & Engineering and Information Technology, Pondicherry Engineering College, Pondicherry, India
Venue:
CIT'04 Proceedings of the 7th international conference on Intelligent Information Technology
Year:
2004

Citing 9
Cited 0

QoSMIC: quality of service sensitive multicast Internet protocol

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Online multicast routing with bandwidth guarantees: a new approach using multicast network flow

IEEE/ACM Transactions on Networking (TON)
Alternate path routing for multicast

IEEE/ACM Transactions on Networking (TON)
A survey of QoS multicasting issues

IEEE Communications Magazine
Multicast routing with end-to-end delay and delay variation constraints

IEEE Journal on Selected Areas in Communications
A QoS-aware multicast routing protocol

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
Multicast routing algorithms and protocols: a tutorial

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent work on multicast routing algorithms in the Internet has introduced new notions of building online multicast tree without a priori knowledge of the future requests. Most of the online multicast routing algorithms aimed to satisfy more number of requests by preserving bandwidth on frequently used links and generate long-hop multicast trees by compromising the hop length. In this paper, we propose an online multicast routing algorithm, wherein rerouting of multicast session is incorporated instead of preserving bandwidth on frequently used links in order to satisfy more number of requests. This enables individual request to have different treatments based on their delay tolerance subject to policy restrictions. Our work focuses on classifying the requests into three classes namely Class-I, Class-II and Class-III and providing the maximum, the best possible and if possible service level in terms of bandwidth and end-to-end delay bound to efficiently utilize the network resources and accepting more user requests. Extensive simulations show that our algorithm provides service level guarantee to the three classes of requests, out performs the existing algorithms in terms of call acceptance ratio and improves the resource utilization.