Routing Reconfiguration/Process Number: Coping wih Two Classes of Services

David Coudert 1, * Florian Huc 1 Dorian Mazauric 1 Nicolas Nisse 1 Jean-Sébastien Sereni 2, 3
* Auteur correspondant
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : In WDM backbone networks, the traffic pattern evolves constantly due to the nature of the demand itself or because of equipment failures leading to reroute affected connections. In this context, requests are routed greedily using available resources without changing the routing of pre-established connections. However, such a policy leads to a poor usage of resources and so higher blocking probability: new connection requests might be rejected while network resources are sufficient to serve all the traffic. Therefore, it is important to regularly reconfigure the network by rerouting established connections in order to optimize the usage of network resources. In this paper, we consider the network reconfiguration problem that consists in switching existing connections one after the other from the current routing to a new pre-computed routing. Due to cyclic dependencies between connections, some requests may have to be temporarily interrupted during this process. Clearly, the number of requests simultaneously interrupted has to be minimized. Furthermore, it might be impossible for the network operator to interrupt some connections because of the contract signed with the corresponding clients. In this setting, the network reconfiguration problem consists in going from a routing to another one given that some priority connections cannot be interrupted. The network reconfiguration problem without priority connections has previously been modeled as a cops-and-robber game in [5, 6]. Here, we first extend this model to handle priority connections. Then we identify cases where no solution exists. Using a simple transformation, we prove that the reconfiguration problem with priority connections can be reduced to the problem without this constraint. Finally, we propose a new heuristic algorithm that improves upon previous proposals.
Type de document :
[Research Report] RR-6698, INRIA. 2008, pp.15
Liste complète des métadonnées

Littérature citée [19 références]  Voir  Masquer  Télécharger
Contributeur : David Coudert <>
Soumis le : vendredi 17 octobre 2008 - 16:32:48
Dernière modification le : jeudi 15 novembre 2018 - 20:26:55
Document(s) archivé(s) le : mardi 9 octobre 2012 - 14:00:08


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00331807, version 1



David Coudert, Florian Huc, Dorian Mazauric, Nicolas Nisse, Jean-Sébastien Sereni. Routing Reconfiguration/Process Number: Coping wih Two Classes of Services. [Research Report] RR-6698, INRIA. 2008, pp.15. 〈inria-00331807〉



Consultations de la notice


Téléchargements de fichiers