Dynamic Reconfiguration of Network Topology in Optical Networks

Dynamic reconfiguration of the logical topology of a network is generally used to adjust the shape of the network to adhere to changes in traffic. In this thesis the logical topology reconfiguration problem for a WDM network is combined with the multi-path routing of traffic throughout the network. Changes to the logical topology are made using branch exchanges to minimize the disruption to the network traffic. A Multi-timescale Markov Decision Process (MMDP) model is used to capture the different frequencies of changes to the network topology (slow timescale) and the routing of traffic (fast timescale). Heuristic policies are developed for the slow and fast time scales and rollout is used to improve the performance of the heuristic. To measure the performance of the heuristic and rollout policies, the Model Reference Adaptive Search (MRAS) method is used to find reference topologies that are close to optimal for a given static traffic demand matrix. To implement the MRAS method a random graph generation algorithm is needed. To address this need, a very efficient random graph generation algorithm is developed that competes with existing algorithms in the literature.

[1]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[2]  B. Mukherjee,et al.  A Review of Routing and Wavelength Assignment Approaches for Wavelength- Routed Optical WDM Networks , 2000 .

[3]  Piecewise Stationary Markov Decision Processes, I: Constant Gain , 1999 .

[4]  John N. Tsitsiklis,et al.  Simulation-based optimization of Markov reward processes , 2001, IEEE Trans. Autom. Control..

[5]  Edward A. Bender,et al.  The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.

[6]  Eytan Modiano,et al.  Dynamic load balancing in WDM packet networks with and without wavelength constraints , 2000, IEEE Journal on Selected Areas in Communications.

[7]  T. Başar,et al.  Dynamic Noncooperative Game Theory , 1982 .

[8]  Changdong Liu,et al.  Performance and testbed study of topology reconfiguration in IP over optical networks , 2002, IEEE Trans. Commun..

[9]  S. Marcus,et al.  Approximate receding horizon approach for Markov decision processes: average reward case , 2003 .

[10]  Harald Gropp.  Enumeration of regular graphs 100 years ago , 1992, Discret. Math..

[11]  H. T. Mouftah,et al.  Network planning algorithms for the optical Internet based on the generalized MPLS architecture , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[12]  S. Marcus,et al.  Reconfiguration of MPLS / WDM Networks Using Simulation-based Markov Decision Processes , 2005 .

[13]  George N. Rouskas,et al.  A framework for hierarchical traffic grooming in WDM networks of general topology , 2005, 2nd International Conference on Broadband Networks, 2005..

[14]  Sudhir S. Dixit,et al.  On the merit of IP/MPLS protection/restoration in IP over WDM networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[15]  Amin Saberi,et al.  A Sequential Algorithm for Generating Random Graphs , 2007, Algorithmica.

[16]  M. K. Ghosh,et al.  Discrete-time controlled Markov processes with average cost criterion: a survey , 1993 .

[17]  Charles Leake,et al.  Discrete Event Systems: Sensitivity Analysis and Stochastic Optimization by the Score Function Method , 1994 .

[18]  S. Leigh,et al.  Probability and Random Processes for Electrical Engineering , 1989 .

[19]  Nicholas C. Wormald.  Enumeration of Labelled Graphs I: 3-Connected Graphs , 1979 .

[20]  Krishna R. Pattipati,et al.  Rollout strategies for sequential fault diagnosis , 2003, IEEE Trans. Syst. Man Cybern. Part A.

[21]  Dimitri P. Bertsekas,et al.  Rollout Algorithms for Stochastic Scheduling Problems , 1999, J. Heuristics.

[22]  E. Ishikawa,et al.  A Heuristic Wavelength Assignment Optimization for Optical Packet Switching Networks , 2006, TENCON 2006 - 2006 IEEE Region 10 Conference.

[23]  Ronald C. Read.  Some Unusual Enumeration Problems , 1970 .

[24]  V. Vu,et al.  Sandwiching random graphs , 2002 .

