Two Dimensional Overlay Peer-to-Peer Networks

As a popular way to share data among ordinary Internet users, peer-to-peer applications have consumed a significant portion of the network resources. Due to its nature of lacking a centralized coordination, a P2P application is challenged by efficiently locating the desired data objects distributed over the participating peers. In this paper, we present a two dimensional structure and the associated protocols for organizing peers into overlay networks. In the proposed overlay networks, distributed hash techniques are used to map a peer into a 2D space, within which one dimension is for the management of data objects, and the other is for fast query routing. The simulation experiments shows that the proposed methodology is able to achieve improved object search efficiency while keep the maintenance overhead low, making it an applicable way to manage large scale P2P applications.