Sciweavers

597 search results - page 59 / 120
» Homomorphisms of random paths
Sort
View
PODC
2003
ACM
14 years 3 months ago
Scalable and dynamic quorum systems
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...
Moni Naor, Udi Wieder
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
14 years 1 months ago
Navigating Low-Dimensional and Hierarchical Population Networks
Abstract. Social networks are navigable small worlds, in which two arbitrary people are likely connected by a short path of intermediate friends that can be found by a "decent...
Ravi Kumar, David Liben-Nowell, Andrew Tomkins
EPEW
2008
Springer
13 years 11 months ago
Evaluation of P2P Algorithms for Probabilistic Trust Inference in a Web of Trust
The problem of finding trust paths and estimating the trust one can place in a partner arises in various application areas, including virtual organisations, authentication systems ...
Huqiu Zhang, Aad P. A. van Moorsel
CORR
2010
Springer
102views Education» more  CORR 2010»
13 years 10 months ago
Outage Probability of General Ad Hoc Networks in the High-Reliability Regime
Outage probabilities in wireless networks depend on various factors: the node distribution, the MAC scheme, and the models for path loss, fading and transmission success. In prior ...
Riccardo Giacomelli, Radha Krishna Ganti, Martin H...
HOTNETS
2010
13 years 4 months ago
Data center networking with multipath TCP
Recently new data center topologies have been proposed that offer higher aggregate bandwidth and location independence by creating multiple paths in the core of the network. To ef...
Costin Raiciu, Christopher Pluntke, Sébasti...