A location-aware peer-to-peer overlay network

Chi Jen Wu, De Kai Liu*, Ren Hung Hwang


研究成果: Article同行評審

10 引文 斯高帕斯(Scopus)


This work describes a novel location-aware, self-organizing, fault-tolerant peer-to-peer (P2P) overlay network, referred to as Laptop. Network locality-aware considerations are a very important metric for designing a P2P overlay network. Several network proximity schemes have been proposed to enhance the routing efficiency of existing DHT-based overlay networks. However, these schemes have some drawbacks such as high overlay network and routing table maintenance overhead, or not being completely self-organizing. As a result, they may result in poor scalability as the number of nodes in the system grows. Laptop constructs a location-aware overlay network without pre-determined landmarks and adopts a routing cache scheme to avoid maintaining the routing table periodically. In addition, Laptop significantly reduces the overlay maintenance overhead by making each node maintain only the connectivity between parent and itself. Mathematical analysis and simulations are conducted to evaluate the efficiency, scalability, and robustness of Laptop. Our mathematical analysis shows that 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 latency stretch is 1.6 and the average routing path length is only about three in 10000 Laptop nodes, and the maximum degree of a node is bounded by 32.

頁(從 - 到)83-102
期刊International Journal of Communication Systems
出版狀態Published - 1月 2007


深入研究「A location-aware peer-to-peer overlay network」主題。共同形成了獨特的指紋。