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 -