Efficient discovery of implicitly formed peer-to-peer communities

M. S. Khambatti, K. D. Ryu, Partha Dasgupta

Research output: Contribution to journalArticlepeer-review

35 Scopus citations

Abstract

Current peer-to-peer systems are targeted for information sharing, file storage, searching, and indexing, often using an overlay network. In this article we expand the scope of peer-to-peer systems to include the concept of "communities." Communities are like interest groups, modelled after human communities, and can overlap. They can also exist without anyone knowing about their existence. Communities are created, implicitly when one or more entities claim an interest in the same topic. Our work focuses on efficient methods to discover the formation of these self-configuring communities. We investigate the behaviour of randomly created communities and model the complexity of discovery algorithms. Discovering communities on the fly is essential to being able to perform community-directed searching. In addition, efficient discovery algorithms allow us to manage quickly changing community structures (dynamic communities, failures, mobile nodes, and so on). We use simulations to discover the architecture of randomly created communities and then perform studies on techniques for discovering communities.

Original languageEnglish (US)
Pages (from-to)155-164
Number of pages10
JournalInternational Journal of Parallel and Distributed Systems and Networks
Volume5
Issue number4
StatePublished - Dec 1 2002

Keywords

  • Distributed computing
  • Peer communities
  • Peer-to-peer computing
  • Self-configuring networks

ASJC Scopus subject areas

  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Efficient discovery of implicitly formed peer-to-peer communities'. Together they form a unique fingerprint.

Cite this