# Balanced Sequences and Optimal Routing

2 SLOOP - Simulation, Object Oriented Languages and Parallelism
CRISAM - Inria Sophia Antipolis - Méditerranée , 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.
Keywords :
Type de document :
Rapport
RR-3180, INRIA. 1997
Domaine :
Liste complète des métadonnées

Littérature citée [1 références]

https://hal.inria.fr/inria-00073509
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 13:05:35
Dernière modification le : mercredi 31 janvier 2018 - 10:24:04
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:48:38

### Identifiants

• HAL Id : inria-00073509, version 1

### Citation

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

### Métriques

Consultations de la notice

## 208

Téléchargements de fichiers