Long-term movie popularity models in video-on-demand systems: or the life of an on-demand movie
MULTIMEDIA '97 Proceedings of the fifth ACM international conference on Multimedia
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Adaptive and lazy segmentation based proxy caching for streaming media delivery
NOSSDAV '03 Proceedings of the 13th international workshop on Network and operating systems support for digital audio and video
An efficient fully polynomial approximation scheme for the Subset-Sum problem
Journal of Computer and System Sciences
PROP: A Scalable and Reliable P2P Assisted Proxy Streaming System
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
SCAP: Smart Caching inWireless Access Points to Improve P2P Streaming
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Hi-index | 0.00 |
A collaborative access scheme that exploits the broadcast nature of the wireless communication in order to achieve multicast content delivery is presented in this paper. The key idea is that individual clients requesting for the same content can collaborate and share the same data channel. As opposed to broadcasting, this method enables the clients to determine online the delivered content, and thus supports on-demand services. On the other hand, a multicast content delivery is much more efficient than a unicast content distribution, which must use a dedicated data channel per each and every client. This method is particularly suitable for sessions having a long-time duration, for applications in which clients can subscribe to ahead of time, and for applications in which the clients receive the same information simultaneously. A multicast content distribution increases the network service throughput in terms of the expected number of clients served simultaneously, and therefore it offers a reduced waiting time for content delivery at highly loaded time periods. It is shown that the problem of maximizing the efficiency of distributing a content in a wireless network is NP-hard. An approximation algorithm is therefore used, that for any 0