The S2 Piggybacking Policy

Authors:
Roberto De A. Façanha;Nelson L. S. Da Fonseca;Pedro J. De Rezende
Affiliations:
Institute of Computing, State University of Campinas, Campinas S.P., Brazil, PO Box 6176. facanha@dcc.unicamp.br;Institute of Computing, State University of Campinas, Campinas S.P., Brazil, PO Box 6176. nfonseca@dcc.unicamp.br;Institute of Computing, State University of Campinas, Campinas S.P., Brazil, PO Box 6176. rezende@dcc.unicamp.br
Venue:
Multimedia Tools and Applications
Year:
1999

Citing 7
Cited 0

Introduction to algorithms

Introduction to algorithms
Channel allocation under batching and VCR control in video-on-demand systems

Journal of Parallel and Distributed Computing - Special issue on multimedia processing and technology
Design and analysis of a look-ahead scheduling scheme to support pause-resume for video-on-demand applications

Multimedia Systems
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
Dynamic batching policies for an on-demand video server

Multimedia Systems
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In video-on-demand systems, users expect to watch a filmright after its selection. Nonetheless, such a short response time isfeasible only if there is available bandwidth. In line with that,several techniques have been proposed to reduce the huge bandwidthdemand on video servers. In this paper, we introduce the Piggybackingpolicy S^2, which adds a second level of optimization to the Snapshot policy. Moreover, we introduce a heuristic to reduce thecomplexity to generate the tree of superimposed video streams.