A unified analysis of hot video schedulers
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Competitive on-line stream merging algorithms for media-on-demand
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
On-line Stream Merging with Max Span and Min Coverage
Theory of Computing Systems
An effective batching scheme utilizing the segment interval time for wireless IPTV
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
| Hi-index | 0.00 |
The advance of wireless and mobile technology introduces a new type of Video-on-Demand (VOD) systems, namely the mobile VOD systems, that provide VOD services to mobile clients. It is a challenge to design broadcasting protocols for such systems because of the following special requirements: (1) fixed maximum bandwidth requirement: the maximum bandwidth required for broadcasting a video should be fixed and independent of the number of requests, (2) load adaptivity: the total bandwidth should be dependent on the number of requests; the fewer the requests the smaller the total bandwidth usage, and (3) clients sensitivity: the system should be able to support clients with a wide range of heterogeneous capabilities. In the literature, there are some partial solutions that give protocols meeting one or two of the above requirements. In this paper, we give the first protocol that meets all of the three requirements. The performance of our protocol is optimal up to a small constant factor.