By Topic

An Improved P2P Lookup Protocol 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

5 Author(s)
Xu Ke ; Dept. of Electron. Eng., Beijing Univ. of Posts & Telecommun., Beijing ; Song Meina ; Pi Renjie ; Wang Xiaohui
more authors

With the development of the peer-to-peer technology, a lot of lookup protocols have come out. Although we can benefit from different protocols separately, our research shows that given a proper model, most of the seemingly different protocols can be classified to a same framework. Since the essence of P2P lookup protocol is to find a specific node from network, some classic lookup arithmetic models can be naturally considered. In this paper, we firstly introduce the binary tree model to analyze some popular P2P lookup protocols, then give an improved Chord arithmetic based on the binary tree.

Published in:

Pervasive Computing and Applications, 2008. ICPCA 2008. Third International Conference on  (Volume:2 )

Date of Conference:

6-8 Oct. 2008