The Age of Information in Gossip Networks

  • Jori Selen
  • Yoni Nazarathy
  • Lachlan L. H. Andrew
  • Hai L. Vu
Conference paper

DOI: 10.1007/978-3-642-39408-9_26

Volume 7984 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Selen J., Nazarathy Y., Andrew L.L.H., Vu H.L. (2013) The Age of Information in Gossip Networks. In: Dudin A., De Turck K. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2013. Lecture Notes in Computer Science, vol 7984. Springer, Berlin, Heidelberg

Abstract

We introduce models of gossip based communication networks in which each node is simultaneously a sensor, a relay and a user of information. We model the status of ages of information between nodes as a discrete time Markov chain. In this setting a gossip transmission policy is a decision made at each node regarding what type of information to relay at any given time (if any). When transmission policies are based on random decisions, we are able to analyze the age of information in certain illustrative structured examples either by means of an explicit analysis, an algorithm or asymptotic approximations. Our key contribution is presenting this class of models.

Keywords

Gossip Networks Discrete Time Markov Chains Approximations Minima of Random Variables 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Jori Selen
    • 1
  • Yoni Nazarathy
    • 2
    • 3
  • Lachlan L. H. Andrew
    • 3
  • Hai L. Vu
    • 3
  1. 1.Department of Mechanical EngineeringEindhoven University of TechnologyEindhovenNetherlands
  2. 2.School of Mathematics and PhysicsThe University of QueenslandBrisbaneAustralia
  3. 3.Faculty of ICTSwinburne University of TechnologyMelbourneAustralia