Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design Problems

Approximation Algorithms for Approximation Algorithms for Non-Uniform Buy-at-Bulk Non-Uniform Buy-at-Bulk Network Design ProblemsNetwork Design Problems

MohammadTaghi HajiaghayiMohammadTaghi HajiaghayiCarnegie Mellon UniversityCarnegie Mellon University

Joint work withJoint work with

Chandra Chekuri Chandra Chekuri (UIUC)(UIUC)Guy Kortsarz Guy Kortsarz (Rutgers, Camden)(Rutgers, Camden)

Mohammad R. Salavatipour Mohammad R. Salavatipour ((University of Alberta)University of Alberta)

22

MotivationMotivation

Suppose we are given a network and some Suppose we are given a network and some nodes have to be connected by cablesnodes have to be connected by cables

10

12

8

21

27

11

5

9

147

21

3

16

Each cable has a cost (installation or cost of usage)

Question: Install cables satisfying demands at minimum cost

This is the well-studied Steiner forest problem and is NP-hard

33

Motivation (cont’d)Motivation (cont’d)

Consider buying bandwidth to meet demands Consider buying bandwidth to meet demands between pairs of nodes.between pairs of nodes.The cost of buying bandwidth satisfy The cost of buying bandwidth satisfy economies of scaleeconomies of scaleThe capacity on a link can be purchased at The capacity on a link can be purchased at discrete units:discrete units:

Costs will be: Costs will be:

WhereWhere

44

So if you buy at bulk you saveSo if you buy at bulk you saveMore generally, we have a non-decreasing More generally, we have a non-decreasing monotone concave (or even sub-additive) functionmonotone concave (or even sub-additive) function

where where f f ((bb)) is the minimum cost of is the minimum cost of cables with bandwidth cables with bandwidth bb..

Motivation (cont’d)Motivation (cont’d)

bandwidth

cost

Question: Given a set of bandwidth demands between nodes, install sufficient capacities at minimum total cost

55

Motivation (cont’d)Motivation (cont’d)

The previous problem is equivalent to the following The previous problem is equivalent to the following problem:problem:

There are a set of pairs There are a set of pairs

to be connectedto be connected

For each possible cable connection For each possible cable connection ee we can: we can:

Buy it at Buy it at bb((ee)): : and have unlimited useand have unlimited use

Rent it at Rent it at rr((ee)): : and pay for each unit of flowand pay for each unit of flow A feasible solutionA feasible solution: buy and/or rent some edges to connect : buy and/or rent some edges to connect

every every ssii to to ttii. .

Goal: Goal: minimize the total cost minimize the total cost

66

Motivation (cont’d)Motivation (cont’d)

10

14

3

If this edge is bought its contribution to total cost is 14.

If this edge is rented, its contribution to total cost

is 2x3=6

Total cost is:

where f(e) is the number of paths going over e.

77

These problems are also known as cost-distance These problems are also known as cost-distance problems:problems:

cost functioncost function

length function length function

Also a set of pairs of nodes each with a Also a set of pairs of nodes each with a demand for every demand for every i i

Feasible solution: a set s.t. all pairs Feasible solution: a set s.t. all pairs

are connected in are connected in

Cost-DistanceCost-Distance

88

Cost-Distance (cont’d)Cost-Distance (cont’d)

The cost of the solution is:The cost of the solution is:

where is the shortest path in where is the shortest path in

The cost is the start-up cost andThe cost is the start-up cost and

is the per-use cost (length).is the per-use cost (length).

Goal:Goal: minimize total cost. minimize total cost.

99

Multicommodity Buy At BulkMulticommodity Buy At Bulk

Note that the solution Note that the solution may have cyclesmay have cycles

The problem is called The problem is called

Multi-Commodity Multi-Commodity Buy-at-Bulk (MC-BB)Buy-at-Bulk (MC-BB)

5

11

8

21

12

1010

Special CasesSpecial CasesIf all If all ssi i (sources) are equal we have the (sources) are equal we have the single-source case single-source case

(SS-BB)(SS-BB)

If the cost and length functions on the edges are all the same, i.e. each edge e has cost c + l f(e) for constants c,l : Uniform-case

5

11821

12

Single-source

1111

Previous WorkPrevious Work

Formally introduced by F. S. Salman, J. Cheriyan, R. Ravi Formally introduced by F. S. Salman, J. Cheriyan, R. Ravi and S. Subramanian, 1997and S. Subramanian, 1997

OO(log(log n n)) approximation for the uniform case, i.e. each approximation for the uniform case, i.e. each edge edge ee has cost has cost c+lc+lff((ee)) for some fixed constants for some fixed constants c, lc, l (B. (B. Awerbuch and Y. Azar, 1997;Awerbuch and Y. Azar, 1997; YY. . Bartal, 1998)Bartal, 1998)

