Subscribe
Issue No.07  July (2009 vol.20)
pp: 10231037
YungChih Lin , National ChengKung University, Tainan
HungChang Hsiao , National ChengKung University, Tainan
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.173
ABSTRACT
Smallworld (SW) networks possess two properties, namely low diameter and high clustering coefficient, which are often desired by largescale peertopeer networks. Prior studies have shown that the construction of an SW network can be based on a dregular graph, and each node in the graph maintains d local neighbors and a small constant number of longdistance contacts. However, it is commonly understood that it is difficult to construct a short route in an SW network, given source (s) and target (t) nodes, though an SW network guarantees that a short route from s to t exists. Prior work in [1] proposed a navigable SW network for a ddimensional lattice such that a simple localized routing algorithm can be devised to route a message from s to t using O(\log^{2}{\cal X}) hops, where {\cal X} is the number of nodes in the network. In this paper, we present a novel navigable SW network based on a hierarchical model. Compared to previous efforts, the novelty of our study presents 1) that our network construction based on a hierarchical model is decentralized, 2) that routing a message between any two nodes in our SW network takes logarithmic hopcount in expectation, 3) that our SW network has high cluster coefficient, and 4) that the performance of our proposal is mathematically provable. We support the performance of our proposal in this study through rigorous, thorough performance analysis and extensive simulations.
INDEX TERMS
Peertopeer systems, small world, overlay networks, tree hierarchy, performance analysis.
CITATION
YungChih Lin, HungChang Hsiao, "Building SmallWorld PeertoPeer Networks Based on Hierarchical Structures", IEEE Transactions on Parallel & Distributed Systems, vol.20, no. 7, pp. 10231037, July 2009, doi:10.1109/TPDS.2008.173
REFERENCES
