Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
Minimization of Communication Cost Through Caching in Mobile Environments
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Distributed servers architecture for networked video services
IEEE/ACM Transactions on Networking (TON)
An optimal minimum spanning tree algorithm
Journal of the ACM (JACM)
QoS-aware multicast routing for the internet: the design and evaluation of QoSMIC
IEEE/ACM Transactions on Networking (TON)
Network caching strategies for reservation-based multimedia services on high-speed networks
Data & Knowledge Engineering
Strategic Replication of Video Files in a Distributed Environment
Multimedia Tools and Applications
HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
Towards a Theory of Collaborative Multimedia
ICMCS '96 Proceedings of the 1996 International Conference on Multimedia Computing and Systems
Document Caching Policies on High-Speed Distributed Networks for Personalized Multimedia Services
ICON '00 Proceedings of the 8th IEEE International Conference on Networks
A source-based algorithm for delay-constrained minimum-cost multicasting
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
Network Caching Strategies for a Shared Data Distribution for a Predefined Service Demand Sequence
IEEE Transactions on Knowledge and Data Engineering
Routing with topology aggregation in delay-bandwidth sensitive networks
IEEE/ACM Transactions on Networking (TON)
Journal of Parallel and Distributed Computing
Multimedia information caching for personalized video-on-demand
Computer Communications
| Hi-index | 0.00 |
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.