A Proximity-Based Self-Organizing Hierarchical Overlay Framework for Distributed Hash Tables

• DOI: 10.1093/ietcom/e90-b.7.1651
• Publication Date: 2007-07-10T14:03:23Z
• Authors: K. SHIN; S. LEE; G. LIM; H. YOON
• Keywords: Distributed hash table; Overlay network

Several structured peer-to-peer networks have been created to solve the scalability problem of previous systems such as Gnutella and Napster. These which support distributed hash table functionality construct a sort overlay network, can cause topology mismatch between underlying physical network. To this problem, we propose topology-aware hierarchical framework for DHTs. The approach is based on concept that global Internet also architecture, is, network networks. This puts forth two benefits: finding data in physically near place with high probability, smaller lookup time. Our different from other architecture sense it provides specific self-organizing grouping algorithm. additional optimization schemes complete basic algorithm constructs structure without any central control.