Peer Matcher: Decentralized Partnership Formation

Nicolae Vladimir Bozdog, Spyros Voulgaris, Henri Bal, Aart van Halteren

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

Abstract

This paper presents Peer Matcher, a fully decentralized algorithm solving the k-clique matching problem. The aim of k-clique matching is to cluster a set of nodes having pair wise weights into k-size groups of maximal total weight. Since solving the problem requires exponential time, Peer Matcher employs a novel set of heuristics that aim at converging to the optimal grouping while keeping the associated time and computational complexity low. A key feature is the use of peer-to-peer communication. An extensive evaluation of Peer Matcher demonstrates its accuracy, efficiency, and scalability.
Original languageEnglish
Title of host publicationProceedings - 2015 IEEE 9th International Conference on Self-Adaptive and Self-Organizing Systems, SASO 2015
PublisherACM, IEEE Computer Society
Pages31-40
Number of pages10
Volume2015-October
ISBN (Electronic)9781467375351
DOIs
Publication statusPublished - 23 Oct 2015
Event9th IEEE International Conference on Self-Adaptive and Self-Organizing Systems, SASO 2015 - Cambridge, United States
Duration: 21 Sep 201525 Sep 2015

Conference

Conference9th IEEE International Conference on Self-Adaptive and Self-Organizing Systems, SASO 2015
CountryUnited States
CityCambridge
Period21/09/1525/09/15

Keywords

  • Overlay network management
  • Peer-to-Peer
  • Self-organization
  • Weighted k-clique matching

Fingerprint Dive into the research topics of 'Peer Matcher: Decentralized Partnership Formation'. Together they form a unique fingerprint.

Cite this