Analysis and Algorithms for Partial Protection in Mesh Networks

Abstract

Abstract-This paper develops a mesh network protection scheme that guarantees a quantifiable minimum grade of service upon a failure within a network. The scheme guarantees that a fraction q of each demand remains after any single link failure. A linear program is developed to find the minimum-cost capacity allocation to meet both demand and protection requirements. For q ≤ 1 2, an exact algorithmic solution for the optimal routing and allocation is developed using multiple shortest paths. For q > 1 2 , a heuristic algorithm based on disjoint path routing is developed that performs, on average, within 1.4% of optimal, and runs four orders of magnitude faster than the minimum-cost solution achieved via the linear program. Moreover, the partial protection strategies developed achieve reductions of up to 82% over traditional full protection schemes.

Network protection with multiple availability guarantees

“…A unit demand needs to be routed from s to t with P = 1 4 and partial protection requirement q. In [17], a simple partial protection scheme called 1 + q protection was developed, which routes the primary demand on one path and the partial protection requirement onto another edge-disjoint path. After any failure along the primary path, the partial protection requirement is met.…”

“…More recently, [17,18] developed a "theory" of partial protection such that after any single link failure, the flow can drop to the partial protection requirement. In [17,18], a fraction q of the demand is guaranteed to remain available between the source and destination after any failure, where q is between 0 and 1. When q is equal to 1, the service will have no disruptions after any failure, and when q is 0, there will be no flow between the two nodes during the down state.…”

Partial Protection in Networks with Backup Capacity Sharing

“…We develop a linear program (LP) for the preemptive and non-preemptive case when bifurcation is allowed. A non-bifurcating protection scheme similar to 1 + 1 protection called 1 + q protection was presented in [5]. This 1 + q protection scheme routes one unit along the primary path and q along a disjoint protection path.…”

“…Our work is inspired by a quantitative framework for deterministic partial protection developed in [4]. In [5], a "theory" of partial protection was presented for a single commodity, and optimal algorithms for capacity allocation were presented. In [6], the savings that can be achieved by guaranteeing part of the demand in the event of a link failure, as opposed to full protection, are examined.…”

Minimum Cost Survivable Routing Algorithms for Generalized Diversity Coding

“…Several survivable routing schemes were introduced in the past decades which could significantly reduce its bandwidth utilization [4]- [11]. Network coding-based approaches perform algebraic operations on the data at core network nodes [4]- [6], partial path protection methods guarantee a minimum grade of service after failure using multi-path routing strategies [7], [8], and shared protection approaches pre-compute backup paths but signal them only after a failure occurs [9]- [11]. Although they are capacity efficient, these methods did not reach the phase of widespread deployment.…”