Sciweavers

1189 search results - page 7 / 238
» Minimizing churn in distributed systems
Sort
View
TPDS
2010
176views more  TPDS 2010»
14 years 8 months ago
Coupling-Based Internal Clock Synchronization for Large-Scale Dynamic Distributed Systems
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...
Roberto Baldoni, Angelo Corsaro, Leonardo Querzoni...
ICDCS
2008
IEEE
15 years 4 months ago
Accessibility-Based Resource Selection in Loosely-Coupled Distributed Systems
Large-scale distributed systems provide an attractive scalable infrastructure for network applications. However, the loosely-coupled nature of this environment can make data acces...
Jinoh Kim, Abhishek Chandra, Jon B. Weissman
GLOBE
2011
Springer
13 years 9 months ago
Hybrid Approaches for Distributed Storage Systems
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...
Júlio Araújo, Frédéric...
65
Voted
SIGMETRICS
2005
ACM
15 years 3 months ago
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
—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...
Derek Leonard, Vivek Rai, Dmitri Loguinov
INFOCOM
2012
IEEE
13 years 1 days ago
On superposition of heterogeneous edge processes in dynamic random graphs
—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...
Zhongmei Yao, Daren B. H. Cline, Dmitri Loguinov