Method and system for reducing hot node load in P2P network

Abstract

The invention discloses a method for reducing the hot node load in the P2P network and a system thereof, which belongs to the P2P network field. The method comprises that: the ID of a node and the memory space of key assignments are expanded; a free node is selected as a backup node for the hot node in the P2P network, and an ID value is distributed to the free node in the expanded ID space to be added in the P2P network; the key assignments of the stored resources in the hot node and the key assignments index information are backed up on the backup node; the key assignments are converted to new key assignments in the expanded memory space when being searched; the node of the new key assignments is searched and maintained; the obtained node converts the new key assignments to the corresponding key assignments in the expanded memory space; the converted key assignments and the key assignments index information are returned. The system comprises management equipment and searching nodes. The invention reduces the hot node load in the P2P network and fully utilizes the free resources in the network; the routing overhead and the searched nodes are not increased.

Description

technical field [0001] The invention relates to the field of peer-to-peer networks, in particular to a method and system for reducing the load of hotspot nodes in the peer-to-peer network. Background technique [0002] There will be some popular data in the network, such as popular music, popular movies, hotlines, etc. When these resources are published in a structured P2P (Peer to Peer, peer-to-peer) network, a (key, value) pair is formed and stored on a node with an ID value that is closer to the key value. Among them, the key value is the tag value of the resource, and the value is the index information of the key value. For more popular resources, it will cause many nodes in the network to click or search for the resource, thus making it a hot resource. Correspondingly, the nodes storing the (key, value) pairs of hot resources need to process too many search requests. Work under load and become a hotspot node. For example, see figure 1 , in a structured P2P network, ...

AI Technical Summary

Problems solved by technology

[0005] 1. For each node that the routing path passes through, before looking up the routing table, it is necessary to look up the cache table first, changing the DHT (Distributed Hash Table, Distributed Hash Table) lookup algorithm, and will increase a certain amount of overhead

[0006] 2. Back up the hotspot resource information to the node that the route passes through. Since the starting point is different when searching for the resource information, the nodes that the corresponding route passes through may be different, which will not completely solve the problem caused by the search for the hotspot resource information in the entire network. Hotspot issues; and if the processing capacity of the backup node is not high, the backup node may become a new hotspot node and introduce new hotspot issues

[0007] 3. Since the node initiating the search and the nodes passing through the route do not know whether the resource to be searched is a hot resource, the cache table must be searched for each hop. When the resource information to be searched is not a hot resource, the search will be delayed.

Images