Birkhoff-von Neumann switching with statistical traffic profiles

Authors:
Jerry Chou;Bill Lin
Affiliations:
University of California, San Diego, 9500 Gilman Drive, La Jolla, CA 92093, USA;University of California, San Diego, 9500 Gilman Drive, La Jolla, CA 92093, USA
Venue:
Computer Communications
Year:
2010

Citing 4
Cited 0

Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round robin

SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
The impact of multicast layering on network fairness

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.24

Visualization

Abstract

Offline scheduling is attractive when the traffic profile is known a priori since the complexity of online scheduling is largely removed. Given any admissible rate matrix @L=(@l"i"j), Birkhoff-von Neumann decomposition offers a quasi-offline scheduling strategy that can provide a service rate of at least @l"i"j for each flow (i,j) without internal speedup. This paper extends the Birkhoff-von Neumann switching strategy to consider traffic profiles in which the traffic demands are specified as statistical distributions rather than fixed rates.