ASYMPTOTICALLY ACHIEVABLE PERFORMANCE IN ATM NETWORKS

The primary objective in the present paper is to gain fundamental unde rstanding of the performance achievable in ATM networks as a function of the various system characteristics. We derive limit theorems that c haracterize the achievable performance in terms of the offered traffic , the admissible region, and the revenue measure. The insights obtaine d allow for substantial simplifications in the design of real-time con nection admission control algorithms. In particular, we describe how t he boundaries of admissible regions with convex complements may be lin earized-thus reducing the admissible region-so as to obtain a convenie nt loss network representation. The asymptotic results for the achieva ble performance suggest that the potential reduction in revenue is imm aterial in high-capacity networks. Numerical experiments confirm that the actual reduction is typically negligible, even in networks of mode rate capacity.