A highly flexible data structure for multi-level visibility of P2P communities

  • Authors:
  • Debmalya Biswas;Krishnamurthy Vidyasankar

  • Affiliations:
  • IRISA/INRIA, Campus Universitaire de Beaulieu, Rennes, France;Dept. of Computer Science, Memorial University of Newfoundland, St. John's, NL, Canada

  • Venue:
  • ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Peer to Peer (P2P) communities (or "interest groups") are referred to as nodes that share a common interest. Each peer in the system claims to have some interests and, accordingly, would like to become a member of these groups. The available interest groups are arranged according to a hierarchical semantics ontology, and managed with a semantic overlay network. P2P community structure is highly dynamic: a peer may be added to or deleted from a community; communities may be added or deleted; communities may be merged or split; and sub-communities may become parent-level communities and vice versa. In this paper, we propose a highly flexible multi-level data structure to capture the visibility aspect of P2P communities. The data structure is simple, facilitates dynamic changes easily and efficiently in a decentralized fashion, and is highly scalable.