• DocumentCode
    2736766
  • Title

    An Improved P2P Lookup Protocol Model

  • Author

    Ke, Xu ; Meina, Song ; Renjie, Pi ; Xiaohui, Wang ; Yan, Li

  • Author_Institution
    Dept. of Electron. Eng., Beijing Univ. of Posts & Telecommun., Beijing
  • Volume
    2
  • fYear
    2008
  • fDate
    6-8 Oct. 2008
  • Firstpage
    1007
  • Lastpage
    1010
  • Abstract
    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.
  • Keywords
    peer-to-peer computing; protocols; table lookup; Chord arithmetic; P2P lookup protocol model; binary tree model; peer-to-peer technology; Arithmetic; Binary trees; Information retrieval; Peer to peer computing; Performance analysis; Routing protocols; Technological innovation; Binary Tree; Chord; Lookup Protocol; P2P; Route;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Pervasive Computing and Applications, 2008. ICPCA 2008. Third International Conference on
  • Conference_Location
    Alexandria
  • Print_ISBN
    978-1-4244-2020-9
  • Electronic_ISBN
    978-1-4244-2021-6
  • Type

    conf

  • DOI
    10.1109/ICPCA.2008.4783670
  • Filename
    4783670