An Adaptable Anycast Routing Algorithm Based on Density and Proximity

Most existing anycast routing algorithms are based on shortest path algorithm. In this paper, an adaptable anycast routing algorithm based on density and proximity is proposed. While determining anycast member, both the proximity factor and nearby anycast members number of the target (density factor) should be considered. Density is calculated on the base of field theory. In comparison with proximity-based algorithm, density-based algorithm is strong in routing robustness, but weak in routing efficiency, so the best performance lies in a tradeoff between proximity and density. In this algorithm, parameter k adjusts the weight of proximity factor and density factor hence influences anycast member selection, therefore the algorithm is characteristic of adaptable. Simulation experiments performed in networks of different dynamic degrees show that by adjusting parameter k, routing robustness and routing efficiency can be well balanced.