The age of information in gossip networks

Selen, Jori, Nazarathy, Yoni, Andrew, Lachlan L. H. and Vu, Hai L. (2013). The age of information in gossip networks. In: Alexander Dudin and Koen De Turck, Analytical and Stochastic Modelling Techniques and Applications - 20th International Conference, ASMTA 2013, Proceedings. 20th International Conference on Analytical and Stochastic Modelling Techniques and Applications, ASMTA 2013, Ghent, Belgium, (364-379). 8 - 10 July 2013. doi:10.1007/978-3-642-39408-9_26


Author Selen, Jori
Nazarathy, Yoni
Andrew, Lachlan L. H.
Vu, Hai L.
Title of paper The age of information in gossip networks
Conference name 20th International Conference on Analytical and Stochastic Modelling Techniques and Applications, ASMTA 2013
Conference location Ghent, Belgium
Conference dates 8 - 10 July 2013
Proceedings title Analytical and Stochastic Modelling Techniques and Applications - 20th International Conference, ASMTA 2013, Proceedings   Check publisher's open access policy
Journal name Lecture Notes in Computer Science   Check publisher's open access policy
Place of Publication Heidelberg, Germany
Publisher Springer
Publication Year 2013
Year available 2013
Sub-type Fully published paper
DOI 10.1007/978-3-642-39408-9_26
Open Access Status DOI
ISBN 9783642394072
9783642394089
ISSN 0302-9743
1611-3349
Editor Alexander Dudin
Koen De Turck
Volume 7984
Start page 364
End page 379
Total pages 16
Language eng
Abstract/Summary 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.
Subjects 1700 Computer Science
2614 Theoretical Computer Science
Keyword Approximations
Discrete Time Markov Chains
Gossip Networks
Minima of Random Variables
Q-Index Code E1
Q-Index Status Confirmed Code
Institutional Status UQ

Document type: Conference Paper
Collections: School of Mathematics and Physics
Official 2014 Collection
 
Versions
Version Filter Type
Citation counts: Scopus Citation Count Cited 0 times in Scopus Article
Google Scholar Search Google Scholar
Created: Fri, 29 Nov 2013, 06:08:33 EST by System User on behalf of School of Mathematics & Physics