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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Andrzejak, A., Xu, Z.: Scalable, efficient range queries for grid information services. In: Second IEEE International Conference on Peer-to-Peer Computing (2002)
Aspnes, J., Kirsch, J., Krishnamurthy, A.: Load balancking and locality in range-queriable data structures. In: Proc. of PODC (2004)
Aspnes, J., Shah, G.: Skip Graphs. In: Proceedings of Symposium on Discrete Algorithms (2003)
Awerbuch, B., Scheideler, C.: Peer-to-peer systems for Prefix Search. In: PODC (2003)
Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9) (1975)
Bharambe, A.R., Agrawal, M., Seshan, S.: Mercury: Supporting scalable multi-attribute range queries. In: SIGCOMM (2004)
Ellard, D., Ledlie, J., Malkani, P., Seltzer, M.: Passive NFS tracing email and research workloads. In: USENIX Conference on File and Storage Technologies (2003)
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)
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)
Johnson, T., Krishna, P.: Lazy updates for distributed search structures. In: Proceedings of ACM SIGMOD (1993)
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)
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)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. In: Proceedings of ACM SIGCOMM (2001)
Ratnasamy, S., Hellerstein, J., Shenker, S.: Range Queries over DHTs. Technical Report IRB-TR-03-009, Intel Research (2003)
Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: ICDCS (2002)
Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: SIGCOMM (2001)
Tang, C., Xu, Z., Dwarkadas, S.: Peer-to-peer information retrieval using self-organizing semantic overlay networks. In: Proceedings of SIGCOMM (2003)
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)
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
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)
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
Zhang, C., Krishnamurthy, A., Wang, R.Y. (2005). Brushwood: Distributed Trees in Peer-to-Peer Systems. 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_5
Download citation
DOI: https://doi.org/10.1007/11558989_5
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)