Topology design of large-scale optical networks

Yufeng Xin. Topology Design of Large-Scale Optical Networks. (Under the direction of Professor George N. Rouskas and Professor Harry G. Perros). Optical networks consisting of optical cross-connects(OXCs) arranged in some arbitrary topology are emerging as an integral part of the Internet infrastructure. The main functionality of these networks will be to provide reliable end-to-end lightpath connections to large numbers of electronic label switched routers (LSRs). We consider two problems that arise in building such networks. The first problem is related to the topology design of optical networks that can grow to Internet scales, while the second is related to the light-tree routing for the provision of optical multicast services. In the first part of the thesis, we present a set of heuristic algorithms to address the combined problem of physical topology design (i.e., determine the number of OXCs required for a given traffic demand and the fiber links among them) and logical topology design (i.e., determine the routing and wavelength assignment for the lightpaths among the LSRs). We then extend our study to take a shared path-based protection scheme into consideration after presenting a detailed analysis and comparison of different protection strategies. In order to characterize the performance of our algorithms, we have developed lower bounds which can be computed efficiently. We present numerical results for up to 1000 LSRs and for a wide range of system parameters such as the number of wavelengths per fiber, the number of transceivers per LSR, and the number of ports per OXC. In the second part of the thesis, we study the problem of constructing light-trees under optical layer power budget constraints, with a focus on algorithms which can guarantee a certain level of quality for the signals received by the destination nodes. We define a new constrained light-tree routing problem by introducing a set of constraints on the source-destination paths to account for the power losses at the optical layer. We investigate a number of variants of this problem, we characterize their complexity, and we develop a suite of corresponding routing algorithms. We find that, in order to guarantee an adequate signal quality and to scale to large destination sets, light-trees must be as balanced as possible. Our algorithms are designed to construct balanced trees which, in addition to having good performance in terms of signal quality, they also ensure a certain degree of fairness among destination nodes. Topology Design of Large-Scale Optical Networks

[1]  Pi-Rong Sheu,et al.  A fast and efficient heuristic algorithm for the delay- and delay variation-bounded multicast tree problem , 2002, Comput. Commun..

[2]  Biswanath Mukherjee,et al.  Optical Communication Networks , 1997 .

[3]  Dimitri Papadimitriou,et al.  Optical Multicast in Wavelength Switched Networks - Architectural Framework , 2001 .

[4]  D. Du,et al.  Multiwavelength Optical Networks , 2002, Network Theory and Applications.

[5]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[6]  Ayan Banerjee,et al.  Generalized multiprotocol label switching: an overview of routing and management enhancements , 2001, IEEE Commun. Mag..

[7]  Chunming Qiao,et al.  Static versus dynamic establishment of protection paths in WDM networks , 2001, J. High Speed Networks.

[8]  Muriel Médard,et al.  Generalized loop-back recovery in optical mesh networks , 2002, TNET.

[9]  Ian M. Leslie,et al.  How bad is naive multicast routing? , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[10]  C. Edward Chow,et al.  On multicast path finding algorithms , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[11]  Xiaohua Jia,et al.  Optimization of wavelength assignment for QoS multicast in WDM networks , 2001, IEEE Trans. Commun..

[12]  Ori Gerstel,et al.  Optical layer survivability-an implementation perspective , 2000, IEEE Journal on Selected Areas in Communications.

[13]  Jitender S. Deogun,et al.  Allocation of Splitting Nodes in All-Optical Wavelength-Routed Networks , 2004, Photonic Network Communications.

[14]  Eric Mannie,et al.  Generalized Multi-Protocol Label Switching (GMPLS) Architecture , 2004, RFC.

[15]  P. B. Chu,et al.  MEMS: the path to large optical crossconnects , 2002 .

[16]  Robert G. Gallager,et al.  Wavelength requirements of all-optical networks , 1995, TNET.

[17]  Jens Vygen,et al.  NP-completeness of Some Edge-disjoint Paths Problems , 1995, Discret. Appl. Math..

[18]  Biswanath Mukherjee,et al.  Some principles for designing a wide-area WDM optical network , 1996, TNET.

[19]  Carmen Mas Machuca,et al.  An efficient algorithm for locating soft and hard failures in WDM networks , 2000, IEEE Journal on Selected Areas in Communications.

[20]  George N. Rouskas,et al.  Multicast Routing with End-to-End Delay and Delay Variation Constraints , 1997, IEEE J. Sel. Areas Commun..

[21]  George C. Polyzos,et al.  Multicast routing for multimedia communication , 1993, TNET.

[22]  Peter Ashwood-Smith,et al.  Generalized MPLS - Signaling Functional Description , 2000 .

[23]  Ryutaro Kawamura.  Architectures for ATM network survivability , 1998, IEEE Communications Surveys & Tutorials.

[24]  Ori Gerstel,et al.  Protection interoperability for WDM optical networks , 2000, TNET.

[25]  Sy-Yen Kuo,et al.  All-optical multicasting on wavelength-routed WDM networks with partial replication , 2001, Proceedings 15th International Conference on Information Networking.

[26]  Henrik Esbensen,et al.  Computing near-optimal solutions to the steiner problem in a graph using a genetic algorithm , 1995, Networks.

[27]  Amitava Mukherjee,et al.  An Approach to Wide Area WDM Optical Network Design Using Genetic Algorithm , 1999, Comput. Commun..

[28]  Zhensheng Zhang,et al.  A heuristic wavelength assignment algorithm for multihop WDM networks with wavelength routing and wavelength re-use , 1995, TNET.

[29]  Arunabha Sen,et al.  Survivability of lightwave networks - path lengths in WDM protection scheme , 2001, J. High Speed Networks.

[30]  Lalit M. Patnaik,et al.  Genetic algorithms: a survey , 1994, Computer.

[31]  Anujan Varma,et al.  Degree-constrained multicasting in point-to-point networks , 1995, Proceedings of INFOCOM'95.

[32]  Murat Alanyali,et al.  Provisioning algorithms for WDM optical networks , 1999, TNET.

[33]  George N. Rouskas,et al.  A Survey of Virtual Topology Design Algorithms for Wavelength Routed Optical Networks , 1999 .

[34]  S. Baroni,et al.  Key topological parameters for the wavelength-routed optical network design , 1996, Proceedings of European Conference on Optical Communication.

[35]  Kyungsik Lee,et al.  Optimal routing and wavelength assignment in WDM ring networks , 2000, IEEE Journal on Selected Areas in Communications.

[36]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[37]  Chunming Qiao,et al.  Constrained multicast routing in WDM networks with sparse light splitting , 2000, Journal of Lightwave Technology.

[38]  S. Baroni,et al.  Wavelength requirements in arbitrarily connected wavelength-routed optical networks , 1997 .

[39]  Wayne D. Grover,et al.  Comparison of Mesh Protection and Restoration Schemes and the Dependency of Graph Connectivity , 2001, DRCN.

[40]  Pierre A. Humblet,et al.  On the number of wavelengths and switches in all-optical networks , 1994, IEEE Trans. Commun..

[41]  Manya Ghobadi,et al.  Optical Networks , 2000 .

[42]  Ezhan Karasan,et al.  Effects of wavelength routing and selection algorithms on wavelength conversion gain in WDM optical networks , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

[43]  Celso C. Ribeiro,et al.  Tabu search for the Steiner problem in graphs , 2000, Networks.

[44]  Biswanath Mukherjee,et al.  Light trees: optical multicasting for improved performance in wavelength routed networks , 1999, IEEE Commun. Mag..

[45]  W.S. Hu,et al.  Multicasting optical cross connects employing splitter-and-delivery switch , 1998, IEEE Photonics Technology Letters.

[46]  Mitsuo Gen,et al.  Genetic algorithms and engineering optimization , 1999 .

[47]  Biswanath Mukherjee,et al.  Topology design and upgrade of an optical network by bottleneck-cut identification , 2001, J. High Speed Networks.

[48]  Thomas E. Stern,et al.  Protection cycles in mesh WDM networks , 2000, IEEE Journal on Selected Areas in Communications.

[49]  David S. Johnson,et al.  The Complexity of Computing Steiner Minimal Trees , 1977 .

