• Refine your search:
  • 
    Keyword
  • 
    Creator / Publisher
  • 
    Year:
    
    • 2018 (1)
    • 2017 (1)
  • 
    Medium
  • 
    Type
  • 
    BLLDB-Access

Search in the Catalogues and Directories

All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year Sort by creator [A → Z]' creator [Z → A]' publishing year ↑ (asc)' publishing year ↓ (desc)' title [A → Z]' title [Z → A]' Simple Search Hits 1 – 2 of 2 1 Multiple order-preserving hash functions for load balancing in P2P networks Antoine, Maeva; Huet, Fabrice In: ISSN: 1754-3916 ; EISSN: 1754-3924 ; International journal of communication networks and distributed systems ; https://hal.inria.fr/hal-02392922 ; International journal of communication networks and distributed systems, Inderscience Publishers, 2018, 20 (1), pp.36-59. ⟨10.1504/IJCNDS.2018.088501⟩ (2018) BASE Show details 2 Multiple Order-Preserving Hash Functions for Load Balancing in P2P Networks Antoine, Maeva; Huet, Fabrice In: Int. J. Communication Networks and Distributed Systems ; https://hal.inria.fr/hal-01417267 ; Int. J. Communication Networks and Distributed Systems, 2017, x,No.x (2017) Abstract: International audience ; 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. Keyword: [INFO.INFO-DC]Computer Science [cs]/Distributed; and Cluster Computing [cs.DC]; hash functions; lexicographic order; load balancing; Parallel; skewed data; structured overlays URL: https://hal.inria.fr/hal-01417267/document https://hal.inria.fr/hal-01417267/file/Multiple%20Order-Preserving%20Hash%20Functions%20for%20Load%20Balancing%20in%20P2P%20Networks.pdf https://hal.inria.fr/hal-01417267 BASE Hide details

Mobile view All Catalogues UB Frankfurt Linguistik 0 IDS Mannheim 0 OLC Linguistik 0 UB Frankfurt Retrokatalog 0 DNB Subject Category Language 0 Institut für Empirische Sprachwissenschaft 0 Leibniz-Centre General Linguistics (ZAS) 0 Bibliographies BLLDB 0 BDSL 0 IDS Bibliografie zur deutschen Grammatik 0 IDS Bibliografie zur Gesprächsforschung 0 IDS Konnektoren im Deutschen 0 IDS Präpositionen im Deutschen 0 IDS OBELEX meta 0 MPI-SHH Linguistics Collection 0 MPI for Psycholinguistics 0 Linked Open Data catalogues Annohub 0 Online resources Link directory 0 Journal directory 0 Database directory 0 Dictionary directory 0 Open access documents BASE 2 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0