Sciweavers

862 search results - page 4 / 173
» Random Information Spread in Networks
Sort
View
SPAA
2010
ACM
14 years 12 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis
CORR
2012
Springer
188views Education» more  CORR 2012»
13 years 7 months ago
Gossip-based Information Spreading in Mobile Networks
Huazi Zhang, Zhaoyang Zhang, Huaiyu Dai
CORR
2008
Springer
98views Education» more  CORR 2008»
14 years 11 months ago
An Information-Theoretical View of Network-Aware Malware Attacks
This work investigates three aspects: (a) a network vulnerability as the non-uniform vulnerable-host distribution, (b) threats, i.e., intelligent malwares that exploit such a vulne...
Zesheng Chen, Chuanyi Ji
CN
2007
137views more  CN 2007»
14 years 11 months ago
Defending against hitlist worms using network address space randomization
Worms are self-replicating malicious programs that represent a major security threat for the Internet, as they can infect and damage a large number of vulnerable hosts at timescal...
Spyros Antonatos, Periklis Akritidis, Evangelos P....
P2P
2010
IEEE
207views Communications» more  P2P 2010»
14 years 10 months ago
Local Access to Sparse and Large Global Information in P2P Networks: A Case for Compressive Sensing
—In this paper we face the following problem: how to provide each peer local access to the full information (not just a summary) that is distributed over all edges of an overlay ...
Rossano Gaeta, Marco Grangetto, Matteo Sereno