caa a22 4500 378856510 CHVBK 20180305123336.0 cr unu---uuuuu 161128e200306 xx s 000 0 ger 10.1515/PIKO.2003.80 doi (NATIONALLICENCE)gruyter-10.1515/PIKO.2003.80 Analysis of Peer-to-peer Joins in a Distributed Hash System [Elektronische Daten] [L. Wang, J. F. Barnes] Distributed Hash Tables (DHTs) are an important tool in building wide-area peer-to-peer applications. To achieve scalable performance, a node in a DHT system maintains links with a subset of all nodes in the overlay network. These links can have a significant effect on the overall performance of the DHT system. The network proximity of the links stored in the DHT will affect performance when used to search for objects. In this paper, we evaluate the performance of joins in Chord [10] and present some modified join algorithms. Our results indicate that with some modest increases in insert costs and a decrease in loadbalancing, our method can improve lookup latency by thirty percent. © Copyright by K.G. Saur Verlag 2003 Wang L. aut Barnes J. F. aut Praxis der Informationsverarbeitung und Kommunikation Walter de Gruyter GmbH & Co. KG 26/2(2003-06), 80-85 0930-5157 26:2<80 2003 26 PIKO https://doi.org/10.1515/PIKO.2003.80 text/html Onlinezugriff via DOI 1 research article jats NATIONALLICENCE 856 40 https://doi.org/10.1515/PIKO.2003.80 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Wang L. aut NATIONALLICENCE 700 1- Barnes J. F. aut NATIONALLICENCE 773 0- Praxis der Informationsverarbeitung und Kommunikation Walter de Gruyter GmbH & Co. KG 26/2(2003-06), 80-85 0930-5157 26:2<80 2003 26 PIKO CC0 http://creativecommons.org/publicdomain/zero/1.0 nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-gruyter