1189 search results - page 7 / 238 » Minimizing churn in distributed systems |
TPDS
2010
13 years 5 months ago
2010
This paper studies the problem of realizing a common software clock among a large set of nodes without an external time reference (i.e., internal clock synchronization), any centr...
ICDCS
2008
IEEE
14 years 1 months ago
2008
IEEE
Large-scale distributed systems provide an attractive scalable infrastructure for network applications. However, the loosely-coupled nature of this environment can make data acces...
GLOBE
2011
Springer
12 years 7 months ago
2011
Springer
Abstract. Distributed or peer-to-peer storage solutions rely on the introduction of redundant data to be fault-tolerant and to achieve high reliability. One way to introduce redund...
SIGMETRICS
2005
ACM
14 years 1 months ago
2005
ACM
—To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users, this paper investigates the resilience of random graphs to li...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
—This paper builds a generic modeling framework for analyzing the edge-creation process in dynamic random graphs in which nodes continuously alternate between active and inactive...