Advertisement

Brushwood: Distributed Trees in Peer-to-Peer Systems

  • Chi Zhang
  • Arvind Krishnamurthy
  • Randolph Y. Wang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3640)

Abstract

There is an increasing demand for locality-preserving distribution of complex data structures in peer-to-peer systems. Current systems either do not preserve object locality or suffer from imbalances in data distribution, routing state, and/or query processing costs. In this position paper, we take a systematic approach that enables the deployment of searchable tree structures in p2p environments. We achieve distributed tree traversal with efficient routing distance and routing state. We show how to implement several p2p applications using distributed tree structures.

Keywords

Load Balance Range Query Overlay Network Tree Node Query Point 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Andrzejak, A., Xu, Z.: Scalable, efficient range queries for grid information services. In: Second IEEE International Conference on Peer-to-Peer Computing (2002)Google Scholar
  2. 2.
    Aspnes, J., Kirsch, J., Krishnamurthy, A.: Load balancking and locality in range-queriable data structures. In: Proc. of PODC (2004)Google Scholar
  3. 3.
    Aspnes, J., Shah, G.: Skip Graphs. In: Proceedings of Symposium on Discrete Algorithms (2003)Google Scholar
  4. 4.
    Awerbuch, B., Scheideler, C.: Peer-to-peer systems for Prefix Search. In: PODC (2003)Google Scholar
  5. 5.
    Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9) (1975)Google Scholar
  6. 6.
    Bharambe, A.R., Agrawal, M., Seshan, S.: Mercury: Supporting scalable multi-attribute range queries. In: SIGCOMM (2004)Google Scholar
  7. 7.
    Ellard, D., Ledlie, J., Malkani, P., Seltzer, M.: Passive NFS tracing email and research workloads. In: USENIX Conference on File and Storage Technologies (2003)Google Scholar
  8. 8.
    Harren, M., Hellerstein, J., Huebsch, R., Loo, B., Shenker, S., Stoica, I.: Complex queries in dht-based peer-to-peer networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 242. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  9. 9.
    Harvey, N.J.A., Jones, M.B., Saroiu, S., Theimer, M., Wolman, A.: SkipNet: A Scalable Overlay Network with Practical Locality Properties. In: USITS (2003)Google Scholar
  10. 10.
    Johnson, T., Krishna, P.: Lazy updates for distributed search structures. In: Proceedings of ACM SIGMOD (1993)Google Scholar
  11. 11.
    Karger, D.R., Ruhl, M.: Simple efficient load balancing algorithms for peer-to-peer systems. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, pp. 131–140. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  12. 12.
    Keleher, P., Bhattacharjee, B., Silaghi, B.: Are virtualized overlay networks too much of a good thing. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 225. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  13. 13.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. In: Proceedings of ACM SIGCOMM (2001)Google Scholar
  14. 14.
    Ratnasamy, S., Hellerstein, J., Shenker, S.: Range Queries over DHTs. Technical Report IRB-TR-03-009, Intel Research (2003)Google Scholar
  15. 15.
    Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: ICDCS (2002)Google Scholar
  16. 16.
    Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: SIGCOMM (2001)Google Scholar
  17. 17.
    Tang, C., Xu, Z., Dwarkadas, S.: Peer-to-peer information retrieval using self-organizing semantic overlay networks. In: Proceedings of SIGCOMM (2003)Google Scholar
  18. 18.
    van Renesse, R., Birman, K.P.: Scalable management and data mining using astrolabe. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 280. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  19. 19.
    Zhang, C., Krishnamurthy, A., Wang, R.Y.: Skipindex: Towards a scalable peer-to-peer index service for high dimensional data. Technical Report TR-703-04, Princeton Univ. CS (2004), http://www.cs.princeton.edu/~chizhang/skipindex.pdf
  20. 20.
    Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.: Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Chi Zhang
    • 1
  • Arvind Krishnamurthy
    • 2
  • Randolph Y. Wang
    • 1
  1. 1.Princeton University 
  2. 2.Yale University 

Personalised recommendations