Sciweavers

88 search results - page 15 / 18
» Fireflies: scalable support for intrusion-tolerant network o...
Sort
View
PODC
2009
ACM
15 years 6 months ago
Fast scalable deterministic consensus for crash failures
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
SIGMETRICS
2003
ACM
119views Hardware» more  SIGMETRICS 2003»
15 years 5 months ago
Incrementally improving lookup latency in distributed hash table systems
Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will ...
Hui Zhang 0002, Ashish Goel, Ramesh Govindan
ICWN
2004
15 years 1 months ago
Searching in Variably Connected P2P Networks
Peer-to-Peer networks are gaining popularity through file-sharing communities. Most P2P networks demand a certain stability from it's nodes in order to function satisfactory. ...
Njål T. Borch, Lars Kristian Vognild
INFOCOM
2003
IEEE
15 years 5 months ago
Associative Search in Peer to Peer Networks: Harnessing Latent Semantics
— The success of a P2P file-sharing network highly depends on the scalability and versatility of its search mechanism. Two particularly desirable search features are scope (abil...
Edith Cohen, Amos Fiat, Haim Kaplan
INFOCOM
2003
IEEE
15 years 5 months ago
YAPPERS: A Peer-to-Peer Lookup Service over Arbitrary Topology
— Existing peer-to-peer search networks generally fall into two categories: Gnutella-style systems that use arbitrary topology and rely on controlled flooding for search, and sy...
Prasanna Ganesan, Qixiang Sun, Hector Garcia-Molin...