Skip to main content
SpringerLink
Log in

Efficient algorithms for scheduling data broadcast

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

With the increasing acceptance of wireless technology, mechanisms to efficiently transmit information to wireless clients are of interest. The environment under consideration is asymmetric in that the information server has much more bandwidth available, as compared to the clients. It has been proposed that in such systems the server should broadcast the information periodically. A broadcast schedule determines what is broadcast by the server and when. This paper makes the simple, yet useful, observation that the problem of broadcast scheduling is related to the problem of fair queueing. Based on this observation, we present a log‐time algorithm for scheduling broadcast, derived from an existing fair queueing algorithm. This algorithm significantly improves the time‐complexity over previously proposed broadcast scheduling algorithms. Modification of this algorithm for transmissions that are subject to errors is considered. Also, for environments where different users may be listening to different number of broadcast channels, we present an algorithm to coordinate broadcasts over different channels. Simulation results are presented for proposed algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. Acharya, R. Alonso, M. Franklin and S. Zdonik, Broadcast disks-data management for asymmetric communications environment, in: Proc. of ACM SIGMOD Int. Conference on Management of Data(May 1995) pp. 199-210.

  2. S. Acharya, M. Franklin and S. Zdonik, Dissemination-based data delivery using broadcast disks, IEEE Personal Communications (December 1995) 50-60. S. Hameed, N.H. Vaidya / Efficient algorithms for scheduling data broadcast 193

  3. S. Acharya, M. Franklin and S. Zdonik, Prefetching from a broadcast disk, in: Proc. of 12th International Conference on Data Engineering(February 1996).

  4. M.H. Ammar and J.W. Wong, The design of teletext broadcast cycles, Performance Evaluation 5 (November 1985) 235-242.

    Google Scholar 

  5. M.H. Ammar and J.W. Wong, On the optimality of cyclic transmission in teletext systems, IEEE Transactions on Communications (January 1987) 68-73.

  6. S. Banerjee and V.O.K. Lee, Evaluating the distributed datacycle scheme for a high performance distributed system, Journal of Computing and Information 1 (May 1994).

  7. S. Banerjee, V.O.K. Lee and C. Wang, Distributed database systems in high-speed wide-area networks, IEEE Journal on Selected Areas in Communications 11 (May 1993) 617-630.

    Google Scholar 

  8. A. Bar-Noy, R. Bhatia, J. Naor and B. Schieber, Minimizing service and operation costs of periodic scheduling, Technical Report, Tel Aviv University (1997).

  9. J. Bennett and H. Zhang, Worst-case fair packet fair queueing algorithms, Technical Report, Computer Science, Carnegie Mellon University (1996).

  10. J.C.R. Bennett and H. Zhang, Wf2q: Worst-case fair weighted fair queueing, in: Proc. of INFOCOM '96 (March 1996).

  11. J.C.R. Bennett and H. Zhang, Hierarchical packet fair queueing algorithms, in: Proc. of ACM SIGCOMM '96 (1996) pp. 43-56.

  12. T.F. Bowen et al., The datacycle architecture, Communications of ACM 35 (December 1992) 71-81.

    Google Scholar 

  13. W.E. Boyce and R.C. DiPrima, Calculus(Wiley, New York, 1988).

    Google Scholar 

  14. M.-S. Chen, P.S. Yu and K.-L. Wu, Indexed sequential data broadcasting in wireless mobile computing, in: Proc. of International Conf. Distributed Computing Systems(1997) pp. 124-131.

  15. T. Chiueh, Scheduling for broadcast-based file systems, in: Proc. of MOBIDATA Workshop(November 1994).

  16. A. Datta, A. Celik, J.G. Kim, D.E. VanderMeer and V. Kumar, Adaptive broadcast protocols to support efficient and energy conserving retrieval from databases in mobile computing environments, in: Proc. of Data Engineering Conference(April 1997).

  17. J. Gescei, The Architecture of Videotex Systems(Prentice-Hall, Englewood Cliffs, NJ, 1983).

    Google Scholar 

  18. V.A. Gondhalekar, Scheduling periodic wireless data broadcast, M.S. thesis, The University of Texas at Austin, TX (December 1995).

    Google Scholar 

  19. V. Gondhalekar, R. Jain and J. Werth, Scheduling on airdisks: Effi-cient access to personalized information services via periodic wireless data broadcast, in: IEEE Int. Conf. Comm.(June 1997).

  20. A. Gurijala and U. Pooch, Propagating updates in asymmetric channels (a position paper), in: Proc. of 1st International Workshop on Satellite-based Information Services (WOSBIS)(November 1996) pp. 53-59.

  21. S. Hameed, Scheduling information broadcast in asymmetric environment, M.S. thesis, Department of Computer Science, Texas A&M University (May 1997).

  22. G. Herman, G. Gopal, K.C. Lee and A. Weinrib, The datacycle architecture for very high throughput, in: Proc. of ACM SIGMOD(1987).

  23. E. Horowitz and S. Sahni, Fundamentals of Data Structures in Pascal(Computer Science Press, Inc., 1984).

  24. T. Imielinski and S. Viswanathan, Adaptive wireless information systems, in: Proceedings of SIGDBS (Special Interest Group in Data-Base Systems) Conference(October 1994).

  25. T. Imielinski, S. Viswanathan and B.R. Badrinath, Energy efficient indexing on air, in: Proc. of International Conference on Management of Data(May 1994) pp. 25-36.

  26. T. Imielinski, S. Viswanathan and B.R. Badrinath, Data on the air-organization and access, IEEE Transactions of Data and Knowledge Engineering (July 1996).

  27. R. Jain and J. Werth, Airdisks and airraid: Modelling and scheduling periodic wireless data broadcast (extended abstract), DIMACS Technical Report 95-11, Rutgers University (May 1995).

  28. S. Keshav, On the efficient implementation of fair queueing, Journal of Internetworking: Research and Experience 2 (September 1991) 57-73.

    Google Scholar 

  29. P. Krishna, Personal communication on packet fair queueing and broadcast scheduling (1996).

  30. M. Shreedhar and G. Varghese, Efficient fair queuing using deficit round robin, in: Proc. of SIGCOMM '95, Cambridge, MA (1995).

  31. K. Stathatos, N. Roussopoulos and J.S. Baras, Adaptive data broadcasting using air-cache, in: Proc. of 1st International Workshop on Satellite-based Information Services (WOSBIS)(November 1996) pp. 30-37.

  32. C.-J. Su and L. Tassiulas, Novel information distribution methods to massive mobile user populations, Technical Report TR 97-46, ISR, University of Maryland (1997).

  33. N.H. Vaidya and S. Hameed, Data broadcast in asymmetric environments, in: Proc. of 1st International Workshop on Satellite-based Information Services (WOSBIS)(November 1996) pp. 38-52.

  34. N.H. Vaidya and S. Hameed, Improved algorithms for scheduling data broadcast, Technical Report 96-029, Computer Science Department, Texas A&M University, College Station (December 1996).

  35. N.H. Vaidya and S. Hameed, Scheduling data broadcast in asymmetric communication environments, Wireless Networks 5 (1999) 171-182, this issue.

    Google Scholar 

  36. S. Viswanathan, Publishing in wireless and wireline environments, Ph.D. thesis, Rutgers (November 1994).

  37. J.W. Wong, Broadcast delivery, in: Proceedings of IEEE(December 1988) pp. 1566-1577.

  38. J.W. Wong and M.H. Ammar, Analysis of broadcast delivery in a videotex system, IEEE Transactions on Computers 34 (September 1985) 863-866.

    Google Scholar 

  39. Z. Zdonik, R. Alonso, M. Franklin and S. Acharya, Are disks in the air, 'just pie in the sky?', in: Proc. of IEEE Workshop on Mobile Comp. System(December 1994). Sohail Hameed received a B.S. in computer engineering from NED University of Engineering and Technology, Pakistan, and an M.S. in computer science from Texas A&M University at College Station. He is currently a systems engineer at Compaq Computer Corporation. His research interests include broadcast scheduling and highreliability mass-storage system design. He is an associate member of the IEEE. Nitin Vaidya received the Ph.D. degree from the University of Massachusetts at Amherst in 1992. He previously received M.E. and B.E. (Hons) degrees from Indian Institute of Science, Bangalore, and the Birla Institute of Technology and Science, Pilani, respectively. He is currently an Associate Professor of Computer Science at the Texas A&M University. His research interests include networking, mobile computing and fault-tolerant computing. Nitin Vaidya is a recipient of a 1995 CAREER award from the National Science Foundation. He has served on program and organizing committees of several conferences. He is a member of the ACM and the IEEE Computer Society. E-mail: vaidya@cs.tamu.edu

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Texas A&M University, College Station, TX, 77843‐3112, USA

    Sohail Hameed & Nitin H. Vaidya

Authors
  1. Sohail Hameed
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nitin H. Vaidya
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hameed, S., Vaidya, N.H. Efficient algorithms for scheduling data broadcast. Wireless Networks 5, 183–193 (1999). https://doi.org/10.1023/A:1019194826654

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1019194826654

Keywords

Search

Navigation