NDLI: Self-optimization of DHT lookups through run-time performance analysis

Content Provider	IEEE Xplore Digital Library
Author	Junemann, K. Hartenstein, H.
Copyright Year	2014
Description	Author affiliation: Steinbuch Centre for Comput. (SCC), Karlsruhe Inst. of Technol. (KIT), Karlsruhe, Germany (Junemann, K.; Hartenstein, H.)
Abstract	Distributed Hash Tables (DHTs) provide information lookup within a Peer-to-Peer (P2P) network. A multitude of distributed applications leverages DHTs for offering more advanced services such as distributed file systems, web caches or distributed DNS. For such DHT-based applications, lookup performance is highly important. However, lookup performance is severely affected by network characteristics, i.e., churn and connectivity issues due to NAT routers. As those characteristics are heavily influenced by user behavior, changes are not only likely but also hard to predict. Although DHTs are known for their self-organization, current implementations often do not adapt optimally to variation in network characteristics. In this paper, we propose to dynamically optimize the client through tuning its parameters at run-time. For doing so, different configurations are tested and compared automatically. To reduce overhead, requests sent to other peers are recorded and replayed by a simulation engine, if the same peer is queried again using the same parameter. We evaluated our approach at two exemplary scenarios of the future state of the BitTorrent Mainline DHT (MDHT), one of the most widely used public DHTs. In these scenarios, the lookups of a client using static parameters were more than three times slower and had a 25% higher network overhead than those of an adaptive client. With only 4 additional UDP packets sent per second and a one-digit CPU load, the proposed approach also induces minimal overhead.
Starting Page	407
Ending Page	415
File Size	808353
Page Count	9
File Format	PDF
ISBN	9781479953127
e-ISBN	9781479953134
DOI	10.1109/HPCSim.2014.6903714
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-07-21
Publisher Place	Italy
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis Routing Approximation methods Optimization DHT Self-Optimization Simulation Kademlia Parallel processing Approximation algorithms Lookup Peer-to-peer computing Performance
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A heuristic bootstrapping mechanism for Kademlia

The routing performance of logarithmic-hop structured P2P overlay

Improving Lookup Performance Over a Widely-Deployed DHT

Analysis and optimization of routing trust values in a Kademlia-based Distributed Hash Table in a malicious environment

Analytical Study on Improving DHT Lookup Performance under Churn

A Desktop Grid enabled parallel Barnes-Hut algorithm

Evaluation of the Broadcast Operation in Kademlia

A lookup algorithm for P2P-CDN

A near-optimal one hop DHT lookup in structure peer-to-peer networks

Self-optimization of DHT lookups through run-time performance analysis

Similar Documents

A heuristic bootstrapping mechanism for Kademlia

The routing performance of logarithmic-hop structured P2P overlay

Improving Lookup Performance Over a Widely-Deployed DHT

Analysis and optimization of routing trust values in a Kademlia-based Distributed Hash Table in a malicious environment

Analytical Study on Improving DHT Lookup Performance under Churn

A Desktop Grid enabled parallel Barnes-Hut algorithm

Evaluation of the Broadcast Operation in Kademlia

A lookup algorithm for P2P-CDN

A near-optimal one hop DHT lookup in structure peer-to-peer networks

Self-optimization of DHT lookups through run-time performance analysis