The age of information in gossip networks

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

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

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 proceeding › Conference Paper › Research › peer-review

8 Citations (Scopus)

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 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 language	English
Title of host publication	Analytical and Stochastic Modelling Techniques and Applications
Subtitle of host publication	20th International Conference, ASMTA 2013, Ghent, Belgium, July 2013, Proceedings
Editors	Alexander Dudin, Koen De Turck
Place of Publication	Berlin, Germany
Publisher	Springer-Verlag London Ltd.
Pages	364 - 379
Number of pages	16
ISBN (Print)	9783642394072
DOIs	https://doi.org/10.1007/978-3-642-39408-9_26
Publication status	Published - 2013
Externally published	Yes
Event	International Conference on Analytical and Stochastic Modelling Techniques and Applications 2013 - Ghent, Belgium Duration: 8 Jul 2013 → 10 Jul 2013 Conference number: 20th

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	7984
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	International Conference on Analytical and Stochastic Modelling Techniques and Applications 2013
Abbreviated title	ASMTA 2013
Country	Belgium
City	Ghent
Period	8/07/13 → 10/07/13

Keywords

Gossip networks
Discrete time markov chains
Approximations
Minima of random variables

Access to Document

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

Link to Scopus publication

Cite this

Selen, J., Nazarathy, Y., Andrew, L. L. H., & Vu, H. L. (2013). The age of information in gossip networks. In A. Dudin, & K. De Turck (Eds.), Analytical and Stochastic Modelling Techniques and Applications: 20th International Conference, ASMTA 2013, Ghent, Belgium, July 2013, Proceedings (pp. 364 - 379). (Lecture Notes in Computer Science; Vol. 7984). Springer-Verlag London Ltd.. https://doi.org/10.1007/978-3-642-39408-9_26

Selen, Jori ; Nazarathy, Yoni ; Andrew, Lachlan L. H. ; Vu, Hai L. / The age of information in gossip networks. Analytical and Stochastic Modelling Techniques and Applications: 20th International Conference, ASMTA 2013, Ghent, Belgium, July 2013, Proceedings. editor / Alexander Dudin ; Koen De Turck. Berlin, Germany : Springer-Verlag London Ltd., 2013. pp. 364 - 379 (Lecture Notes in Computer Science).

@inproceedings{47d27421a8a246ffa03342633bb3a73b,

title = "The age of information in gossip networks",

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 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.",

keywords = "Gossip networks, Discrete time markov chains, Approximations, Minima of random variables",

author = "Jori Selen and Yoni Nazarathy and Andrew, {Lachlan L. H.} and Vu, {Hai L.}",

year = "2013",

doi = "10.1007/978-3-642-39408-9_26",

language = "English",

isbn = "9783642394072",

series = "Lecture Notes in Computer Science",

publisher = "Springer-Verlag London Ltd.",

pages = "364 -- 379",

editor = "Alexander Dudin and {De Turck}, Koen",

booktitle = "Analytical and Stochastic Modelling Techniques and Applications",

address = "Germany",

note = "International Conference on Analytical and Stochastic Modelling Techniques and Applications 2013, ASMTA 2013 ; Conference date: 08-07-2013 Through 10-07-2013",

}

Selen, J, Nazarathy, Y, Andrew, LLH & Vu, HL 2013, The age of information in gossip networks. in A Dudin & K De Turck (eds), Analytical and Stochastic Modelling Techniques and Applications: 20th International Conference, ASMTA 2013, Ghent, Belgium, July 2013, Proceedings. Lecture Notes in Computer Science, vol. 7984, Springer-Verlag London Ltd., Berlin, Germany, pp. 364 - 379, International Conference on Analytical and Stochastic Modelling Techniques and Applications 2013, Ghent, Belgium, 8/07/13. https://doi.org/10.1007/978-3-642-39408-9_26

The age of information in gossip networks. / Selen, Jori; Nazarathy, Yoni ; Andrew, Lachlan L. H.; Vu, Hai L.

Analytical and Stochastic Modelling Techniques and Applications: 20th International Conference, ASMTA 2013, Ghent, Belgium, July 2013, Proceedings. ed. / Alexander Dudin; Koen De Turck. Berlin, Germany : Springer-Verlag London Ltd., 2013. p. 364 - 379 (Lecture Notes in Computer Science; Vol. 7984).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

T1 - The age of information in gossip networks

AU - Selen, Jori

AU - Nazarathy, Yoni

AU - Andrew, Lachlan L. H.

AU - Vu, Hai L.

N1 - Conference code: 20th

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

KW - Gossip networks

KW - Discrete time markov chains

KW - Approximations

KW - Minima of random variables

UR - http://www.scopus.com/inward/record.url?scp=84884955762&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-39408-9_26

DO - 10.1007/978-3-642-39408-9_26

M3 - Conference Paper

SN - 9783642394072

T3 - Lecture Notes in Computer Science

SP - 364

EP - 379

BT - Analytical and Stochastic Modelling Techniques and Applications

A2 - Dudin, Alexander

A2 - De Turck, Koen

PB - Springer-Verlag London Ltd.

CY - Berlin, Germany

T2 - International Conference on Analytical and Stochastic Modelling Techniques and Applications 2013

Y2 - 8 July 2013 through 10 July 2013

ER -

Selen J, Nazarathy Y, Andrew LLH, Vu HL. The age of information in gossip networks. In Dudin A, De Turck K, editors, Analytical and Stochastic Modelling Techniques and Applications: 20th International Conference, ASMTA 2013, Ghent, Belgium, July 2013, Proceedings. Berlin, Germany: Springer-Verlag London Ltd. 2013. p. 364 - 379. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-642-39408-9_26