[25]  K. G. Ramakrishnan,et al.  Techniques for traffic engineering of multiservice, multipriority networks , 2001, Bell Labs Technical Journal.

[26]  Frank Harary,et al.  Graphical enumeration , 1973 .

[27]  Hyogon Kim,et al.  Network Control and Management for the Next Generation Internet , 2000 .

[28]  R. Rubinstein.  The Cross-Entropy Method for Combinatorial and Continuous Optimization , 1999 .

[29]  Marco Listanti,et al.  Off-line configuration of a MPLS over WDM network under time-varying offered traffic , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[30]  Nicholas C. Wormald,et al.  Counting the 10-point graphs by partition , 1981, J. Graph Theory.

[31]  George N. Rouskas,et al.  Reconfiguration and Dynamic Load Balancing in Broadcast WDM Networks* , 2004, Photonic Network Communication.

[32]  Biswanath Mukherjee,et al.  Virtual-topology adaptation for WDM mesh networks under dynamic traffic , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[33]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[34]  Biswanath Mukherjee,et al.  Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study , 2000, TNET.

[35]  R. C. Read,et al.  The Enumeration of Locally Restricted Graphs (I) , 1959 .

[36]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[37]  Reuven Y. Rubinstein,et al.  Optimization of computer simulation models with rare events , 1997 .

[38]  Béla Bollobás,et al.  A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..

[39]  Eric Bouillet,et al.  Lightpath Re-optimization in mesh optical networks , 2005, IEEE/ACM Transactions on Networking.

[40]  Mark A. Shayman,et al.  Multitime scale Markov decision processes , 2003, IEEE Trans. Autom. Control..

[41]  Pushpa N. Rathie.  On Some Enumeration Problems in Graph Theory , 1980 .

[42]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[43]  Nicholas C. Wormald,et al.  Generating Random Regular Graphs Quickly , 1999, Combinatorics, Probability and Computing.

[44]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[45]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[46]  Hiroyuki Morikawa,et al.  Priority-Based Wavelength Assignment Algorithm for Burst Switched WDM Optical Networks , 2003 .

[47]  Byrav Ramamurthy,et al.  Virtual topology reconfiguration of wavelength-routed optical WDM networks , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[48]  Van H. Vu,et al.  Generating Random Regular Graphs , 2003, STOC '03.

[49]  Robert Givan,et al.  Congestion control using policy rollout , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[50]  Michael C. Fu,et al.  A Model Reference Adaptive Search Method for Global Optimization , 2007, Oper. Res..

[51]  Lih-Yuan Deng,et al.  The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation, and Machine Learning , 2006, Technometrics.

[52]  N. Wormald.  Some problems in the enumeration of labelled graphs , 1980, Bulletin of the Australian Mathematical Society.

[53]  Oktay Günlük,et al.  Computational experience with a difficult mixedinteger multicommodity flow problem , 1995, Math. Program..

[54]  Kumar N. Sivarajan,et al.  Design of Logical Topologies for Wavelength-Routed Optical Networks , 1996, IEEE J. Sel. Areas Commun..

[55]  Anthony S. Acampora,et al.  Logically rearrangeable multihop lightwave networks , 1991, IEEE Trans. Commun..

[56]  Nicholas C. Wormald,et al.  Number of labeled 4-regular graphs , 1980, J. Graph Theory.

[57]  Nicholas C. Wormald.  Enumeration of Labelled Graphs II: Cubic Graphs with a given Connectivity , 1979 .

[58]  Elise Miller-Hooks,et al.  Solving a generalized traveling salesperson problem with stochastic customers , 2007, Comput. Oper. Res..

[59]  Shie Mannor,et al.  A Tutorial on the Cross-Entropy Method , 2005, Ann. Oper. Res..

[60]  George N. Rouskas,et al.  Design of dynamic reconfiguration policies for broadcast WDM networks , 1998, Other Conferences.

[61]  Anthony S. Acampora,et al.  Branch-exchange sequences for reconfiguration of lightwave networks , 1994, IEEE Trans. Commun..