By Topic

Coding and scheduling for efficient loss-resilient data broadcasting

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Foltz, K. ; California Inst. of Technol., Pasadena, CA, USA ; Lihao Xu ; Bruck, J.

This paper examines the problem of sending data to clients over a broadcast channel in a way that minimizes the clients' expected waiting time for this data. This channel, however, is not completely reliable, and packets are occasionally lost. If items consist of k packets, k large, the loss of even a single packet can increase the expected waiting time by 167%. We propose and analyze two solutions that use coding to reduce this degradation. The resulting degradation is 67% for the first solution and less than 1% for the second. The second solution is extended to combat up to t packet losses per data item for any t≪k. This solution maintains near-optimal performance even with packet losses.

Published in:

Information Theory, 2003. Proceedings. IEEE International Symposium on

Date of Conference:

29 June-4 July 2003