Effective real-time anycast flow connection algorithm and delay analysis

Jia, Weijia; Zhang, Chuanlin; Lin, Lidong; Tu, Wanqing; Jiao, Jinliang

Abstract

Define anycast services as a group of replicated servers that may provide similar or identical services. Using anycast services can significantly simplify some applications such as to seek appropriate servers to provide quality of service and to achieve the load balance and fault-tolerance for service availability. An anycast flow is a sequence of packet that can be established between a user and any server in an anycast (replicated) service group. We study a set of efficient distributed connection setup algorithms for real-time anycast flows. Given an anycast flow between a server j and a request node s with end-to-end deadline D<inf>s,j</inf> and minimum bandwidth requirement B<inf>s,j</inf>, our algorithms can effectively seek multiple destination connections in parallel thus the best path which satisfies the requirements of the anycast flow is chosen. The deterministic approach for worst delay bound analysis is also given.

Citation

Jia, W., Zhang, C., Lin, L., Tu, W., & Jiao, J. (2003, August). Effective real-time anycast flow connection algorithm and delay analysis. Presented at Proceedings of the International Conference on Parallel Processing, Taiwan

• Presentation Conference Type: Conference Paper (published)
• Conference Name: Proceedings of the International Conference on Parallel Processing
• Start Date: Aug 1, 2003
• Publication Date: Jan 1, 2003
• Deposit Date: Jun 12, 2025
• Peer Reviewed: Peer Reviewed
• Volume: 2003-January
• Pages: 205-212
• Book Title: Proceedings 2003 International Conference on Parallel Processing
• DOI: https://doi.org/10.1109/ICPP.2003.1240582
• Public URL: https://durham-repository.worktribe.com/output/4095814