Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
Scheduling policies for an on-demand video server with batching
MULTIMEDIA '94 Proceedings of the second ACM international conference on Multimedia
IEEE Transactions on Parallel and Distributed Systems
New dynamic algorithms for shortest path tree computation
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
A Distributed Delay-Constrained Dynamic Multicast Routing Algorithm
IDMS '97 Proceedings of the 4th International Workshop on Interactive Distributed Multimedia Systems and Telecommunication Services
WAVE: A New Multicast Routing Algorithm for Static and Dynamic Multicast Groups
NOSSDAV '95 Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video
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
Threshold-based multicast for continuous media delivery
IEEE Transactions on Multimedia
On a unified architecture for video-on-demand services
IEEE Transactions on Multimedia
Multimedia information caching for personalized video-on-demand
Computer Communications
| Hi-index | 0.24 |
Video-on-Reservation (VOR) systems serve as an attractive service providing scheme for multimedia network based services. As opposed to on-demand systems, in VOR, requests arrive in advance to their viewing times so that the network resources can be better utilized by carefully scheduling the resources. In this paper, we address the problem of optimizing the per user service cost and maximizing the number of requests that can be served by VOR systems. In order to provide a guaranteed QoS, 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, we propose two efficient and practically realizable heuristic algorithms, referred to as Source-Based Stream Scheduling (SBS) algorithm and Destination-Based Stream Scheduling (DBS) algorithm to solve the problem in polynomial time. Both SBS and DBS algorithms judiciously combine the concept of multicast routing and network caching, so that the copies of Multimedia Documents (MMDs) can be dynamically cached in the network. To analyze the trade-off between caching cost and transmission cost, we present a mathematical model and show that service cost can be minimized by adjusting offset time according to the network characteristics. When network resources (cache space and link bandwidth) are constraints, acceptance ratio can be improved significantly by combining video partitioning with SBS or DBS. We analyze and quantify the performance under several influencing parameters such as link availability, cache capacity and MMD availability. Our simulation results conclusively show that all the proposed algorithms can reduce the service cost, balance the network load and achieve a high acceptance ratio.