Abstract
We propose a utilization-based schedulability and admission control mechanism for distributed systems with workload aggregation to achieve scalability. We use the differentiated services (diffserv) architecture to describe and illustrate our approach. Scalability of admission control is achieved by determining off-line safe levels of server utilization. Scalability during the connection lifetimes is provided by the aggregation mechanisms (for example, class-based scheduling) provided by the diffserv architecture. Our evaluations show that our system's admission probabilities are very close to those of significantly more expensive approaches, which do not allow for workload aggregation. At the same time, admission control overhead during flow establishment is very low.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Banerjea, A., and Keshav, S. 1993. Queueing delays in rate controlled ATM networks. Proceedings of Inforcom'93.
Bennett, J., and Zhang, H. 1996. WF 2 Q. worst-case fair weighted fair queueing. Proceedings of IEEE INFOCOM'96.
Bernet, Y. et al. 1999. A framework for differentiated services. Internet-Draft, IETF, Feb.
Bettati, R., Ferrari, D., Gupta, A., Heffner, W., Howe, W., Moran, M., Nguyen, Q., and Yavatkar, R. 1995. Connection establishment for multiparty real-time communication. In Proceedings of the 5th International Workshop on Netwrok and Operating System Support for Digital Audio and Video, Durham, New Hampshire.
Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., and Weiss, W. 1998. An architecture for differentiated service, RFC 2474, Dec.
Borgonovo, F., Capone, A., Fratta, L., and Petrioli, C. (submitted) End-to-end call admission control for telephony services over IP networks. IEEE Network and IEEE Internet Computing Joint Issue.
Boyle, J., Cohen, R., Durham, D., Herzog, S., Rajan, R., and Sastry, A. 1999. The COPS (Common Open Policy Service) Protocol. Internet-Draft Feb.
Braden, R., Clark, D., and Shenker, S. 1994. Integrated services in the internet architecture. RFC 1633, June.
Cruz, R. L. 1991a. A calculus for network delay, Part I: Network elements in isolation. IEEE Transactions on Information Theory, 37: Jan.
Cruz, R. L. 1991b. A calculus for network delay, Part II: Network analysis. IEEE Transactions on Information Theory 37: Jan.
Dailianas, A., and Bovopoulis, A. 1994. Real-time admission control algorithms with delay and loss guarantees in ATM networks. Proceedings of INFOCOM'94, PP. 1065–1072.
Devalla, B., Li, C., Sahoo, A., and Zhao, W. 1997. Connection-oriented real-time communication for mission critical applications-an introduction to NetEx: a portable and efficient tool kit. In Aerospace and Electronics Conferernce, NAECON 1997, vol. 2. pp. 698–707.
Dong, X., Li, C., Bettati, R. Chen, J., and Zhao, W. 2000. Utilization-based admission control for real-time applications. In Proceedings of the International Conference on Parallel Processing (ICPP'2000).
Figueira, N. R., and Pasquale, J. 1995. An upper bound on delay for the VirtualClock service discipline. IEEE/ACM Transactions on Networking 3: Aug.
Figueira, N. R., and Pasquale, J. 1997. Rate-function scheduling. Proceedings of Infocom'97.
Firoiu, V., Kurose, J., and Towsley, D. 1997. Efficient admission control for EDF schedulers. Proceedings of Infocom'97.
Golestani, S. J. 1995. Network delay analysis of a class of fair queuing algorithms. IEEE Journal on Selected Areas in Communications 13(6).
Goyal, P. Lam, S. S., and Vin, H. 1995. Determining end-to-end delay bounds in heterogeneous networks. In 5th International Workshop on Network and Op. Sys. Support for Digital Audio and Video (NOSSDAV).
Hyman, J. M., Lazar, A. A., and Pacifici, G. 1991. Real-time scheduling with quality of service constraints. IEEE Journal on Selected Areas in Communications 9(7).
Kostas, T. J., Borella, M. S., Sidhu, I., Schuster, G. M., Grabiec, J., and Mahler, J. 1998. Real-time voice over packet-switched networks. IEEE Network Mag, Jan./Feb.
Li, C., Bettati, R., and Zhao, W. 1997. Static priority scheduling for ATM networks. Proceedings of the 18th IEEE Real-Time Systems Symposium.
Liebeherr, J., Wrege, D. E., and Ferrari, D. 1998. Exact admission control in network with bounded delay services. IEEE/ACM Transactions on Networking.
Liu, C. L., and Layland, J. W. 1973. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM 29(1): 46–61.
Nicols, K., Jacobson, V., and Zhang, L. 1997. A two-bit differentiated services architecture for the internet. Internet-Draft, Nov.
Parekh, A. K. J., and Gallager, R. G. 1993. A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM Transaction Networking 1(3).
Parekh, A. K. J., and Gallager, R. G. 1994. A generalized processor sharing approach to flow control in integrated services networks: the multiple-node case. IEEE/ACM Transactions on Networking 2(2).
Park, D.-W. Natarajan, S., and Kanevsky, A. 1996. Generalized utilization-bound test for fixed-priority real-time scheduling. Journal of Systems and Software.
Raha, A., Kamat, S., and Zhao, W. 1995. Guaranteeing end-to-end deadlines in ATM networks. In The 15th International Conference on Distributed Computing Systems.
Sahoo, A. Devalla, B., Guan, Y., Bettati, R., and Zhao, W. (to appear) Adapative connection management for mission critical applications over ATM Networks. International Journal of Parallel and Distributed Systems and Networks. Special Issue On Network Architectures for End-to-end Quality-of-Service Support, to appear.
Stoica, I., and Zhang, H., 1999. Providing guaranteed services without per flow management. Proceedings of SIGCOMM.
Zhang, L. 1991. Virtual clock: A new traffic control algorithm for packet switching networks. ACM Transactions on Computer Systems 9: May.
Zhang, L., Deering, S., Estrin, D., Shenker, S., and Zappala, D. 1993. RSVP: a new resource reservation protocol. IEEE Networks Magazine 31(9): 8–18.
Zhang, Z.-L., Towsley, D., and Kurose, J. 1995. Statistical analysis of the generalized processor sharing scheduling discipline. IEEE Journal of Selected Areas in Communications 13(6): 1071–1080.
Zhang, J.-L., Liu, Z., and Towsley, D. 1996. Closed-form deterministic end-to-end performance bounds for the generalized processor sharing scheduling discipline. Journal of Combinatorial Optimization.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Choi, BK., Xuan, D., Bettati, R. et al. Utilization-Based Admission Control for Scalable Real-Time Communication. Real-Time Systems 24, 171–202 (2003). https://doi.org/10.1023/A:1021778402786
Issue Date:
DOI: https://doi.org/10.1023/A:1021778402786