Balanced sequences and optimal routing
The objective pursued in this paper is two-fold. The first part addresses the fallowing combinatorial problem: is it possible to construct an infinite sequence wet n letters where each letter is distributed as "evenly" as possible and appears with a given rate? The second objective of the gaper is to use this construction in the framework of optimal routing in queuing networks. We show under rather general assumptions that the optimal deterministic routing in stochastic event graphs is such a sequence.
balanced sequences stochastic event graphs multimodularity optimal control