Robust dynamic admission control for unified cell and call QoS in statistical multiplexers

The design of connection admission control (CAC) for a simple Markovian model of a multiservice statistical multiplexer is considered. The paper begins by laying the foundation through several fundamental analytic concepts, such as a semi-Markov decision process formulation of the design problem and time scale decomposition, before progressively leading up to real-world requirements, like robustness and simplicity of design. Several numerical illustrations are given. The salient contributions of the paper are as follows. (1) A unified treatment of multiclass cell and call QoS. (2) A CAC design which is robust, fair, and efficient. (3) Simplicity in the CAC design, together with an evaluation of the tradeoff with performance. (4) An analytic technique for computing the feasibility region in the space of call arrival rates where some control exists to satisfy QoS. (5) The discovery of near linearity of the boundary of the feasible region, which is then used to decompose the design problem. (6) A unified treatment of aggressive and conservative forms of CAC, the latter being conventional and the former yielding better call level performance. (7) An effective bandwidth definition based on the aggressive form of CAC, which influences the CAC design. (8) A demonstration of the beneficial impact on performance of cell level control. (9) An asymptotic theory of the joint behavior of cell loss and call blocking. (10) A rigorous development of time scale decomposition. (11) A numerical evaluation of the accuracy of the notion of nearly completely decomposable Markov chains.

[1]  Debasis Mitra,et al.  Effective bandwidth of general Markovian traffic sources and admission control of high speed networks , 1993, TNET.

[2]  Peter Key,et al.  Optimal Control and Trunk Reservation in Loss Networks , 1990 .

[3]  Frank P. Kelly,et al.  Effective bandwidths at multi-class queues , 1991, Queueing Syst. Theory Appl..

[4]  Hiroshi Saito,et al.  Call admission control in an ATM network using upper bound of cell loss probability , 1992, IEEE Trans. Commun..

[5]  Karl Lindberger,et al.  Dimensioning and Design Methods for Integrated ATM Networks , 1994 .

[6]  Richard J. Gibbens,et al.  A Decision-Theoretic Approach to Call Admission Control in ATM Networks , 1995, IEEE J. Sel. Areas Commun..

[7]  N. G. Bean.  Effective Bandwidths with Different Quality of Service Requirements , 1993, Integrated Broadband Communications.

[8]  James Yan,et al.  Interaction of call blocking and cell loss in an ATM network , 1994, IEEE J. Sel. Areas Commun..

[9]  Debasis Mitra,et al.  Virtual Partitioning by Dynamic Priorities: Fair and Efficient Resource-Sharing by Several Services , 1996, International Zurich Seminar on Digital Communications.

[10]  Aurel A. Lazar,et al.  A Separation Principle Between Scheduling and Admission Control for Broadband Switching , 1993, IEEE J. Sel. Areas Commun..

[11]  Joseph Y. Hui.  Resource allocation for broadband networks , 1988, IEEE J. Sel. Areas Commun..

[12]  D. Jagerman.  Some properties of the erlang loss function , 1974 .

[13]  J. W. Roberts,et al.  Performance evaluation and design of multiservice networks , 1992 .

[14]  Sem C. Borst,et al.  Virtual partitioning for robust resource sharing: computational techniques for heterogeneous traffic , 1998, IEEE J. Sel. Areas Commun..

[15]  Debasis Mitra,et al.  Dynamic call admission control of an ATM multiplexer with on/off sources , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.

[16]  J. M. Akinpelu,et al.  The overload performance of engineered networks with nonhierarchical and hierarchical routing , 1984, AT&T Bell Laboratories Technical Journal.

[17]  E. Altman,et al.  Stability and singular perturbations in constrained Markov decision problems , 1993, IEEE Trans. Autom. Control..

[18]  Eugene A. Feinberg,et al.  Constrained Semi-Markov decision processes with average rewards , 1994, Math. Methods Oper. Res..