A Repair Mechanism for Fault-Tolerance for Tree-Structured Peer-to-Peer Systems

  • Eddy Caron
  • Frédéric Desprez
  • Charles Fourdrignier
  • Franck Petit
  • Cédric Tedeschi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4297)


Facing the limits of traditional tools of resource management within computational grids (related to scale, dynamicity, etc. of the platforms newly considered), new approaches, based on peer-to-peer technologies are emerging. The resource discovery and in particular the service discovery is concerned by this evolution. Among the solutions, a promising one is the indexing of resources using trie structures and more particularly prefix trees. The major advantages of trie-structured approaches is the capability to support search queries on ranges of values with a latency growing logarithmically in the number of nodes in the trie. Those techniques are easy to extend to multicriteria searches. One drawback of using tries is its inherent poor robustness in a dynamic environment, where nodes join and leave the network, leading to the split of the tree into a forest, which results in the impossibility to route requests. Within most recent approaches, the fault-tolerance is a prevention mechanism, often replication-based. The replication can be costly in term of resources required. In this paper, we propose a fault-tolerance protocol that reconnects subtrees a posteriori, after crashes, to have again a connected graph and then reorder the nodes to rebuild a consistent tree.


Range Query Service Discovery Distribute Hash Table Resource Discovery Physical Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Andrzejak, A., Xu, Z.: Scalable, Efficient Range Queries for Grid Information Services. In: Peer-to-Peer Computing, pp. 33–40 (2002)Google Scholar
  2. 2.
    Aspnes, J., Shah, G.: Skip Graphs. In: Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 2003, pp. 384–393 (2003)Google Scholar
  3. 3.
    Balazinska, M., Balakrishnan, H., Karger, D.: INS/Twine: A Scalable Peer-to-Peer Architecture for Intentional Resource Discovery. In: Mattern, F., Naghshineh, M. (eds.) PERVASIVE 2002. LNCS, vol. 2414, p. 195. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  4. 4.
    Basu, S., Banerjee, S., Sharma, P., Lee, S.: NodeWiz: Peer-to-Peer Resource Discovery for Grids. In: 5th International Workshop on Global and Peer-to-Peer Computing (GP2PC) in conjunction with CCGrid (May 2005)Google Scholar
  5. 5.
    Caron, E., Desprez, F., Tedeschi, C.: A dynamic prefix tree for the service discovery within large scale grids. In: IEEE (ed.) The Sixth IEEE International Conference on Peer-to-Peer Computing, P2P 2006, Cambridge, UK, September 6-8 (2006)Google Scholar
  6. 6.
    Chang, E.J.H.: Echo Algorithms: Depth Parallel Operations on General Graphs. IEEE Trans. on Software Engineering SE-8, 391–401 (1982)CrossRefGoogle Scholar
  7. 7.
    Datta, A., Hauswirth, M., John, R., Schmidt, R., Aberer, K.: Range Queries in Trie-Structured Overlays. In: The Fifth IEEE International Conference on Peer-to-Peer Computing (2005)Google Scholar
  8. 8.
    Foster, I., Iamnitchi, A.: On Death, Taxes, and the Convergence of Peer-to-Peer and Grid Computing. In: IPTPS 2003, pp. 118–128 (2003)Google Scholar
  9. 9.
  10. 10.
    KaZaA 2005. The KaZaA Web Site,
  11. 11.
    Oppenheimer, D., Albrecht, J., Patterson, D., Vahdat, A.: Distributed Resource Discovery on PlanetLab with SWORD. In: Proceedings of the ACM/USENIX Workshop on Real, Large Distributed Systems (WORLDS) (December 2004)Google Scholar
  12. 12.
    Ramabhadran, S., Ratnasamy, S., Hellerstein, J.M., Shenker, S.: Prefix Hash Tree An indexing Data Structure over Distributed Hash Tables. In: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing, St. John’s, Newfoundland, Canada (July 2004)Google Scholar
  13. 13.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Adressable Network. In: ACM SIGCOMM (2001)Google Scholar
  14. 14.
    Rowstron, A., Druschel, P.: Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-To-Peer Systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  15. 15.
    Schmidt, C., Parashar, M.: Enabling Flexible Queries with Guarantees in P2P Systems. IEEE Internet Computing 8(3), 19–26 (2004)CrossRefGoogle Scholar
  16. 16.
    Segall, A.: Distributed Network Protocols. IEEE Transactions on Information Theory IT-29, 23–35 (1983)CrossRefMathSciNetGoogle Scholar
  17. 17.
    Shu, Y., Ooi, B.-C., Tan, K.-L., Zhou, A.: Supporting Multi-Dimensional Range Queries in Peer-to-Peer Systems. In: Peer-to-Peer Computing, pp. 173–180 (2005)Google Scholar
  18. 18.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup service for Internet Applications. In: ACM SIGCOMM, pp. 149–160 (2001)Google Scholar
  19. 19.
    Triantafillou, P., Pitoura, T.: Towards a Unifying Framework for Complex Query Processing over Structured Peer-to-Peer Data Networks. In: DBISP2P (2003)Google Scholar
  20. 20.
    Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.D.: Tapestry: A Resilient Global-scale Overlay for Service Deployment. IEEE Journal on Selected Areas in Communications 22(1), 41–53 (2004)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Eddy Caron
    • 1
  • Frédéric Desprez
    • 1
  • Charles Fourdrignier
    • 2
  • Franck Petit
    • 2
  • Cédric Tedeschi
    • 1
  1. 1.LIP LaboratoryUMR CNRS-ENS Lyon-UCB Lyon-INRIA 5668France
  2. 2.LaRIA LaboratoryUniversity of PicardieAmiensFrance

Personalised recommendations