OO(log(log n n)) randomized approximation for the single-sink randomized approximation for the single-sink case: Acase: A. . Meyerson, K. Munagala and S. Plotkin, 2000Meyerson, K. Munagala and S. Plotkin, 2000

OO(log(log n n) ) deterministic approximation for the single-sink deterministic approximation for the single-sink case: case: C. Chekuri, S. Khanna and S. Naor, 2001C. Chekuri, S. Khanna and S. Naor, 2001

1212

Hardness Results for Buy-at-Bulk Hardness Results for Buy-at-Bulk ProblemsProblems

Hardness of Hardness of ΩΩ(log log(log log n n)) for the single- for the single- sink case sink case JJ. Chuzhoy, A. Gupta, J. Naor . Chuzhoy, A. Gupta, J. Naor and A. Sinha, 2005and A. Sinha, 2005

ΩΩ(log(log1/2-1/2- n n)) in general M. Andrews 2004, in general M. Andrews 2004, unless unless NPNP ZPTIME(n ZPTIME(npolylog(n)polylog(n)))

1313

Algorithms for Special Cases Algorithms for Special Cases

Steiner ForestSteiner Forest

A. Agrawal, P. Klein and R. Ravi, 1991A. Agrawal, P. Klein and R. Ravi, 1991M. X. Goemans and D. P. Williamson, 1995 M. X. Goemans and D. P. Williamson, 1995

Single sourceSingle source

S. Guha, A. Meyerson and K. Munagala , 2001S. Guha, A. Meyerson and K. Munagala , 2001K. Talwar, 2002K. Talwar, 2002A. Gupta, A. Kumar and T. Roughgarden, 2002A. Gupta, A. Kumar and T. Roughgarden, 2002A. Goel and D. Estrin, 2003A. Goel and D. Estrin, 2003

1414

Multicommodity Buy at BulkMulticommodity Buy at Bulk

Multicommodity Uniform Case:Multicommodity Uniform Case:Y. Azar and B. Awerbuch, 1997Y. Azar and B. Awerbuch, 1997

Y. Bartal,1998Y. Bartal,1998

A. Gupta, A. Kumar, M. Pal and T. Roughgarden, A. Gupta, A. Kumar, M. Pal and T. Roughgarden, 20032003

The only known approximation for the general caseThe only known approximation for the general case

M. Charikar, A. Karagiozova, 2005. The ratio is:M. Charikar, A. Karagiozova, 2005. The ratio is:

exp( exp( OO(( log (( log DD log log log log D D ))1/2 1/2 ))))

1515

Our Main ResultOur Main Result

Theorem: Theorem: If If hh is the number of pairs of is the number of pairs of ssii,t,tii then there is a polytime algorithm with then there is a polytime algorithm with approximation ratio approximation ratio OO(log(log44 h h))..

For simplicity we focus on the unit-demand For simplicity we focus on the unit-demand case (i.e. case (i.e. ddii==11 for all for all i’i’s) and we present s) and we present

OO(log(log55nn loglogloglog n n))..

1616

Overview of the AlgorithmOverview of the Algorithm

The algorithm iteratively finds a partial The algorithm iteratively finds a partial solution connecting some of the residual solution connecting some of the residual pairspairs

The new pairs are then removed from the set; The new pairs are then removed from the set; repeat until all pairs are connected (routed)repeat until all pairs are connected (routed)

Density of a partial solution = Density of a partial solution = cost of the partial solutioncost of the partial solution # of new pairs routed# of new pairs routed

The algorithm tries to find low density partial The algorithm tries to find low density partial solution at each iterationsolution at each iteration

1717

Overview of the Algorithm (cont’d)Overview of the Algorithm (cont’d)

The density of each partial solution is at mostThe density of each partial solution is at most

ÕÕ(log(log44 nn) ) (OPT / (OPT / hh'')) where where OPTOPT is the cost of is the cost of optimum solution and optimum solution and hh'' is the number of is the number of unrouted pairsunrouted pairs

A simple analysis (like for set cover) shows:A simple analysis (like for set cover) shows:

Total Cost Total Cost

ÕÕ(log(log4 4 nn) ) OPT OPT (1/ (1/nn22 + 1/( + 1/(nn22 - 1) +…+ - 1) +…+ 1)1)

ÕÕ(log(log5 5 nn) ) OPT OPT

1818

Structure of the OptimumStructure of the Optimum

How to compute a low-density partial solution?How to compute a low-density partial solution?

Prove the existence of low-density one with a very Prove the existence of low-density one with a very specific structure: specific structure: junction-treejunction-tree

Junction-tree:Junction-tree: given a set given a set PP of pairs, tree of pairs, tree TT rooted at rooted at rr is a junction tree if is a junction tree if

