Sciweavers

101 search results - page 2 / 21
» Rumor Spreading in Social Networks
Sort
View
PODC
2010
ACM
13 years 4 months ago
Meeting the deadline: on the complexity of fault-tolerant continuous gossip
In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the go...
Chryssis Georgiou, Seth Gilbert, Dariusz R. Kowals...
APPROX
2010
Springer
179views Algorithms» more  APPROX 2010»
13 years 7 months ago
Rumor Spreading on Random Regular Graphs and Expanders
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
Nikolaos Fountoulakis, Konstantinos Panagiotou
IPPS
2008
IEEE
14 years 20 hour ago
Heterogenous dating service with application to rumor spreading
Peer-to-Peer overlay networks have proven their efficiency for storing and retrieving data at large scale, but new services are required to take the actual performances of resour...
Olivier Beaumont, Philippe Duchon, Miroslaw Korzen...
STACS
2012
Springer
12 years 1 months ago
Low Randomness Rumor Spreading via Hashing
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
George Giakkoupis, Thomas Sauerwald, He Sun, Phili...
ITCC
2005
IEEE
13 years 11 months ago
Zonal Rumor Routing for Wireless Sensor Networks
has to be relayed to nodes interested in those events. Moreover, nodes may also generate queries to find events they are interested in. Thus there is a need to route the informatio...
Tarun Banka, Gagan Tandon, Anura P. Jayasumana