The age of information in gossip networks

Jori Selen, Yoni Nazarathy, Lachlan L. H. Andrew, Hai L. Vu

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

8 Citations (Scopus)


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 informationin 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.
Original languageEnglish
Title of host publicationAnalytical and Stochastic Modelling Techniques and Applications
Subtitle of host publication 20th International Conference, ASMTA 2013, Ghent, Belgium, July 2013, Proceedings
EditorsAlexander Dudin, Koen De Turck
Place of PublicationBerlin, Germany
PublisherSpringer-Verlag London Ltd.
Pages364 - 379
Number of pages16
ISBN (Print)9783642394072
Publication statusPublished - 2013
Externally publishedYes
EventInternational Conference on Analytical and Stochastic Modelling Techniques and Applications 2013 - Ghent, Belgium
Duration: 8 Jul 201310 Jul 2013
Conference number: 20th

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceInternational Conference on Analytical and Stochastic Modelling Techniques and Applications 2013
Abbreviated titleASMTA 2013


  • Gossip networks
  • Discrete time markov chains
  • Approximations
  • Minima of random variables

Cite this