Queueing Systems: Theory and Applications
State space collapse with application to heavy traffic limits for multiclass queueing networks
Queueing Systems: Theory and Applications
Insensitivity in processor-sharing networks
Performance Evaluation
Insensitive Bandwidth Sharing in Data Networks
Queueing Systems: Theory and Applications
Maximum Pressure Policies in Stochastic Processing Networks
Operations Research
Logarithmic delay for N × N packet switches under the crossbar constraint
IEEE/ACM Transactions on Networking (TON)
Optimal delay scheduling in networks with arbitrary constraints
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Large Deviations of Queues Sharing a Randomly Time-Varying Server
Queueing Systems: Theory and Applications
Stability and Asymptotic Optimality of Generalized MaxWeight Policies
SIAM Journal on Control and Optimization
Resource pooling in congested networks: proportional fairness and product form
Queueing Systems: Theory and Applications
Qualitative properties of α-weighted scheduling policies
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Optimal scaling of average queue sizes in an input-queued switch: an open problem
Queueing Systems: Theory and Applications
Fluid models of congestion collapse in overloaded switched networks
Queueing Systems: Theory and Applications
Optimal Throughput–Delay Scaling in Wireless Networks—Part II: Constant-Size Packets
IEEE Transactions on Information Theory
Max-Weight Scheduling in Queueing Networks With Heavy-Tailed Traffic
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
We consider a switched (queueing) network in which there are constraints on which queues may be served simultaneously; such networks have been used to effectively model input-queued switches and wireless networks. The scheduling policy for such a network specifies which queues to serve at any point in time, based on the current state or past history of the system. In the main result of this paper, we provide a new class of online scheduling policies that achieve optimal average queue-size scaling for a class of switched networks including input-queued switches. In particular, it establishes the validity of a conjecture about optimal queue-size scaling for input-queued switches.