Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Effective real-time anycast flow connection algorithm and delay analysis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Weijia Jia ; Dept. of Comput. Eng. & IT, City Univ. of Hong Kong, Kowloon ; Chuanlin Zhang ; Lidong Lin ; Wanqing Tu
more authors

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 Ds,j and minimum bandwidth requirement B s,j, 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

Published in:

Parallel Processing, 2003. Proceedings. 2003 International Conference on

Date of Conference:

9-9 Oct. 2003