Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. Age-Optimal Causal Labeling of Memoryless Processes
 
conference paper

Age-Optimal Causal Labeling of Memoryless Processes

Inan, Yunus
•
Telatar, Emre  
August 3, 2022
2022 IEEE International Symposium on Information Theory (ISIT)
2022 IEEE International Symposium on Information Theory (ISIT)

We consider a problem of labeling a memoryless temporal point process. The labelings have to be done causally. We study the tradeoff between the rate and age of the labeled process and characterize the optimal tradeoff curve. We show that the optimal curve can be achieved with rather simple labeling procedures which repeatedly do the following: Wait for T time units and label the next arrival.

  • Details
  • Metrics
Type
conference paper
DOI
10.1109/ISIT50566.2022.9834803
Author(s)
Inan, Yunus
Telatar, Emre  
Date Issued

2022-08-03

Publisher

IEEE

Published in
2022 IEEE International Symposium on Information Theory (ISIT)
ISBN of the book

978-1-665421-60-7

Start page

2082

End page

2087

Subjects

Age of Information

•

Causal Labeling

•

Memoryless Process

•

Markov Decision Process

•

Policy Updates

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
LTHI  
Event nameEvent placeEvent date
2022 IEEE International Symposium on Information Theory (ISIT)

Espoo, Finland

June 26- July 1, 2022

Available on Infoscience
March 24, 2023
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/196380
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés