Analysis of resource sharing in transparent networks

Transparent optical networking promises a cost-efficient solution for future core and metro networks because of the efficacy of switching high-granularity trunk traffic without opto-electronic conversion. Network availability is an important performance parameter for network operators, who are incorporating protection and restoration mechanisms in the network to achieve competitive advantages. This paper focuses on the reduction in Capital Expenditures (CapEx) expected from implementing sharing of backup resources in path-protected transparent networks. We dimension a nationwide network topology for different protection mechanisms using transparent and opaque architectures. We investigate the CapEx reductions obtained through protection sharing on a population of 1000 randomly generated biconnected planar topologies with 14 nodes. We show that the gain for transparent networks is heavily dependent on the offered load, with almost no relative gain for low load (no required parallel line systems). We also show that for opaque networks the CapEx reduction through protection sharing is independent of the traffic load and shows only a small dependency on the number of links in the network. The node CapEx reduction for high load (relative to the number of channels in a line system) is comparable to the CapEx reduction in opaque OTN systems. This is rather surprising as in OTN systems the number of transceivers and linecards and the size of the OTN switching matrix all decrease, while in transparent networks only the degree of the ROADM (number and size of WSSs in the node) decreases while the number of transponders remains the same.

[1]  R. Sokal,et al.  A New Statistical Approach to Geographic Variation Analysis , 1969 .

[2]  Yuzo Ishii,et al.  MEMS-based 1×43 wavelength-selective switch with flat passband , 2009, 2009 35th European Conference on Optical Communication.

[3]  A. Morea,et al.  A critical analysis of the possible cost savings of translucent networks , 2005, DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005..

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

[5]  P. Demeester,et al.  Recovery in multilayer optical networks , 2006, Journal of Lightwave Technology.

[6]  Brigitte Jaumard,et al.  CAPEX/OPEX effective optical wide area network design , 2012, Telecommun. Syst..

[7]  Didier Colle,et al.  Cost efficiency of protection in future transparent networks , 2009, 2009 11th International Conference on Transparent Optical Networks.

[8]  M. Gunkel,et al.  A Cost Model for the WDM Layer , 2006, 2006 International Conference on Photonics in Switching.

[9]  H. T. Mouftah,et al.  Spare capacity allocation for WDM mesh networks with partial wavelength conversion capacity , 2003, Workshop on High Performance Switching and Routing, 2003, HPSR..

[10]  E. K. Park,et al.  Restoration performance study of k-shortest disjoint paths in WDM optical networks , 2007, Telecommun. Syst..

[11]  Robert D. Doverspike,et al.  Future transport network architectures , 1999, IEEE Commun. Mag..

[12]  Hervé Rivano,et al.  Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks , 2003, Telecommun. Syst..

[13]  Christian Fenger Performance Evaluations for Dynamic Wavelength Routed All-Optical Multifiber Networks , 2004, Telecommun. Syst..

[14]  Yu Liu,et al.  Approximating optimal spare capacity allocation by successive survivable routing , 2005, TNET.

[15]  Didier Colle,et al.  Cost comparison of different translucent optical network architectures , 2010, 2010 9th Conference of Telecommunication, Media and Internet.

[16]  Matthias Gunkel,et al.  Cost modeling and evaluation of capital expenditures in optical multilayer networks , 2008 .

[17]  J.P. Heritage,et al.  Transparent vs. opaque vs. translucent wavelength-routed optical networks , 1999, OFC/IOOC . Technical Digest. Optical Fiber Communication Conference, 1999, and the International Conference on Integrated Optics and Optical Fiber Communication.

[18]  Robert E. Tarjan,et al.  A quick method for finding shortest pairs of disjoint paths , 1984, Networks.