Reducing I/O demand in video-on-demand storage servers
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer 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
Optimal time-critical scheduling via resource augmentation (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Online computation and competitive analysis
Online computation and competitive analysis
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Page replacement for general caching problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Trade-offs between speed and processor in hard-deadline scheduling
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Optimal and efficient merging schedules for video-on-demand servers
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
The Online Transportation Problem
SIAM Journal on Discrete Mathematics
Competitive on-line stream merging algorithms for media-on-demand
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
An 5-competitive on-line scheduler for merging video streams
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Speed is more powerful than clairvoyance
Nordic Journal of Computing
Competitive Analysis of On-line Stream Merging Algorithms
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
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
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling
Theoretical Computer Science
An optimal broadcasting protocol for mobile video-on-demand
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
On-line stream merging, max span, and min coverage
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
In this paper we consider the notion of relative competitive analysis, which is a simple generalization of the conventional competitive analysis and extra-resource analysis for on-line algorithms. We apply this analysis to study on-line schedulers for stream merging in two different video-on-demand (VOD) systems, which are based on two common approaches, namely, piggybacking and skimming. Our new analysis, in its simplest form, reveals a 3-competitive algorithm for stream merging based on skimming as well as piggybacking. This improves all previous results [4, 8]. We also show how to obtain guarantee on the performance improvement based on adding extra resources, and more interestingly, we provide a unified methodology to compare piggybacking and skimming. We believe that our result gives a clue to system designers for choosing desirable configurations.