Discovery Through Gossip

Random Struct. Algorithms, Volume 48, Issue 3, 2016, Pages 565-587.

Cited by: 0|Bibtex|Views13
EI
Other Links: dblp.uni-trier.de|arxiv.org

Abstract:

We study randomized gossip-based processes in dynamic networks that are motivated by discovery processes in large-scale distributed networks like peer-to-peer or social networks. A well-studied problem in peer-to-peer networks is the resource discovery problem. There, the goal for nodes (hosts with IP addresses) is to discover the IP ...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments