Abstract
We present a dynamic distributed hash table where peers may join and leave at any time. Our system tolerates a powerful adversary which has complete visibility of the entire state of the system and can continuously add and remove peers. Our system provides worst-case fault-tolerance, maintaining desirable properties such as a low peer degree and a low network diameter.
Research (in part) supported by the Hasler Stiftung and the Swiss National Science Foundation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Peleg, D., Upfal, E.: The Token Distribution Problem. SIAM J. on Computing 287(2), 229–243 (1989)
Aberer, K.: P-Grid: A Self-Organizing Access Structure for P2P Information Systems. In: Batini, C., Giunchiglia, F., Giorgini, P., Mecella, M. (eds.) CoopIS 2001. LNCS, vol. 2172, pp. 179–194. Springer, Heidelberg (2001)
Abraham, I., Dobzinski, O., Malkhi, D.: LAND: Stretch (1 + ε) Locality-Aware Networks for DHTs. In: Proc. 15th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 550–559 (2004)
Aspnes, J., Shah, G.: Skip Graphs. In: Proc. 14th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 384–393 (2003)
Awerbuch, B.: Scheideler, Ch.: The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments. In: Proc. 15th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA) (2004)
Harvey, N., Jones, M., Saroiu, S., Theimer, M., Wolman, A.: SkipNet: A Scalable Overlay Network with Practical Locality Properties. In: Proc. 4th USENIX Symp. on Internet Technologies and Systems (USITS) (2003)
Bindel, D., Chen, Y., Eaton, P., Geels, D., Gummadi, R., Kubiatowicz, J., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: OceanStore: An Architecture for Global-scale Persistent Storage. In: Proc. of ACM ASPLOS (2000)
Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A Scalable and Dynamic Emulation of the Butterfly. In: Proc. 21st Ann. Symp. on Principles of Distributed Computing (PODC), pp. 183–192 (2002)
Plaxton, G., Rajaraman, R., Richa, A.: Accessing Nearby Copies of Replicated Objects in a Distributed Environment. In: Proc. 9th Ann. ACM Symp. on Parallel Algorithms and Architectures (SPAA), pp. 311–320 (1997)
Francis, P., Handley, M., Karp, R., Ratnasamy, S., Shenker, S.: A Scalable Content Addressable Network. In: Proc. of ACM SIGCOMM 2001 (2001)
Balakrishnan, H., Kaashoek, F., Karger, D., Morris, R., Stoica, I.: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In: Proc. ACM SIGCOMM Conference (2001)
Joseph, A., Huang, L., Kubiatowicz, J., Stribling, J., Zhao, B.: Tapestry: A Resilient Global-scale Overlay for Service Deployment. IEEE Journal on Selected Areas in Communications 22 (2004)
Geels, D., Kubiatovicz, J., Rhea, S., Roscoe, T.: Handling Churn in a DHT. In: Proc. USENIX Ann. Technical Conference (2004)
Fiat, A., Saia, J.: Censorship Resistant Peer-to-Peer Content Addressable Networks. In: Proc. 13th Symp. on Discrete Algorithms (SODA) (2002)
Gribble, S., Fiat, A., Karlin, A., Saia, J., Saroiu, S.: Dynamically Fault-Tolerant Content Addressable Networks. In: Proc. 1st Int. Workshop on Peer-to-Peer Systems (IPTPS) (2002)
Abraham, I., Awerbuch, B., Azar, Y., Bartal, Y., Malkhi, D., Pavlov, E.: A Generic Scheme for Building Overlay Networks in Adversarial Scenarios. In: Proc. 17th Int. Symp. on Parallel and Distributed Processing (IPDPS) (2003)
Li, X., Misra, J., Plaxton, G.: Active and Concurrent Topology Maintenance. In: Proc. 18th Ann. Conference on Distributed Computing (DISC) (2004)
Hurson, A.R., Kavi, K., Shirazi, B.: Scheduling and Load Balancing in Parallel and Distributed Systems. IEEE Computer Science Press, Los Alamitos (1995)
Cybenko, G.: Dynamic Load Balancing for Distributed Memory Multiprocessors. Journal on Parallel Distributed Computing 7, 279–301 (1989)
Plaxton, G.: Load Balancing, Selection and Sorting on the Hypercube. In: Proc. 1st Ann. ACM Symp. on Parallel Algorithms and Architectures (SPAA), pp. 64–73 (1989)
Albrecht, K., Arnold, R., Gähwiler, M., Wattenhofer, R.: Aggregating Information in Peer-to-Peer Systems for Improved Join and Leave. In: 4th IEEE Int. Conference on Peer-to-Peer Computing (P2P) (2004)
Birman, P., van Renesse, R., Vogels, W.: Astrolabe: A Robust and Scalable Technology for Distributed System Monitoring, Management, and Data Mining. ACM Transactions on Computing Systems 21(2), 164–206 (2003)
Bozdog, A., van Renesse, R.: Willow: DHT, Aggregation, and Publish/Subscribe in One Protocol. In: Proc. 3rd Int. Workshop on Peer-To-Peer Systems (IPTPS) (2004)
Kuhn, F., Schmid, S., Smit, J., Wattenhofer, R.: Constructing Robust Dynamic Peer-to-Peer Systems. TIK Report 216, ETH Zurich (2005), http://www.tik.ee.ethz.ch
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kuhn, F., Schmid, S., Wattenhofer, R. (2005). A Self-repairing Peer-to-Peer System Resilient to Dynamic Adversarial Churn. In: Castro, M., van Renesse, R. (eds) Peer-to-Peer Systems IV. IPTPS 2005. Lecture Notes in Computer Science, vol 3640. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11558989_2
Download citation
DOI: https://doi.org/10.1007/11558989_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29068-1
Online ISBN: 978-3-540-31906-1
eBook Packages: Computer ScienceComputer Science (R0)