PeerMatcher: Decentralized Partnership Formation

N.V. Bozdog, S. Voulgaris, H.E. Bal, A. van Halteren

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

127 Downloads (Pure)

Abstract

This paper presents PeerMatcher, a fully decentralized algorithm solving the k-clique matching problem. The aim of k-clique matching is to cluster a set of nodes having pairwise weights into k-size groups of maximal total weight. Since solving the problem requires exponential time, PeerMatcher 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 PeerMatcher demonstrates its accuracy, efficiency, and scalability.
Original languageEnglish
Title of host publicationIEEE 9th International Conference on Self-Adaptive and Self-Organizing Systems
Publication statusPublished - 2015

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

Cite this