Network Reconfiguration using Cops-and-Robber Games

@inproceedings{Coudert2008NetworkRU,
  title={Network Reconfiguration using Cops-and-Robber Games},
  author={David Coudert and Dorian Mazauric},
  year={2008}
}
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… CONTINUE READING

Figures from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 10 REFERENCES

Connection rerouting/network reconfiguration

  • Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings.
  • 2003
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

Markov Chains and Stochastic Stability

  • Communications and Control Engineering Series
  • 1993
VIEW 2 EXCERPTS

Graph minors

N. Robertson, P. D. Seymour
  • I. Excluding a forest. J. Combin. Theory Ser. B, 35(1):39–61, 1983. INRIA in ria -0 03 15 56 8, v er si on 3 - 16 O ct 2 00 8 Unité de recherche INRIA Sophia Antipolis 2004, route des Lucioles - BP 93 - 06902 Sophia Antipolis Cedex
  • 1893
VIEW 2 EXCERPTS