Skip to main content
SpringerLink
Log in

Fair Scheduling Under Packet Management: Competitive Analysis of Age of Information

  • Conference paper
  • First Online:
Algorithmics of Wireless Networks (ALGOWIN 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14061))

Included in the following conference series:

  • 72 Accesses

Abstract

Maintaining up-to-date information is essential for enhancing the quality of service in mobile devices. The freshness of a mobile device is typically evaluated using the Age of Information (AoI) metric. This study considers a system where a Base Station (BS) transmits update messages to its terminals, and the goal is to design message transmission scheduling algorithms that minimize the overall AoI across all terminals. Previous studies have demonstrated that online algorithms perform poorly when the BS is required to send every message. However, in many applications, once a new message is generated, older ones can be discarded. This policy is called packet management. We prove that Round Robin (RR) is O(1)-competitive under packet management. We also generalize RR and consider a broader class of fair scheduling algorithms.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • 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

Institutional subscriptions

References

  1. Bedewy, A.M., Sun, Y., Kompella, S., Shroff, N.B.: Age-optimal sampling and transmission scheduling in multi-source systems. In: Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 121–130 (2019)

    Google Scholar 

  2. Bedewy, A.M., Sun, Y., Kompella, S., Shroff, N.B.: Optimal sampling and scheduling for timely status updates in multi-source networks. IEEE Trans. Inf. Theory 67(6), 4019–4034 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  3. Farazi, S., Klein, A.G., Brown, D.R.: Average age of information in multi-source self-preemptive status update systems with packet delivery errors. In: 2019 53rd Asilomar Conference on Signals, Systems, and Computers, pp. 396–400. IEEE (2019)

    Google Scholar 

  4. Han, B., Zhu, Y., Jiang, Z., Sun, M., Schotten, H.D.: Fairness for freshness: optimal age of information based OFDMA scheduling with minimal knowledge. IEEE Trans. Wireless Commun. 20(12), 7903–7919 (2021)

    Article  Google Scholar 

  5. He, Q., Yuan, D., Ephremides, A.: Optimal link scheduling for age minimization in wireless systems. IEEE Trans. Inf. Theory 64(7), 5381–5394 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  6. Hsu, Y.P., Modiano, E., Duan, L.: Age of information: design and analysis of optimal scheduling algorithms. In: 2017 IEEE International Symposium on Information Theory (ISIT), pp. 561–565. IEEE (2017)

    Google Scholar 

  7. Jiang, Z., Krishnamachari, B., Zheng, X., Zhou, S., Niu, Z.: Timely status update in wireless uplinks: analytical solutions with asymptotic optimality. IEEE Internet Things J. 6(2), 3885–3898 (2019)

    Article  Google Scholar 

  8. Kadota, I., Sinha, A., Uysal-Biyikoglu, E., Singh, R., Modiano, E.: Scheduling policies for minimizing age of information in broadcast wireless networks. IEEE/ACM Trans. Netw. 26(6), 2637–2650 (2018)

    Article  Google Scholar 

  9. Kadota, I., Uysal-Biyikoglu, E., Singh, R., Modiano, E.: Minimizing the age of information in broadcast wireless networks. In: 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 844–851. IEEE (2016)

    Google Scholar 

  10. Kaul, S., Yates, R., Gruteser, M.: Real-time status: how often should one update? In: 2012 Proceedings IEEE INFOCOM, pp. 2731–2735. IEEE (2012)

    Google Scholar 

  11. Kuo, T.W.: Minimum age of information TDMA scheduling: Approximation algorithms and hardness results. IEEE Trans. Inf. Theory 66(12), 7652–7671 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kuo, T.W.: Competitive analyses of online minimum age of information transmission scheduling. In: IEEE INFOCOM 2022-IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp. 1–8. IEEE (2022)

    Google Scholar 

  13. Moltafet, M., Leinonen, M., Codreanu, M.: On the age of information in multi-source queueing models. IEEE Trans. Commun. 68(8), 5003–5017 (2020)

    Article  Google Scholar 

  14. Najm, E., Telatar, E.: Status updates in a multi-stream M/G/1/1 preemptive queue. In: IEEE Infocom 2018-IEEE Conference On Computer Communications Workshops (Infocom Wkshps), pp. 124–129. IEEE (2018)

    Google Scholar 

  15. Pappas, N., Gunnarsson, J., Kratz, L., Kountouris, M., Angelakis, V.: Age of information of multiple sources with queue management. In: 2015 IEEE international conference on communications (ICC), pp. 5935–5940. IEEE (2015)

    Google Scholar 

  16. Sun, J., Jiang, Z., Krishnamachari, B., Zhou, S., Niu, Z.: Closed-form whittle’s index-enabled random access for timely status update. IEEE Trans. Commun. 68(3), 1538–1551 (2019)

    Article  Google Scholar 

  17. Sun, Y., Cyr, B.: Sampling for data freshness optimization: non-linear age functions. J. Commun. Netw. 21(3), 204–219 (2019)

    Article  Google Scholar 

  18. Yates, R.D., Kaul, S.K.: The age of information: real-time status updating by multiple sources. IEEE Trans. Inf. Theory 65(3), 1807–1827 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  19. Yates, R.D., Sun, Y., Brown, D.R., Kaul, S.K., Modiano, E., Ulukus, S.: Age of information: an introduction and survey. IEEE J. Sel. Areas Commun. 39(5), 1183–1210 (2021)

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported in part by the Ministry of Science and Technology of Taiwan under Contract MOST 111-2221-E-004-003-MY2. This work was also financially supported by the “Research Center for Chinese Cultural Metaverse in Taiwan” of National Chengchi University (NCCU) from The Featured Areas Research Center Program within the framework of the Higher Education Sprout Project by the Ministry of Education (MOE) in Taiwan.

Author information

Authors and Affiliations

  1. Department of Computer Science, National Chengchi University, Taipei, Taiwan

    Chen-Rui Jien & Tung-Wei Kuo

Authors
  1. Chen-Rui Jien
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tung-Wei Kuo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tung-Wei Kuo .

Editor information

Editors and Affiliations

  1. Toronto Metropolitan University, Toronto, ON, Canada

    Konstantinos Georgiou

  2. Carleton University, Ottawa, ON, Canada

    Evangelos Kranakis

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Jien, CR., Kuo, TW. (2023). Fair Scheduling Under Packet Management: Competitive Analysis of Age of Information. In: Georgiou, K., Kranakis, E. (eds) Algorithmics of Wireless Networks. ALGOWIN 2023. Lecture Notes in Computer Science, vol 14061. Springer, Cham. https://doi.org/10.1007/978-3-031-48882-5_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-48882-5_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-48881-8

  • Online ISBN: 978-3-031-48882-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation