Multiple Order-Preserving Hash Functions for Load Balancing in P2P Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Int. J. Communication Networks and Distributed Systems Year : 2017

Multiple Order-Preserving Hash Functions for Load Balancing in P2P Networks

Abstract

Hash functions are at the heart of data insertion and retrieval in DHT-based overlays. However, a standard hash function destroys the natural ordering of data. To perform efficient range queries processing, in a minimum number of hops, more and more systems opt for an order-preserving hash function to place data. Unlike a standard hash function, this technique cannot evenly distribute data among peers. In this paper, we propose a novel approach to improve the data dissemination using several order-preserving hash functions. We describe a protocol that allows an overloaded peer to change its hash function at run-time. Then, we show that all peers should not necessarily use the same hash function in an overlay to insert or look for an item. Finally, we demonstrate through simulations that this strategy greatly improves the dissemination of data items. As this technique does not require any overall coordination, it is well suited to overloaded P2P systems facing unstable topologies. To our knowledge, this is the first load balancing solution using multiple order-preserving hash functions in structured overlays.
Fichier principal
Vignette du fichier
Multiple Order-Preserving Hash Functions for Load Balancing in P2P Networks.pdf (2.07 Mo) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01417267 , version 1 (15-12-2016)

Identifiers

  • HAL Id : hal-01417267 , version 1

Cite

Maeva Antoine, Fabrice Huet. Multiple Order-Preserving Hash Functions for Load Balancing in P2P Networks. Int. J. Communication Networks and Distributed Systems, 2017, x,No.x. ⟨hal-01417267⟩
9 View
52 Download

Share

Gmail Mastodon Facebook X LinkedIn More