Scalable Anti-KNN: Decentralized Computation of k-Furthest-Neighbor Graphs with HyFN

Files in This Item:
File Description SizeFormat 
DAIS17_paper_16.pdf980.92 kBAdobe PDFDownload
Title: Scalable Anti-KNN: Decentralized Computation of k-Furthest-Neighbor Graphs with HyFN
Authors: Bouget, Simon
Bromberg, Yérom-David
Taïani, François
Ventresque, Anthony
Permanent link:
Date: 22-Jun-2017
Online since: 2017-11-13T16:21:58Z
Abstract: The decentralized construction of k-Furthest-Neighbor graphs has been little studied, although such structures can play a very useful role, for instance in a number of distributed resource allocation problems. In this paper we define KFN graphs; we propose HyFN, a generic peer-to-peer KFN construction algorithm, and thoroughly evaluate its behavior on a number of logical networks of varying sizes.
Funding Details: Science Foundation Ireland
Type of material: Conference Publication
Publisher: Springer
Keywords: DecentralizedSelf-organizationP2PAlgorithmSimilarityEpidemic protocolGossip protocolScalabilityHyFNKNN graphsKFN graphs
DOI: 10.1007/978-3-319-59665-5_7
Language: en
Status of Item: Peer reviewed
Is part of: Lecture Notes in Computer Science, volume 10320
Conference Details: Distributed Applications and Interoperable Systems (DAIS), Neuchâtel, Switzerland, 2017
Appears in Collections:Computer Science Research Collection
PEL Research Collection

Show full item record

Google ScholarTM



This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.