Abstract
We are given an undirected simple graph G = (V,E) with edge capacities \(c_{e} \epsilon \mathcal{Z}+\), e ∈ E, and a set K ⊆ V 2 of commodities with demand values d (s,t) εℤ, (s, t) ∈ K. An unsplittable shortest path routing (USPR) of the commodities K is a set of flow paths Φ(s,t), (s, t) ∈ K, such that each Φ(s,t) is the unique shortest (s, t)-path for commodity (s, t) with respect to a common edge length function \(\lambda = (\lambda_e) \epsilon \mathbb{Z}^{E}_{+}\). The minimum congestion unsplittable shortest path routing problem (Min-Con-USPR) is to find an USPR that minimizes the maximum congestion (i.e., the flow to capacity ratio) over all edges. We show that it is \(\mathcal{NP}\)-hard to approximate Min-Con-USPR within a factor of \(\mathcal{O}(|V|^1-\epsilon)\) for any ε > 0. We also present a simple approximation algorithm that achieves an approximation guarantee of \(\mathcal{O}(|E|)\) in the general case and of 2 in the special case where the underlying graph G is a cycle. Finally, we construct examples where the minimum congestion that can be obtained with an USPR is a factor of Ω(|V|2) larger than the congestion of an optimal unsplittable flow routing or an optimal shortest multi-path routing, and a factor of Ω(|V|) larger than the congestion of an optimal unsplittable source-invariant routing. This indicates that unsplittable shortest path routing problems are indeed harder than their corresponding unsplittable flow, shortest multi-path, and unsplittable source-invariant routing problems.
The Min-Con-USPR problem is of great practical interest in the planning of telecommunication networks that are based on shortest path routing protocols.
Mathematical Subject Classification (2000): 68Q25, 90C60, 90C27, 05C38, 90B18.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ben-Ameur, W., Gourdin, E.: Internet routing and related topology issues. SIAM Journal on Discrete Mathematics 17, 18–49 (2003)
Bley, A.: Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths. Technical Report ZR-05-04, Konrad-Zuse-Zentrum für Informationstechnik Berlin (2005)
Bley, A., Grötschel, M., Wessäly, R.: Design of broadband virtual private networks: Model and heuristics for the B-WiN. In: Dean, N., Hsu, D., Ravi, R. (eds.) Robust Communication Networks: Interconnection and Survivability. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 53, pp. 1–16. American Mathematical Society, Providence (1998)
Bley, A.: A Lagrangian approach for integrated network design and routing in IP networks. In: Proceedings of International Network Optimization Conference (INOC 2003), Evry/Paris, pp. 107–113 (2003)
Bley, A., Koch, T.: Integer programming approaches to access and backbone IP-network planning. Technical Report ZR-02-41, Konrad-Zuse-Zentrum für Informationstechnik Berlin (2002)
Farago, A., Szentesi, A., Szviatovski, B.: Allocation of administrative weights in PNNI. In: Proceedings of Networks 1998, pp. 621–625 (1998)
Ben-Ameur, W., Gourdin, E., Liau, B., Michel, N.: Optimizing administrative weights for efficient single-path routing. In: Proceedings of Networks 2000 (2000)
Prytz, M.: On Optimization in Design of Telecommunications Networks with Multicast and Unicast Traffic. PhD thesis, Royal Institute of Technology, Stockholm, Sweden (2002)
Dinitz, Y., Garg, N., Goemans, M.: On the single source unsplittable flow problem. Combinatorica 19, 1–25 (1999)
Kolliopoulos, S., Stein, C.: Improved approximation algorithms for unsplittable flow problems. In: Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, Miami Beach FL, pp. 426–435 (1997)
Skutella, M.: Approximating the single source unsplittable min-cost flow problem. Mathematical Programming 91 (2002)
Garey, M., Johnson, D.: Computers and intractability: A Guide to the Theory of NP-Completeness. Freeman and Company, New York (1979)
Fortz, B., Thorup, M.: Increasing internet capacity using local search. Computational Optimization and Applications 29, 13–48 (2004)
Lorenz, D., Orda, A., Raz, D., Shavitt, Y.: How good can IP routing be? Technical Report 2001-17, DIMACS, Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University, Princeton University, AT&T Bell Laboratries and Bellcore (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bley, A. (2005). On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem. In: Jünger, M., Kaibel, V. (eds) Integer Programming and Combinatorial Optimization. IPCO 2005. Lecture Notes in Computer Science, vol 3509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11496915_8
Download citation
DOI: https://doi.org/10.1007/11496915_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26199-5
Online ISBN: 978-3-540-32102-6
eBook Packages: Computer ScienceComputer Science (R0)