Efficient Batch Update of Unique Identifiers in a Distributed Hash Table for Resources in a Mobile Host
Yoo Chung

TL;DR
This paper introduces an efficient method for updating resource identifiers in a distributed hash table when a mobile host changes its network address, reducing update time through a novel host/resource separation approach.
Contribution
The paper presents a new approach that separates host identifiers from network addresses in hash table entries, enabling faster updates for mobile hosts in distributed systems.
Findings
Significantly reduces update time for mobile hosts
Effective in large-scale distributed hash tables
Validated through experiments on OpenDHT
Abstract
Resources in a distributed system can be identified using identifiers based on random numbers. When using a distributed hash table to resolve such identifiers to network locations, the straightforward approach is to store the network location directly in the hash table entry associated with an identifier. When a mobile host contains a large number of resources, this requires that all of the associated hash table entries must be updated when its network address changes. We propose an alternative approach where we store a host identifier in the entry associated with a resource identifier and the actual network address of the host in a separate host entry. This can drastically reduce the time required for updating the distributed hash table when a mobile host changes its network address. We also investigate under which circumstances our approach should or should not be used. We evaluate…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
