DocumentCode :
3677743
Title :
Peer Matcher: Decentralized Partnership Formation
Author :
Nicolae Vladimir Bozdog;Spyros Voulgaris;Henri Bal;Aart Van Halteren
Author_Institution :
Dept. of Comput. Sci., VU Univ. Amsterdam, Amsterdam, Netherlands
fYear :
2015
Firstpage :
31
Lastpage :
40
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.
Keywords :
"Peer-to-peer computing","Protocols","Synchronization","Polynomials","Clustering algorithms","Companies","Distributed algorithms"
Publisher :
ieee
Conference_Titel :
Self-Adaptive and Self-Organizing Systems (SASO), 2015 IEEE 9th International Conference on
Type :
conf
DOI :
10.1109/SASO.2015.11
Filename :
7306593
Link To Document :
بازگشت