Improved approximation algorithms for computing $$k$$ k disjoint paths subject to two constraints

  • Published on

  • View

  • Download


<ul><li><p>J Comb OptimDOI 10.1007/s10878-013-9693-x</p><p>Improved approximation algorithms for computingk disjoint paths subject to two constraintsLongkun Guo Hong Shen Kewen Liao</p><p> Springer Science+Business Media New York 2013</p><p>Abstract For a given graph G with distinct vertices s and t , nonnegative integral costand delay on edges, and positive integral bound C and D on cost and delay respectively,the k bi-constraint path (kBCP) problem is to compute k disjoint st-paths subject to Cand D. This problem is known to be NP-hard, even when k = 1 (Garey and Johnson,Computers and Intractability, 1979 ). This paper first gives a simple approximationalgorithm with factor-(2, 2), i.e. the algorithm computes a solution with delay andcost bounded by 2 D and 2 C respectively. Later, a novel improved approxima-tion algorithm with ratio (1 + , max{2, 1 + ln(1/)}) is developed by constructinginteresting auxiliary graphs and employing the cycle cancellation method. As a conse-quence, we can obtain a factor-(1.369, 2) approximation algorithm immediately anda factor-(1.567, 1.567) algorithm by slightly modifying the algorithm. Besides, when = 0, the algorithm is shown to be with ratio (1, O(ln n)), i.e. it is an algorithmwith only a single factor ratio O(ln n) on cost. To the best of our knowledge, this isthe first non-trivial approximation algorithm that strictly obeys the delay constraintfor the kBCP problem.</p><p>Keywords k-disjoint bi-constraint path NP-hard Bifactor approximationalgorithm Auxiliary graph Cycle cancellation</p><p>This research was partially supported by Natural Science Foundation of China under its Youth funding#61300025, Natural Science Foundation of Fujian Province under its Youth funding #2012J05115,Doctoral Funds of Ministry of Education of China for Young Scholars #20123514120013 and FuzhouUniversity Development Fund (2012-XQ-26).</p><p>L. Guo (B)School of Mathematics and Computer Science, Fuzhou University, Fuzhou, Chinae-mail:</p><p>H. Shen K. LiaoSchool of Computer Science, University of Adelaide, Adelaide, SA, Australia</p><p>123</p></li><li><p>J Comb Optim</p><p>1 Introduction</p><p>In real networks, there are many applications that require quality of service (QoS) andsome degree of robustness simultaneously. Typically, the QoS related problems requirerouting between the source node and the destination node to satisfy several constraintssimultaneously, such as bandwidth, delay, cost and energy consumption. Nevertheless,in networks, some time-critical applications also require routing to remain functioningwhile edge or vertex failures occur. A common solution is to compute k disjoint pathsthat satisfy the QoS constraints, and then to use some paths as active paths whilstthe other paths as backup paths. The routing traffic is carried on the active paths, andswitched to the disjoint backup paths while edge or vertex failures occur on the activepaths. However, for some time-critical applications even the time to discover failuresof routing and restore data transmission in backup paths is too long for them. Forsuch applications, packages are routed via k paths simultaneously, and the traffic isswitched from failed paths to functioning paths if edge or vertex failures occur, suchthat routing can tolerate k 1 edge (vertex) failures. Therefore, given cost and delayas the QoS constraints, the disjoint QoS Path problem arises as below:</p><p>Definition 1 For a graph G = (V, E) and a pair of distinct vertices s, t V , a costfunction c : E Z+0 , a delay function d : E Z+0 , a cost bound C Z+ and a delaybound D Z+, the k-disjoint QoS Paths problem is to compute k disjoint st-pathsP1, . . . , Pk , such that</p><p>i=1,...,k c(Pi ) C and d(Pi ) D for every i = 1, . . . , k.</p><p>This problem is N P-hard even when all edges of G are with cost 0 (Li et al. 1989). Soit is impossible to approximate the k-disjoint QoS Paths problem within a non-trivialsingle factor ratio unless P = N P . An alternative method is to compute k disjointpaths with total cost bounded by C and delay bounded by D (equal to k D when D is asin Definition 1), and then route the packages via the paths according to their urgencypriority, i.e., route urgent packages via paths of low delay whilst other packages viaother paths of higher delay of the k disjoint paths. Therefore, the disjoint bi-constraintpath problem arises as in the following:</p><p>Definition 2 (The k disjoint bi-constraint path problem, kBCP) For a graph G =(V, E) with a pair of distinct vertices s, t V , a cost function c : E Z+0 , a delayfunction d : E Z+0 , a cost bound C Z+ and a delay bound D Z+, the k-disjoint bi-constraint path problem is to calculate k disjoint st-paths P1, . . . , Pk , suchthat</p><p>i=1,...,k c(Pi ) C and</p><p>i=1,...,k d(Pi ) D.</p><p>This paper will focus on the kBCP problems bifactor approximation algorithms,whose definition is roughly as in the following:</p><p>Definition 3 An algorithm A is a bifactor (, )-approximation for the kBCP prob-lem, if and only if for every instance of kBCP A computes k disjoint st-paths, whosetotal delay and total cost are bounded by D and C respectively.Since a -approximation with the single factor ratio on cost is identical to a bifactor(1, )-approximation, we use them interchangeably in the text.</p><p>123</p></li><li><p>J Comb Optim</p><p>1.1 Related work</p><p>This kBCP problem is NP-hard even when k = 1 (Garey and Johnson 1979). To thebest of our knowledge, this paper presents the first non-trivial approximation algorithmfor the kBCP problem. However, a number of papers have addressed problems closelyrelated to kBCP, in particular the k restricted shortest path problem (kRSP), whichis to calculate k disjoint st-paths of minimum cost-sum under the delay constraint</p><p>i=1,...,k d(Pi ) D. An algorithm with bifactor approximation ratio (2, 2) has beendeveloped in Guo and Shen (2012) for general k, while no approximation solution thatstrictly obeys the delay (or cost) constraint is known even when k = 2. Bifactor ratioof (1+ 1</p><p>r, r(1+ 2(log r+1)</p><p>r)(1+)) and (1+ 1</p><p>r, 1+r) have been achieved respectively</p><p>in Chao and Hong (2007), Orda and Sprintson (2004) for the case k = 2, under theassumption that the delay of each path in the optimal solution of kRSP is bounded by Dk .</p><p>Special cases of the kBCP problem have been well studied. When the delay con-straint is removed, this problem is reduced to the min-sum problem, which is to calcu-late k disjoint paths with the total cost minimized. This problem is known polynomiallysolvable (Suurballe 1974). Moreover, when k = 1, the problem reduces to the singlebi-constraint path (BCP) problem, which is known as the basic QoS routing problem(Garey and Johnson 1979) and admits full polynomial time approximation scheme(FPTAS) (Garey and Johnson 1979; Lorenz and Raz 2001). Recently, the MCP prob-lem (the Multi-Constraint Path problem, including the single BCP path problem as aspecial case) is still attracting considerable interests of the researchers. The strongestresult known is a (1 + )-approximation due to Xue et al. (2008).</p><p>Additionally, special cases of the disjoint QoS path problem have also been inves-tigated. When the cost constraint is removed, the disjoint QoS problem reduces to thelength bounded disjoint path problem of finding two disjoint paths with the length ofeach path constrained by a given bound. This problem is a variant of the min-Maxproblem of finding two disjoint paths with the length of the longer path minimized.Both of the two problems are known to be NP-complete, and with a best possibleapproximation ratio of 2 in digraphs Li et al. (1989), which can be achieved by apply-ing the algorithm for the min-sum problem in Suurballe (1974), Suurballe and Tarjan(1984). Contrastingly, the min-min problem of finding two paths with the length ofthe shorter path minimized is NP-complete and does not admit K -approximation forany K 1 (Bhatia et al. 2006; Guo and Shen 2013; Xu et al. 2006). The problemremains NP-complete and admits no polynomial time approximation scheme even inplanar digraphs (Guo and Shen 2012).</p><p>1.2 Our technique and results</p><p>The main result of this paper is a factor-(1 + , max{2, 1 + ln 1}) approximation</p><p>algorithm for any 0 &lt; 1 for the kBCP problem. The main idea of the algorithmis firstly to compute k-disjoint paths, such that there exists a real number 0 2that the total delay of the computed paths is bounded by D and total cost boundedby (2 ) C . Secondly, the key idea is to improve the computed k paths by novellycombining cycle cancellation method (Orda and Sprintson 2004) and auxiliary layergraph technique (Xue et al. 2008). The improving phase (i.e. the second step) would</p><p>123</p></li><li><p>J Comb Optim</p><p>decrease the delay of the computed k paths at the price of cost increasing in the case thatthe delay of the k paths is large. The approximation ratio of our algorithm is shown to be(1+, max{2, 1+ln 1</p><p>}) after rebalancing the delay and cost of the k computed paths.</p><p>As a consequence of the main result, we obtain a factor-(1.369, 2) approximationalgorithm by setting 1 + ln 1</p><p>= 2, and a factor-(1.567, 1.567) algorithm by setting</p><p>1 + = 1 + ln 1</p><p>and slightly modifying our algorithm (to improve either cost ordelay that is with worse ratio). Nevertheless, by slightly modifying our ratio proof, weshow that when = 0 the approximation algorithm is with ratio (1, O(ln n)), i.e. it iswithin a single factor ratio of O(ln n) on cost. To the best of our knowledge, this is thefirst non-trivial approximation algorithm, which strictly obeys the delay constraint,for the kBCP problem.</p><p>We note that our algorithms are with pseudo-polynomial time complexity, sincethe auxiliary graph we construct is of size O(C n). However, by using the classicpolynomial time approximation scheme design technique (Garey and Johnson 1979),i.e. for any small &gt; 0 setting the cost of every edge to</p><p>c(e)Cn</p><p>in G before the con-struction of auxiliary graph, we can immediately obtain a polynomial time algorithmwith ratio ((1 + ) (1 + ), max{2, (1 + ln 1</p><p>) (1 + )}).</p><p>2 An improved approximation algorithm for computing k disjointbi-constraint paths</p><p>This section will firstly present a simple approximation method for computing k-disjoint paths. We show that there exists a real number 0 2, such that thek computed paths are with delay-sum bounded by D and cost-sum bounded by(2)C . Later, we improve the k paths by balancing the cost and delay according tothe value of , via constructing auxiliary layer graphs and using the cycle cancellationmethod therein. Though the presented simple algorithm itself is not with better ratiothan that of the algorithm for k = 2 in Orda and Sprintson (2004), it suits the improvingphase better.</p><p>2.1 A basic approximation algorithm</p><p>Observing that the difficulty of computing k-disjoint bi-constraint paths mainly comesfrom the two given constraints, the key idea of our algorithm is to deal with one newconstraint B instead of the two given constraints C and D. Our algorithm firstly assignsa new mixed cost b(e) = c(e)C + d(e)D to every edge in graph, and secondly computesk disjoint paths with the new cost sum minimized. Note that the second step can beaccomplished in polynomial time by employing the SPP algorithm due to Suurballe(1974), Suurballe and Tarjan (1984). The detailed algorithm is as in Algorithm 1.</p><p>The time complexity and performance guarantee of Algorithm 1 is given by thefollowing theorem:</p><p>Theorem 4 Algorithm 1 runs in O(km log1+ mn</p><p>n) time. There exists a real number0 2, such that the k-disjoint paths computed in Algorithm 1 are with delay-sumbounded by D and cost-sum bounded by (2 ) C.</p><p>123</p></li><li><p>J Comb Optim</p><p>Algorithm 1 A basic approximation algorithm for the k-BCP problemInput: A graph G = (V, E), each edge e with cost c(e) and delay d(e), a given cost constraint C Z+and delay constraint D Z+;Output: k disjoint paths P1, P2 . . . , Pk .</p><p>1. Set the new cost of edge e as b(e) = c(e)C + d(e)D ;2. Compute the k disjoint paths P1, P2 . . . , Pk in G by using Suurballe and Tarjans algorithm (Suurballe</p><p>1974; Suurballe and Tarjan 1984), such that ki=1</p><p>ePi b(e) is minimized;3. Return P1, P2 . . . , Pk .</p><p>Proof The main part of Algorithm 1 takes O(km log1+ mn n) time to compute k-disjointpaths by using Surrballe and Tarjans algorithm (Suurballe 1974; Suurballe and Tarjan1984), and other parts of the algorithm take trivial time. Hence the time complexityof the algorithm is O(km log1+ mn n).</p><p>It remains to show the approximation ratio. To make the proof concise, we denoteby O PT an optimal solution for the k-disjoint BCP paths problem, and SO L thesolution of Algorithm 1. Obviously</p><p>eO PT b(e) =</p><p>eO PT c(e)</p><p>C +</p><p>eO PT d(e)D 2</p><p>holds. Then since the new cost of k disjoint paths attains minimum, we have</p><p>eSO Lb(e) </p><p>eO PTb(e) 2. (1)</p><p>From Inequality (1) and the definition of cost b(e), there exists a real number 0 2, such that the delay-sum of the algorithm is times of d(O PT ). Then we have</p><p>eSO L b(e) =k</p><p>i=1</p><p>ePi b(e) = + c(SO L)c(O PT ) . From Inequality (1), + c(SO L)c(O PT ) 2 holds. That is, c(SO L) (2 )c(O PT ) (2 )C . This completes the proof.Note that differs for different instances, i.e. Algorithm 1 may return a solution withcost 2 c(O PT ) and delay 0 for some instances, while a solution with cost 0 anddelay 2 d(O PT ) for other instances. Hence, the bifactor approximation ratio forAlgorithm 1 is actually (2, 2).</p><p>In real networks, the two given constraints may not be of equal importance, say,delay is far more important comparing to cost. In this case, applications require thatthe delay of the resulting solution is bounded by (1+)D, where 0 &lt; &lt; 1 is a givenpositive real number. Apparently, we could get an algorithm similar to Algorithm 1excepting setting the new cost as b(e) = c(e)C + d(e)D . The ratio of the new algorithmis given as below:</p><p>Corollary 5 For any given real number 0 &lt; &lt; 1, there exists a real number0 1 + , such that by setting the new cost as b(e) = c(e)C + d(e)D , Algorithm 1returns k paths with delay-sum bounded by D and cost-sum bounded by 1+</p><p> C.</p><p>That is, in the worst case, the ratio of Algorithm 1 is (1 + , 1 + 1).</p><p>The proof of Corollary 5 is omitted here, since it is similar to the proof of Theorem1. According to Corollary 5, our algorithm can bound the delay-sum of the k-disjointpath by (1 + )D for any 0 &lt; &lt; 1, by relaxing the cost constraint to (1 + 1</p><p>) C .</p><p>123</p></li><li><p>J Comb Optim</p><p>For example, if = 0.01, then the bifactor approximation ratio of the algorithm is(1.01, 101). Thus, the algorithm decrease the delay of the k-disjoint paths at a highprice. In the next subsection, we shall develop an improved method that pays less tomake delay-sum of the k-disjoint paths bounded by (1 + )D.</p><p>2.2 The improving phase</p><p>To make the delay of the solution resulting from Algorithm 1 bounded by (1+)D, ourimproving phase is, basically a greedy method, using the so-called cycle cancellationto improve the disjoint paths in iterations until a solution with the best possible ratio(1+, max{2, 1+ ln 1</p><p>}) is obtained. The cycle cancellation method is an approach of</p><p>using cycles to cha...</p></li></ul>


View more >