Effective admission control for real-time anycast flow

Authors:
Weijia Jia;Jinliang Jiao;Chuanlin Zhang
Affiliations:
Department of Computer Engineering and Information Technology, City University of Hong Kong, Kowloon, Hong Kong, SAR China;Department of Computer Engineering and Information Technology, City University of Hong Kong, Kowloon, Hong Kong, SAR China;Department of Mathematics, Jinan University, Guangzhou, P. R. China
Venue:
ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
Year:
2003

Citing 8
Cited 0

A framework for scalable global IP-anycast (GIA)

Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
A Routing Protocol for Anycast Messages

IEEE Transactions on Parallel and Distributed Systems
Application-Layer Anycasting

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Efficient Admission Control for EDF Schedulers

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Scalable QoS Guaranteed Communication Services for Real-Time Applications

ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Effective Delay Control for High Rate Heterogeneous Real-time Flows

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Distributed Admission Control for Anycast Flows with QoS Requirements

ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Integrated routing algorithms for anycast messages

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a novel admission control algorithm for anycast flow with real-time constraints. Given the time requirement, our algorithm can effective calculate the delay bound on a selected path for anycast flows. Thus our algorithms can guarantee the end-to-end deadline. Our algorithm is scalable in terms of the number of flows can be admitted through local information of the routes.