Back to Search Start Over

Controlling Packet Drops to Improve Freshness of information

Authors :
Kavitha, Veeraruna
Altman, Eitan
Saha, Indrajit
Indian Institute of Technology Bombay (IIT Bombay)
Network Engineering and Operations (NEO )
Inria Sophia Antipolis - Méditerranée (CRISAM)
Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
Laboratoire Informatique d'Avignon (LIA)
Avignon Université (AU)-Centre d'Enseignement et de Recherche en Informatique - CERI
Laboratory of Information, Network and Communication Sciences (LINCS)
Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU)
Source :
Netgcoop 2020-International Conference on NETwork Games, Control and Optimisation, Netgcoop 2020-International Conference on NETwork Games, Control and Optimisation, Sep 2021, Cargese, France. ⟨10.1007/978-3-030-87473-5_7⟩, Netgcoop 2020-International Conference on NETwork Games, Control and Optimisation, Sep 2021, Cargese, France, Network Games, Control and Optimization ISBN: 9783030874728, NetGCooP
Publication Year :
2021
Publisher :
HAL CCSD, 2021.

Abstract

Many systems require frequent and regular updates of a certain information. These updates have to be transferred regularly from the source to the destination. We consider scenarios in which an old packet becomes completely obsolete, in the presence of a new packet. In this context, if a new packet arrives at the source while it is transferring a packet, one needs to decide the packet to be dropped. New packet has recent information, but might require more time to transfer. Thus it is not clear as to which packet to be dis- carded, and this is the main focus of the paper. Recently introduced performance metrics, called average age of information (AAoI) and peak age of information (PAoI) of the information available at the destination, are the relevant performance measures. These type of systems do not require storage buffers, of size more than one, at the source queue. We consider single source / multiple sources regularly updating information to a single destination possibly over wireless channels to derive optimal drop policies that optimize the AAoI. We showed that the state independent (static) policies like dropping always the old packets or dropping always the new packets is optimal in many scenarios, among an appropriate set of stationary Markov policies. We consider relevant games when multiple sources compete. In many scenarios, the non-cooperative solution almost minimizes the social objective, the sum of AAoIs of all the sources.<br />Comment: 12 pages and 3 figures

Details

Language :
English
ISBN :
978-3-030-87472-8
ISBNs :
9783030874728
Database :
OpenAIRE
Journal :
Netgcoop 2020-International Conference on NETwork Games, Control and Optimisation, Netgcoop 2020-International Conference on NETwork Games, Control and Optimisation, Sep 2021, Cargese, France. ⟨10.1007/978-3-030-87473-5_7⟩, Netgcoop 2020-International Conference on NETwork Games, Control and Optimisation, Sep 2021, Cargese, France, Network Games, Control and Optimization ISBN: 9783030874728, NetGCooP
Accession number :
edsair.doi.dedup.....dab7f038b8a6c577e72da6bc208a5956
Full Text :
https://doi.org/10.1007/978-3-030-87473-5_7⟩