Network Reconfiguration using Cops-and-Robber Games

David Coudert 1, * Dorian Mazauric 1
* Corresponding author
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
I3S - Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis, CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : The process number is the number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph theory point of view, it is similar to the pathwidth. However they are not always equal in general graphs. Determining these parameters is in general NP-complete. In this paper, we propose a polynomial algorithm to compute an approximation of the process number of digraphs, improving the efficiency of the previous exponential algorithm.
Document type :
Reports
[Research Report] RR-6694, INRIA. 2008


https://hal.inria.fr/inria-00315568
Contributor : David Coudert <>
Submitted on : Thursday, October 16, 2008 - 5:47:13 PM
Last modification on : Thursday, October 16, 2008 - 8:05:49 PM

File

RR-6694.pdf
fileSource_public_author

Identifiers

  • HAL Id : inria-00315568, version 3

Collections

Citation

David Coudert, Dorian Mazauric. Network Reconfiguration using Cops-and-Robber Games. [Research Report] RR-6694, INRIA. 2008. <inria-00315568v3>

Export

Share

Metrics

Consultation de
la notice

168

Téléchargement du document

50