Delay Control and Parallel Admission Algorithms for Real-Time Anycast Flow

  • Authors:

  • Weijia Jia;Bo Han;Chuanlin Zhang;Wanlei Zhou

  • Affiliations:

  • Department of Computer Engineering and Information Technology, City University of Hong Kong, Kowloon, Hong Kong, SAR China. itjia@cityu.edu.hk;Department of Computer Engineering and Information Technology, City University of Hong Kong, Kowloon, Hong Kong, SAR China;Department of Mathematics, Jinan University, Guangzhou 510632, People's Republic of China;School of Information Technology, Deakin University, 221 Burwood Highway, Burwood, VIC 3125, Australia

  • Venue:
  • The Journal of Supercomputing
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

An anycast flow is a flow that can be connected to any one of the members in a group of designated (replicated) servers (called anycast group). In this paper, we derive a set of formulas for calculating the end-to-end delay bound for the anycast flows and present novel admission control algorithms for anycast flows with real-time constraints. Given such an anycast group, our algorithms can effectively select the paths for anycast flows' admission and connection based on the least end-to-end delay bounds evaluated. We also present a parallel admission control algorithm that can effectively calculate the available paths with a short delay bound for different destinations in the anycast group so that a best path with the shortest delay bound can be chosen.