Resource Sharing for Book-Ahead and Instantaneous-Request Calls Using a CLT Approximation

This paper extends the admission control algorithm for book-ahead and instantaneous-request calls proposed by Greenberg, Srikant and Whitt (1997) to cover multiple classes of instantaneous-request calls, each with their own traffic characteristics and their own performance requirements. As before, book-ahead calls specify their starting and finishing times, and are assumed to book far ahead relative to the holding times of the instantaneous-request calls. The book-ahead calls may be constrained by an upper-limit on the capacity that can be reserved for them. Instantaneous-request calls are admitted if the probability of interruption (or some other form of service degradation in response to the conflict) for that call is below a threshold, but now this threshold can be class-dependent, and now the interrupt probability is calculated by a normal approximation based on the central limit theorem. Simulation experiments show that the normal approximation performs as well as the previous detailed calculation in single-class examples, and that the normal approximation can be applied to multi-class examples.

[1]  Ward Whitt,et al.  Control and recovery from rare congestion events in a large multi-server system , 1997, Queueing Syst. Theory Appl..

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

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

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

[5]  Olov Schelén,et al.  Advance Reservations for Predictive Service , 1995, NOSSDAV.

[6]  R. Srikant,et al.  Simulation run lengths to estimate blocking probabilities , 1996, TOMC.

[7]  W. Whitt,et al.  A Source traffic model and its transient analysis for network control , 1998 .

[8]  R. Gibbens,et al.  Asymptotic analysis of single resource loss systems in heavy traffic, with applications to integrated networks , 1995, Advances in Applied Probability.

[9]  Frank Kelly,et al.  Notes on effective bandwidths , 1994 .

[10]  James A. Bucklew,et al.  Large Deviation Techniques in Decision, Simulation, and Estimation , 1990 .

[11]  Rayadurgam Srikant,et al.  Diffusion approximations for models of congestion control in high-speed networks , 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).

[12]  Ward Whitt,et al.  Efficiently providing multiple grades of service with protection against overloads in shared resources , 1995, AT&T Technical Journal.

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

[14]  Stan Zachary,et al.  The Performance of Single Resource Loss Systems in Multiservice Networks , 1994 .

[15]  Albert G. Greenberg,et al.  Admission control for booking ahead shared resources , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[16]  Michel Mandjes,et al.  Large Deviations for Performance Analysis: Queues, Communications, and Computing , Adam Shwartz and Alan Weiss (New York: Chapman and Hall, 1995). , 1996, Probability in the Engineering and Informational Sciences.

[17]  Ward Whitt,et al.  The Physics of the Mt/G/∞ Queue , 1993, Oper. Res..

[18]  M. R. Leadbetter,et al.  Extremes and Related Properties of Random Sequences and Processes: Springer Series in Statistics , 1983 .

[19]  Mischa Schwartz,et al.  Distributed call admission control in mobile/wireless networks , 1996, IEEE J. Sel. Areas Commun..

[20]  R. R. P. Jackson,et al.  Introduction to the Theory of Queues , 1963 .

[21]  Zbigniew Dziong,et al.  Control of multi-service loss networks , 1989, Proceedings of the 28th IEEE Conference on Decision and Control,.

[22]  R. Srikant,et al.  Resource sharing for book-ahead and instantaneous-request calls , 1999, TNET.

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

[24]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[25]  P. Kokotovic,et al.  A singular perturbation approach to modeling and control of Markov chains , 1981 .

[26]  John H. Reif,et al.  Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications , 1994, SIAM J. Comput..

[27]  B. Poonen,et al.  Reservation Probabilities , 2022 .

[28]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[29]  Giorgio Ventre,et al.  Distributed advance reservation of real-time connections , 1997, Multimedia Systems.

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