Balanced Sequences and Optimal Routing - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 1997

Balanced Sequences and Optimal Routing


The objective pursued in this paper is two-fold. The first part gives an overview of 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 fixed rate? The second objective of the paper is to relate this construction to the framework of optimal routing in queueing networks. We show under rather general assumptions that the optimal deterministic routing in several event graphs is such a sequence.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-3180.pdf (309.78 Ko) Télécharger le fichier

Dates and versions

inria-00073509 , version 1 (24-05-2006)


  • HAL Id : inria-00073509 , version 1


Eitan Altman, Bruno Gaujal, Arie Hordijk. Balanced Sequences and Optimal Routing. RR-3180, INRIA. 1997. ⟨inria-00073509⟩
120 View
189 Download


Gmail Facebook Twitter LinkedIn More