A Distributed Hashing Algorithm Based on Virtual Neighborhood
Search and Retrieval
Ebada Sarhan(1) , Mohamed Belal1 and Mohamed Khafagy(2)
  (1) Computer Science Department, Faculty of Computers & Information, Helwan University
 (2) Computer Science Department, Faculty of Information Systems & Computer Science,
6th October University
 

Abstract:
Dealing with a huge amount of data nowadays increases the need to distribute this data among cooperated servers in order to increase its availability and the performance of accessing and retrieving data. Rapidly growing networks imply that future files and database system are likely to be constructed as networked clusters of Distributed nodes and algorithms should be devised to work in this environment In this paper we describe the design and implementation of an innovated distributed algorithm using arbitrary architecture. This algorithm spreads data across multiple nodes in network with an arbitrary and vaiying architecture. Using novel autonomous location discovery and searching algorithm that cooperates with the other nodes to uniformly distribute the data among the neighborhood instead of using a centralized algorithm. Performance results show that the innovated algorithm is superior to the extendable hashing Algorithm EH* [5] in the distributed environment based on several performance measurements.
Keywords: Distributed Hashing Algorithm, Virtual Toplogy, Data Retrival Cost, Communication Complexity