DocumentCode
3698441
Title
New service discovery algorithm based on DHT for mobile application
Author
De-gan Zhang;Wen-bin Li;Zhen Ma
Author_Institution
Tianjin Key Lab of Intelligent Computing &
fYear
2015
fDate
6/1/2015 12:00:00 AM
Firstpage
145
Lastpage
147
Abstract
In order to solve how to enhance the discovery efficiency and coverage, based on DHT (Distributed Hash Table), 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
"Fingers","Peer-to-peer computing","Algorithm design and analysis","Redundancy","Servers","Mobile applications","Conferences"
Publisher
ieee
Conference_Titel
Sensing, Communication, and Networking (SECON), 2015 12th Annual IEEE International Conference on
Type
conf
DOI
10.1109/SAHCN.2015.7338301
Filename
7338301
Link To Document