Optimal Universal Schedules for Discrete Broadcast

We study broadcast systems that distribute a series of data updates to a large number of passive clients. The updates are sent over a broadcast channel in the form of discrete packets. We assume that clients periodically access the channel to obtain the most recent update. Such scenarios arise in many practical applications, such as distribution of traffic information and market updates to mobile wireless devices. Our goal is to design broadcast schedules that minimize the waiting time, i.e., the amount of time the client needs to wait in order to obtain the most recent update. We assume that each client has a different access pattern depending on the channel conditions, computing power, and storage capabilities. We introduce and analyze optimal universal schedules that guarantee low waiting time for any client, regardless of its behavior.

[1]  Mostafa H. Ammar.  Response Time in a Teletext System: An Individual User's Perspective , 1987, IEEE Trans. Commun..

[2]  Tomasz Imielinski,et al.  Data on Air: Organization and Access , 1997, IEEE Trans. Knowl. Data Eng..

[3]  Richard E. Ladner,et al.  Comparison of stream merging algorithms for media-on-demand , 2003, Multimedia Systems.

[4]  Jehoshua Bruck,et al.  Splitting schedules for internet broadcast communication , 2002, IEEE Trans. Inf. Theory.

[5]  Jehoshua Bruck,et al.  Scheduling for efficient data broadcast over two channels , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[6]  David R. Cheriton,et al.  Dissemination-Oriented Communication Systems. , 1996 .

[7]  J. Bruck,et al.  Time division is better than frequency division for periodic Internet broadcast of dynamic data , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[8]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[9]  Jehoshua Bruck,et al.  Coding and scheduling for efficient loss-resilient data broadcasting , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[10]  Randeep Bhatia,et al.  Minimizing service and operation costs of periodic scheduling , 2002, SODA '98.

[11]  Nitin H. Vaidya,et al.  Scheduling data broadcast in asymmetric communication environments , 1999, Wirel. Networks.

[12]  Richard M. Karp,et al.  Optimization problems in congestion control , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[13]  Mostafa H. Ammar,et al.  The Design of Teletext Broadcast Cycles , 1985, Perform. Evaluation.

[14]  Kirk Pruhs,et al.  A maiden analysis of longest wait first , 2005, TALG.

[15]  Michael Langberg,et al.  Optimal universal schedules for discrete broadcast , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[16]  Sujeong Choi,et al.  Scheduling Data Broadcast Based on Multi-Frequency in Mobile Interactive Broadcasting , 2007, IEEE Transactions on Broadcasting.

[17]  Claire Mathieu,et al.  Polynomial-time approximation scheme for data broadcast , 2000, STOC '00.

[18]  Jianliang Xu,et al.  Time-critical on-demand data broadcast: algorithms, analysis, and performance evaluation , 2006, IEEE Transactions on Parallel and Distributed Systems.

[19]  Kirk Pruhs,et al.  Multicast Pull Scheduling: When Fairness Is Fine , 2003, Algorithmica.

[20]  Nitin H. Vaidya,et al.  Log-time algorithms for scheduling single and multiple channel data broadcast , 1997, MobiCom '97.

[21]  Richard E. Ladner,et al.  Efficient Algorithms for Optimal Stream Merging for Media-on-Demand , 2004, SIAM J. Comput..

[22]  Richard E. Ladner,et al.  Optimal delay for media-on-demand with pre-loading and pre-buffering , 2008, Theor. Comput. Sci..

[23]  Rafael Alonso,et al.  Broadcast disks: data management for asymmetric communication environments , 1995, SIGMOD '95.

[24]  Jehoshua Bruck,et al.  Robustness of time-division schedules for Internet broadcast , 2002, Proceedings IEEE International Symposium on Information Theory,.

[25]  Mostafa H. Ammar,et al.  Analysis of Broadcast Delivery in a Videotex System , 1985, IEEE Transactions on Computers.

[26]  Nitin H. Vaidya,et al.  Data Broadcast in Asymmetric Wireless Environments , 1996 .

[27]  Richard E. Ladner,et al.  Optimal Delay for Media-on-Demand with Pre-loading and Pre-buffering , 2006, SIROCCO.

[28]  Richard E. Ladner,et al.  Off-line and on-line guaranteed start-up delay for Media-on-Demand with stream merging , 2006, J. Discrete Algorithms.