Approximation Algorithm for Minimum Cost Flow allocation with Varied Survivability

Abstract : In this work, we study the minimum cost flow allocation problem with varied survivability. Given a set of demands and a capacitated network, the problem consists of allocating each demand to a set of primary paths that carry the flows realizing the demand volume in the normal operation mode. To ensure survivability, bandwidth is allocated over a disjoint set of backup links protecting the primary path. With the varied survivability concept, only a varied portion of the primary flow is guaranteed to be recovered in failure situations. The recovery ratio is predefined for a given demand and denotes the guaranteed quality of protection. We associate a unitary cost for using the installed bandwidth in core links. Thus, the problem provides a minimum cost solution for allocating the demands and ensuring their survivability. The main contribution of this paper is a new approximation algorithm using a primal-dual approach. This approximation algorithm computes a solution that is within a guaranteed factor of the optimal one
Document type :
Conference papers
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download
Contributor : Samer Lahoud <>
Submitted on : Tuesday, November 9, 2010 - 1:57:00 PM
Last modification on : Thursday, October 17, 2019 - 12:34:48 PM
Long-term archiving on : Friday, December 2, 2016 - 6:27:41 AM


Files produced by the author(s)



Samer Lahoud, Géraldine Texier, Laurent Toutain. Approximation Algorithm for Minimum Cost Flow allocation with Varied Survivability. 2nd Conference on Next Generation Internet Design and Engineering, NGI '06, 2006, Valencia, Spain, France. 8 pp. -299, ⟨10.1109/NGI.2006.1678254⟩. ⟨hal-00534356⟩



Record views


Files downloads