Utilization-based admission control for real-time applications Conference Paper

abstract

• 2000 IEEE. In this paper, we present a methodology to use utilization-based admission control in guaranteed real-time communication in a scalable fashion. We make admission control scalable by using a configuration-time test to determine a safe utilization level of servers. Admission control at run-time then is reduced to simple utilization tests on the servers along the path of the new flow. Furthermore, we discuss how appropriate route selection improve utilization levels, design a safe route selection heuristic algorithm to achieve high utilization of resources, and derive two bounds on the maximum utilization level for given traffic in a network. We compare the results of our route selection heuristics with that of a shortest-path based algorithm, and find that our heuristics can achieve a much higher maximum utilization level than that of the shortest-path based algorithm.

name of conference

• Proceedings 2000 International Conference on Parallel Processing

authors

• Bettati, Riccardo
• Chen, Jianer

published proceedings

• 2000 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, PROCEEDINGS

author list (cited authors)

• Xuan, D., Li, C. Z., Bettati, R., Chen, J. N., & Zhao, W.

citation count

• 16

complete list of authors

• Xuan, D||Li, CZ||Bettati, R||Chen, JN||Zhao, W

publication date

• January 2000

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• Proceedings of the International Conference on Parallel Processing  Journal

Digital Object Identifier (DOI)

• 10.1109/icpp.2000.876137

International Standard Book Number (ISBN) 10

• 0-7695-0768-9

start page

• 251

end page

• 260

volume

• 2000-January

URL

• https://ieeexplore.ieee.org/xpl/conhome/7045/proceeding