[50]  Kumar N. Sivarajan,et al.  Routing and wavelength assignment in all-optical networks , 1995, TNET.

[51]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[52]  Murat Azizoglu,et al.  Multicast routing and wavelength assignment in wide-area networks , 1998, Other Conferences.

[53]  J. Leuthold,et al.  Multimode interference couplers with tunable power splitting ratios , 2001 .

[54]  K. Dowsland.  HILL-CLIMBING, SIMULATED ANNEALING AND THE STEINER PROBLEM IN GRAPHS , 1991 .

[55]  Wayne D. Grover,et al.  Influence of modularity and economy-of-scale effects on design of mesh-restorable DWDM networks , 2000, IEEE Journal on Selected Areas in Communications.

[56]  Ayan Banerjee,et al.  Generalized multiprotocol label switching: an overview of signaling enhancements and recovery techniques , 2001, IEEE Commun. Mag..

[57]  Wayne D. Grover,et al.  Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[58]  Biswanath Mukherjee,et al.  Survivable WDM mesh networks. Part I-Protection , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

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

[60]  Charles C. Palmer,et al.  An approach to a problem in network design using genetic algorithms , 1994, Networks.

[61]  Tali Eilam-Tzoreff,et al.  The Disjoint Shortest Paths Problem , 1998, Discret. Appl. Math..

[62]  S. Louis Hakimi,et al.  Steiner's problem in graphs and its implications , 1971, Networks.

[63]  Piet Demeester,et al.  Efficient Usage of Capacity Resources in Survivable MP lambda S Networks , 2003, QoS-IP.

[64]  Chu-Sing Yang,et al.  Multicast routing with power consideration in sparse splitting WDM networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[65]  Angela Chiu,et al.  Issues for routing in the optical layer , 2001, IEEE Commun. Mag..

[66]  Zhensheng Zhang,et al.  A heuristic wavelength assignment algorithm for multihop WDM networks with wavelength routing and wavelength reuse , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[67]  Bruno Beauquier,et al.  All-to-all communication for some wavelength-routed all-optical networks , 1999, Networks.

[68]  Jitender S. Deogun,et al.  Power-efficient design of multicast wavelength-routed networks , 2000, IEEE Journal on Selected Areas in Communications.

[69]  N. Nagatsu,et al.  Optical Path Cross-Connect System Scale Evaluation Using Path Accommodation Design for Restricted Wavelength Multiplexing , 1996, IEEE J. Sel. Areas Commun..

[70]  Henrik Esbensen.  Computing Near-Optimal Solutions to the Steiner Problem in a Graph Using a Genetic Algorithm , 1994 .

[71]  Biswanath Mukherjee,et al.  Fault management in IP-over-WDM networks: WDM protection versus IP restoration , 2002, IEEE J. Sel. Areas Commun..

[72]  Deying Li,et al.  Minimizing number of wavelengths in multicast routing trees in WDM networks , 2000, Networks.

[73]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[74]  Yongbum Kim,et al.  A restoration method independent of failure location in all-optical networks , 2002, Comput. Commun..

[75]  Luca Valcarenghi,et al.  IP restoration vs. WDM protection: is there an optimal choice? , 2000, IEEE Netw..

[76]  Imrich Chlamtac,et al.  Lightpath communications: an approach to high bandwidth optical WAN's , 1992, IEEE Trans. Commun..

[77]  A. Royset,et al.  How many wavelengths does it take to build a wavelength routed optical network? , 1996, Proceedings of European Conference on Optical Communication.

[78]  Yakov Rekhter,et al.  Mpls: Technology and Applications , 2000 .

[79]  Marco Ajmone Marsan,et al.  Topologies for wavelength-routing all-optical networks , 1993, TNET.

[80]  Manoj Kumar,et al.  Analysis and design of backbone architecture alternatives for IP optical networking , 2000, IEEE Journal on Selected Areas in Communications.

[81]  Sheng Wang,et al.  Dynamic routing and assignment of wavelength algorithms in multifiber wavelength division multiplexing networks , 2000, IEEE Journal on Selected Areas in Communications.