Efficient distributed admission control for anycast flows

Anycasting has become an important research topic recently especially for replicated servers where availability and fault-tolerance are critical for quality of service. With anycasting, applications can request the "nearest" server for provision of desired services. We study efficient admission control for anycast (ACA) flows. We focus on algorithms that perform smart destination selection and efficient route establishment weighing at the probe message round trip time (RTT). Taking advantages of anycasting, our ACA algorithms differ from other approaches in their dependence on system status information. Performance data obtained through simulation show that our ACA system performs efficiently in terms of admission delay, overhead and admission probability.