<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>1081</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2008-08-05</completedDate>
    <publishedDate>2008-08-05</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">An Integer Programming Algorithm for Routing Optimization in IP Networks</title>
    <abstract language="eng">Most data networks nowadays use shortest path protocols to route the traffic. Given administrative routing lengths for the links of the network, all data packets are sent along shortest paths with respect to these lengths from their source to their destination. In this paper, we present an integer programming algorithm for the minimum congestion unsplittable shortest path routing problem, which arises in the operational planning of such networks. Given a capacitated directed graph and a set of communication demands, the goal is to find routing lengths that define a unique shortest path for each demand and minimize the maximum congestion over all links in the resulting routing. We illustrate the general decomposition approach our algorithm is based on, present the integer and linear programming models used to solve the master and the client problem, and discuss the most important implementational aspects. Finally, we report computational results for various benchmark problems, which demonstrate the efficiency of our algorithm.</abstract>
    <identifier type="serial">08-30</identifier>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="opus3-id">1116</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-10814</identifier>
    <enrichment key="SourceTitle">Appeared in: Proceedings of the 16th Annual European Symposium on Algorithms (ESA 2008), Karlsruhe, Germany. LNCS 5193, Springer, pp 198-209</enrichment>
    <author>Andreas Bley</author>
    <submitter>unknown unknown</submitter>
    <series>
      <title>ZIB-Report</title>
      <number>08-30</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Shortest Path Routing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Integer Programming</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="msc" number="90B18">Communication networks [See also 68M10, 94A05]</collection>
    <collection role="msc" number="90C10">Integer programming</collection>
    <collection role="msc" number="90C27">Combinatorial optimization</collection>
    <collection role="msc" number="90C90">Applications of mathematical programming</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1081/ZR_08_30.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/1081/ZR_08_30.rev.Vers.pdf</file>
  </doc>
</export-example>
