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

Files in This Item:
 File SizeFormat
DownloadDAIS17_paper_16.pdf980.92 kBAdobe PDF
Title: Scalable Anti-KNN: Decentralized Computation of k-Furthest-Neighbor Graphs with HyFN
Authors: Bouget, SimonBromberg, Yérom-DavidTaïani, FrançoisVentresque, Anthony
Permanent link: http://hdl.handle.net/10197/9040
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
Funding Details: Lero
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
This item is made available under a Creative Commons License: https://creativecommons.org/licenses/by-nc-nd/3.0/ie/
Appears in Collections:Computer Science Research Collection
PEL Research Collection

Show full item record

Page view(s)

1,326
Last Week
1
Last month
checked on Dec 7, 2022

Download(s)

233
checked on Dec 7, 2022

Google ScholarTM

Check

Altmetric


If you are a publisher or author and have copyright concerns for any item, please email research.repository@ucd.ie and the item will be withdrawn immediately. The author or person responsible for depositing the article will be contacted within one business day.