It is the cache of ${baseHref}. It is a snapshot of the page. The current page could have changed in the meantime.
Tip: To quickly find your search term on this page, press Ctrl+F or ⌘-F (Mac) and use the find bar.

A New Algorithm of Service Discovery Based on DHT for Mobile Application | Zhang | Journal of Networks
Journal of Networks, Vol 6, No 10 (2011), 1466-1474, Oct 2011
doi:10.4304/jnw.6.10.1466-1474

A New Algorithm of Service Discovery Based on DHT for Mobile Application

De-gan Zhang, Yu-xia Hu, Dong Wang, Yan-pin Liang

Abstract


In order to solve how to enhance the discovery efficiency and coverage, based on DHT (Distributed Hash Table) and Small World Theory, we put forward a new algorithm of service discovery for mobile application. In traditional DHT discovery algorithm, each node maintains the finger-table that store node information of adjacent node. By using Small-World Theory, we put forward adding a remote node into the finger-table and adding the corresponding remote index. It is different from selecting the remote connection node randomly. We select the remote connection node by calculating local node and it can assure not only the cove range of service discovery but also not increase the length of finger-table, which simplifies the calculation of the finger-table and maintenance work. The simulation proved that the algorithm can reduce the path length of service discovery effectively, improve success rate of service discovery


Keywords


service discovery, DHT, SWT, finger-table, coverage, mobile application

References


[1] Zhang D G. Web-Based Seamless Migration for Task-oriented Nomadic Service, International Journal of Distance Education Technology (JDET) [J]. 2006, 4(3): 108~115.
http://dx.doi.org/10.4018/jdet.2006070106

[2] I. Stoica R, Morris D, Karger M Kaashoek F, Balakrishnan H, Chord: a scalable peer-to-peer lookup service for Internet applications, In Proc ACM SIGCOMM01, San Diego, CA, Aug, 2001.

[3] Song Jiantao. Sume question research on Peer-to-Peer computing [D]. Shanghai: Fudan University of Information Science and Engineering, 2003

[4] Milgram, S. The small world problem[J]. Psychology Today, 2007, (2): 60~67

[5] Watts, D. J. and Strogatz, S. H. Collective dynamics of small-world networks [J]. Nature, 1998, 393: 440-442
http://dx.doi.org/10.1038/30918
PMid:9623998

[6] J. Kleiberg. The small-world phenomenon: An algorithmic perspective[R]. Cornell Computer Science Tech. Pep, 2009

[7] Daswani, Neil. Open Problems in Data-Sharing Peer-to-Peer Systems[C]. In: Proceedings of the 9th International Conference on Database Theory (ICDT). Siena, Italy: 2003.

[8] Zhao, B. Tapestry: An infrastructure for fault-tolerant wide-area location and routing [J]. Technical Report UCB/CSD-01-1141, Computer Science Division, U. C. Berkeley. 2010

[9] Lu Li. Research on P2P-based Network Resource Search Model [D]. Chongqing: Computer Application Technology of Chongqing University, 2007

[10] Zhang D G. 'A kind of new decision fusion method based on sensor evidence', Journal of information and Computational Science, 2008, 5 (1): 171-178.


Full Text: PDF


Journal of Networks (JNW, ISSN 1796-2056)

Copyright @ 2006-2014 by ACADEMY PUBLISHER – All rights reserved.