ADJACENT NODE SELECTION METHOD, NODE, AND PROGRAM

摘要

Provided are an adjacent node selection method, a node, and a program which make it possible to select adjacent nodes with little overhead in a distributed hash table (DHT) protocol. The node stores information in relation to an adjacent node for each specified identifier region of an identifier which specifies each node participating in the distributed hash table protocol, and receives a message which includes information in relation to a sending node. The node derives a first communication environment between the actual node and the sending node, which is the originator of the message sent, in accordance with the information in relation to the sending node. The node derives a second communication environment between the actual node and a current adjacent node selected as the current adjacent node with respect to the identifier region corresponding to the sending node, the second communication environment being derived in accordance with the information in relation to the adjacent node and the information in relation to the sending node. The node compares the first communication environment and the second communication environment, and when the first communication environment is more favorable than the second communication environment, the node replaces, with the sending node, the current adjacent node selected as the current adjacent node with respect to the identifier region corresponding to the sending node.