Details of Research Outputs

In the Internet, a group of replicated servers is commonly used in order to improve the scalability of network service. Anycast service is a new network service that can improve network load distribution and simplify certain applications. In this paper, we propose two anycast QoS routing algorithms, RBH and RBHS, on networks with accurate and inaccurate link-state information, respectively. Both algorithms are randomized. The RBH algorithm uses the path length to determine the probability for choosing the next link, while the RBHS algorithm takes both the path length and the bandwidth safety into consideration. We measure the quality of QoS algorithms in terms of the accepting ratio on anycast QoS requests. Our simulation on a variety of network topologies and on various parameters shows that the RBH and RBHS algorithms perform much better than the static shortest-shortest algorithm.