A Locality-Aware Peer-to-peer Overlay Network

• Main Authors: Chi-Jen Wu, 吳齊人
• Other Authors: Ren-Hung Hwang
• Format: Others
• Language: en_US
• Published: 2004
• Online Access: http://ndltd.ncl.edu.tw/handle/27834647358072830574

碩士 === 國立中正大學 === 通訊工程研究所 === 92 === This work describes a novel locality-aware structured peer-to-peer (P2P) overlay network, referred to as LAPTOP. Since most structured P2P overlay networks perform routing based on distributed hash tables (DHTs), which usually result in high complexity on overlay maintenance, one important aspect of the overlay construction is how to reduce the maintenance overhead while maintaining efficient routing and network locality. LAPTOP organizes nodes into a locality-aware, tree-based overlay network in a self-organizing manner. The tree-based overlay network enables LAPTOP to utilize the parental relation to reduce the overhead of overlay maintenance. LAPTOP adopts the proximity neighbor selection (PSN) in the routing table construction to achieve low routing latency. Mathematical analysis and simulations are conducted to evaluate the efficiency and scalability of LAPTOP. Our mathematical analysis shows that the routing table size of a node is bounded by logd N ﹡(d-1), the routing path length is bounded by logd N, and the joining and leaving overhead is bounded by d logd N, where N is the number of nodes in the system and d is the maximum degree of each node on the overlay tree. Our simulation results show that the average path stretch and routing path length are only 1.48 and 3.8, respectively, in a system of 100 000 nodes with maximum degree of 16 . As compared to previous research, the proposed LAPTOP approach has the advantage of reducing the overlay maintenance overhead while still providing efficient routing.