IEEE/ACM Transactions on Networking (TON)
High-speed switch scheduling for local-area networks
ACM Transactions on Computer Systems (TOCS)
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Hierarchical packet fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
Symmetric Crossbar Arbiters for VLSI Communication Switches
IEEE Transactions on Parallel and Distributed Systems
Fair Scheduling for Input Buffered Switches
Cluster Computing
Max-Min Fair Scheduling in Input-Queued Switches
IEEE Transactions on Parallel and Distributed Systems
On guaranteed smooth switching for buffered crossbar switches
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Strong performance guarantees for asynchronous buffered crossbar scheduler
IEEE/ACM Transactions on Networking (TON)
A distributed scheduling architecture for scalable packet switches
IEEE Journal on Selected Areas in Communications
Fast Switching and Fair Control of Congested Flow in Broadband Networks
IEEE Journal on Selected Areas in Communications
Round-robin scheduling for max-min fairness in data networks
IEEE Journal on Selected Areas in Communications
An evolution to crossbar switches with virtual output queuing and buffered cross points
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
This paper studies the fairness properties of distributed WFQ scheduling in buffered crossbars. Using a fluid model, we prove that these networks converge to ideal weighted max-min fair allocation. We simulate the cell-based system, and observe how close real rates come to the theoretical WMM fair: with buffer sizes of 2-5 cells per crosspoint, the average rate discrepancy is below 1%; the worst-case discrepancy falls below 4% with 4- to 8-cell buffers. We also study the transient phenomena when some flows come and go. We find that, after a change in a flow's state, rate changes visit flows along non-circular paths, stabilizing them to their new fair rates; interestingly, some flows can affect all other active flows in the crossbar. Regarding the factors that influence the stabilization delay, although larger buffers yield more accurate convergence, they increase stabilization delay. Larger networks may also take more time to stabilize. Finally, convergence speeds up as the difference between the present rates and the WMM fair rates increases. Transient behavior simulations verify these results. Although we deal with data crossbar networks only, our analysis reveals complicated, ''multi-hop'' interactions among the flows in the crossbar, similar to those that can appear in arbitrary, point-to-point networks with distributed WFQ schedulers and backpressure mechanisms, such as the scheduling sub-system of a multi-stage switching fabric.