On-line stream merging, max span, and min coverage

Authors:
Wun-Tat Chan;Tak-Wah Lam;Hing-Fung Ting;Prudence W. H. Wong
Affiliations:
Department of Computing, Hong Kong Polytechnic University, Hong Kong;Department of Computer Science, University of Hong Kong, Hong Kong;Department of Computer Science, University of Hong Kong, Hong Kong;Department of Computer Science, University of Hong Kong, Hong Kong
Venue:
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Year:
2003

Citing 12
Cited 0

Adaptive piggybacking: a novel technique for data sharing in video-on-demand storage servers

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
Merging video streams in a multimedia storage server: complexity and heuristics

Multimedia Systems
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
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
Competitive Analysis of On-line Stream Merging Algorithms

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On-line stream merging in a general setting

Theoretical Computer Science - Computing and combinatorics
On-line scheduling of video streams

On-line scheduling of video streams

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces the notions of span and coverage for analyzing the performance of on-line algorithms for stream merging. We show that these two notions can solely determine the competitive ratio of any such algorithm. Furthermore, we devise a simple greedy algorithm that can attain the ideal span and coverage, thus giving a better performance guarantee than existing algorithms with respect to either the maximum bandwidth or the total bandwidth. The new notions also allow us to obtain a tighter analysis of existing algorithms.