Take a look at the new version of this page: [ beta version ]. Tell us what you think.

ABSTRACT

The major challenge in survivable mesh networks is the design of resource allocation algorithms that allocate network resources efficiently while at the same time are able to recover from a failure quickly. This issue is particularly more challenging in optical networks operating under wavelength continuity constraint, where the same wavelength must be assigned on all links in the selected path. This paper proposes two approaches to solve the survivable routing and wavelength assignment RWA problem under static traffic using p-cycles techniques. The first is a nonjointly approach, where the minimum backup capacity against any single span failure is set up first. Then the working lightpaths problem is solved by first generating the most likely candidate routes for each source and destination s-d pair. These candidate routes are then used to formulate the overall problem as an ILP problem. Alternatively, for a more optimum solution, the problem can be solved jointly, where the working routes and the backup p-cycles are jointly formulated as an ILP problem to minimize the total capacity required. Furthermore, only a subset of high merit cycles that are most likely able to protect the proposed working paths is used in the formulation. Reducing the number of candidate cycles in the final formulation plays a significant role in reducing the number of variables required to solve the problem. To reduce the number of candidate cycles in the formulation, a new metric called Route Sensitive Efficiency (RSE)--has been introduced to pre-select a reduced number of high merit cycle candidates. The RSE ranks each cycle based on the number of links of the primary candidate routes that it can protect. The two approaches were tested and their performances were compared.

REFERENCES

• 1: D. Schupke, C. Gruber, and A. Autenrieth, "Optimal configuration of p-cycle in WDM networks," in Proc. IEEE Int. Conf. Communications (ICC'2002), New York, Apr. 2002, vol. 5, pp. 2761-2765.
• 2: Z. Zhenrong, Z. W. De, and B. Mukherjee, "A heuristic method for design of survivable WDM networks with p-cycles," IEEE Commun. Lett., vol. 8, no. 7, pp. 467-469, Jul. 2004.
• 3: W. D. Grover and D. Stamatelakis, "Cycle-oriented distributed preconfiguration: Ring-like speed with mesh-like capacity for self-planning network restoration," in Proc. IEEE Int. Conf. Communications (ICC'1998), Atlanta, GA, Jun. 1998, vol. 1, pp. 537-543.
• 4: W. D. Grover and J. Doucette, "Advances in optical networks design with p-cycles: Joint optimization and pre-selection of candidate p-cycles," in Proc. IEEE/LEOS, All-Optical Networking Conf., Mont Tremblant, QC, Canada, Jul. 2002, pp. WA2-49-WA2-50.
• 5: G. Shen and W. D. Grover, "Extending the p-cycle concept to path segment protection for span and node failure recovery," IEEE J. Sel. Areas Commun., vol. 21, no. 8, pp. 1306-1319, Oct. 2003.
• 6: A. Sack and W. D. Grover, "Hamiltonian p-cycle for fiber-level protection in homogeneous and semi-homogeneous optical networks," IEEE Network, vol. 18, no. 2, pp. 49-56, Mar.-Apr. 2004.
• 7: D. A. Schupke, "Multiple failure survivability in WDM networks with p-cycles," in Proc. IEEE Int. Symp. Circuits and Systems (ISCAS'2003), Bangkok, Thailand, May 2003, vol. 3, pp. III-866-III-869.
• 8: D. A. Schupke, "The tradeoff between the number of deployed p-cycles and survivability to dual fiber duct failures," in Proc. IEEE Int. Conf. Communications (ICC'2003), Anchorage, AK, May 2003, vol. 2, pp. 1428-1432.
• 9: T. Stidsen and T. Thomadsen, "Joint optimization of working and p-cycle protection capacity," Technical Univ. of Denmark, DTU, Kgs. Lyngby, Tech. Rep. IMM-Report-2004-8, 2004.
• 10: D. A. Schupke, M. C. Scheffel, and W. D. Grover, "An efficient strategy for wavelength conversion in WDM p-cycle networks," in Proc. IEEE 4th Int. Workshop on Design of Reliable Communication Networks (DRCN'2003), Banif, Alberta, Canada, Oct. 2003, pp. 221-227.
• 11: W. D. Grover, J. Doucette, M. Clouqueur, D. Leung, and D. Stamatelakis, "New options and insights for survivable transport networks," IEEE Commun. Mag., vol. 40, no. 1, pp. 34-41, Jan. 2002.
• 12: W. He, J. Fang, and A. K. Somani, "A p-cycle based survivable design for dynamic traffic in WDM networks," in Proc. IEEE GLOBECOM 2005, St. Louis, MO, Nov. 2005.
• 13: W. D. Grover, Mesh-Based Survivable Networks. New York: Bernard Goodwin, 2004.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.2 Network Protocols
          Subjects: Routing protocols

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Network topology
      C.2.5 Local and Wide-Area Networks
          Subjects: High-speed (e.g., FDDI, fiber channel, ATM)
  C.4 PERFORMANCE OF SYSTEMS
      Subjects: Reliability, availability, and serviceability

General Terms:
Algorithms, Design, Performance, Reliability

Keywords:
optical networks, p-cycles, routing and wave-length assignment, survivability