By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Tomimoto, T. ; Nara Inst. of Sci. & Technol., Nara ; Tachibana, T. ; Sugimoto, K.

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

Published in:

Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE

Date of Conference:

26-30 Nov. 2007