Chapter 2. Admission Control
Published Online: 12 FEB 2002
DOI: 10.1002/0471224391.ch2
Copyright © 2002 by John Wiley & Sons, Inc.
Book Title
Quality of Service Control in High-Speed Networks
Additional Information
How to Cite
Chao, H. J. and Guo, X. (2002) Admission Control, in Quality of Service Control in High-Speed Networks, John Wiley & Sons, Inc., New York, USA. doi: 10.1002/0471224391.ch2
Publication History
- Published Online: 12 FEB 2002
- Published Print: 1 NOV 2001
ISBN Information
Print ISBN: 9780471003977
Online ISBN: 9780471224396
- Summary
- Chapter
Keywords:
- admission control;
- deterministic bound;
- probabilistic bound;
- variable bit rate (VBR) services;
- worst-case traffic model;
- effective bandwidth;
- modified statistical multiplexing (MSM) algorithm;
- guaranteed service;
- controlled load service
Summary
Chapter 2 explores admission control and its process of deciding whether a new connection between a source-destination pair can be accepted across a data network. The decision is made subject to this new connection's QoS requirement (e.g., loss and delay) and network resources (e.g., link available capacity) without affecting the existing connections' QoS at each node on its path. Connection Admission Control (CAC) algorithms for ATM Variable bit rate (VBR) services and Internet Integrated services are discussed in detail in this chapter.