Details of Research Outputs

In this paper, we study admission control algorithm for anycast flow with real-time constraints. With the given time requirement, when the result of this algorithm give succeed information-we find route for the anycast flow requesting. Therefore, what we need to do is testing if the corresponding path r, has enough bandwidth for coming anycast flow requirement at source S with end-to-end deadline D. This admission control is scalable in terms of the number of flows can be admitted through local information of the routes.