By Topic

Resource discovery in location-aware effective P2P network model

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)
Bo Yang ; PCN & CAD Center, Beijing Univ. of Posts & Telecommun., Beijing, China ; Meina Song ; Junde Song

Resource discovery is a key component of P2P network. The resource discovery algorithm complexities of classic models, such as Chord and Pastry, are always equal or even bigger than O(logN), which means while the network scale increasing, the time delay will also increase rapidly without a ceiling. In this paper, we present a new P2P network model for resource discovery. Firstly, we take location-aware into account to divide the whole network into several domains, so that the topology mismatch problem between the P2P logical topology and the physical topology can be solved. Furthermore, in order to control the algorithm complexity as a constant, we assign each domain a super peer to help normal peers to do some operations, such as resource publishing and searching. Comparing the performance of this model with Chord, the results show the new model can reduce the resource discovery complexity to a constant, and significantly shorten the latency of the searching process.

Published in:

Communications Technology and Applications, 2009. ICCTA '09. IEEE International Conference on

Date of Conference:

16-18 Oct. 2009