Optimal universal schedules for discrete broadcast

Michael Langberg; Alexander Sprintson; Jehoshua Bruck

Optimal universal schedules for discrete broadcast

Michael Langberg
, Alexander Sprintson
, Jehoshua Bruck

Department of Electrical Engineering

California Institute of Technology

Research output: Contribution to journal › Conference article › peer-review

5 Scopus citations

Abstract

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 language	English
Pages (from-to)	111
Number of pages	1
Journal	IEEE International Symposium on Information Theory - Proceedings
State	Published - 2004
Event	Proceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States Duration: Jun 27 2004 → Jul 2 2004

Cite this

@article{504927ff65854cbebf73d763ee88d2be,

title = "Optimal universal schedules for discrete broadcast",

abstract = "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.",

author = "Michael Langberg and Alexander Sprintson and Jehoshua Bruck",

year = "2004",

language = "English",

pages = "111",

journal = "IEEE International Symposium on Information Theory - Proceedings",

issn = "2157-8095",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "Proceedings - 2004 IEEE International Symposium on Information Theory ; Conference date: 27-06-2004 Through 02-07-2004",

}

TY - JOUR

T1 - Optimal universal schedules for discrete broadcast

AU - Langberg, Michael

AU - Sprintson, Alexander

AU - Bruck, Jehoshua

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/5044249073

M3 - Conference article

AN - SCOPUS:5044249073

SN - 2157-8095

SP - 111

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

T2 - Proceedings - 2004 IEEE International Symposium on Information Theory

Y2 - 27 June 2004 through 2 July 2004

ER -

Optimal universal schedules for discrete broadcast

Abstract

Other files and links

Fingerprint

Cite this