Optimal universal schedules for discrete broadcast

Michael Langberg, Alexander Sprintson, Jehoshua Bruck

Research output: Contribution to journalConference articlepeer-review


The efficient schedules for sending dynamic data over lossless broadcast channels were investigated. A system was considered which the server periodically transmits highly dynamic data to a number of passive clients. The case in which the data consists of discrete packets, where each update is sent in a separate packet. A scheduling strategy which promises an expected waiting time lower than one was also presented.

Original languageEnglish
Pages (from-to)111
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
StatePublished - 2004
Externally publishedYes
EventProceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States
Duration: 27 Jun 20042 Jul 2004


Dive into the research topics of 'Optimal universal schedules for discrete broadcast'. Together they form a unique fingerprint.

Cite this