Chattering and congestion collapse in an overload switching control

Routing mechanisms for stochastic networks are often designed to produce state space collapse (SSC) in a heavy-traffic limit, i.e., to confine the limiting process to a lower-dimensional subset of its full state space. In a fluid limit, a control producing asymptotic SSC corresponds to an ideal sliding mode control that forces the fluid trajectories to a lower-dimensional sliding manifold. Within deterministic dynamical systems theory, it is well known that sliding-mode controls can cause the system to chatter back and forth along the sliding manifold due to delays in activation of the control. For the prelimit stochastic system, chattering implies fluid-scaled fluctuations that are larger than typical stochastic fluctuations. In this paper we show that chattering can occur in the fluid limit of a controlled stochastic network when inappropriate control parameters are used. The model has two large service pools operating under the fixed-queue-ratio with activation and release thresholds (FQR-ART) overload control which we proposed in a recent paper. The FQR-ART control is designed to produce asymptotic SSC by automatically activating sharing (sending some customers from one class to the other service pool) once an overload occurs. We have previously shown that this control is effective and robust, even if the service rates are less for the other shared customers, when the control parameters are chosen properly. We now show that, if the control parameters are not chosen properly, then delays in activating and releasing the control can cause chattering with large oscillations in the fluid limit. In turn, these fluid-scaled fluctuations lead to severe congestion, even when the arrival rates are smaller than the potential total service rate in the system, a phenomenon referred to as congestion collapse. We show that the fluid limit can be a bi-stable switching system possessing a unique nontrivial periodic equilibrium, in addition to a unique stationary point.

[1]  S. Shakkottai,et al.  Pathwise optimality of the exponential scheduling rule for wireless channels , 2004, Advances in Applied Probability.

[2]  Ward Whitt,et al.  Achieving Rapid Recovery in an Overload Control for Large-Scale Service Systems , 2013, INFORMS J. Comput..

[3]  A. Stolyar.  MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic , 2004 .

[4]  J. Harrison.  Heavy traffic analysis of a system with parallel servers: asymptotic optimality of discrete-review policies , 1998 .

[5]  P. R. Kumar,et al.  Distributed scheduling based on due dates and buffer priorities , 1991 .

[6]  Ward Whitt,et al.  Heavy-Traffic Limits for Queues with Many Exponential Servers , 1981, Oper. Res..

[7]  Hyunjoong Kim,et al.  Functional Analysis I , 2017 .

[8]  D. Down,et al.  Stability of Queueing Networks , 1994 .

[9]  Johannes Schumacher,et al.  An Introduction to Hybrid Dynamical Systems, Springer Lecture Notes in Control and Information Sciences 251 , 1999 .

[10]  R. Durrett.  Probability: Theory and Examples , 1993 .

[11]  Arjan van der Schaft,et al.  An Introduction to Hybrid Dynamical Systems, Springer Lecture Notes in Control and Information Sciences 251 , 1999 .

[12]  Devavrat Shah,et al.  Fluid models of congestion collapse in overloaded switched networks , 2011, Queueing Syst. Theory Appl..

[13]  Ward Whitt,et al.  A Fluid Limit for an Overloaded X Model Via an Averaging Principle , 2010, ArXiv.

[14]  W. Whitt,et al.  Martingale proofs of many-server heavy-traffic limits for Markovian queues ∗ , 2007, 0712.4211.

[15]  P. Ramadge,et al.  Periodicity and chaos from switched flow systems: contrasting examples of discretely controlled continuous systems , 1993, IEEE Trans. Autom. Control..

[16]  R. Scanlan,et al.  Resonance, Tacoma Narrows bridge failure, and undergraduate physics textbooks , 1991 .

[17]  T. Sideris.  Ordinary Differential Equations and Dynamical Systems , 2013 .

[18]  David E. Stewart,et al.  Rigid-Body Dynamics with Friction and Impact , 2000, SIAM Rev..

[19]  M. Bramson.  Instability of FIFO Queueing Networks , 1994 .

