Issue No. 08 - August (2004 vol. 15)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2004.34
Wei Zhao , IEEE
Weijia Jia , IEEE
Dong Xuan , IEEE
<p><b>Abstract</b>—Anycasting has recently become an important research topic, especially for replicated servers. With anycasting, applications can request the "nearest” server for provision of desired (multimedia) service. In this paper, we study efficient Distributed Admission Control (DAC) for anycast flows. We focus on algorithms that perform destination selection and efficient path establishment. Taking advantage of anycasting, our distributed algorithms differ from each other in their dependence on system status information. Performance data obtained through mathematical analysis and simulations show that, in terms of admission probabilities, DAC systems that are based on local status information have performance levels close to those that utilize global and dynamic status information. This renders our DAC algorithms useful not only for the network layer, but also for the application layer admission control for anycast flows.</p>
Admission control, anycast service and flow, destination selection, weight assignment.
Lidong Lin, Wei Zhao, Weijia Jia, Wanqing Tu, Dong Xuan, "Distributed Admission Control for Anycast Flows", IEEE Transactions on Parallel & Distributed Systems, vol. 15, no. , pp. 673-686, August 2004, doi:10.1109/TPDS.2004.34