Segment-based approaches to survivable translucent network design under various ultra-long-haul system reach capabilities (Invited)

One of the most practical architectural options for optical networking is a so-called translucent network based on a predominance of optically transparent switch nodes and a smaller number of strategically placed opaque (electronic core) switch nodes. In such a network it is technically easier to assume failure detection at the opaque nodes only and thus natural to consider viewing the transparent path segments between opaque nodes as the entities to be protected for network survivability, as opposed to single spans or entire end-to-end paths. We develop and test capacity-design models to compare this type of segmentbased restoration scheme with conventional schemes. More important, however, a fast, nearly optimal, algorithm is proposed that can determine the placement of opaque nodes so that the fewest possible number is needed that ensures complete translucent reachability and single-failure survivability on the basis of the corresponding transparent path segments. Our data and methods also reveal the trade-off between the transparent reach obtainable by an ultra-long-haul (ULH) system and the corresponding number of opaque nodes required in the network (including survivability considerations), and thus we attain important insights to guide the relative allocation of research and development efforts on ULH systems as opposed to optical‐electronic‐optical cross-connect cost reduction. © 2003 Optical Society of America

[1]  Byrav Ramamurthy,et al.  Translucent optical WDM networks for the next-generation backbone networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[2]  C. Siva Ram Murthy,et al.  Dynamic establishment of segmented protection paths in single and multi-fiber WDM mesh networks , 2002, SPIE ITCom.

[3]  Xi Yang,et al.  Sparse regeneration in a translucent WDM optical network , 2001, SPIE/OSA/IEEE Asia Communications and Photonics.

[4]  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.

[5]  Krishna P. Gummadi,et al.  An efficient primary-segmented backup scheme for dependable real-time communication in multihop networks , 2003, TNET.

[6]  Wayne D. Grover,et al.  Design of a meta-mesh of chain subnetworks: enhancing the attractiveness of mesh-restorable WDM networking on low connectivity graphs , 2002, IEEE J. Sel. Areas Commun..

[7]  S. Wheeler,et al.  40 channels 4000 km DWDM ULH transmission field trial without Raman amplification and regeneration , 2002, Optical Fiber Communication Conference and Exhibit.

[8]  Wayne D. Grover,et al.  Comparison of k-shortest paths and maximum flow routing for network facility restoration , 1994, IEEE J. Sel. Areas Commun..

[9]  Jennifer Yates,et al.  Limited-range wavelength translation in all-optical networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[10]  Biswanath Mukherjee,et al.  Sub-path protection for scalability and fast recovery in WDM mesh networks , 2002, Optical Fiber Communication Conference and Exhibit.

[11]  Ezhan Karasan,et al.  Regenerator Placement and Traffic Engineering with Restoration in GMPLS Networks , 2004, Photonic Network Communications.

[12]  Debasish Datta,et al.  Impact of transmission impairments on the teletraffic performance of wavelength-routed optical networks , 1999 .

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

[14]  V. Li,et al.  A Wavelength-Convertible Optical Network , 1993 .

[15]  Wayne D. Grover,et al.  A highly efficient path-restoration protocol for management of optical network transport integrity , 2000, IEEE Journal on Selected Areas in Communications.

[16]  M. Herzberg,et al.  An optimal spare-capacity assignment model for survivable networks with hop limits , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[17]  Ezhan Karasan,et al.  Subnetwork partitioning and section restoration in translucent optical networks , 2003, OptiComm: Optical Networking and Communications Conference.

[18]  Wayne D. Grover,et al.  Extending the p-cycle concept to path-segment protection , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[19]  Byrav Ramamurthy,et al.  Dynamic routing in translucent WDM optical networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

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

[21]  Jian Wang,et al.  Path vs. subpath vs. link restoration for fault management in IP-over-WDM networks: performance comparisons using GMPLS control signaling , 2002, IEEE Commun. Mag..

[22]  E. Iannone Wavelength conversion and routing strategies in opaque optical networks , 1998, Conference Proceedings. LEOS'98. 11th Annual Meeting. IEEE Lasers and Electro-Optics Society 1998 Annual Meeting (Cat. No.98CH36243).

[23]  Gangxiang Shen,et al.  Sparse placement of electronic switching nodes for low blocking in translucentoptical networks , 2002 .

[24]  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).

[25]  Suresh Subramaniam,et al.  All-optical networks with sparse wavelength conversion , 1996, TNET.

[26]  Wayne D. Grover,et al.  Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks , 1998, TNET.

[27]  Pin-Han Ho,et al.  A framework for service-guaranteed shared protection in WDM mesh networks , 2002, IEEE Commun. Mag..