Performance Analysis of an ISP-based Distributed Sloppy Hash Table

University essay from Blekinge Tekniska Högskola/Sektionen för datavetenskap och kommunikation; Blekinge Tekniska Högskola/Sektionen för datavetenskap och kommunikation

Author: Md. Wahid Murad; Odion Ehimiaghe; [2011]

Keywords: ISP; DHT; DSHT; Lookup Time;


Distributed Hash Table (DHT) systems are the basics for routing protocols in peer-to-peer network, suitable for flat design (non-hierarchical systems) ensuring evenly distributed file storage. But a well structured and hierarchical system providing for scalability, fault tolerance and to cater adequately for web cashing and multicast resource control in Internet applications in mobile environment is the use of distributed sloppy hash table (DSHT). In our work we will be working on how a well structured overlay application that will perform better in terms of scalability, lookup time and ease of use. We will focus on the application of real time usage with the incorporation of ISP (internet service provider) based partitioning for DSHTs. The sloppy hash DHT is employed to take advantageous use of low round trip times. The ISP bash DSHT yields some additional benefits to regular DHTs. These benefits include the use of pointers to reference keys in particular layers, thereby avoiding data replication at nodes for bandwidth utilization. Also, effective use of spillover in concentric rings is employed for load balancing and the phenomenon of distance optimization by the introduction of geographical proximity.

  AT THIS PAGE YOU CAN DOWNLOAD THE WHOLE ESSAY. (follow the link to the next page)