[20]  Ward Whitt,et al.  Scheduling Flexible Servers with Convex Delay Costs in Many-Server Service Systems , 2009, Manuf. Serv. Oper. Manag..

[21]  J. Michael Harrison,et al.  Instantaneous Control of Brownian Motion , 1983, Math. Oper. Res..

[22]  S. Sushanth Kumar,et al.  Heavy traffic analysis of open processing networks with complete resource pooling: Asymptotic optimality of discrete review policies , 2005, math/0503477.

[23]  R. J. Williams,et al.  Workload reduction of a generalized Brownian network , 2005, math/0602495.

[24]  Andrey V. Savkin,et al.  Qualitative Theory of Hybrid Dynamical Systems , 2012 .

[25]  Thomas G. Kurtz,et al.  Averaging for martingale problems and stochastic approximation , 1992 .

[26]  Ruth J. Williams,et al.  Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse , 1998, Queueing Syst. Theory Appl..

[27]  Ward Whitt,et al.  Queue-and-Idleness-Ratio Controls in Many-Server Service Systems , 2009, Math. Oper. Res..

[28]  Philippe Robert.  Stochastic Networks and Queues , 2003 .

[29]  Ronald J. Williams,et al.  Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: asymptotic optimality of a threshold policy , 2001 .

[30]  Daniel Liberzon,et al.  Switching in Systems and Control , 2003, Systems & Control: Foundations & Applications.

[31]  S. Sastry,et al.  Jump behavior of circuits and systems , 1981, CDC 1981.

[32]  W. Whitt.  Weak convergence theorems for priority queues: preemptive-resume discipline , 1971, Journal of Applied Probability.

[33]  Ruth J. Williams,et al.  On dynamic scheduling of stochastic networks in heavy traffic and some new results for the workload process , 2000, Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187).

[34]  Aleksej F. Filippov,et al.  Differential Equations with Discontinuous Righthand Sides , 1988, Mathematics and Its Applications.

[35]  J. Dai.  On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models , 1995 .

[36]  S. Meyn,et al.  Spectral theory and limit theorems for geometrically ergodic Markov processes , 2002, math/0209200.

[37]  Ward Whitt,et al.  Nearly periodic behavior in the overloaded $G/D/s+GI$ queue , 2011 .

[38]  W. Whitt.  Comparing counting processes and queues , 1981, Advances in Applied Probability.

[39]  Ward Whitt,et al.  Responding to Unexpected Overloads in Large-Scale Service Systems , 2009, Manag. Sci..

[40]  Martin I. Reiman,et al.  Some diffusion approximations with state space collapse , 1984 .

[41]  J. Michael Harrison,et al.  Brownian Models of Queueing Networks with Heterogeneous Customer Populations , 1988 .

[42]  Ward Whitt,et al.  A Fluid Approximation for Service Systems Responding to Unexpected Overloads , 2011, Oper. Res..

[43]  Maury Bramson,et al.  State space collapse with application to heavy traffic limits for multiclass queueing networks , 1998, Queueing Syst. Theory Appl..

[44]  P. Olver.  Nonlinear Systems , 2013 .

[45]  Avishai Mandelbaum,et al.  Designing a Call Center with Impatient Customers , 2002, Manuf. Serv. Oper. Manag..

[46]  Tolga Tezcan,et al.  Dynamic Control of N-Systems with Many Servers: Asymptotic Optimality of a Static Priority Policy in Heavy Traffic , 2010, Oper. Res..

[47]  R. J. Williams,et al.  Dynamic scheduling of a system with two parallel servers: asymptotic policy in heavy traffic , 1999, Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304).

[48]  S. Asmussen,et al.  Applied Probability and Queues , 1989 .

[49]  Ward Whitt,et al.  An ODE for an Overloaded X Model Involving a Stochastic Averaging Principle , 2010, ArXiv.

[50]  Ashok Erramilli,et al.  Oscillations and Chaos in a Flow Model of a Switching System , 1991, IEEE J. Sel. Areas Commun..