OSA's Digital Library

Journal of Optical Communications and Networking

Journal of Optical Communications and Networking

  • Editor: Keren Bergman
  • Vol. 7, Iss. 7 — Jul. 1, 2008
  • pp: 673–691

Approaches to p-cycle network design with controlled optical path lengths in the restored network state

Diane Prisca Onguetou and Wayne D. Grover  »View Author Affiliations


Journal of Optical Networking, Vol. 7, Issue 7, pp. 673-691 (2008)
http://dx.doi.org/10.1364/JON.7.000673


View Full Text Article

Acrobat PDF (464 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

Abstract

In a transparent optical network it is desirable to have design control over the length of normal working paths and over the end-to-end length of paths in any restored network state. An obvious approach with p-cycles is to limit the maximum allowable circumference of candidate cycles considered in the network design. But this is somewhat inefficient and does not directly control the end-to-end length of paths in a restored state; it only controls the maximum length of protection path-segments that might be substituted into a working path on failure. Another basic strategy is now considered. It consists of systematically matching shorter working paths with longer protection path-segments through p-cycles, and vice versa, with direct consideration of the end-to-end length of paths in the restored network state during the design. This complementary matching notion is studied through an integer linear programming (ILP) model to minimize cost while intelligently associating longer working paths with shorter protection path-segments and vice versa. The basic ILP is adapted in one case to minimize the average restored state path lengths; in another to achieve the least possible longest path length; and, finally, to also constrain all restored path lengths under a fixed limit. Each variation can also be subject to a requirement of using only the theoretically minimal spare capacity or, through bi-criteria methods, a minimal amount of additional spare capacity for the corresponding objective on path lengths. Taken overall the work provides the means to design an entire transparent survivable island that respects the transparent reach limits of a given ultra-long-haul technology. A heuristic combination of ILP and genetic algorithm methods is also developed to solve some of the larger problems and is shown to perform well.

© 2008 Optical Society of America

OCIS Codes
(060.1155) Fiber optics and optical communications : All-optical networks
(060.4251) Fiber optics and optical communications : Networks, assignment and routing algorithms
(060.4254) Fiber optics and optical communications : Networks, combinatorial network design
(060.4256) Fiber optics and optical communications : Networks, network optimization
(060.4257) Fiber optics and optical communications : Networks, network survivability
(060.4261) Fiber optics and optical communications : Networks, protection and restoration

ToC Category:
Reliability Issues in Optical Networks

History
Original Manuscript: November 2, 2007
Revised Manuscript: April 14, 2008
Manuscript Accepted: May 14, 2008
Published: June 24, 2008

Virtual Issues
Reliability Issues in Optical Networks (2008) Journal of Optical Networking

Citation
Diane Prisca Onguetou and Wayne D. Grover, "Approaches to p-cycle network design with controlled optical path lengths in the restored network state," J. Opt. Netw. 7, 673-691 (2008)
http://www.opticsinfobase.org/jocn/abstract.cfm?URI=jon-7-7-673

You do not have subscription access to this journal. Citation lists with outbound citation links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Log in to access OSA Member Subscription

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Log in to access OSA Member Subscription

« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited