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

  • Simon BougetEmail author
  • Yérom-David Bromberg
  • François TaïaniEmail author
  • Anthony VentresqueEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10320)


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.



This work was supported, in part, by Science Foundation Ireland grant 13/RC/2094 to Lero - the Irish Software Research Centre (, and by the ANR (Agence Nationale de la Recherche) Project PAMELA n. ANR-16-CE23-0016.


  1. 1.
    Bai, X., Bertier, M., Guerraoui, R., Kermarrec, A.-M., Leroy, V.: Gossiping personalized queries. In: EDBT 2010 (2010)Google Scholar
  2. 2.
    Baldoni, R., Beraldi, R., Quéma, V., Querzoni, L., Piergiovanni, S.T.: TERA: topic-based event routing for peer-to-peer architectures. In: DEBS 2007, pp. 2–13. ACM (2007)Google Scholar
  3. 3.
    Beloglazov, A., Abawajy, J., Buyya, R.: Energy-aware resource allocation heuristics for efficient management of data centers for cloud computing. In: FGCS, pp. 755–768 (2012)Google Scholar
  4. 4.
    Bertier, M., Frey, D., Guerraoui, R., Kermarrec, A.-M., Leroy, V.: The gossple anonymous social network. In: Gupta, I., Mascolo, C. (eds.) Middleware 2010. LNCS, vol. 6452, pp. 191–211. Springer, Heidelberg (2010). doi: 10.1007/978-3-642-16955-7_10 CrossRefGoogle Scholar
  5. 5.
    Bouget, S., Kervadec, H., Kermarrec, A.-M., Taïani, F.: Polystyrene: the decentralized data shape that never dies. In: ICDCS’14, pp. 288–297, June 2014Google Scholar
  6. 6.
    Boutet, A., Frey, D., Guerraoui, R., Jégou, A., Kermarrec, A.-M.: WhatsUp decentralized instant news recommender. In: IPDPS (2013)Google Scholar
  7. 7.
    Boutet, A., Frey, D., Guerraoui, R., Kermarrec, A.-M., Patra, R.: HyRec: leveraging browsers for scalable recommenders. In: Middleware, pp. 85–96 (2014)Google Scholar
  8. 8.
    Boutet, A., Kermarrec, A.-M., Mittal, N., Taïani, F.: Being prepared in a sparse world: the case of KNN graph construction. In: ICDE 2016, pp. 172–181 (2016)Google Scholar
  9. 9.
    Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. In: PODC 1987 (1987)Google Scholar
  10. 10.
    Dong, W., Moses, C., Li, K.: Efficient k-nearest neighbor graph construction for generic similarity measures. In: WWW, pp. 577–586 (2011)Google Scholar
  11. 11.
    Frey, D., Goessens, M., Kermarrec, A.-M.: Behave: behavioral cache for web content. In: Magoutis, K., Pietzuch, P. (eds.) DAIS 2014. LNCS, vol. 8460, pp. 89–103. Springer, Heidelberg (2014). doi: 10.1007/978-3-662-43352-2_8 CrossRefGoogle Scholar
  12. 12.
    Frey, D., Guerraoui, R., Kermarrec, A.-M., Koldehofe, B., Mogensen, M., Monod, M., Quéma, V.: Heterogeneous gossip. In: Bacon, J.M., Cooper, B.F. (eds.) Middleware 2009. LNCS, vol. 5896, pp. 42–61. Springer, Heidelberg (2009). doi: 10.1007/978-3-642-10445-9_3 CrossRefGoogle Scholar
  13. 13.
    Frey, D., Jégou, A., Kermarrec, A.-M.: Social market: combining explicit and implicit social networks. In: Défago, X., Petit, F., Villain, V. (eds.) SSS 2011. LNCS, vol. 6976, pp. 193–207. Springer, Heidelberg (2011). doi: 10.1007/978-3-642-24550-3_16 CrossRefGoogle Scholar
  14. 14.
    Frey, D., Kermarrec, A.-M., Maddock, C., Mauthe, A., Roman, P.-L., Taïani, F.: Similitude: decentralised adaptation in large-scale P2P recommenders. In: Bessani, A., Bouchenak, S. (eds.) DAIS 2015. LNCS, vol. 9038, pp. 51–65. Springer, Cham (2015). doi: 10.1007/978-3-319-19129-4_5 Google Scholar
  15. 15.
    Grace, P., Hughes, D., Porter, B., Blair, G.S., Coulson, G., Taïani, F.: Experiences with open overlays: a middleware approach to network heterogeneity. In: Eurosys 2008, Glasgow, Scotland UK, 31 March-4 April 2008, pp. 123–136. ACM (2008)Google Scholar
  16. 16.
    Halder, K., Bellur, U., Kulkarni, P.: Risk aware provisioning and resource aggregation based consolidation of virtual machines. In: CLOUD, pp. 598–605 (2012)Google Scholar
  17. 17.
    Jelasity, M., Montresor, A., Babaoglu, O.: T-man: gossip-based fast overlay topology construction. Comput. Netw. 53(13), 2321–2339 (2009)CrossRefzbMATHGoogle Scholar
  18. 18.
    Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.-M., Van Steen, M.: Gossip-based peer sampling. ACM ToCS 25(3), 8 (2007)CrossRefGoogle Scholar
  19. 19.
    Kermarrec, A.-M., Taïani, F.: Diverging towards the common good: heterogeneous self-organisation in decentralised recommenders. In: SNS 2012 (2012)Google Scholar
  20. 20.
    Koomey, J., Taylor, J.: New data supports finding that nearly a third of capital in enterprise data centers is wasted (2015)Google Scholar
  21. 21.
    Li, X., Ventresque, A., Iglesias, J.O., Murphy, J.: Scalable correlation-aware virtual machine consolidation using two-phase clustering. In: HPCS, pp. 237–245 (2015)Google Scholar
  22. 22.
    Liu, J., Zhou, M.: Tree-assisted gossiping for overlay video distribution. J. Multimedia Tools Appl. 29(3), 211–232 (2006)CrossRefGoogle Scholar
  23. 23.
    Montresor, A., Jelasity, M.: Peersim: a scalable p2p simulator. In: P2P 2009 (2009)Google Scholar
  24. 24.
    Patel, J.A., Riviere, E., Gupta, I., Kermarrec, A.: Rappel: exploiting interest and network locality to improve fairness in publish-subscribe systems. Comput. Netw. 53(13), 2304–2320 (2009)CrossRefzbMATHGoogle Scholar
  25. 25.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: SIGCOMM 2001, pp. 161–172. ACM, New York (2001)Google Scholar
  26. 26.
    Rowstron, A., Druschel, P.: Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001). doi: 10.1007/3-540-45518-3_18 CrossRefGoogle Scholar
  27. 27.
    Saber, T., Ventresque, A., Brandic, I., Thorburn, J., Murphy, L.: Towards a multi-objective VM reassignment for large decentralised data centres. In: UCC (2015)Google Scholar
  28. 28.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. ACM SIGCOMM Comput. Commun. Rev. 31(4), 149–160 (2001)CrossRefGoogle Scholar
  29. 29.
    Verma, A., Dasgupta, G., Nayak, T.K., De, P., Kothari, R.: Server workload analysis for power minimization using consolidation. In: USENIX ATC, p. 28 (2009)Google Scholar
  30. 30.
    Voulgaris, S., van Steen, M.: Epidemic-style management of semantic overlays for content-based searching. In: Euro-Par 2005 (2005)Google Scholar
  31. 31.
    Xu, F., Liu, F., Jin, H., Vasilakos, A.V.: Managing performance overhead of virtual machines in cloud computing: a survey, state of the art, and future directions. Proc. IEEE 102(1), 11–31 (2014)CrossRefGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2017

Authors and Affiliations

  1. 1.Université de Rennes 1 - IRISARennesFrance
  2. 2.ESIRRennesFrance
  3. 3.Lero@UCD, School of Computer ScienceUniversity College DublinDublinIreland

Personalised recommendations