Capability-Aware ID Assignment and Message Routing Based on Skip List in Large-Scale Heterogeneous P2P Networks

In this paper, we propose capability-aware ID assignment and message routing based on skip list in order to perform object placement and message routing in large-scale heterogeneous P2P networks. In the proposed ID assignment, two identifications are utilized; TypelD and HashlD. The TypeID is assigned to each node based on its forwarding capability, data-storage capability, mobility, and availability, and it is also utilized in order to specify the capabilities of a node where an object is stored. On the other hand, HashlD is utilized for providing load balancing among nodes with the same capabilities. Moreover, in the proposed routing, message routing is performed based on TypelD, and then additional routing is performed based on HashlD. With the proposed method, it is expected that objects are stored and searched based on the capabilities of each node. We evaluate the performance of the proposed method with simulation, and we investigate the effectiveness of the method. From numerical examples, we find that the proposed method is useful for storing