Sciweavers

TIT
2008

Optimal Universal Schedules for Discrete Broadcast

13 years 11 months ago
Optimal Universal Schedules for Discrete Broadcast
In this paper we study the scenario in which a server sends dynamic data over a single broadcast channel to a number of passive clients. We consider the data to consist of discrete packets, where each update is sent in a separate packet. On demand, each client listens to the channel in order to obtain the most recent data packet. Such scenarios arise in many practical applications such as the distribution of weather and traffic updates to wireless mobile devices and broadcasting stock price information over the Internet. To satisfy a request, a client must listen to at least one packet from beginning to end. We thus consider the design of a broadcast schedule which minimizes the time that passes between a clients request and the time that it hears a new data packet, i.e., the waiting time of the client. Previous studies have addressed this objective, assuming that client requests are distributed uniformly over time. However, in the general setting, the clients behavior is difficult to...
Michael Langberg, Alexander Sprintson, Jehoshua Br
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2008
Where TIT
Authors Michael Langberg, Alexander Sprintson, Jehoshua Bruck
Comments (0)