Buffered cross-bar switches, revisited: design steps, proofs and simulations towards optimal rate and minimum buffer memory

Authors:
George F. Georgakopoulos
Affiliations:
Department of Computer Science, University of Crete, Crete, Greece
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2008

Citing 5
Cited 1

Data networks

Data networks
VirtualClock: a new traffic control algorithm for packet-switched networks

ACM Transactions on Computer Systems (TOCS)
Two-dimensional round-robin schedulers for packet switches with multiple input queues

IEEE/ACM Transactions on Networking (TON)
The iSLIP scheduling algorithm for input-queued switches

IEEE/ACM Transactions on Networking (TON)
Algorithms, games, and the internet

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing

Distributed WFQ scheduling converging to weighted max-min fairness

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Regarding the packet-switching problem, we prove that the weighed max-min fair service rates comprise the unique Nash equilibrium point of a strategic game, specifically a throughput auction based on a "least-demanding first-served" principle. We prove that a buffered crossbar switch can converge to this equilibrium with no pre-computation or internal acceleration, with either randomized or deterministic schedulers, (the latter with a minimum buffering of a single-packet per crosspoint). Finally, we present various simulation results that corroborate and extend our analysis.