Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Performance modeling of epidemic routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Relays, base stations, and meshes: enhancing mobile networks with infrastructure
Proceedings of the 14th ACM international conference on Mobile computing and networking
The age of impatience: optimal replication schemes for opportunistic networks
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Optimal monotone forwarding policies in delay tolerant mobile ad-hoc networks
Performance Evaluation
Incentivizing peer-assisted services: a fluid shapley value approach
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Distributed caching over heterogeneous mobile networks
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Optimal channel choice for collaborative ad-hoc dissemination
INFOCOM'10 Proceedings of the 29th conference on Information communications
On the age of pseudonyms in mobile ad hoc networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Globs in the primordial soup: the emergence of connected crowds in mobile wireless networks
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
How efficient can gossip be? (on the cost of resilient information exchange)
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Mean-field framework for performance evaluation of push-pull gossip protocols
Performance Evaluation
On the stability and optimality of universal swarms
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
On the stability and optimality of universal swarms
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Large-scale games in large-scale systems
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Information dissemination dynamics in delay tolerant network: a bipartite network approach
Proceedings of the third ACM international workshop on Mobile Opportunistic Networks
DTN support for news dissemination in an urban area
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed caching over heterogeneous mobile networks
Queueing Systems: Theory and Applications
Continuous approximation of collective system behaviour: A tutorial
Performance Evaluation
Combined optimal control of activation and transmission in delay-tolerant networks
IEEE/ACM Transactions on Networking (TON)
Predicting the impact of measures against P2P networks: transient behavior and phase transition
IEEE/ACM Transactions on Networking (TON)
Optimal management of dynamic information in Delay Tolerant Networks
The Journal of Supercomputing
Hi-index | 0.00 |
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.