On the approximability of the minimum congestion unsplittable shortest path routing problem

Lecture Notes in Computer Science

Volumn 3509, Issue , 2005, Pages 97-110

  Bley, Andreas ^a  

^a ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

Approximation; Computational Complexity; Shortest Path Routing; Unsplittable Flow

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; FUNCTIONS; GRAPH THEORY; NETWORK PROTOCOLS; PROBLEM SOLVING; ROUTERS; SET THEORY; TELECOMMUNICATION NETWORKS;

APPROXIMATION; DEMAND VALUES; SHORTEST PATH ROUTING; UNSPLITTABLE FLOW;

CONGESTION CONTROL (COMMUNICATION);

EID: 24944449414     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11496915_8     Document Type: Conference Paper

References (14)

1. Ben-Ameur, W., Gourdin, E.: Internet routing and related topology issues. SIAM Journal on Discrete Mathematics 17 (2003) 18-49
2. 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)
3. 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. Volume 53 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science., American Mathematical Society (1998) 1-16
4. 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 (2003) 107-113
5. 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)
6. Farago, A., Szentesi, A., Szviatovski, B.: Allocation of administrative weights in PNNI. In: Proceedings of Networks 1998. (1998) 621-625
7. Ben-Ameur, W., Gourdin, E., Liau, B., Michel, N.: Optimizing administrative weights for efficient single-path routing. In: Proceedings of Networks 2000. (2000)
8. Prytz, M.: On Optimization in Design of Telecommunications Networks with Multicast and Unicast Traffic. PhD thesis, Royal Institute of Technology, Stockholm, Sweden (2002)
9. Dinitz, Y., Garg, N., Goemans, M.: On the single source unsplittable flow problem. Combinatorica 19 (1999) 1-25
10. 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. (1997) 426-435
11. Skutella, M.: Approximating the single source unsplittable min-cost flow problem. Mathematical Programming 91 (2002)
12. Garey, M., Johnson, D.: Computers and intractability: A Guide to the Theory of NP-Completeness. Freeman and Company, New York (1979)
13. Fortz, B., Thorup, M.: Increasing internet capacity using local search. Computational Optimization and Applications 29 (2004) 13-48
14. 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)