ACM Home Page
Please provide us with feedback. Feedback
Loss-resilient on-demand media streaming using priority encoding
Full text PdfPdf (184 KB)
Source International Multimedia Conference archive
Proceedings of the 12th annual ACM international conference on Multimedia table of contents
New York, NY, USA
SESSION: Technical session 4: multimedia streaming table of contents
Pages: 152 - 159  
Year of Publication: 2004
ISBN:1-58113-893-8
Authors
Cheng Huang  Washington University in St. Louis, St. Louis, MO
Ramaprabhu Janakiraman  Washington University in St. Louis, St. Louis, MO
Lihao Xu  Washington University in St. Louis, St. Louis, MO
Sponsors
SIGMULTIMEDIA: ACM Special Interest Group on Multimedia
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 31,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1027527.1027555
What is a DOI?

ABSTRACT

A novel solution to the reliable multicast problem is the "digital fountain" approach, in which data is encoded with an erasure protection code before transmission, and receivers can recover the original data after receiving enough distinct encoded data. This solution, however, is not desirable for streaming media schemes in which it is preferable for parts of a movie to be available for consumption before the entire movie is received. Earlier work has proposed the use of Unequal Error Protection (UEP) codes, which permit some parts of the movie to be recovered before others. Unfortunately, a straightforward implementation of this solution can incur prohibitive coding complexity.

We outline an on-demand media streaming scheme involving a combination of segmentation and rateless encoding. Our solution reduces the coding complexity to feasible levels, while guaranteeing the least bandwidth consumption for a given playout delay and number of segments. We propose an efficient algorithm to find the optimal segmentation for single-layered and multi-layered transmissions, and analyze its performance under network packet loss. Through analysis, numerical examples, and simulations, we demonstrate the feasibility and performance of the proposed 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
A. Albanese, J. Blomer, J. Edmonds, M. Luby, and M. Sudan. Priority Encoded Transmission. In Proceedings of IEEE FOCS 1994, pages 604--612, 1994.
2
 
3
C. Huang and L. Xu. Efficient FEC Codes for Data Loss Recovery. Techni-cal report, Washington University in St. Louis, June 2004. Available at http://www.nisl.wustl.edu.
 
4
 
5
A. Hu. Video-on-Demand Broadcasting Protocols: a Comprehensive Study. In Proceedings of IEEE INFOCOM 2001, pages 508--517, 2001.
 
6
J.-C. Bolot, S. Fosse-Parisis, and D. Towdley. Adaptive FEC-Based Error Control for Internet Telephony. In Proceedings of IEEE INFOCOM 1999, 1999.
 
7
J. G. Apostolopoulos. Reliable Video Communication Over Lossy Packet Networks Using Multiple State Encoding and Path Diversity. In Proceedings of MMCN 2002, 2002.
 
8
R. Janakiraman and L. Xu. Layered Priority-encoded Transmission for Video Streaming to Heterogeneous Clients. In Proceedings of IEEE ISIT 2004, July 2004.
9
10
 
11
 
12
 
13
V. Pless. Introduction to the Theory of Error-Correcting Codes. Wiley-Interscience, 1998.
 
14
M. A. Shokrollahi. Raptor codes. In Proceedings of IEEE ISIT 2004, July 2004.
 
15
 
16
L. Xu. Resource-Efficient Delivery of On-Demand Streaming Data Using UEP Codes. IEEE Transactions on Communications, 51(1):63--71, Jan. 2003.


Collaborative Colleagues:
Cheng Huang: colleagues
Ramaprabhu Janakiraman: colleagues
Lihao Xu: colleagues