A p-cycle based survivable design for dynamic traffic in WDM networks

Abstract

Achieving both high capacity efficiency and fast restoration speed is a primary goal of survivable design in WDM network. The pcycle method aims to benefit from the fast restoration of ring-like protection and high capacity efficiency of mesh protection. In this paper, we first present a p-cycle based method to deal with dynamic traffic in survivable WDM network design. In this method, we first find an optimal set of p-cycles for the given network topology. Next, we propose three routing strategies for accommodating dynamic requests upon their arrival time. The performance of our p-cycle based design using different routing strategies are compared with that of the Shared Backup Path Protection (SBPP). The results show that proposed p-cycle based design method performs better than SBPP in dense networks. Whereas SBPP performs better than the p-cycle based design in sparse networks. IEEEGlobecom 2005 1869 0-7803-9415-1/05/$20.00 © 2005 IEEE 0-7803-9415-1/05/$20.00 © 2005 IEEE 0-7803-9415-

Near optimal routing and capacity management for PWCE-based survivable WDM networks

“…In Constraint (5), r l denotes the aggregate traffic arrival rate on link l. The left-hand side of (6) is the minimum number of working channels to satisfy the target-blocking probability under traffic flow r l . Constraint (6) requires that the needed working channels cannot exceed the allocated working channels on link l. Constraints (7) and (8) are the routing constraints to route one backup path for each link. The left-hand side of Constraint (9) is 1 if link k is used by the backup path for link l protection; otherwise, it must be 0.…”

“…An optimization formulation for static traffic input is proposed in [13] to determine the spare capacity. In dealing with dynamic traffic, some p-cycle-based PWCE approaches [6,[14][15][16]19] have been proposed in the literature. The studies in [6,19] propose an integer linear programming formulation to determine spare capacity allocation such that the amount of the protected working channels can be maximized.…”

“…In dealing with dynamic traffic, some p-cycle-based PWCE approaches [6,[14][15][16]19] have been proposed in the literature. The studies in [6,19] propose an integer linear programming formulation to determine spare capacity allocation such that the amount of the protected working channels can be maximized. The main goal of [14][15][16] is to design more flexible p-cycles to enhance the protection capacity usage.…”

“…Problem inputs include network topology, number of lightpath demands between source-destination (SD) node pairs, and network capacity in each link. The most common objective function is to minimize network resource usage [4,6,[9][10][11][12]17]. Network operators can use the problem output to provision working and backup routes and assign working and backup capacity on each link.…”

“…Several researchers apply p-cycle [2,6,[13][14][15][16]19] to design survivable WDM networks. An optimization formulation for static traffic input is proposed in [13] to determine the spare capacity.…”