TY - JOUR
T1 - Optimal universal schedules for discrete broadcast
AU - Langberg, Michael
AU - Sprintson, Alexander
AU - Bruck, Jehoshua
N1 - Copyright:
Copyright 2013 Elsevier B.V., All rights reserved.
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 - http://www.scopus.com/inward/record.url?scp=5044249073&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???
AN - SCOPUS:5044249073
SN - 2157-8097
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 -