Sciweavers

1189 search results - page 4 / 238
» Minimizing churn in distributed systems
Sort
View
ISPDC
2010
IEEE
13 years 6 months ago
Practical Uniform Peer Sampling under Churn
—Providing independent uniform samples from a system population poses considerable problems in highly dynamic settings, like P2P systems, where the number of participants and the...
Roberto Baldoni, Marco Platania, Leonardo Querzoni...
ICDCS
2009
IEEE
14 years 4 months ago
Implementing a Register in a Dynamic Distributed System
Providing distributed processes with concurrent objects is a fundamental service that has to be offered by any distributed system. The classical shared read/write register is one ...
Roberto Baldoni, Silvia Bonomi, Anne-Marie Kermarr...
IMC
2006
ACM
14 years 1 months ago
Understanding churn in peer-to-peer networks
The dynamics of peer participation, or churn, are an inherent property of Peer-to-Peer (P2P) systems and critical for design and evaluation. Accurately characterizing churn requir...
Daniel Stutzbach, Reza Rejaie
IPPS
2008
IEEE
14 years 1 months ago
Random choices for churn resilient load balancing in peer-to-peer networks
Peer-to-peer (P2P) networks based on consistent hashing functions have an inherent load uneven distribution problem. Things are even worse in unstructured P2P systems. The objecti...
Song Fu, Cheng-Zhong Xu, Haiying Shen
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
13 years 9 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin