Abstract
Distributed Hash Tables (DHT) implements a distributed dictionary, supporting key insertion, deletion and lookup. They use hashing to enable efficient dictionary operations, and achieve storage balance across the participant nodes. Hashing can be inappropriate for both problems, as it destroys data ordering, thus making sequential key access and range queries expensive, and fails to provide storage balance when keys are not unique. We propose generalizing DHTs to create Distributed Balanced Tables (DBTs), which eliminate the above two problems. To solve problem, we discuss how DHT routing structures can be adapted for use in DBTs, while preserving the costs of the standard dictionary operations and supporting efficient range queries. To solve problem, we describe an efficient algorithm that guarantees storage balance, even against an adversarial insertion and deletion of keys.
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
Adler, M., Halperin, E., Karp, R.M., Vazirani, V.V.: A stochastic process on the hypercube with applications to peer to- peer networks. In: Proc. of STOC (2003)
Gupta, A., Agrawal, D., El Abbadi, A.: Approximate range selection queries in peer-to-peer systems. In: Proc. CIDR (2003)
Andrzejak, A., Xu, Z.: Scalable, efficient range queries for grid information services. In: Proc. of P2P (2002)
Silberschatz, A., Korth, H.F., Sudarshan, S.: Database System Concepts, ch 17, pp. 566–169. McGraw-Hill, New York (2002)
Aspnes, J., Shah, G.: Skip graphs. In: Proc. of SODA (2003)
Byers, J., Considine, J., Mitzenmacher, M.: Simple load balancing for distributed hash tables. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)
Harvey, N.J.A., Jones, M., Theimer, M., Wolman, A.: Skipnet: A scalable overlay network with practical locality properties. In: Proc. of USITS (2003)
Karger, D.R., Ruhl, M.: New algorithms for load balancing in peer-to-peer systems. In: Prog. IRIS Student Workshop (2003)
Naor, M., Wieder, U.: Novel architectures for p2p applications: The continuous-discrete approach. In: Proc. of SPAA (2003)
Rao, A., Lakshminarayanan, K., Surana, S., Karp, R., Stoica, I.: Load balancing in structured P2P systems. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)
Ratnasamy, S., Francis, P., Handley, M., Karp, R.: A Scalable Content-Addressable Network (CAN). In: Proc. of SIGCOMM (2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large scale peer-to-peer systems. In: Proc. of MIDDLEWARE (2001)
Ratnasamy, S., Hellerstein, J.M., Shenker, S.: Range queries over dhts. Technical Report IRB-TR-03-009, Intel Tech Report, (2003)
Stoica, I., Morris, R., Karger, D., Fran Kaashoek, M., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proc. of SIGCOMM (2001)
Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, U. C. Berkeley, Computer Science Division (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tripathy, A., Negi, T., Singh, A. (2004). Distributed Balanced Tables: A New Approach. In: Ghosh, R.K., Mohanty, H. (eds) Distributed Computing and Internet Technology. ICDCIT 2004. Lecture Notes in Computer Science, vol 3347. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30555-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-30555-2_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24075-4
Online ISBN: 978-3-540-30555-2
eBook Packages: Computer ScienceComputer Science (R0)