Improved queue-size scaling for input-queued switches via graph factorization
From MaRDI portal
Publication:5005035
DOI10.1017/apr.2020.31zbMath1473.60147arXiv1903.00398OpenAlexW3088506439MaRDI QIDQ5005035
Publication date: 4 August 2021
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.00398
Queueing theory (aspects of probability theory) (60K25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal scaling of average queue sizes in an input-queued switch: an open problem
- Optimal queue-size scaling in switched networks
- Factors and factorizations of graphs. Proof techniques in factor theory
- A theorem on flows in networks
- Graph factors and factorization: 1985--2003: a survey
- Regular spanning subgraphs of bipartite graphs of high minimum degree
- On factors in random graphs
- MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
- Brownian models of open processing networks: Canonical representation of workload.
- Fluid model for a network operating under a fair bandwidth-sharing policy.
- On Queue-Size Scaling for Input-Queued Switches
- Queue Length Behavior in a Switch under the MaxWeight Algorithm
- Maximal Flow Through a Network
- Combinatorial Properties of Matrices of Zeros and Ones
- Probabilistic Analysis of the Capacitated Transportation Problem
- Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
- Maximum Pressure Policies in Stochastic Processing Networks
This page was built for publication: Improved queue-size scaling for input-queued switches via graph factorization
