HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Balanced Sequences and Optimal Routing

Eitan Altman 1 Bruno Gaujal 2 Arie Hordijk
2 SLOOP - Simulation, Object Oriented Languages and Parallelism
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : 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.
Document type :
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 1:05:35 PM
Last modification on : Friday, February 4, 2022 - 3:08:49 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:48:38 PM


  • HAL Id : inria-00073509, version 1



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



Record views


Files downloads