An algorithm for improved delay-scaling in input-queued switches
From MaRDI portal
Publication:2124907
Recommendations
- On Queue-Size Scaling for Input-Queued Switches
- Improved queue-size scaling for input-queued switches via graph factorization
- Bounds on delays and queue lengths in input-queued cell switches
- Scheduling of an input-queued switch to achieve maximal throughput
- Optimal heavy-traffic queue length scaling in an incompletely saturated switch
Cites work
- A new approach to the maximum-flow problem
- Asymptotically tight steady-state queue length bounds implied by drift conditions
- Communication networks. An optimization, control and stochastic networks perspective
- Complex graphs and networks
- Heavy traffic queue length behavior in a switch under the MaxWeight algorithm
- scientific article; zbMATH DE number 5485447 (Why is no real title available?)
- Improved queue-size scaling for input-queued switches via graph factorization
- MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
- On Edge Coloring Bipartite Graphs
- On Queue-Size Scaling for Input-Queued Switches
- Optimal queue-size scaling in switched networks
- Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
- Switched networks with maximum weight policies: fluid approximation and multiplicative state space collapse
Cited in
(2)
This page was built for publication: An algorithm for improved delay-scaling in input-queued switches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2124907)