Sciweavers

325 search results - page 45 / 65
» Computing all skyline probabilities for uncertain data
Sort
View
SPAA
2010
ACM
13 years 7 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
CONEXT
2009
ACM
13 years 8 months ago
BUFFALO: bloom filter forwarding architecture for large organizations
In enterprise and data center networks, the scalability of the data plane becomes increasingly challenging as forwarding tables and link speeds grow. Simply building switches with...
Minlan Yu, Alex Fabrikant, Jennifer Rexford
ACSAC
2010
IEEE
12 years 11 months ago
Friends of an enemy: identifying local members of peer-to-peer botnets using mutual contacts
In this work we show that once a single peer-to-peer (P2P) bot is detected in a network, it may be possible to efficiently identify other members of the same botnet in the same ne...
Baris Coskun, Sven Dietrich, Nasir D. Memon
CN
2007
76views more  CN 2007»
13 years 7 months ago
A practical and robust inter-domain marking scheme for IP traceback
A practical and robust inter-domain marking scheme for IP traceback is proposed. We first identify six drawbacks of Probabilistic Packet Marking (PPM), and then contrive a synerg...
Zhiqiang Gao, Nirwan Ansari
IPPS
2008
IEEE
14 years 1 months 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...