Skip to main navigation Skip to search Skip to main content

Dissymmetrical P2P topology and resource locating algorithm

  • Yang Jing
  • , He Liang*
  • *Corresponding author for this work
  • East China Normal University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationProceedings - CIS Workshops 2007, 2007 International Conference on Computational Intelligence and Security Workshops, CISW 2007
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages335-341
Number of pages7
ISBN (Print)0769530737, 9780769530734
DOIs
StatePublished - 2007
Event2007 International Conference on Computational Intelligence and Security Workshops, CIS 2007 - Harbin, Heilongjiang, China
Duration: 15 Dec 200719 Dec 2007

Publication series

NameProceedings - CIS Workshops 2007, 2007 International Conference on Computational Intelligence and Security Workshops

Conference

Conference2007 International Conference on Computational Intelligence and Security Workshops, CIS 2007
Country/TerritoryChina
CityHarbin, Heilongjiang
Period15/12/0719/12/07

Keywords

  • Dissymmetrical
  • P2P
  • Peer-to-peer
  • Resource locating

Fingerprint

Dive into the research topics of 'Dissymmetrical P2P topology and resource locating algorithm'. Together they form a unique fingerprint.

Cite this