Abstract
Peer-to-peer systems are prone to faults; Therefore, it is extremely important to design peer-to-peer systems that automatically regain consistency or, in other words, are self-stabilizing. In order to achieve the above, we present a deterministic structure that defines the entire (IP) pointers structure among the machines, for every n machines; i.e., defines the next hop for the insert, delete, and search procedures of the peer-to-peer system. Thus, the consistency of the system is easily defined, monitored, verified, and repaired. We present the HyperTree (distributed) structure, which supports the peer-to-peer procedures while ensuring that the out-degree and the in-degree (the number of outgoing/ incoming pointers) are b log b n where n is the actual number of machines and b is an integer parameter greater than 1. Moreover, the HyperTree ensures that the maximal number of hops involved in each procedure is bounded by log b n. A self-stabilizing peer-to- peer distributed algorithm based on the HyperTree is presented.
Similar content being viewed by others
References
Abraham, I., Awerbuch, B., Azar, Y., Bartal, Y., Malkhi, D., Pavlov, E.: A generic scheme for building overlay networks in adversarial scenarios. In: IPDPS ’03: Proceedings of the 17th International Symposium on Parallel and Distributed Processing, p. 40.2. IEEE Computer Society, Washington, DC, USA (2003)
Attiya H., Dolev S. and Welch J.L. (1995). Connection management without retaining information. Inf. Comput. 123(2): 155–171
Clark, D.D.: The design philosophy of the darpa internet protocols. In: SIGCOMM ’88: Symposium Proceedings on Communications Architectures and Protocols, pp. 106–114. ACM Press, New York (1988). doi:http://doi.acm.org/10.1145/52324.52336
Dabek, F., Zhao, B., Druschel, P., Stoica, I.: Towards a common api for structured peer-to-peer overlays. In: IPTPS ’03: Proceedings of Peer-to-Peer Systems II, 2nd International Workshop (2003)
Dijkstra E.W. (1974). Self-stabilizing systems in spite of distributed control. Commun. ACM 1(11): 643–644
Dolev S. (2000). Self-Stabilization. MIT Press, Cambridge
Dolev, S., Kat, R.I.: Self-stabilizing distributed file systems. In: RCDS’ 02: Proceedings of the International Workshop on Self-Repairing and Self-Configurable Distributed Systems, pp. 384–389 (2002)
Dolev S., Kranakis E., Krizanc D. and Peleg D. (2000). Bubbles: adaptive routing scheme for high-speed dynamic networks. SIAM J. Comput. 29(3): 804–833 doi:http://dx.doi.org/ 10.1137/S0097539797316610
Dolev S. and Schiller E. (2003). Communication adaptive self-stabilizing group membership service. IEEE Trans. Parallel Distrib. Syst. 14(7): 709–720 doi:http://dx.doi.org/10.1109/TPDS. 2003.1214322
Dolev S., Schiller E. and Welch J.L. (2006). Random walk for self-stabilizing group communication in ad hoc networks. IEEE Trans. Mobile Comput. 5(7): 893–905 doi:http://dx.doi.org/10.1109/TMC.2006.104
Dolev S. and Welch J.L. (1997). Crash resilient communication in dynamic networks. IEEE Trans. Comput. 46(1): 14–26 doi:http://dx.doi.org/10.1109/12.559799
Foster I., Kesselman C. and Tuecke S. (2001). The anatomy of the grid: Enabling scalable virtual organizations. Int. J. High Perf. Comput. Appl. 15(3): 200–222 doi:http://dx.doi.org/10.1177/109434200101500302
Kleinberg, J.: The small-world phenomenon: an algorithm perspective. In: STOC ’00: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 163–170. ACM Press, New York (2000). doi:http://doi.acm.org/10.1145/ 335305.335325
Kubiatowicz J., Bindel D., Chen Y., Czerwinski S., Eaton P., Geels D., Gummadi R., Rhea S., Weatherspoon H., Wells C. and Zhao B. (2000). Oceanstore: an architecture for global-scale persistent storage. ACM SIGARCH Comput. Architect. News 28(5): 190–201 doi:http://doi.acm.org/ 10.1145/378995.379239
Lynch N. (1996). Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco
Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: a scalable and dynamic emulation of the butterfly. In: PODC ’02: Proceedings of the 21st Annual Symposium on Principles of Distributed Computing, pp. 183–192. ACM Press, New York (2002). doi:http://doi.acm.org/10.1145/571825.571857
Perlman R. (1999). Interconnections: Bridges, Routers, Switches and Internetworking Protocols. Addison-Wesley, Reading
Plaxton, G.C., Rajaraman, R., Richa, A.W.: Accessing nearby copies of replicated objects in a distributed environment. In: SPAA ’97: Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 311–320. ACM Press, New York (1997). doi:http://doi.acm.org/10.1145/258492.258523
Ratnasamy, S., Francis, P., Handley, M., Karp, R., ScottShenker: A scalable content addressable network. In: SIGCOMM’01: Proceedings of ACM SIGCOMM, pp. 161–172 (2001)
Ripeanu, M.: Peer-to-peer architecture case study: Gnutella network. Technical report 2001-26, University of Chicago, Chicago (2001)
Rowstron, A.I.T., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Middleware ’01: Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg, pp. 329–350. Springer, London (2001)
Schlosser, M., Sintek, M., Decker, S., Nejdl, W.: Hypercup – hypercubes, ontologies and efficient search on p2p networks. In: AP2PC ’02: Proceedings of the First Workshop on Agents and P2P Computing, pp. 112–124 (2002)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: SIGCOMM ’01: Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 149–160. ACM Press, New York (2001). doi:http://doi.acm.org/10.1145/383059.383071
Zhao B.Y., Huang L., Stribling J., Rhea S.C., Joseph A.D. and Kubiatowicz J. (2003). Tapestry: a resilient global-scale overlay for service deployment. IEEE J. Selected Areas Commun. 22(1): 41–53
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was partially supported by IBM Faculty Award, NSF Grant 0098305, the Israeli Ministry of Trade and Industry, the Rita Altura Trust Chair in Computer Sciences and the Lynne and William Frankel Center for Computer Sciences. The work was done while Ronen I. Kat was a PhD student at Ben-Gurion University of the Negev. An preliminary version was published in the proceedings of the third IEEE International Symposium on Network Computing and Applications (NCA’04).
Rights and permissions
About this article
Cite this article
Dolev, S., Kat, R.I. HyperTree for self-stabilizing peer-to-peer systems. Distrib. Comput. 20, 375–388 (2008). https://doi.org/10.1007/s00446-007-0038-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00446-007-0038-9