p-Cycle Network Design with Hop Limits and Circumference Limits
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
A new heuristic routing algorithm with Hamiltonian Cycle Protection in survivable networks
Computer Communications
Reliability assessment of optical p-cycles
IEEE/ACM Transactions on Networking (TON)
Survivability approaches using p-cycles in WDM mesh networks under static traffic
IEEE/ACM Transactions on Networking (TON)
ILP formulations for p-cycle design without candidate cycle enumeration
IEEE/ACM Transactions on Networking (TON)
CAPEX costs of lightly loaded restorable networks under a consistent WDM layer cost model
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
IEEE Transactions on Communications
p-Cycle protection at the glass fiber level
Computer Communications
Dependable WDM networks with edge-disjoint p-cycles
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Applicability of resilient routing layers for k-fault network recovery
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
The threshold hop-limit effect in p-cycles: Comparing hop- and circumference-limited design
Optical Switching and Networking
| Hi-index | 0.00 |
Recently there has been interest in DWDM-based optical networks that are assumed to employ exactly two working fibers uniformly on every span (or "link"). At the fiber level such networks are referred to as homogeneous networks. An interesting and highly efficient strategy for protection of such networks is to use a single dark-fiber p-cycle formed on a Hamiltonian cycle (if it exists). We show that in a homogeneous Hamiltonian network, a Hamiltonian p-cycle is the most efficient overall solution, although interestingly it does not always correspond to the individually most efficient p-cycle that can be formed. We also consider p-cycle planning in non-Hamiltonian but homogeneous networks and introduce the concept of a semi-homogenous network, specifically linked to the p-cycle concept. The proposed semi-homogeneous class of network actually realizes the theoretical lower bound on span-restorable networks in terms of network redundancy. Such networks also provide a strategy to accommodate certain patterns of capacity growth beyond a homogenous network without any increase in protection capacity. The work also demonstrates and explains why a single Hamiltonian p-cycle is not as efficient as a specifically optimized set of individual p-cycles in a "capacitated" (non-homogeneous) network where the working capacity on each span varies in a general way. These discussions provide new options for DWDM network architecture and also clarify some possible confusions about the applicability of Hamiltonian p-cycles and generalized sets of p-cycles.