Share Email Print

Optical Engineering

Optimal capacity assignment for p-cycle in survivable optical mesh networks
Author(s): Taifei Zhao; Lemin Li; Jin Cao; Hongfang Yu
Format Member Price Non-Member Price
PDF $20.00 $25.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The preconfiguration cycle (p-cycle) is an excellent protection scheme that benefits both the fast recovery time and the efficient resource utilization in wavelength-division-multiplexing (WDM) mesh networks. Before providing protection for any link whose end nodes are both on the p-cycle, the spare capacity assignment for the p-cycles is a very important step for p-cycle design in WDM networks. We present a heuristic scheme, called the p-Cycle Capacity Assignment Algorithm (CCAA), to achieve an optimal capacity assignment of p-cycles in WDM networks without using Integer Linear Programming (ILP). CCAA can configure the p-cycles with good actual efficiency because it first consumes the spare capacity of the links where more spare capacity exists. This scheme is more suitable for the design of maximum p-cycle restorability with a given spare capacity distribution. When allocating the spare capacity for the p-cycles in WDM mesh networks, this scheme considers the actual distribution of the working capacity and the spare capacity of a certain traffic pattern. The performance of CCAA is evaluated by computer simulations on the real-world network topology.

Paper Details

Date Published: 1 December 2006
PDF: 9 pages
Opt. Eng. 45(12) 125005 doi: 10.1117/1.2404917
Published in: Optical Engineering Volume 45, Issue 12
Show Author Affiliations
Taifei Zhao, Univ. of Electronic Science and Technology of China (China)
Lemin Li, Univ. of Electronic Science and Technology of China (China)
Jin Cao, Univ. of Electronic Science and Technology of China (China)
Hongfang Yu, Univ. of Electronic Science and Technology of China (China)

© SPIE. Terms of Use
Back to Top