• DocumentCode
    532434
  • Title

    Chord algorithm based on two-way routing table

  • Author

    Ziyang, Wang ; Yyin, Siqing

  • Author_Institution
    Sch. of Electron. & Comput. Sci. & Technol., North Univ. of China, Taiyuan, China
  • Volume
    7
  • fYear
    2010
  • fDate
    22-24 Oct. 2010
  • Abstract
    Chord algorithm is a typical and relatively successful routing algorithm in the structured P2P network, but it needs to be improved in searching efficiency. By the method adding a reverse routing table for each node,the finding each hop is as close as possible the target node to reduce search times in the search process, that is, to improve the search efficiency. The analysis of examples proves that routing hop times have a certain decrease in the search process, and the search efficiency is improved.
  • Keywords
    peer-to-peer computing; search problems; telecommunication network routing; chord algorithm; reverse routing table; search process; structured P2P network; two-way routing table; Routing; Chord; P2P; Two way routing table; routing table;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Application and System Modeling (ICCASM), 2010 International Conference on
  • Conference_Location
    Taiyuan
  • Print_ISBN
    978-1-4244-7235-2
  • Electronic_ISBN
    978-1-4244-7237-6
  • Type

    conf

  • DOI
    10.1109/ICCASM.2010.5620520
  • Filename
    5620520