16 search results - page 1 / 4 » Order Optimal Information Spreading Using Algebraic Gossip |
CORR
2011
Springer
12 years 8 months ago
2011
Springer
QEST
2009
IEEE
13 years 11 months ago
2009
IEEE
—We consider a distributed shuffling algorithm for sharing data in a distributed network. Nodes executing the algorithm periodically contact each other and exchange data. The be...
IEEECIT
2010
IEEE
13 years 3 months ago
2010
IEEE
—Gossip-based Peer-to-Peer protocols proved to be very efficient for supporting dynamic and complex information exchange among distributed peers. They are useful for building an...
PODC
2006
ACM
13 years 11 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
INFOCOM
2011
IEEE
12 years 8 months ago
2011
IEEE
—Information dissemination in a large network is typically achieved when each user shares its own information or resources with each other user. Consider n users randomly located...