It contains all pairs of It contains all pairs of PP

For every pair For every pair ssii,t,tii P P the the

path connecting them path connecting them

in in TT goes through goes through rr

r

1919

Structure of the Optimum (cont’d)Structure of the Optimum (cont’d)

So the pairs in a junction tree connect via the rootSo the pairs in a junction tree connect via the root

We show there is always a partial solution with low We show there is always a partial solution with low density that is a junction treedensity that is a junction tree

Observation:Observation: If we know the pairs participating in a If we know the pairs participating in a junction-tree it reduces to the single-source BB junction-tree it reduces to the single-source BB problemproblem r

Then we could use the Then we could use the

OO(log(log n n)) approximation approximation

of of [MMP’00][MMP’00]

2020

Summary of the AlgorithmSummary of the Algorithm

So there are two main ingredients in the proofSo there are two main ingredients in the proof

Theorem 2:Theorem 2: There is always a partial solution that is a There is always a partial solution that is a

junction tree with density junction tree with density ÕÕ (log(log22 nn) ) (OPT / (OPT / hh''))

Theorem 3:Theorem 3: There is an There is an O O (log(log22 nn)) approximation for the approximation for the

problem of finding lowest density junction tree (this is low problem of finding lowest density junction tree (this is low

density SS-BB).density SS-BB).

Corollary:Corollary: We can find a partial solution with density We can find a partial solution with density

ÕÕ (log(log44 nn) ) (OPT / (OPT / hh''))

This implies an approximation This implies an approximation ÕÕ (log(log55 nn)) for MC-BB. for MC-BB.

2121

More Details of the Proof of Theorem 2: More Details of the Proof of Theorem 2:

We want to show there is a partial solution that is a junction tree We want to show there is a partial solution that is a junction tree

with density with density ÕÕ (log(log22 nn) ) (OPT / (OPT / hh''))

Consider an optimum solution OPT.Consider an optimum solution OPT.

Let Let E*E* be the edge set of OPT, be the edge set of OPT, OPTOPTcc be its costbe its cost and and

OPTOPTll be be its length. its length.

By the result of By the result of Elkin, Emek, Spielman and Tang 2005Elkin, Emek, Spielman and Tang 2005 on on

probabilistic distribution on spanning trees and by loosing a probabilistic distribution on spanning trees and by loosing a

factor factor ÕÕ (log(log22 nn)) on length, we can assume that on length, we can assume that E* E* is a forest is a forest T T

(WLOG we assume (WLOG we assume TT is connected). is connected).

2222

More Details of the Proof of Theorem 2: More Details of the Proof of Theorem 2:

From From TT we obtain a collection of rooted subtrees we obtain a collection of rooted subtrees TT11,…,T,…,Taa

such thatsuch that

any edge e of any edge e of TT is in at most is in at most O(O(loglog h) h) of the subtrees of the subtrees

For every pair there is exactly one index For every pair there is exactly one index ii such that both vertices such that both vertices

are in are in TTii; further the root of ; further the root of TTii is their least common ancestor is their least common ancestor

The total cost of the junction trees is at most The total cost of the junction trees is at most

ÕÕ (log(log22 hh) ) OPT OPT ((OO (log (log hh) ) OPT OPTcc + + ÕÕ (log(log22 hh) ) OPT OPTll))

Thus at least one of junction trees of Thus at least one of junction trees of TT11,…,T,…,Taa has the has the

desired density of desired density of ÕÕ (log(log22 hh) ) (OPT / (OPT / hh''))

2323

More Details of the Proof of Theorem 2:More Details of the Proof of Theorem 2:

Given Given TT, we pick a centeroid , we pick a centeroid rr11 (i.e., largest remaining (i.e., largest remaining

component has at most component has at most 2/3 |V(T)| 2/3 |V(T)| vertices).vertices).

Add tree Add tree TT rooted at rooted at rr1 1 to the collectionto the collection

Remove Remove rr1 1 from from TT and apply the procedure recursively and apply the procedure recursively

to each of the resulting componentto each of the resulting component

Each pair is on exactly one subtree in the collectionEach pair is on exactly one subtree in the collection

The depth of the recursion is in The depth of the recursion is in OO (log (log hh))

2424

Some Details of the Proof of Theorem 3:Some Details of the Proof of Theorem 3:Theorem 3:Theorem 3: There is anThere is an approximation approximation

for finding lowest density junction tree.for finding lowest density junction tree.

This is very similar to SS-BB except that we have to This is very similar to SS-BB except that we have to

find a lowest density solution.find a lowest density solution.

Here we have to connect a subset of the pairs Here we have to connect a subset of the pairs

to the root to the root rr with lowest density with lowest density

