Abstract:

Based on the original P-Grid construction algorithm,two improved algorithms are proposed focusing on two situations,one is the node without initial data load（Ignore-of-Load） and the other is the node with initial data load（Care-of-Load）.The proposed Ignore-of-Load algorithm improves convergence rate in the aspects of extending the path with more bits and increasing the success rate of recommendation.The three Care-of-Load algorithms,two of which respectively focus on the path and the data and another of which possesses satisfaction adjustment,are then compared.Simulated results show that the proposed Ignore-of-Load algorithm reduces number of communications by more than 50 percentage points and greatly improves the convergence rate,and that the Care-of-Load algorithm with satisfaction adjustment can also improve the convergence rate and can search data index with a success probability of about 90%.

Key words: overlay network, P-Grid construction algorithm, convergence rate, number of communications, initial data load, search failure rate