Utilize este identificador para referenciar este registo: http://hdl.handle.net/10362/156119
Título: Enriching Kademlia by Partitioning
Autor: Monteiro, João
Costa, Pedro Akos
Leitão, João
De La Rocha, Alfonso
Psaras, Yiannis
Palavras-chave: Decentralized Web
Distributed Hash Tables
Peer-to-Peer
Computer Networks and Communications
Hardware and Architecture
Information Systems
Information Systems and Management
Data: 2022
Editora: Institute of Electrical and Electronics Engineers (IEEE)
Citação: Monteiro, J., Costa, P. A., Leitão, J., De La Rocha, A., & Psaras, Y. (2022). Enriching Kademlia by Partitioning. In Proceedings : 2022 IEEE 42nd International Conference on Distributed Computing Systems Workshops, ICDCSW 2022 (pp. 33-38). (Proceedings - 2022 IEEE 42nd International Conference on Distributed Computing Systems Workshops, ICDCSW 2022). Institute of Electrical and Electronics Engineers (IEEE). https://doi.org/10.1109/ICDCSW56584.2022.00016
Resumo: Decentralizing the Web is becoming an increasingly interesting endeavor that aims at improving user security and privacy as well as providing guaranteed ownership of content. One such endeavor that pushes towards this reality, is Protocol Labs' Inter-Planetary File System (IPFS) network, that provides a decentralized large scale file system to support the decentralized Web. To achieve this, the IPFS network leverages the Kademlia DHT to route and store pointers to content stored by network members (i.e., peers). However, due to the large number of network peers, content, and accesses, the DHT routing needs to be efficient and quick to enable a decentralized web that is competitive. In this paper, we present work in progress that aims at improving the Kademlia DHT performance through the manipulation of DHT identifiers by adding prefixes to identifiers. With this, we are able to bias the DHT topological organization towards locality (which can be either geographical or applicational), which creates partitions in the DHT and enables faster and more efficient query resolution on local content. We designed prototypes that implement our proposal, and performed a first evaluation of our work in an emulated network testbed composed of 5000 nodes. Our results show that our proposal can benefit the DHT look up on data with locality with minimal overhead.
Descrição: Experiments presented in this paper were carried out using the Grid'5000 testbed, supported by a scientific interest group hosted by Inria and including CNRS, RENATER and several Universities as well as other organizations (see https://www.grid5000.fr). Publisher Copyright: © 2022 IEEE.
Peer review: yes
URI: http://hdl.handle.net/10362/156119
DOI: https://doi.org/10.1109/ICDCSW56584.2022.00016
ISBN: 978-1-6654-8880-8
978-1-6654-8879-2
ISSN: 1545-0678
Aparece nas colecções:FCT: DI - Documentos de conferências internacionais

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
monteiro2022.pdf308,64 kBAdobe PDFVer/Abrir


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.