IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v103y2023i1d10.1007_s11134-022-09852-w.html
   My bibliography  Save this article

Age of information using Markov-renewal methods

Author

Listed:
  • George Kesidis

    (School of EECS, The Pennsylvania State University)

  • Takis Konstantopoulos

    (The University of Liverpool)

  • Michael A. Zazanis

    (Athens University of Economics and Business)

Abstract

When designing a message transmission system, from the point of view of making sure that the information transmitted is as fresh as possible, two rules of thumb seem reasonable: use small buffers and adopt a last-in-first-out policy. In this paper, the freshness of information is interpreted as the recently studied “age of information” performance measure. Considering it as a stochastic process operating in a stationary regime, we compute the whole marginal distribution of the age of information for some well-performing systems. We assume that the arrival process is Poisson and that the messages have independent service times with common distribution, i.e., the M/GI model. We demonstrate the usefulness of Palm and Markov-renewal theory to derive results for Laplace transforms. Our numerical studies address some aspects of open questions regarding the optimality of previously proposed scheduling policies, and a policy newly considered herein, for AoI management.

Suggested Citation

  • George Kesidis & Takis Konstantopoulos & Michael A. Zazanis, 2023. "Age of information using Markov-renewal methods," Queueing Systems: Theory and Applications, Springer, vol. 103(1), pages 95-130, February.
    • Handle: RePEc:spr:queues:v:103:y:2023:i:1:d:10.1007_s11134-022-09852-w
    DOI: 10.1007/s11134-022-09852-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-022-09852-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11134-022-09852-w?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:queues:v:103:y:2023:i:1:d:10.1007_s11134-022-09852-w. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.