Sciweavers

6808 search results - page 1361 / 1362
» Distributed Concurrency Control
Sort
View
CCS
2009
ACM
16 years 6 months ago
Towards complete node enumeration in a peer-to-peer botnet
Modern advanced botnets may employ a decentralized peer-to-peer overlay network to bootstrap and maintain their command and control channels, making them more resilient to traditi...
Brent ByungHoon Kang, Eric Chan-Tin, Christopher P...
PODC
2009
ACM
16 years 6 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
IMC
2006
ACM
15 years 11 months ago
Malware prevalence in the KaZaA file-sharing network
In recent years, more than 200 viruses have been reported to use a peer-to-peer (P2P) file-sharing network as a propagation vector. Disguised as files that are frequently exchan...
Seungwon Shin, Jaeyeon Jung, Hari Balakrishnan
COMPGEOM
2004
ACM
15 years 11 months ago
On locally Delaunay geometric graphs
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
Rom Pinchasi, Shakhar Smorodinsky
SASN
2004
ACM
15 years 11 months ago
Securing quality-of-service route discovery in on-demand routing for ad hoc networks
An ad hoc network is a collection of computers (nodes) that cooperate to forward packets for each other over a multihop wireless network. Users of such networks may wish to use de...
Yih-Chun Hu, David B. Johnson
« Prev « First page 1361 / 1362 Last » Next »