Birkhoff--von Neumann Graphs that are PM-Compact
نویسندگان
چکیده
منابع مشابه
Minimum Birkhoff-von Neumann Decomposition
Motivated by the applications in routing in data centers, we study the problem of expressing an n × n doubly stochastic matrix as a linear combination using the smallest number of (sub)permutation matrices. The Birkhoff-von Neumann decomposition theorem proves that there exists such a decomposition, but does not give a representation with the smallest number of permutation matrices. In particul...
متن کاملExtending the Birkhoff-von Neumann Switching Strategy
The Birkhoff-von Neumann (BVN) strategy for offline switching does not support multicast, as it considers only permutation-based switch configurations. This thesis extends the BVN strategy to multicast switching. Using a graph theoretic model, we show that the capacity region for a traffic pattern is precisely the stable set polytope of the pattern's "conflict graph", in the no-fanout-splitting...
متن کاملPreconditioning Techniques Based on the Birkhoff-von Neumann Decomposition
We introduce a class of preconditioners for general sparsematrices based on the Birkhoff–von Neumann decomposition of doubly stochastic matrices. These preconditioners are aimed primarily at solving challenging linear systems with highly unstructured and indefinite coefficient matrices. We present some theoretical results and numerical experiments on linear systems from a variety of applications.
متن کاملExtending the Birkhoff-Von Neumann Switching Strategy to Multicast Switches
This paper extends the Birkhoff-von Neumann unicast switching strategy to the multicast case. Using a graph theoretic model we show that the rate region for a traffic pattern is precisely the stable set polytope of the pattern’s ‘conflict graph’, in the no-fanout splitting case. Computing the offline schedule is equivalent to fractional weighted graph coloring which takes polynomial time for pe...
متن کاملBirkhoff-von Neumann switching with statistical traffic profiles
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 K 1⁄4 ðkijÞ, Birkhoff-von Neumann decomposition offers a quasi-offline scheduling strategy that can provide a service rate of at least kij for each flow ði; jÞ without internal speedup. This paper extends the Birkhoff-von Neum...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2020
ISSN: 0895-4801,1095-7146
DOI: 10.1137/18m1202347