QoS Driven Online Multicast Routing Algorithm

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 u...

Full description

Saved in:
Bibliographic Details
Published inIntelligent Information Technology pp. 87 - 96
Main Authors Manoharan, R., Thambidurai, P., Pradhiba, S.
Format Book Chapter Conference Proceeding
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 01.01.2004
Springer
SeriesLecture Notes in Computer Science
Subjects
Alternate Path
Applied sciences
Artificial intelligence
Computer science; control theory; systems
Exact sciences and technology
Learning and adaptive systems
Multicast Route
Multicast Session
Multicast Tree
Short Path Tree
Multicast
Routing algorithm
Bandwidth
Tolerance
Internet
Artificial intelligence
Service quality
Multilevel system
Bounded delay
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:9783540241263
3540241264
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-540-30561-3_10