Network protection with guaranteed recovery times using recovery domains

We consider the problem of providing network protection that guarantees the maximum amount of time that flow can be interrupted after a failure. This is in contrast to schemes that offer no recovery time guarantees, such as IP rerouting, or the prevalent local recovery scheme of Fast ReRoute, which often over-provisions resources to meet recovery time constraints. To meet these recovery time guarantees, we provide a novel and flexible solution by partitioning the network into failure-independent “recovery domains”, where within each domain, the maximum amount of time to recover from a failure is guaranteed. We show the recovery domain problem to be NP-Hard, and develop an optimal solution in the form of an MILP for both the case when backup capacity can and cannot be shared. This provides protection with guaranteed recovery times using up to 45% less protection resources than local recovery. We demonstrate that the network-wide optimal recovery domain solution can be decomposed into a set of easier to solve subproblems. This allows for the development of flexible and efficient solutions, including an optimal algorithm using Lagrangian relaxation, which simulations show to converge rapidly to an optimal solution. Additionally, an algorithm is developed for when backup sharing is allowed. For dynamic arrivals, this algorithm performs better than the solution that tries to greedily optimize for each incoming demand.National Science Foundation (U.S.) (NSF grant CNS-1017800)National Science Foundation (U.S.) (grant CNS-0830961)United States. Defense Threat Reduction Agency (grant HDTRA-09-1-005)United States. Defense Threat Reduction Agency (grant HDTRA1-07-1-0004)United States. Air Force (Air Force contract # FA8721-05-C-0002

Multi-layer survivability in IP-over-WDM networks

Ph.DDOCTOR OF PHILOSOPH

Protection algorithms for bandwidth guaranteed connections in MPLS networks

Master'sMASTER OF ENGINEERIN

Real-time bandwidth encapsulation for IP/MPLS Protection Switching

Bandwidth reservation and bandwidth allocation are needed to guarantee the protection of voice traffic during network failure. Since voice calls have a time constraint of 50 ms within which the traffic must be recovered, a real-time bandwidth management scheme is required. Such bandwidth allocation scheme that prioritizes voice traffic will ensure that the voice traffic is guaranteed the necessary bandwidth during the network failure. Additionally, a mechanism is also required to provide the bandwidth to voice traffic when the reserved bandwidth is insufficient to accommodate voice traffic. This mechanism must be able to utilise the working bandwidth or bandwidth reserved for lower priority applications and allocate it to the voice traffic when a network failure occurs

Survivability schemes for dynamic traffic in optical networks

Ph.DDOCTOR OF PHILOSOPH

Protection and restoration algorithms for WDM optical networks

Currently, Wavelength Division Multiplexing (WDM) optical networks play a major role in supporting the outbreak in demand for high bandwidth networks driven by the Internet. It can be a catastrophe to millions of users if a single optical fiber is somehow cut off from the network, and there is no protection in the design of the logical topology for a restorative mechanism. Many protection and restoration algorithms are needed to prevent, reroute, and/or reconfigure the network from damages in such a situation. In the past few years, many works dealing with these issues have been reported. Those algorithms can be implemented in many ways with several different objective functions such as a minimization of protection path lengths, a minimization of restoration times, a maximization of restored bandwidths, etc. This thesis investigates, analyzes and compares the algorithms that are mainly aimed to guarantee or maximize the amount of remaining bandwidth still working over a damaged network. The parameters considered in this thesis are the routing computation and implementation mechanism, routing characteristics, recovering computation timing, network capacity assignment, and implementing layer. Performance analysis in terms of the restoration efficiency, the hop length, the percentage of bandwidth guaranteed, the network capacity utilization, and the blocking probability is conducted and evaluated

Survivable mesh-network design & optimization to support multiple QoP service classes

Every second, vast amounts of data are transferred over communication systems around the world, and as a result, the demands on optical infrastructures are extending beyond the traditional, ring-based architecture. The range of content and services available from the Internet is increasing, and network operations are constantly under pressure to expand their optical networks in order to keep pace with the ever increasing demand for higher speed and more reliable links

Guaranteed Protection in Survivable WDM Mesh Networks – New ILP Formulations for Link Protection and Path Protection, Journal of Telecommunications and Information Technology, 2011, nr 4

In this paper we propose new simple integer linear programs (ILPs) formulations for minimizing capacity (in wavelength link) utilization in survivable WDM network. The study examines the performance of shared based protection schemes, such as path protection scheme and link protection scheme under single fiber failure. The numerical results obtained show a reduction in capacity utilization using random traffic compared to the reported ILP formulation. We also present the results using Poisson’s traffic to identify the frequently used links for the widely used NSF network. The proposed work not only reduces the wavelength consumption in different traffic scenarios but also efficient in terms of simulation time