Web 3.0 Chord DHT Resource Clustering

초록

This study explores the impact and challenges of new user behaviors inthe Web 3.0 environment on distributed networks. The traditional Chordalgorithm allows nodes to freely join and leave the network by hashing theirIP addresses, and publishing and storing resources through the same hashfunction. When the keys of the resources are unique, the resources will beevenly distributed across each node, thereby achieving load balancing. How-ever, in cases where many identical resources are published, this method leadsto specific nodes bearing too much load, causing performance bottlenecks andresource concentration issues. In Web 3.0, when the nodes use the resource'stopic as the key to publish resources, as the topic's popularity increases, thenumber of nodes using the same key as the publishing node and the nodeswith demand for the topic resources will also increase. In the traditionalChord algorithm, the same key will be managed by the same node. The noderesponsible for the key needs to save the routing information of all relatednodes and cope with a large number of resource requests for it. To addressthese issues, this paper proposes a new variant of the Chord algorithm, whichuses two different Chord rings for resource clustering: one based on thehash of resource names and the other based on the hash of IP addresses.This method allows us to allocate resources more effectively, ensuring eachnode bears a reasonable load share according to capacity. This paper willpresent the design principles of this method and validate its effectiveness in improving resource distribution and reducing the problem of single-pointoverload through experiments.

키워드