A Caltech Library Service

Optimal universal schedules for discrete broadcast

Langberg, Michael and Sprintson, Alexander and Bruck, Jehoshua (2005) Optimal universal schedules for discrete broadcast. In: IEEE International Symposium on Information Theory (ISIT '04), Chicago, IL, 27 June-2 July, 2004. IEEE , Piscataway, NJ, p. 111. ISBN 0-7803-8280-3

See Usage Policy.


Use this Persistent URL to link to this item:


This paper investigates an efficient scheduling for sending dynamic data over lossless broadcast channels. A server transmits dynamic data periodically to a number of passive clients and thus the updated discrete packets are sent into a separate packet. The objective of this paper is to design universal schedules that minimize the time that passes between a client's request and the broadcast of a new item, independently of the client's behavior. From the results the optimal scheduling of high transmission rate for discrete broadcast data is obtained by considering adaptive clients.

Item Type:Book Section
Additional Information:© Copyright 2004 IEEE. Reprinted with permission. Posted online 10 January 2005 This work was supported in part by the Caltech Lee Center for Advanced Networking and by NSF grant ANI-0322475. We would like to thank Kevin Foltz for useful discussions.
Record Number:CaltechAUTHORS:LANisit04
Persistent URL:
Alternative URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:2611
Deposited By: Archive Administrator
Deposited On:12 Apr 2006
Last Modified:26 Dec 2012 08:50

Repository Staff Only: item control page