Jiangzhuo Chen
Abstract
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this article, we study single-commodity confluent flow problems, where we need to route given node demands to a single destination using a confluent flow. Single- and multi-commodity confluent flows arise in a variety of application areas, most notably in networking; in fact, most flows in the Internet are (multi-commodity) confluent flows since Internet routing is destination based.
We present near-tight approximation algorithms, hardness results, and existence theorems for minimizing congestion in single-commodity confluent flows. The maximum edge congestion of a single-commodity confluent flow occurs at one of the incoming edges of the destination. Therefore, finding a minimum-congestion confluent flow is equivalent to the following problem: given a directed graph G with k sinks and non-negative demands on all the nodes of G, determine a confluent flow that routes every node demand to some sink such that the maximum congestion at a sink is minimized.
The main result of this article is a polynomial-time algorithm for determining a confluent flow with congestion at most 1 + ln(k) in G, if G admits a splittable flow with congestion at most 1. We complement this result in two directions. First, we present a graph G that admits a splittable flow with congestion at most 1, yet no confluent flow with congestion smaller than Hk, the kth harmonic number, thus establishing tight upper and lower bounds to within an additive constant less than 1. Second, we show that it is NP-hard to approximate the congestion of an optimal confluent flow to within a factor of (log2k)/2, thus resolving the polynomial-time approximability to within a multiplicative constant. We also consider a demand maximization version of the problem. We show that if G admits a splittable flow of congestion at most 1, then a variant of the congestion minimization algorithm yields a confluent flow in G with congestion at most 1 that satisfies 1/3 fraction of total demand.
We show that the gap between confluent flows and splittable flows is much smaller, if the underlying graph is k-connected. In particular, we prove that k-connected graphs with k sinks admit confluent flows of congestion less than C + dmax, where C is the congestion of the best splittable flow, and dmax is the maximum demand of any node in G. The proof of this existence theorem is non-constructive and relies on topological techniques introduced by Lovász.
- Bertsekas, D. 1999. Nonlinear Programming. Athena Scientific, Belmont, MA.Google Scholar
- Chen, J., Rajaraman, R., and Sundaram, R. 2003. Meet and merge: Approximation algorithms for confluent flows. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing. 373--382. Google Scholar
- Dinitz, Y., Garg, N., and Goemans, M. 1999. On the single-source unsplittable flow problem. Combinatorica 19, 17--41.Google Scholar
- Feige, U. 1998. A threshold of ln n for approximating set cover. J. ACM 45, 634--652. Google Scholar
- Ford, Jr., L., and Fulkerson, D. 1956. Maximal flow through a network. Canad. J. Math. 8, 399--404.Google Scholar
- Ford, Jr., L., and Fulkerson, D. 1962. Flows in Networks. Princeton University Press, Princeton, NJ.Google Scholar
- Fortune, S., Hopcroft, J., and Wyllie, J. 1980. The directed subgraph homeomorphism problem. Theoret. Comput. Sci. 10, 111--121.Google Scholar
- Frank, A. 1976. Combinatorial algorithms, algorithmic proofs. Ph.D. dissertation. Eötvös University, Budapest. In Hungarian.Google Scholar
- Gallo, G., Grigoriadis, M. D., and Tarjan, R. E. 1989. A fast parametric maximum flow algorithm and applications. SIAM J. Comput. 18, 1 (Feb.), 30--55. Google Scholar
- Gupta, A., Kleinberg, J., Kumar, A., Rastogi, R., and Yener, B. 2001. Provisioning a virtual private network: A network design problem for multicommodity flow. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing. ACM, New York. Google Scholar
- Guruswami, V., Khanna, S., Rajaraman, R., Shepherd, B., and Yannakakis, M. 2003. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. J. Comput. Syst. Sci. 67, 473--496. Google Scholar
- Győri, E. 1976. On division of graphs to connected subgraphs. In Proceedings of the 5th Hungarian Combinatorial Colloquium. Budapest, Hungary.Google Scholar
- Hatcher, A. 2002. Algebraic Topology. Cambridge University Press, Cambridge, UK.Google Scholar
- Khuller, S., Raghavachari, B., and Young, N. 1994. Designing multi-commodity flow trees. Info. Proc. Lett. 50, 49--55. Google Scholar
- Kleinberg, J. M. 1996. Single-source unsplittable flow. In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 68--77. Google Scholar
- Kumar, A., Rastogi, R., Silberschatz, A., and Yener, B. 2001. Algorithms for provisioning virtual private networks in the hose model. In Proceedings of the ACM SIGCOMM Conference. ACM, New York, 135--148. Google Scholar
- Lenstra, J. K., Shmoys, D. B., and Tardos, E. 1990. Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46, 3, 259--271. Google Scholar
- Lorenz, D., Orda, A., Raz, D., and Shavitt, Y. 2001. How good can IP routing be? Tech. Rep. 2001-17, DIMACS. Apr. Google Scholar
- Lovász, L. 1977. A homology theory for spanning trees of a graph. Acta Mathematica Academiae Scientiarum Hungaricae 30, 3-4, 241--251.Google Scholar
- Megiddo, N. 1977. A good algorithm for lexicographically optimal flows in multi-terminal networks. Bull. AMS 83, 3 (May), 407--409.Google Scholar
- Wang, J., and Nahrstedt, K. 2002. Hop-by-hop routing algorithms for premium-class traffic in diffserv networks. ACM SIGCOMM Comput. Communi. Rev. 32, 73--88. Google Scholar
Index Terms
- (Almost) Tight bounds and existence theorems for single-commodity confluent flows
Recommendations
(Almost) tight bounds and existence theorems for confluent flows
STOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computingA flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we consider the problem of determining a confluent flow that routes every node ...
Meet and merge: approximation algorithms for confluent flows
STOC '03: Proceedings of the thirty-fifth annual ACM symposium on Theory of computingIn this paper we investigate the problem ofdetermining confluent flows with minimum congestion. A flow of a given commodity is said to be confluent if at any node all the flow of the commodity departs along a single edge. Confluent flows appear in a ...
Capacitated confluent flows: complexity and algorithms
CIAC'10: Proceedings of the 7th international conference on Algorithms and ComplexityA flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We study the Maximum Confluent Flow Problem (MaxConf) with a single commodity ...
Comments