A Small World Routing Model for Structured P2P Systems

Full text for this resource is not available from the Research Repository.

Huang, Guimin, Zhou, Ya and Zhang, Yanchun (2008) A Small World Routing Model for Structured P2P Systems. In: International Symposium on Information Science and Engieering 2008, ISISE '08. Yu, Fei, Yue, Guangxue, Zhigang, Chen and Zhang, Jun, eds. IEEE Computer Society, Los Alamitos, California, pp. 632-636.


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. --ISISE conference held: Shanghai, China, 20-22 December, 2008.

Dimensions Badge

Altmetric Badge

Item type Book Section
URI https://vuir.vu.edu.au/id/eprint/6425
DOI 10.1109/ISISE.2008.332
Official URL http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arn...
ISBN 9781424427274
Subjects Historical > FOR Classification > 0806 Information Systems
Historical > FOR Classification > 0807 Library and Information Studies
Historical > SEO Classification > 970108 Expanding Knowledge in the Information and Computing Sciences
Historical > Faculty/School/Research Centre/Department > School of Engineering and Science
Keywords ResPubID16394, peer-to-peer computing, protocols, table lookup, telecommunication network routing, topology, Chord protocol, distributed hash tables, lookup failure rate, next generation Internet, proximity neighbor selection, proximity routing, small world routing model, unstructured P2P systems, chord, congregating coefficient, routing models, small world, characteristic, structured peer-to-peer systems
Citations in Scopus 2 - View on Scopus
Download/View statistics View download statistics for this item

Search Google Scholar

Repository staff login