Controlled and optimally controlled multiplexing systems: A numerical exploration

Large controlled multiplexing systems are approximated by diffusion type processes yielding a very efficient way of approximation and good numerical methods. The “limit” equations are an efficient aggregation of the original system, and provide the basis of the actual numerical approximation to the control problem. The numerical approximations have the structure of the original problem, but are generally much simpler. The control can occur in a variety of places; e.g., “leaky bucket” controllers, control of “marked cells” at the transmitter buffer, or control of the transmitter speed. From the point of view of the limit equations, those are equivalent. Various forms of the optimal control problem are explored, where the main aim is to control or balance the losses at the control with those due to buffer overflow. It is shown that much can be saved via the use of optimal controls or reasonable approximations to them. We discuss systems with one to three classes of sources, various aggregation methods and control approximation schemes. There are qualitative comparisons of various systems with and without control and a discussion of the variations of control and performance as the systems data and control bounds vary. The approach is a very useful tool for providing both qualitative and quantitative information which would be hard to get otherwise. The results have applications to various forms of the ATM and broadband integrated data networks.

[1]  D. Mitra,et al.  Stochastic theory of a data-handling system with multiple sources , 1982, The Bell System Technical Journal.

[2]  D. Mitra Stochastic theory of a fluid model of producers and consumers coupled by a buffer , 1988, Advances in Applied Probability.

[3]  M. Reiman Asymptotically optimal trunk reservation for large trunk groups , 1989, Proceedings of the 28th IEEE Conference on Decision and Control,.

[4]  Lawrence M. Wein,et al.  Optimal Control of a Two-Station Brownian Network , 2015, Math. Oper. Res..

[5]  J. Michael Harrison,et al.  The QNET method for two-moment analysis of open queueing networks , 1990, Queueing Syst. Theory Appl..

[6]  C. Knessl,et al.  Heavy-traffic analysis of a data-handling system with many sources , 1991 .

[7]  L. F. Martins,et al.  Numerical Methods for Stochastic Singular Control Problems , 1991 .

[8]  J. Dai Steady-state analysis of reflected Brownian motions: characterization, numerical methods and queueing applications , 1991 .

[9]  Anwar Elwalid,et al.  Fluid models for the analysis and design of statistical multiplexing with loss priorities on multiple classes of bursty traffic , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[10]  Harold J. Kushner,et al.  Heavy Traffic Analysis of a Data Transmission System with Many Independent Sources , 1993, SIAM J. Appl. Math..

[11]  L. F. Martins,et al.  Limit theorems for pathwise average cost per unit time problems for controlled queues in heavy traffic , 1993 .

[12]  Harold J. Kushner,et al.  Numerical methods for controlled and uncontrolled multiplexing and queueing systems , 1994, Queueing Syst. Theory Appl..

[13]  Harold J. Kushner,et al.  A Numerical Method for Controlled Routing in Large Trunk Line Networks via Stochastic Control Theory , 1994, INFORMS J. Comput..

[14]  Tyrone E. Duncan,et al.  Numerical Methods for Stochastic Control Problems in Continuous Time (Harold J. Kushner and Paul G. Dupuis) , 1994, SIAM Rev..