Faster Content Access in KAD

被引：14
作者：
Steiner, Moritz [1 ]
Carra, Damiano [1 ]
Biersack, Ernst W. [1 ]
机构：
[1] Eurecom, Sophia Antipolis, France
来源：
P2P'08: EIGHTH INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING, PROCEEDINGS | 2008年
关键词：
D O I：
10.1109/P2P.2008.28
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Many different Distributed Hash Tables (DHTs) have been designed, but only few have been successfully deployed. The implementation of a DHT needs to deal with practical aspects (e.g. related to churn, or to the delay) that are often only marginally, considered in the design. In this paper, we analyze in detail the content retrieval process in KAD, the implementation of the DHT Kademlia that is part of several popular peer-to-peer clients. In particular, we present a simple model to evaluate the impact of different design parameters on the overall lookup latency We then perform extensive measurements on the lookup performance using an instrumented client. From the analysis of the results, we propose an improved scheme that is able to significantly decrease the overall lookup latency without increasing the overhead.
引用
收藏
页码：195 / 204
页数：10
相关论文
共 50 条
  • [21] Faster learning by reduction of data access time
    Chauhan, Vinod Kumar
    Sharma, Anuj
    Dahiya, Kalpana
    APPLIED INTELLIGENCE, 2018, 48 (12) : 4715 - 4729
  • [22] Faster learning by reduction of data access time
    Vinod Kumar Chauhan
    Anuj Sharma
    Kalpana Dahiya
    Applied Intelligence, 2018, 48 : 4715 - 4729
  • [23] Faster deterministic wakeup in multiple access channels
    De Marco, G
    Pellegrini, M
    Sburlati, G
    THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2005, 3701 : 196 - 204
  • [24] In race to deliver faster access, DSL leads
    不详
    INTERNET WORLD, 1997, 8 (10): : 18 - 18
  • [25] Achieving faster access to satellite link bandwidth
    Kapoor, A
    Falk, A
    Faber, T
    Pryadkin, Y
    IEEE Infocom 2005: The Conference on Computer Communications, Vols 1-4, Proceedings, 2005, : 2870 - 2875
  • [26] NHS Evidence: better and faster access to information
    Leng, Gillian C.
    LANCET, 2009, 373 (9674) : 1502 - 1504
  • [27] DYNAMIC MEMORIES WITH FASTER RANDOM AND SEQUENTIAL ACCESS
    WONG, CK
    TANG, DT
    IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1977, 21 (03) : 281 - 288
  • [28] Faster deterministic wakeup in multiple access channels
    De Marco, Gianluca
    Pellegrini, Marco
    Sburlati, Giovanni
    DISCRETE APPLIED MATHEMATICS, 2007, 155 (08) : 898 - 903
  • [29] ID Distribution in KAD
    Lin, Fuhong
    Lin, Fudong
    Chen, Changjia
    Wu, Hengkui
    Zhang, Hongke
    2010 2ND INTERNATIONAL ASIA CONFERENCE ON INFORMATICS IN CONTROL, AUTOMATION AND ROBOTICS (CAR 2010), VOL 3, 2010, : 384 - 387
  • [30] Kad Encryption Algorithm
    Li, Qiang
    Li, Hui
    Wen, Zhongling
    Liu, Zhibo
    PROCEEDINGS OF 2017 8TH IEEE INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND SERVICE SCIENCE (ICSESS 2017), 2017, : 684 - 687
12345