ACM Home Page
Please provide us with feedback. Feedback
Zero-delay broadcasting protocols for video-on-demand
Full text PdfPdf (881 KB)
Source International Multimedia Conference archive
Proceedings of the seventh ACM international conference on Multimedia (Part 1) table of contents
Orlando, Florida, United States
Pages: 189 - 197  
Year of Publication: 1999
ISBN:1-58113-151-8
Authors
Jehan-François Pâris  Department of Computer Science, University of Houston, Houston, TX
Darrell D. E. Long  Jack Baskin School of Engineering, University of California, Santa Cruz, CA
Patrick E. Mantey  Jack Baskin School of Engineering, University of California, Santa Cruz, CA
Sponsors
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
SIGCOMM: ACM Special Interest Group on Data Communication
SIGMULTIMEDIA: ACM Special Interest Group on Multimedia
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 19,   Citation Count: 11
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/319463.319600
What is a DOI?

ABSTRACT

Broadcasting protocols for video-on-demand continuously retransmit videos that are watched simultaneously by many viewers. Nearly all broadcasting protocols assume that the client set-top box has enough storage to store between 48 and 60 minutes of video. We propose to use this storage to anticipate the customer requests and to preload, say, the first 3 minutes of the top 16 to 20 videos. This would provide instantaneous access to these videos and also eliminate the extra bandwidth required to handle compressed video signal. We present two broadcasting protocols using partial preloading to eliminate this extra bandwidth. The first of these protocols, Polyharmonic Broadcasting with Partial Preloading (PHB-PP), partitions each video into between 20 and 160 segments of equal duration and allocates a separate data stream to each individual segment. Our second protocol, the Mayan Temple Broadcasting protocol, uses fewer data streams but requires more overall bandwidth.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Aggarwal, C. C., J. L. Wolf, and P. S. Yu. A permutation-based pyramid broadcasting scheme for video-ondemand systems. Proc. International Conference on Multimedia Computing and Systems, pages 118-26, June 1996.
 
2
Beran, J., R. Sherman, M. Taqqu, and W. Willinger. Long-range dependence in variable bit-rate video traffic. IEEE Transactions on Communications, 43:1566-1579, 1995.
 
3
4
 
5
 
6
Eager, D., M. Fen-is and M. Vernon.. Optimized regional caching for on-demand data delivery. In Proc. 1999 Multimedia Computing and Networking Conference (MMCN'99), San Jose, CA, Jan. 1999.
7
8
 
9
Juhn, L. and L. Tseng. Harmonic broadcasting for videoon-demand service. IEEE Transactions on Broadcasting, 43(3): 268-271, Sept. 1997.
 
10
 
11
 
12
Sen, S., J. Rexford, and D. Towsley, Proxy prefix caching for multimedia streams. Proc. iEEE INFOCOM '99, March 1999.
 
13
 
14
Wong, J. W. Broadcast delivery. Proceedings of the IEEE, 76(12), 1566-1577, Dec. 1988.

CITED BY  11

Collaborative Colleagues:
Jehan-François Pâris: colleagues
Darrell D. E. Long: colleagues
Patrick E. Mantey: colleagues