• DocumentCode
    2564998
  • Title

    Hot-Chord: A Query Algorithm for Accelerating the Locating of Hot Resources

  • Author

    Miao Yuting ; Wu Chunming ; Jiang Ming

  • Author_Institution
    Comput. Sci. Coll., Zhejiang Univ., Hangzhou, China
  • fYear
    2010
  • fDate
    23-25 Sept. 2010
  • Firstpage
    1
  • Lastpage
    4
  • Abstract
    Chord is a common circular P2P model with high routing efficiency and stable data inquiring. This paper proposes the Hot-Chord algorithm according to the fact that hot resources have occupied the majority of searching in the P2P system. Hot-Chord algorithm constructs an inner chord dynamically by using the nodes which hot resources is locating, to decrease the inquiring space; Nodes join or leave the inner chord adaptively according to the variation of resources searching rate. On the basis of theoretical analysis and experimental simulation, this paper certifies that the Hot-Chord algorithm has not only the better searching efficiency in hot resources inquiring but also the lower the average number of hops in finding resources than the original Chord and some improved algorithms.
  • Keywords
    peer-to-peer computing; query processing; search problems; telecommunication network routing; P2P system; circular P2P model; hot resources; hot-chord algorithm; query algorithm; routing efficiency; searching efficiency; searching rate; stable data inquiring; theoretical analysis; Algorithm design and analysis; Analytical models; Computer science; Keyword search; Peer to peer computing; Query processing; Routing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless Communications Networking and Mobile Computing (WiCOM), 2010 6th International Conference on
  • Conference_Location
    Chengdu
  • Print_ISBN
    978-1-4244-3708-5
  • Electronic_ISBN
    978-1-4244-3709-2
  • Type

    conf

  • DOI
    10.1109/WICOM.2010.5601241
  • Filename
    5601241