Sciweavers

1537 search results - page 272 / 308
» Deployment of Distributed Multi-agent Systems
Sort
View
ICDCS
2010
IEEE
13 years 11 months ago
Practical Robust Communication in DHTs Tolerating a Byzantine Adversary
—There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and ...
Maxwell Young, Aniket Kate, Ian Goldberg, Martin K...
CLUSTER
2004
IEEE
13 years 11 months ago
An efficient end-host architecture for cluster communication
Cluster computing environments built from commodity hardware have provided a cost-effective solution for many scientific and high-performance applications. Likewise, middleware te...
Xin Qi, Gabriel Parmer, Richard West
TON
2002
91views more  TON 2002»
13 years 7 months ago
The stable paths problem and interdomain routing
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilf...
P2P
2010
IEEE
207views Communications» more  P2P 2010»
13 years 6 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
EUROSYS
2006
ACM
14 years 4 months ago
Experiences in building and operating ePOST, a reliable peer-to-peer application
Peer-to-peer (p2p) technology can potentially be used to build highly reliable applications without a single point of failure. However, most of the existing applications, such as ...
Alan Mislove, Ansley Post, Andreas Haeberlen, Pete...