Generating functionology
Optimization of static traffic allocation policies
Theoretical Computer Science - Special issue on probabilistic modelling
Combinatorial properties of sequences defined by the billiard in paved triangles
Theoretical Computer Science
On the pathwise optimal Bernoulli routing policy for homogeneous parallel servers
Mathematics of Operations Research
Combinatorics of patterns of a bidimensional Sturmian sequence.
Theoretical Computer Science
Minimizing service and operation costs of periodic scheduling
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Optimal Allocation Sequences of Two Processes Sharing aResource
Discrete Event Dynamic Systems
Optimal Load Balancing on Distributed Homogeneous Unreliable Processors
Operations Research
Balance properties of multi-dimensional words
Theoretical Computer Science
Optimal Open-Loop Control of Vacations, Polling and Service Assignment
Queueing Systems: Theory and Applications
Bounds for Deterministic Periodic Routing Sequences
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Balances for fixed points of primitive substitutions
Theoretical Computer Science - WORDS
The maximum deviation just-in-time scheduling problem
Discrete Applied Mathematics
NOTE ON THE CONVEXITY OF THE STATIONARY WAITING TIME AS A FUNCTION OF THE DENSITY
Probability in the Engineering and Informational Sciences
COMPARISON OF QUEUES WITH DIFFERENT DISCRETE-TIME ARRIVAL PROCESSES
Probability in the Engineering and Informational Sciences
SCHEDULING OF AN INPUT-QUEUED SWITCH TO ACHIEVE MAXIMAL THROUGHPUT
Probability in the Engineering and Informational Sciences
m-Balanced words: a generalization of balanced words
Theoretical Computer Science
Lattices and multi-dimensional words
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Optimal Routing in Two Parallel Queues with Exponential Service Times
Discrete Event Dynamic Systems
Design and analysis of a class-aware recursive loop scheduler for class-based scheduling
Performance Evaluation
Balance Properties and Distribution of Squares in Circular Words
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Balancing and clustering of words in the Burrows-Wheeler transform
Theoretical Computer Science
Periodic scheduling of marked graphs using balanced binary words
Theoretical Computer Science
Counting minimal semi-Sturmian words
Discrete Applied Mathematics
On the structure of bispecial Sturmian words
Journal of Computer and System Sciences
| Hi-index | 0.01 |
The objective pursued in this paper is two-fold. The first part addresses the following combinatorial problem: is it possible to construct an infinite sequence over n letters where each letter is distributed as “evenly” as possible and appears with a given rate? The second objective of the paper 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.