Dynamic batching policies for an on-demand video server
Multimedia Systems
On optimal piggyback merging policies for video-on-demand systems
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Metropolitan area video-on-demand service using pyramid broadcasting
Multimedia Systems
Skyscraper broadcasting: a new broadcasting scheme for metropolitan video-on-demand systems
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Patching: a multicast technique for true video-on-demand services
MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
Improving bandwidth efficiency of video-on-demand servers
IC3N '97 Selected papers of the 6th international conference on Computer communications and networks
Optimal and efficient merging schedules for video-on-demand servers
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
Competitive on-line stream merging algorithms for media-on-demand
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A unified analysis of hot video schedulers
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The dyadic stream merging algorithm
Journal of Algorithms
Minimizing Bandwidth Requirements for On-Demand Data Delivery
IEEE Transactions on Knowledge and Data Engineering
On-line stream merging in a general setting
Theoretical Computer Science - Computing and combinatorics
Efficient Broadcasting Protocols for Video on Demand
MASCOTS '98 Proceedings of the 6th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Efficient Algorithms for Optimal Stream Merging for Media-on-Demand
SIAM Journal on Computing
A Permutation-Based Pyramid Broadcasting Scheme for Video-on-Demand Systems
ICMCS '96 Proceedings of the 1996 International Conference on Multimedia Computing and Systems
On Optimal Batching Policies for Video-on-Demand Storage Servers
ICMCS '96 Proceedings of the 1996 International Conference on Multimedia Computing and Systems
Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Bandwidth usage distribution of multimedia servers using Patching
Computer Networks: The International Journal of Computer and Telecommunications Networking
On-line stream merging, max span, and min coverage
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
| Hi-index | 0.00 |
A popular approach to reduce the server bandwidth in a video-on-demand system is to merge the streams initiated at different times. In recent years, a number of on-line algorithms for stream merging have been proposed; the objective is to minimize either the total bandwidth or the maximum bandwidth over all time. The performance of these algorithms was better understood with respect to the first objective. In particular, the connector algorithm [9] is known to be O(1)- competitive, and the dyadic algorithm [12] is known to have an almost tight bounds on its average total bandwidth requirement. For minimizing maximum bandwidth, existing results are limited to empirical studies only and no algorithm has been known to be competitive. The main contribution of this paper is the first competitive analysis of the connector and the dyadic algorithms with respect to the maximum bandwidth, showing that both algorithms are 4-competitive. We also give a worstcase analysis of the dyadic algorithm with respect to the total bandwidth, revealing that the dyadic algorithm can be tuned to be 3-competitive.