Abstract
Distributed hash tables (DHT for short) schemes are the core techniques to locate and search resources in structured P2P system. But DHT only support exact-match search, cannot support complex search due to that its hash methods destroy data locality. A simple and flexible solution has been built to tackle the problem which is known as over-DHT paradigm without modifying existing DHT infrastructures. One of the well known over-DHT paradigms now is LIGHT which provides more efficient complex query methods than other paradigms and also reduces the paradigm maintenance cost. However, LIGHT takes more than one steps (a step means a DHT-lookup operation) to search single data record in P2P system, while traditional DHT schemes only take one step. In this paper, we propose a improved lookup algorithm, Nearest Upper Boundary Lookup (NUBL for short) to reduce the DHT-lookup times during single data record searching procedure in LIGHT. We also proved the effectiveness of NUBL by simulating experiments.
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
Tang, Y., Zhou, S., Xu, J.: LIGHT: A Query-Efficient Yet Low-Maintenance Indexing Scheme over DHTs. IEEE Transactions on Knowledge and Data Engineering 22(1) (January 2010)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrisnan, H.: Chord: A Scalable peer-to-peer lookup service for Internet applications. In: Proceedings of ACM SIGCOMM 2001 (August 2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Proceedings of IFIP/ACM International Conference on Distributed Systems Platforms (November 2001)
Ratnasamy, S., Francis, P., Handley, M., Karp, R.: A Scalable Content-Addressable Network. In: Proceedings of ACM SIGCOMM 2001 (August 2001)
Rhea, S.C., Geels, D., Roscoe, T., Kubiatowicz, J.: Handling churn in a dht. In: USENIX Annual Technical Conference, General Track, pp. 127–140 (2004)
Zheng, C., Shen, G., Li, S., Shenker, S.: Distributed segment tree: Support of range query and cover query over dht. In: The 5th International Workshop on Peer-to-Peer Systems (IPTPS) (February 2006)
Gao, J., Steenkiste, P.: An adaptive protocol for efficient support of range queries in dht-based systems. In: ICNP, pp. 239–250 (2004)
Chen, L., Candan, K.S., Tatemura, J., Agrawal, D., Cavendish, D.: On overlay schemes to support point-in-range queries for scalable grid resource discovery. In: Peer-to-Peer Computing, pp. 23–30 (2005)
Ramabhadran, S., Ratnasamy, S., Hellerstein, J.M., Shenker, S.: Brief announcement: prefix hash tree. In: PODC, p. 368 (2004)
Tanin, E., Harwood, A., Samet, H.: Using a distributed quadtree index in peer-to-peer networks. VLDB J. 16(2), 165–178 (2007)
Chawathe, Y., Ramabhadran, S., Ratnasamy, S., LaMarca, A., Shenker, S., Hellerstein, J.M.: A Case Study in Building Layered DHT Applications. In: Proc. 2005 Conf. Applications, Technologies, Architectures, and Protocols for Computer Comm (SIGCOMM), pp. 97–108 (2005)
Podnar, I., Rajman, M., Luu, T., Klemm, F., Aberer, K.: Scalable peer-to-peer web retrieval with highly discriminative keys. In: ICDE, pp. 1096–1105 (2007)
Adjie-Winoto, W., Schwartz, E., Balakrishnan, H., Lilley, J.: The Design and Implementation of an Intentional Naming Systems. In: Proceedings of ACM Symposium on Operating Systems Principles (December 1999)
Carzaniga, A., Rosenblum, D., Wolf, A.: Design and Evaluation of a Wide-Area Event Notification Service. ACM Transactions on Computer Systems 19(3) (August 2001)
Foster, I., Kesselman, C., Nick, J., Tuecke, S.: Grid Services for Distributed System Integration. IEEE Computer 35(6) (June 2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fu, Y., Hu, R., Chen, J., Wang, Z., Tian, G. (2011). An Improved Lookup Algorithm on Over-DHT Paradigm Based P2P Network. In: Gong, Z., Luo, X., Chen, J., Lei, J., Wang, F.L. (eds) Web Information Systems and Mining. WISM 2011. Lecture Notes in Computer Science, vol 6987. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23971-7_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-23971-7_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23970-0
Online ISBN: 978-3-642-23971-7
eBook Packages: Computer ScienceComputer Science (R0)