In this work, we consider the scenario where different classes of traffic w
ith differing bandwidth requirements are to be supported over a link with f
inite capacity. The network will be required to meet class-level quality-of
-service (QoS) constraints that are specified as relations between the call
blocking probabilities of these traffic classes. The network will also be
required to maintain maximum throughput performance. We develop two differe
nt admission control schemes that consider these two important criteria. Fi
rst, we choose an objective that maximizes the throughput subject to the co
nstraint that the maximum deviation from the desired class-level QoS is sma
ller than a certain pre-specified quantity. In the second approach, we choo
se an objective that minimizes the deviation from the desired class-level Q
oS subject to the throughput being greater than a pre-specified minimum val
ue. We show how these problems can be converted to linear programming probl
ems. We illustrate our schemes using numerical examples. (C) 2001 Elsevier
Science B.V. All rights reserved.