Optimal universal schedules for discrete broadcast

Michael Langberg; Alexander Sprintson; Jehoshua Bruck

doi:10.1109/ISIT.2004.1365148

Optimal universal schedules for discrete broadcast

Michael Langberg
, Alexander Sprintson
, Jehoshua Bruck

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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
Title of host publication	Proceedings - 2004 IEEE International Symposium on Information Theory
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	111
Number of pages	1
ISBN (Print)	0780382803
DOIs	https://doi.org/10.1109/ISIT.2004.1365148
State	Published - 2004
Externally published	Yes
Event	2004 IEEE International Symposium on Information Theory, ISIT 2004 - Chicago, IL, United States Duration: 27 Jun 2004 → 2 Jul 2004

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8095

Conference

Conference	2004 IEEE International Symposium on Information Theory, ISIT 2004
Country/Territory	United States
City	Chicago, IL
Period	27/06/04 → 2/07/04

Access to Document

10.1109/ISIT.2004.1365148

Cite this

@inproceedings{11dd0f6155544715b8c81027d1196feb,

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",

doi = "10.1109/ISIT.2004.1365148",

language = "אנגלית",

isbn = "0780382803",

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

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

pages = "111",

booktitle = "Proceedings - 2004 IEEE International Symposium on Information Theory",

address = "ארצות הברית",

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

}

Langberg, M, Sprintson, A & Bruck, J 2004, Optimal universal schedules for discrete broadcast. in Proceedings - 2004 IEEE International Symposium on Information Theory. IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 111, 2004 IEEE International Symposium on Information Theory, ISIT 2004, Chicago, IL, United States, 27/06/04. https://doi.org/10.1109/ISIT.2004.1365148

Optimal universal schedules for discrete broadcast. / Langberg, Michael; Sprintson, Alexander; Bruck, Jehoshua.
Proceedings - 2004 IEEE International Symposium on Information Theory. Institute of Electrical and Electronics Engineers Inc., 2004. p. 111 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

U2 - 10.1109/ISIT.2004.1365148

DO - 10.1109/ISIT.2004.1365148

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:5044249073

SN - 0780382803

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 111

BT - Proceedings - 2004 IEEE International Symposium on Information Theory

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2004 IEEE International Symposium on Information Theory, ISIT 2004

Y2 - 27 June 2004 through 2 July 2004

ER -

Optimal universal schedules for discrete broadcast

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this