• DocumentCode
    2703982
  • Title

    Dissymmetrical P2P Topology and Resource Locating Algorithm

  • Author

    Jing, Yang ; Liang, He

  • Author_Institution
    East China Normal Univ., Shanghai
  • fYear
    2007
  • fDate
    15-19 Dec. 2007
  • Firstpage
    335
  • Lastpage
    341
  • Abstract
    The paper proposes a dissymmetrical and pure P2P topology based on K-ary-tree architecture named DSKTree topology, with the view of "node symmetrical characteristic", it can solve the unstable and linearly increasing scale problem in existing resource sharing application using pure P2P topology. We also design resource locating algorithm in DSKTree topology. The performance analysis shows that it can optimize the cost of locating and lower the impact to performance of pure P2P topology while the scale of the system increases.
  • Keywords
    peer-to-peer computing; resource allocation; tree data structures; DSKTree topology; K-ary-tree architecture; P2P topology; node symmetrical characteristic; resource locating algorithm; Algorithm design and analysis; Computational intelligence; Computer security; Helium; Network topology; Peer to peer computing; Performance analysis; Routing; Stability; Tornadoes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Intelligence and Security Workshops, 2007. CISW 2007. International Conference on
  • Conference_Location
    Harbin
  • Print_ISBN
    978-0-7695-3073-4
  • Type

    conf

  • DOI
    10.1109/CISW.2007.4425504
  • Filename
    4425504