| 摘要 |
<p>PROBLEM TO BE SOLVED: To provide a context node by which a sufficient number of hit nodes can be found even when a width of a context value to be a retrieval target is changed in various manners.SOLUTION: Response message numbers AMN and AMN are counted to calculate a message number difference AMN-AMN. This counting and calculation are repeated for each non-pair adjacent node to calculate a maximum valueΔmax1 of the message number differences. A partner node N is notified of the maximum valueΔmax1 of the message number differences and the one non-pair adjacent node A giving the maximum value. Information on a maximum valueΔmax2 of the message number differences and one non-pair adjacent node Bmax giving the maximum value similarly calculated at the partner node N is acquired from the partner node N. The necessity for topology control is determined on the basis of the respective maximum valuesΔmax1 andΔmax2 of message number differences. When it is determined that the topology control is needed, a link between the own node and the non-pair adjacent node Amax is disconnected, and instead of it, a link with the non-pair adjacent node Bmax is established.</p> |
