ACM Home Page
Please provide us with feedback. Feedback
An efficient bandwidth-sharing technique for true video on demand systems
Full text PdfPdf (499 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: 211 - 214  
Year of Publication: 1999
ISBN:1-58113-151-8
Authors
Ying Cai  School of Computer Science, University of Central Florida, Orlando, FL
Kien A. Hua  School of Computer Science, University of Central Florida, Orlando, FL
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): 1,   Downloads (12 Months): 21,   Citation Count: 17
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.319607
What is a DOI?

ABSTRACT

Patching is a cost efficient channel-sharing technique for video-on-demand systems. However, its performance is limited due to the fact that a video stream cannot be shared unless it delivers the video in its entirety. As a result, larger and larger patches are required to serve new requests as the temporal distance increases. To avoid the overwhelming accumulation of patching cost, the entire video must be delivered frequently. In this paper, we address this problem by introducing a new technique called Transition Patching. Our performance study shows that the new scheme outperforms the existing approach under all scenarios. In particular, the performance gain is more significant when the request rate is higher. We note that such improvement is achieved without extra download bandwidth required at the client site. The implementation cost, therefore, is the same as the original Patching scheme.


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
 
2
 
3
 
4
 
5
S. Sheu, Kien A. Hua, and W. Tavanapong. Dynamic grouping: An efficient buffer management scheme for video-on-demand servers. In Proc. of 2nd Int'l Conference on Multimedia Information Systems, April 1997,
6
 
7
 
8
Ying Cai, Kien A. Hua, and Khanh Vu. Optimizing patching performance. In Proc. of SPIE's Conf. on Multimedia Computing and Networking (MMCN'99), pages 204-216, San Jose, CA, USA, January 1999.
 
9

CITED BY  17