Reconfiguration of the routing in WDM networks with two classes of services

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 to a 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.

[1]  John R. Gilbert,et al.  Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree , 1995, J. Algorithms.

[2]  Rolf H. Möhring,et al.  The Pathwidth and Treewidth of Cographs , 1990, SIAM J. Discret. Math..

[3]  Michael A. Langston,et al.  Exact and Approximate Solutions for the Gate Matrix Layout Problem , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  Jean-Sébastien Sereni,et al.  Characterization of graphs and digraphs with small process numbers , 2011, Discret. Appl. Math..

[5]  Paul D. Seymour,et al.  Graph minors. I. Excluding a forest , 1983, J. Comb. Theory, Ser. B.

[6]  Arun K. Somani,et al.  Connection rerouting/network reconfiguration , 2003, Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings..

[7]  Christos H. Papadimitriou,et al.  The complexity of searching a graph , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[8]  Konstantin Skodinis.  Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time , 2003, J. Algorithms.

[9]  Ahmed E. Kamal,et al.  Traffic Grooming for Optical Networks , 2008 .

[10]  David Coudert,et al.  Network Reconfiguration using Cops-and-Robber Games , 2008 .

[11]  Christos H. Papadimitriou,et al.  Searching and Pebbling , 1986, Theor. Comput. Sci..

[12]  Imrich Chlamtac,et al.  Analysis of blocking probability for distributed lightpath establishment in WDM optical networks , 2005, IEEE/ACM Transactions on Networking.

[13]  Dieter Kratsch,et al.  Treewidth and Pathwidth of Permutation Graphs , 1995, SIAM J. Discret. Math..

[14]  Jean-Sébastien Sereni,et al.  Rerouting requests in WDM networks , 2005 .

[15]  B. Mohar,et al.  Graph Minors , 2009 .

[16]  Dimitrios M. Thilikos,et al.  An annotated bibliography on guaranteed graph searching , 2008, Theor. Comput. Sci..

[17]  Ioan Todinca,et al.  Pathwidth of Circular-Arc Graphs , 2007, WG.

[18]  Eytan Modiano,et al.  On-line routing and wavelength assignment for dynamic traffic in WDM ring and torus networks , 2006, IEEE/ACM Transactions on Networking.

[19]  Biswanath Mukherjee,et al.  Optical WDM Networks (Optical Networks) , 2006 .

[20]  George N. Rouskas,et al.  Traffic Grooming for Optical Networks: Foundations, Techniques and Frontiers , 2008 .

[21]  Biswanath Mukherjee,et al.  Optical WDM Networks , 2006 .