A Random Routing Algorithm Based on the Path Weight
Dengyin Zhang · Electronic Engineer · 2006
Anycast is a new standard communication mode.The client can access the nearest server of a group of Anycast servers,which share an identical Anycast address.When the Anycast Server′s load is heavy,it′s important to assure the rate of successful requests.In this paper,a Weighted Random Selection(WRS) routing scheme is proposed.We consider both the distance metric and the server′s load to calculate the weights.This routing algorithm can balance the network′s traffic and servers load efficiently.Simulation results show that the algorithm is correct and efficient.