Please use this identifier to cite or link to this item:
|Title:||Cost-effective multicast approaches for time-critical applications in dynamic network environments|
QoS-constrained multicast routing
|Citation:||Li, X.,Veeravalli, B. (2007). Cost-effective multicast approaches for time-critical applications in dynamic network environments. Journal of High Speed Networks 16 (3) : 239-259. ScholarBank@NUS Repository.|
|Abstract:||In this paper, we address the issue of optimizing the per request cost and maximizing the number of requests that can be served by a networked system that demands staging of data at vantage sites. In order to provide a guaranteed Quality of Services, generation of multicast trees with end-to-end delay constraints is recommended to minimize the costs. Since such an issue has been proved to be NP-complete in a networked environment, we proposed two efficient and practically realizable heuristic algorithms, referred to as Source-Initiated Scheduling (SIS) algorithm and Client-Initiated Scheduling (CIS) algorithm to solve the problem in polynomial time. Both SIS and CIS algorithms judiciously combine the concept of QoS-constrained multicast routing and network caching, so that the copies of data to be staged can be dynamically cached in the network. These strategies are carefully designed to consider the underlying resource constraints imposed by the dynamic network environments, such as link bandwidth availability, data availability on the network, and the storage capabilities of a site. We analyze and quantify the performance under several influencing parameters such as link availability, cache capacity and the data availability. Simulation results show that both of the proposed algorithms are able to reduce the service cost and achieve a high acceptance ratio. © 2007 - IOS Press and the authors. All rights reserved.|
|Source Title:||Journal of High Speed Networks|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 3, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.