Author, Subjects, Keywords

Cited Author

 
 
   » By Author or Editor
 » Browse Author by Alphabet
 » By Journal
 » By Subjects
 » Malaysian Journals
 » By Type
 » By Year
 » By Latest Additions
 
 
   » By Author
 » Top 20 Authors
 » Top 20 Article
 » Top Journal Cited
 » Top Article Cited
 » Journal Citation Statistics
 » Usage Since Sept 2007


 
 
 

Login | Create Account

DChord: An Efficient and Robust Peer to Peer Lookup System.

Kim, Chul-Su, and Lee, Sanghwan, and Han, Jae-Il, and Lee, Yong-Joon, and Park, Jong-Hyun, (2010) DChord: An Efficient and Robust Peer to Peer Lookup System. Malaysian Journal of Computer Science, 23 (1). pp. 37-48. ISSN 0127-9084

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
335Kb

Official URL: http://ejum.fsktm.um.edu.my/ArticleInformation.aspx?ArticleID=876

Affiliations

Electronics and Telecommunications Research Institute, South Korea
Kookmin University, South Korea

Abstract

Dynamic Hash Tables (DHTs) are distributed systems that maintain key-value pairs and provide efficient lookup services. Traditional DHTs usually rely on a random ID distribution of the keys to achieve such efficiency. Uniformly random hash functions are typically used to create uniformly random ID distributions from non-random key distributions. However, there are many cases where such random hash functions cannot be applied. For example, those systems that provide range queries over the keys cannot apply random hash functions on the keys, otherwise, the range query is very difficult to support. In this paper, we present a new lookup system called DChord, which does not depend on the randomness assumption to achieve its performance. To show the performance of the proposed system, we provide mathematical analysis and extensive simulation results in a highly non-random USN (Ubiquitous Sensor Network) metadata identifier space. To be specific, we show that DChord has high regularity in terms of in-degree and out-degree distributions. Thus, the system is robust against random node failures. We also show that query processing load is well balanced among nodes and the lookup speed is deterministic in such a way that the number of nodes to visit for a query is at most log2(N).

Item Type:Journal
Additional Information:This work was partly supported by the IT R&D program of MIC/IITA [2006-S022-02, Development of USN Middleware Platform Tech] and research program 2009 of Kookmin University in Korea. Sanghwan Lee is the corresponding author of this paper.
Keywords:Lookup, USN, Deterministic, DHT, DChord
Subjects:Q Science, Computer Science
ID Code:11749

Myung-Sup Kim, Young J. Won, and James Won-Ki Hong, "Application-Level Traffic Monitoring and an Analysis on IP Networks," ETRI Journal, Vol. 27, No.1, Feb. 2005, pp. 22-42.

I. Stoica, et al., "Chord: A scalable peer-to-peer lookup service for Internet applications," in Proceedings of ACM SIGCOMM 2001, San Diego, CA, Aug. 2001, pp. 149-160.

A. Rowstron and P. Drushel, "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 (Middleware), Heidelberg, Germany, Nov. 2001, pp. 329-350.

S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A scalable content-addressable network," in Proceedings of ACM SIGCOMM 2001, San Diego, CA, Aug. 2001, pp. 161-172.

Y. Yu, S. Lee, and Z.-L. Zhang, "Leopard: A locality-aware peer-to-peer system with no hot spot," in Proceedings of the 4th IFIP Networking Conference (Networking'05), Waterloo, Canada, May 2005, pp. 27-39.

F. Klemm, et al., "On routing in distributed hash tables," in Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing, Sept. 2007, pp. 113-120.

Yuh-Jzer Joung, "Approaching neighbor proximity and load balance for range query in P2P networks," Computer Networks, Vol. 52, No. 7, May 2008, pp. 1451-1472.

K. Sayood, Introduction to Data Compression, 2nd ed. Morgan Kaufmann, pp. 13-22, 2000.

M. Weiser, "Some computer science issues in ubiquitous computing," Communications of the ACM, Vol. 36, No. 7, July 1993, pp. 75-84.

C. Intanagonwiwat, R. Govindan, and D. Estrin, "Directed diffusion: a scalable and robust communication paradigm for sensor networks," in Proceedings of the International Conference on Mobile Computing and Networking (ACM Mobicom), Boston, MA, Aug. 2000, pp. 56-67.

E. -S. Jung and N. H. Vaidya, "A power control mac protocol for ad hoc networks," in Proceedings of the International Conference on Mobile Computing and Networking (ACM Mobicom), Atlanta, GA, 2002, pp. 36-47.

I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "A survey on sensor networks," IEEE Communications Magazine, Vol. 40, No. 8, Aug. 2002, pp. 102-144.

W. B. Heinzelman, A. L. Murphy, H. S. Carvalho, and M. A. Perillo, "Middleware to support sensor network applications, "IEEE Networks, Vol. 18, No. 1, Jan. 2004, pp. 6-14.

Repository Staff Only: item control page
 
 
 
 
 
 
© Copyright 2007 MyAIS Faculty of Computer Science and Information Technology, University of Malaya – All Rights Reserved. Malaysian Abstracting and Indexing System is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.