Abstract
We consider problems involving how to schedule broadcasts in a pulled-based data-dissemination service, such as the DirecPC system, where data requested by the clients is delivered via broadcast. In particular, we consider the case where all the data items are of approximately equal in size and preemption is not allowed. We give an offline O(1)-speed O(1)-approximation algorithm for the problem of minimizing the average response time. We provide worst-case analysis, under various objective functions, of the online algorithms that have appeared in the literature, namely, Most Requests First, First Come First Served, and Longest Wait First.
Supported in part by NSF Grant CCR-9734927 and by ASOSR grant F49620010011.
Supported in part by NSF Grant CCR-9734927 and by ASOSR grant F49620010011.
Supported in part by a gift from AT&T
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S. Aacharya, and S. Muthukrishnan, “Scheduling on-demand broadcasts: new metrics and algorithms”, MobiCom, 1998. also at: http://www.bell-labs.com/user/acharya/papers/mobicom98.ps.gz/.
D. Aksoy, and M. Franklin, “RxW: A scheduling approach for large-scale on-demand data broadcast”, INFOCOM, 1998.
AirMedia website, http://www.airmedia.com.
Y. Bartal, and S. Muthukrishnan, “Minimizing Maximum Response Time in Scheduling Broadcasts”, 558–559, SODA, 2000.
E. Coffman, and P. Denning, Operating Systems Theory, Prentice-Hall, 1973.
DirecPC website, http://www.direcpc.com.
Hybrid website, http://www.hybrid.com.
Intel intercast website, http://www.intercast.com.
B. Kalyanasundaram, and K. Pruhs, “Speed is as powerful as clairvoyance”, IEEE Symposium on Foundations of Computation, 214–221, 1995.
E. Lawler, J.K. Lenstra, A. Rinnooy Kan, and D. Shmoys, “Sequencing and Scheduling: Algorithms and Complexity”, in S. Graves, A.Rinnooy Kan, and P. Zipkin (eds.), Logistics of Production and Inventory, Handbooks in OR & MS 4, Elsevier Science, Chapter 9, 445–522, 1993.
S. Leonardi, and D. Raz, “Approximating total flow time on parallel machines”, ACM Symposium on Theory of Computing, 110–119, 1997.
C. Phillips, C. Stein, E. Torng, and J. Wein“Optimal time-critical scheduling via resource augmentation”, ACM Symposium on Theory of Computing, 140–149, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kalyanasundaram, B., Pruhs, K., Velauthapillai, M. (2000). Scheduling Broadcasts in Wireless Networks. In: Paterson, M.S. (eds) Algorithms - ESA 2000. ESA 2000. Lecture Notes in Computer Science, vol 1879. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45253-2_27
Download citation
DOI: https://doi.org/10.1007/3-540-45253-2_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41004-1
Online ISBN: 978-3-540-45253-9
eBook Packages: Springer Book Archive