An integrated end-to-end QoS anycast routing on DiffServ networks
Computer Communications
Extension headers for IPv6 anycast
Computer Communications
Branch-and-bound algorithm for anycast flow assignment in connection-oriented networks
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
ADVIS'06 Proceedings of the 4th international conference on Advances in Information Systems
| Hi-index | 0.00 |
For fault-tolerance and load-balance purposes, manymodern Internet applications may require that a groupof replicated servers dispersed widely over the world.The anycast as a new communication style defined inIPv6 provides the capability to route packets to thenearest server. Better quality of service (QoS) can beachieved by this kind of computing paradigm. DNS, WebService, and Distributed Database System are three mostwell known examples. However, before anycasting canbe realized, more researches need to be done. Theanycast routing scheme is one of the most importantissues. In this paper, we propose a load-balancedanycast routing scheme based on the WRS (WeightedRandom Selection) method. We suggest that the servercapability should be propagated along with other fieldsin the routing tables. An anycast routing algorithmshould take into account the network transmissioncapability as well as the server processing capability forthe selection of a target server. Three weightdetermination strategies are given. We also develop asimple algorithm to calculate the weights of WRS toachieve optimization under both the heavy and the lightsystem traffic environment. Our approach is locallyoptimized to minimize the average total delay and wellbalanced for the server load.