Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

A Small World Routing Model for Structured P2P Systems

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)
Guimin Huang ; Guilin Univ. of Electron. Technol., Guilin ; Ya Zhou ; Yanchun Zhang

Peer-to-Peer (P2P) technologies are considered as one of the fundamental technologies for the next generation Internet. P2P systems are classified into unstructured P2P systems or structured P2P systems depending on their topological structure of network. Most structured P2P systems are based on Chord protocol that is designed by using Distributed Hash Tables (DHTs). However, some issues have not still been addressed in structured P2P systems based on DHTs, which include high lookup failure rate, low effective proximity routing, and poor proximity neighbor selection. This paper proposes a Small World Routing Model (SWRM) based on Chord for solving the above issues. The idea of the SWRM comes from the small world characteristic in networks. The SWRM classifies nodes on a network into two classes, which include common nodes and super nodes. The classification principle depends on the status of links with other nodes. Every node in the SWRM can be congregated into different clusters depending on the congregating coefficients and the average shortest hop distance between two chosen nodes. Finally, this paper presents the experimental results of comparing the performance between SWRM and Chord. The experimental results show that it takes fewer lookup hops for the SWRM to find object nodes than Chord, and it takes fewer average lookup successful hops for the SWRM to find object nodes than Chord. Meanwhile, the SWRM has better proximity neighbor selection and is more consistent with the SWC than Chord.

Published in:

Information Science and Engineering, 2008. ISISE '08. International Symposium on  (Volume:1 )

Date of Conference:

20-22 Dec. 2008