Efficiently providing multiple grades of service with protection against overloads in shared resources

Multiservice telecommunications systems require different grades of service for different customers, including protection against overloads caused by other customers. One way to provide multiple grades of service, including overload protection, is by partial sharing using upper-limit (UL) bounds, which specify an upper limit on the number of requests a customer is allowed at any time, and guaranteed-minimum (GM) bounds, which guarantee that there will always be space for a minimum number of requests from that customer. These bounds achieve effective separation with sharing and can be efficiently enforced and analyzed. Analysis is made possible by a new algorithm for computing blocking probabilities based on numerical transform inversion.

[1]  L. Delbrouck.  A Unified Approximate Evaluation of Congestion Functions for Smooth and Peaky Traffics , 1981, IEEE Trans. Commun..

[2]  L. Delbrouck.  On the Steady-State Distribution in a Service Facility Carrying Mixtures of Traffic with Different Peakedness Factors and Capacity Requirements , 1983, IEEE Trans. Commun..

[3]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[4]  R. Srikant,et al.  Computational techniques for accurate performance evaluation of multirate, multihop communication networks , 1995, SIGMETRICS '95/PERFORMANCE '95.

[5]  Keith W. Ross,et al.  Algorithms to determine exact blocking probabilities for multirate tree networks , 1990, IEEE Trans. Commun..

[6]  Zbigniew Dziong,et al.  Congestion Probabilities in a Circuit-Switched Integrated Services Network , 1987, Perform. Evaluation.

[7]  Debasis Mitra,et al.  State-dependent routing on symmetric loss networks with trunk reservations. I , 1993, IEEE Trans. Commun..

[8]  W. Whitt,et al.  Heavy-traffic approximations for service systems with blocking , 1984, AT&T Bell Laboratories Technical Journal.

[9]  W. Whitt,et al.  Blocking when service is required from several facilities simultaneously , 1985, AT&T Technical Journal.

[10]  W. Whitt,et al.  An algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss models , 1995, Advances in Applied Probability.

[11]  S. Zachary,et al.  Loss networks , 2009, 0903.0640.

[12]  Geert A. Awater,et al.  Exact computation of time and call blocking probabilities in multi-traffic circuit-switched networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[13]  W. Whitt,et al.  Resource-Sharing Models with State-Dependent Arrivals of Batches , 1995 .

[14]  Debasis Mitra,et al.  Erlang capacity and uniform approximations for shared unbuffered resources , 1994, TNET.

[15]  R. I. Wilkinson.  Theories for toll traffic engineering in the U. S. A. , 1956 .

[16]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[17]  J. Kaufman,et al.  Blocking in a Shared Resource Environment , 1981, IEEE Trans. Commun..

[18]  W. Whitt,et al.  Multidimensional Transform Inversion with Applications to the Transient M/G/1 Queue , 1994 .

[19]  Farouk Kamoun,et al.  Analysis of Shared Finite Storage in a Computer Network Node Environment Under General Traffic Conditions , 1980, IEEE Trans. Commun..

[20]  Kin K. Leung,et al.  An algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss models , 1994, Fifth IEEE International Workshop on Computer-Aided Modeling, Analysis, and Design of Communication Links and Networks.

[21]  Ward Whitt,et al.  On Arrivals That See Time Averages , 1990, Oper. Res..

[22]  Keith W. Ross,et al.  Multiservice Loss Models for Broadband Telecommunication Networks , 1997 .

[23]  Keith W. Ross,et al.  Reduced load approximations for multirate loss networks , 1993, IEEE Trans. Commun..

[24]  Kin K. Leung,et al.  An inversion algorithm to compute blocking probabilities in loss networks with state-dependent rates , 1995, TNET.

[25]  Ward Whitt,et al.  The Fourier-series method for inverting transforms of probability distributions , 1992, Queueing Syst. Theory Appl..

[26]  John A. Morrison,et al.  Blocking Probabilities for Multiple Class Batched Poisson Arrivals to a Shared Resource , 1996, Perform. Evaluation.

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