Diffusion approximation for an input-queued switch operating under a maximum weight matching policy

For N ≥ 2, we consider an N × N input-queued switch operating under a maximum weight matching policy. We establish a diffusion approximation for a (2N − 1)-dimensional workload process associated with this switch when all input ports and output ports are heavily loaded. The diffusion process is a semimartingale reflecting Brownian motion living in a polyhedral cone with N2 boundary faces, each of which has an associated constant direction of reflection. Our proof builds on our own prior work [13] on an invariance principle for semimartingale reflecting Brownian motions in piecewise smooth domains and on a multiplicative state space collapse result for switched networks established by Shah and Wischik in [19].

[1]  G. Dantzig,et al.  On the continuity of the minimum set of a continuous function , 1967 .

[2]  D. Luenberger.  Optimization by Vector Space Methods , 1968 .

[3]  P. Donnelly.  MARKOV PROCESSES Characterization and Convergence (Wiley Series in Probability and Mathematical Statistics) , 1987 .

[4]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[5]  Thomas E. Anderson,et al.  High-speed switch scheduling for local-area networks , 1993, TOCS.

[6]  Robert J. Plemmons,et al.  Nonnegative Matrices in the Mathematical Sciences , 1979, Classics in Applied Mathematics.

[7]  Jean C. Walrand,et al.  Achieving 100% throughput in an input-queued switch , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[8]  Ruth J. Williams,et al.  Existence and Uniqueness of Semimartingale Reflecting Brownian Motions in Convex Polyhedrons , 1996 .

[9]  Ruth J. Williams,et al.  An invariance principle for semimartingale reflecting Brownian motions in an orthant , 1998, Queueing Syst. Theory Appl..

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

[11]  J. Harrison.  Brownian models of open processing networks: canonical representation of workload , 2000 .

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

[13]  S. Ethier,et al.  Markov Processes: Characterization and Convergence , 2005 .

[14]  Jim Dai,et al.  Correctional Note to "Existence and Uniqueness of Semimartingale Reflecting Brownian Motions in Convex Polyhedrons" , 2006 .

[15]  R. J. Williams,et al.  An invariance principle for semimartingale reflecting Brownian motions in domains with piecewise smooth boundaries. , 2007, 0704.0405.

[16]  R. J. Williams,et al.  State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy , 2009, 0910.3821.

[17]  John N. Tsitsiklis,et al.  Qualitative properties of α-weighted scheduling policies , 2010, SIGMETRICS '10.

[18]  Devavrat Shah,et al.  Switched networks with maximum weight policies: Fluid approximation and multiplicative state space collapse , 2010, ArXiv.

[19]  J. Tsitsiklis,et al.  Qualitative properties of $\alpha$-fair policies in bandwidth-sharing networks , 2011, 1104.2340.

[20]  R. Bass,et al.  Review: P. Billingsley, Convergence of probability measures , 1971 .

[21]  John N. Tsitsiklis,et al.  Optimal scaling of average queue sizes in an input-queued switch: an open problem , 2011, Queueing Syst. Theory Appl..

[22]  Devavrat Shah,et al.  Optimal queue-size scaling in switched networks , 2011, SIGMETRICS '12.

[23]  David D. Yao,et al.  A Stochastic Network Under Proportional Fair Resource Control - Diffusion Limit with Multiple Bottlenecks , 2012, Oper. Res..

[24]  John N. Tsitsiklis,et al.  Qualitative properties of α-fair policies in bandwidth-sharing networks , 2014 .

[25]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .