Evaluation of a novel space filling curve and its application to the P2P overlay network

P2P networks can achieve high scalability sincethey distribute service contents/resources to multiple nodesin the network. In a P2P network, it is necessary to searchthe resource location on the network when we use some contents/resources. Space filling curve is known as technique tomap information of a multi-dimensional space such as locationinformation onto a one-dimensional space such as ID.We have proposed a novel space filling curve for P2P overlaynetworks considering the proximity of nodes based on the geographicalinformation of the nodes and reducing the communicationdelay proportional to the geographical distance of thenodes. By using the proposed space filling curve, we can convertgeographic information of nodes into their ID (label) ofP2P network. In this paper, we evaluate the space filling curvefor P2P networks and apply it on a virtual network map. Onthe virtual network map, each node has the coordinated positioninformation which is proportional to the communicationdelay with its neighbor nodes. Through the numerical evaluation,we confirmed that the proposed curve is more suitablefor handling hierarchical-spread nodes than the conventionalcurves on the virtual network map.