Learn More
" Always on " information networks must automatically reroute around virtually any problem—but conventional, redundant ring architectures are too inefficient and inflexible. The solution: mesh-based networks that will be just as survivable—and far more flexible and cost-effective. Drawing heavily on the latest research, Wayne D. Grover introduces radical(More)
Cycle-oriented preconfiguration of spare capacity is a new idea for the design and operation of mesh-restorable networks. It offers a sought-after goal: to retain the capacity-efficiency of a mesh-restorable network, while approaching the speed of line-switched self-healing rings. We show that through a strategy of pre-failure cross-connection between the(More)
—We describe a novel restoration strategy called virtual protection cycles (cycles , patents pending) for extremely fast restoration in IP networks. Originally conceived for use in WDM and Sonet transport networks, we outline the adaption of the-cycle concept to an IP environment. In an IP router-based network ,-cycles are implemented with virtual circuits(More)
—Recent work on restorable networks has shown experimentally that one can support 100% restoration with an optimized set of closed cycles of spare capacity while requiring little or no increase in spare capacity relative to a span-restorable mesh network. This is important and unexpected because it implies that future restoration schemes could be as(More)
—This work introduces a significant extension to the method of-cycles for network protection. The main advance is the generalization of the-cycle concept to protect path segments of contiguous working flow, not only spans that lie on the cycle or directly straddle the-cycle. This effectively extends the-cycle technique to include path protection or(More)
This article is devoted to a selection of recent topics in survivable networking. New ideas in capacity design and ring-to-mesh evolution are given, as well as a systematic comparison of the capacity requirements of several mesh-based schemes showing how they perform over a range of network graph connectivi-ty. The work provides new options and insights to(More)
We evaluate the performance of optical network designs using relatively few switch nodes at which wavelength conversion and electronic regeneration is possible. A simple heuristic for placing the fewest such nodes to reach a given blocking probability is based on the ranked frequency of shortest-path routes transiting each node. This strategy is found to be(More)
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(More)