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 language | English |
---|---|
Title of host publication | Proceedings - 2015 IEEE 9th International Conference on Self-Adaptive and Self-Organizing Systems, SASO 2015 |
Publisher | ACM, IEEE Computer Society |
Pages | 31-40 |
Number of pages | 10 |
Volume | 2015-October |
ISBN (Electronic) | 9781467375351 |
DOIs | |
Publication status | Published - 23 Oct 2015 |
Event | 9th IEEE International Conference on Self-Adaptive and Self-Organizing Systems, SASO 2015 - Cambridge, United States Duration: 21 Sept 2015 → 25 Sept 2015 |
Conference
Conference | 9th IEEE International Conference on Self-Adaptive and Self-Organizing Systems, SASO 2015 |
---|---|
Country/Territory | United States |
City | Cambridge |
Period | 21/09/15 → 25/09/15 |
Keywords
- Overlay network management
- Peer-to-Peer
- Self-organization
- Weighted k-clique matching