NDLI: The age of gossip: spatial mean field regime

Please wait, while we are loading the content...

Efficient control of epidemics over random networks

Redundancy in network traffic: findings and implications

Topological transformation approaches to optimizing TCAM-based packet classification systems

The age of gossip: spatial mean field regime

Dynamic data compression in multi-hop wireless networks

Understanding intrinsic characteristics and system implications of flash memory based solid state drives

Neighbor-specific BGP: more flexible routing policies while improving global stability

Leveraging discarded samples for tighter estimation of multiple-set aggregates

Surprising results on task assignment in server farms with high-variability workloads

Botnet spam campaigns can be long lasting: evidence, implications, and analysis

Unveiling core network-wide communication patterns through application traffic activity graph decomposition

Reference-driven performance anomaly identification

Scheduling in multi-channel wireless networks: rate function optimality in the small-buffer regime

Optimal power allocation in server farms

DRAM errors in the wild: a large-scale field study

Delay tolerant bulk data transfers on the internet

Maximum likelihood estimation of the flow size distribution tail index from sampled packet data

MapReduce optimization using regulated dynamic prioritization

Inferring undesirable behavior from P2P traffic analysis

On the treeness of internet latency and bandwidth

Node weighted scheduling

Network adiabatic theorem: an efficient randomized protocol for contention resolution

Evaluating the impact of job scheduling and power management on processor lifetime for chip multiprocessors

Restrained utilization of idleness for transparent scheduling of background tasks

Cooperative content distribution and traffic engineering in an ISP network

Modeling channel popularity dynamics in a large IPTV system

Self-adaptive admission control policies for resource-sharing systems

The age of gossip: spatial mean field regime

Content Provider	ACM Digital Library
Author	Chaintreau, Augustin Ristanovic, Nikodin Le Boudec, Jean-Yves
Abstract	Disseminating a piece of information, or updates for a piece of information, has been shown to benefit greatly from simple randomized procedures, sometimes referred to as gossiping, or epidemic algorithms. Similarly, in a network where mobile nodes occasionally receive updated content from a base station, gossiping using opportunistic contacts allows for recent updates to be efficiently maintained, for a large number of nodes. In this case, however, gossiping depends on node mobility. For this reason, we introduce a new gossip model, with mobile nodes moving between different classes that can represent locations or states, which determine gossiping behavior of the nodes. Here we prove that, when the number of mobile nodes becomes large, the age of the latest updates received by mobile nodes approaches a deterministic mean-field regime. More precisely, we show that the occupancy measure of the process constructed, with the ages defined above, converges to a deterministic limit that can be entirely characterized by differential equations. This major simplification allows us to characterize how mobility, source inputs and gossiping influence the age distribution for low and high ages. It also leads to a scalable numerical evaluation of the performance of mobile update systems, which we validate (using a trace of 500 taxicabs) and use to propose infrastructure deployment.
Starting Page	109
Ending Page	120
Page Count	12
File Format	PDF
ISBN	9781605585116
DOI	10.1145/1555349.1555363
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2009-06-15
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Epidemic Mean field Dynamic content Gossip Updates Infrastructure deployment
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

The age of gossip:spatial mean field regime

The age of gossip: spatial mean field regime (2009)

Automating the Mean-Field Method for Large Dynamic Gossip Networks

Automating the Mean-Field Method for Large Dynamic Gossip Networks

Dynamic Content Delivery Infrastructure Deployment using Network Cloud Resources

Parsimonious flooding in dynamic graphs

Mean-field analysis for the evaluation of gossip protocols (2008)

Mean-Field Analysis for the Evaluation of Gossip Protocols

Mean-field analysis for the evaluation of gossip protocols (2008)

The age of gossip: spatial mean field regime

Similar Documents

The age of gossip:spatial mean field regime

The age of gossip: spatial mean field regime (2009)

Automating the Mean-Field Method for Large Dynamic Gossip Networks

Automating the Mean-Field Method for Large Dynamic Gossip Networks

Dynamic Content Delivery Infrastructure Deployment using Network Cloud Resources

Parsimonious flooding in dynamic graphs

Mean-field analysis for the evaluation of gossip protocols (2008)

Mean-Field Analysis for the Evaluation of Gossip Protocols

Mean-field analysis for the evaluation of gossip protocols (2008)

The age of gossip: spatial mean field regime