Efficient distributed admission control for anycast flows

Jia, Weijia; Tu, Wanqing; Lin, Lidong

Abstract

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.

Citation

Jia, W., Tu, W., & Lin, L. (2003, October). Efficient distributed admission control for anycast flows. Presented at 2003 International Conference on Computer Networks and Mobile Computing, 2003. ICCNMC 2003., Shanghai, China

• Presentation Conference Type: Conference Paper (published)
• Conference Name: 2003 International Conference on Computer Networks and Mobile Computing, 2003. ICCNMC 2003.
• Start Date: Oct 20, 2003
• End Date: Oct 23, 2003
• Online Publication Date: Nov 3, 2003
• Publication Date: Nov 3, 2003
• Deposit Date: Jun 18, 2025
• Publisher: Institute of Electrical and Electronics Engineers
• Peer Reviewed: Peer Reviewed
• Pages: 78-85
• Book Title: Proceedings 2003 International Conference on Computer Networks and Mobile Computing Iccnmc 2003
• DOI: https://doi.org/10.1109/ICCNMC.2003.1243030
• Public URL: https://durham-repository.worktribe.com/output/4107702