(= cost of solution / # of pairs in sol).(= cost of solution / # of pairs in sol).

Let denote the set of paths from Let denote the set of paths from rr to to ii..

We formulate the problem as an IP and then consider We formulate the problem as an IP and then consider

the LP relaxation of the problemthe LP relaxation of the problem

2525

Some Details of the Proof of Theorem 3:Some Details of the Proof of Theorem 3:

We solve the LP by setting We solve the LP by setting yyss=y=yt t for each pair for each pair (s,t)(s,t), and then , and then

find a subset of nodes to solve the SS-BBfind a subset of nodes to solve the SS-BB

We find a class of We find a class of y y among among O O (log (log nn) ) classes of almost equal classes of almost equal

yyii with maximum sum (loose a factor with maximum sum (loose a factor O O (log (log nn))) )

We use the We use the O O (log (log nn)) approx of approx of [MMP,CKN][MMP,CKN] for SS-BB for SS-BB

(indeed it is the upper bound on integrality gap of the LP)(indeed it is the upper bound on integrality gap of the LP)

2626

Some Remarks:Some Remarks:

For the polynomially bounded demand case we can find low For the polynomially bounded demand case we can find low

density junction-trees using a density junction-trees using a more refined region growing more refined region growing

techniquetechnique and also using a and also using a greedy greedy algorithm (within algorithm (within OO (log(log44 nn))))

Hajiaghayi, Kortsarz and Salavatipour, ECCC 2006Hajiaghayi, Kortsarz and Salavatipour, ECCC 2006

The greedy algorithm is based on an algorithm for the The greedy algorithm is based on an algorithm for the

k-k-shallow-light tree problem shallow-light tree problem Hajiaghayi, Kortsarz and Hajiaghayi, Kortsarz and

Salavatipour, APPROX 2006Salavatipour, APPROX 2006

There is a conjectured upper bound of There is a conjectured upper bound of OO (log (log nn) ) for distortion for distortion

in embedding a graph metric into a probability distribution over in embedding a graph metric into a probability distribution over

its spanning tree (its spanning tree (Alon, Karp, Peleg and West, 1991Alon, Karp, Peleg and West, 1991))

If true, that would improve our approximation factor for If true, that would improve our approximation factor for

arbitrary demands to arbitrary demands to OO (log(log44 nn) )

2727

Some Remarks (cont’d):Some Remarks (cont’d):

Indeed, as suggested by Racke, our current approach can be Indeed, as suggested by Racke, our current approach can be

applied via Bartal’s trees (and interestingly not FRT) to applied via Bartal’s trees (and interestingly not FRT) to

obtain an obtain an OO(log (log hh) ) factor instead of factor instead of ÕÕ (log(log22 hh) ) factorfactor

For a constant fraction of the pairs, we use strong diameter For a constant fraction of the pairs, we use strong diameter

property which is true in Bartal’s construction property which is true in Bartal’s construction

It is more technical, but we can obtain factor It is more technical, but we can obtain factor OO (log(log44 hh) ) for for

general demands (solving an open problem)general demands (solving an open problem)

2828

Recent ExtensionsRecent Extensions

The result The result OO(log(log44nn) ) can be extended to the vertex-weighted case can be extended to the vertex-weighted case

but requires some new ideas and some extra work but requires some new ideas and some extra work [CHKS’07].[CHKS’07].

Especially we obtain theEspecially we obtain the tight tight result result OO(log (log nn) ) for the single-sink for the single-sink

vertex-weighted case via LP roundingvertex-weighted case via LP rounding

Also it needs some subtle change of vertex weights to edge Also it needs some subtle change of vertex weights to edge

weights in the junction tree lemma weights in the junction tree lemma

Also our results can be extended to the stochastic versions with Also our results can be extended to the stochastic versions with

non-uniform inflation (by loosing an extra factor non-uniform inflation (by loosing an extra factor OO(log (log nn))) )

[Gupta, Hajiaghayi, Kumar’06].[Gupta, Hajiaghayi, Kumar’06].

Some technique has been used in the Dial-a-Ride problemSome technique has been used in the Dial-a-Ride problem

[Gupta, Hajiaghayi, Ravi, Nagarajan’06].[Gupta, Hajiaghayi, Ravi, Nagarajan’06].

2929

Open ProblemsOpen Problems

There are still quite large gaps between upper bounds There are still quite large gaps between upper bounds

(approx alg) and lower bounds (hardness)(approx alg) and lower bounds (hardness)

For MC-BB: For MC-BB: vsvs

For SS-BB: For SS-BB: vs vs

It would be nice to upper bound the integrality gap for It would be nice to upper bound the integrality gap for

MC-BB.MC-BB.

Emphasize on the conjecture ofEmphasize on the conjecture of Alon, Karp, Peleg and Alon, Karp, Peleg and

West, 1991West, 1991

3030

Thanks for your attention…Thanks for your attention…