Skip to main content

Periodic Scheduling with Costs Revisited

A Novel Approach for Wireless Broadcasting

  • Conference paper
  • 1166 Accesses

Part of the Lecture Notes in Computer Science book series (LNCCN,volume 7277)

Abstract

Periodic broadcast scheduling typically considers a set of discrete data items, characterized by their popularity, size and scheduling cost. A classic goal is the definition of an infinite, periodic schedule that yields minimum mean client serving time and minimum mean scheduling cost at the same time. This task has been proven to be NP-Hard and more recent works have discarded the scheduling cost attribute, focusing only on the minimization of the mean client serving time. In the context of the present work the scheduling cost is reinstated. An analysis-based scheduling technique is presented, which can practically minimize the mean client serving time and the mean scheduling cost concurrently. Comparison with related approaches yields superior performance in all test cases.

Keywords

  • periodic scheduling
  • broadcast cost
  • wireless transmission

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jacobson, V., Smetters, D.K., Thornton, J.D., Plass, M.F., Briggs, N.H., Braynard, R.L.: Networking named content. In: Proceedings of the 5th ACM Conference on Emerging Network Experiment and Technology (CoNEXT 2009), Rome, Italy, pp. 1–12 (December 2009)

    Google Scholar 

  2. Nicopolitidis, P., Papadimitriou, G., Pomportsis, A.: Continuous Flow Wireless Data Broadcasting for High-Speed Environments. IEEE Transactions on Broadcasting 55(2), 260–269 (2009)

    CrossRef  Google Scholar 

  3. Acharya, S., Alonso, R., Franklin, M., Zdonik, S.: Broadcast disks. ACM SIGMOD Record 24(2), 199–210 (1995)

    CrossRef  Google Scholar 

  4. Liaskos, C., Petridou, S., Papadimitriou, G.: Towards Realizable, Low-Cost Broadcast Systems for Dynamic Environments. IEEE/ACM Transactions on Networking 19(2), 383–392 (2011)

    CrossRef  Google Scholar 

  5. Vaidya, N.H., Hameed, S.: Scheduling data broadcast in asymmetric communication environments. Wireless Networks 5(3), 171–182 (1999)

    CrossRef  Google Scholar 

  6. Kakali, V.L., Sarigiannidis, P.G., Papadimitriou, G.I., Pomportsis, A.S.: A Novel Adaptive Framework for Wireless Push Systems Based on Distributed Learning Automata. Wireless Personal Communications 57(4), 591–606 (2011)

    CrossRef  Google Scholar 

  7. Schabanel, N.: The Data Broadcast Problem with Preemption. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 181–192. Springer, Heidelberg (2000)

    CrossRef  Google Scholar 

  8. Kenyon, C., Schabanel, N.: The Data Broadcast Problem with Non-Uniform Transmission Times. Algorithmica 35(2), 146–175 (2002)

    CrossRef  MathSciNet  Google Scholar 

  9. Gondhalekar, V., Jain, R., Werth, J.: Scheduling on airdisks: efficient access to personalized information services via periodic wireless data broadcast. In: Proceedings of the 1997 International Conference on Communications (ICC 1997), Montreal, Canada, pp. 1276–1280. IEEE (June 1997)

    Google Scholar 

  10. Gecsei, J.: The Architecture of Videotex Systems. Prentice-Hall, Englewood Cliffs (1983)

    Google Scholar 

  11. Su, C.J., Tassiulas, L.: Broadcast scheduling for information distribution. In: Proceedings of the 17th Annual IEEE Conference on Computer Communications, INFOCOM 1997, Kobe, Japan, pp. 109–117. IEEE Comput. Soc. Press (April 1997)

    Google Scholar 

  12. Liaskos, C., Petridou, S., Papadimitriou, G., Nicopolitidis, P., Obaidat, M., Pomportsis, A.: Clustering-driven Wireless Data Broadcasting. IEEE Wireless Comm. Magazine 16, 80–87 (2009)

    CrossRef  Google Scholar 

  13. Liaskos, C., Petridou, S., Papadimitriou, G., Nicopolitidis, P., Pomportsis, A.: On the Analytical Performance Optimization of Wireless Data Broadcasting. IEEE Transactions on Vehicular Technology 59, 884–895 (2010)

    CrossRef  Google Scholar 

  14. Liaskos, C., Petridou, S., Papadimitriou, G.: Cost-Aware Wireless Data Broadcasting. IEEE Transactions on Broadcasting 56(1), 66–76 (2010)

    CrossRef  Google Scholar 

  15. Xu, J., Tang, X., Lee, W.-C.: Time-critical on-demand data broadcast: algorithms, analysis, and performance evaluation. IEEE Transactions on Parallel and Distributed Systems 17(1), 3–14 (2006)

    CrossRef  Google Scholar 

  16. Zheng, B., Wu, X., Jin, X., Lee, D.L.: TOSA: a near-optimal scheduling algorithm for multi-channel data broadcast. In: Proceedings of the 6th International Conference on Mobile Data Management (MDM 2005), Ayia Napa, Cyprus, pp. 29–37 (May 2005)

    Google Scholar 

  17. Hu, C.-L., Chen, M.-S.: Online Scheduling Sequential Objects with Periodicity for Dynamic Information Dissemination. IEEE Transactions on Knowledge and Data Engineering 21(2), 273–286 (2009)

    CrossRef  Google Scholar 

  18. Poor, H.V., Hadjiliadis, O.: Quickest detection. Cambridge University Press, Cambridge (2009), http://www.worldcat.org/oclc/637444316

    MATH  Google Scholar 

  19. Bansal, N., Coppersmith, D., Sviridenko, M.: Improved Approximation Algorithms for Broadcast Scheduling. SIAM Journal on Computing 38(3), 1157 (2008)

    CrossRef  MathSciNet  MATH  Google Scholar 

  20. Xu, J., Lee, D.-L., Hu, Q., Lee, W.-C.: Data Broadcast. In: Stojmenović, I., Zomaya, A.Y. (eds.) Wiley Series on Parallel and Distributed Computing, pp. 243–265. John Wiley & Sons, Inc., New York (2002)

    Google Scholar 

  21. Chen, M.-S., Wu, K.-L., Yu, P.: Optimizing index allocation for sequential data broadcasting in wireless mobile computing. IEEE Transactions on Knowledge and Data Engineering 15(1), 161–173 (2003)

    CrossRef  Google Scholar 

  22. Pietronero, L., Tosatti, E., Tosatti, V., Vespignani, A.: Explaining the uneven distribution of numbers in nature: The laws of Benford and Zipf. Physica A: Statistical Mechanics and its Applications 293(1-2), 297–304 (2001)

    CrossRef  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liaskos, C., Xeros, A., Papadimitriou, G.I., Lestas, M., Pitsillides, A. (2012). Periodic Scheduling with Costs Revisited. In: Koucheryavy, Y., Mamatas, L., Matta, I., Tsaoussidis, V. (eds) Wired/Wireless Internet Communication. WWIC 2012. Lecture Notes in Computer Science, vol 7277. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30630-3_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30630-3_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30629-7

  • Online ISBN: 978-3-642-30630-3

  • eBook Packages: Computer ScienceComputer Science (R0)