<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>708</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2002-11-18</completedDate>
    <publishedDate>2002-11-18</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Integer programming approaches to access and backbone IP-network planning</title>
    <abstract language="eng">In this article we study the problem of designing a nation-wide communication network. Such networks usually consist of an access layer, a backbone layer, and maybe several intermediate layers. The nodes of each layer must be connected to those of the next layer in a tree-like fashion. The backbone layer has to satisfy certain survivability and routing constraints. Given the node locations, the demands between them, the possible connections and hardware configurations, and various other technical and administrational constraints, the goal is to decide, which node is assigned to which network level, how the nodes are connected, what hardware must be installed, and how traffic is routed in the backbone. Mixed integer linear programming models and solution methods are presented for both the access and the backbone network design problem. The focus is on the design of IP-over-SDH networks, but the access network design model and large parts of the backbone network design models are general and also applicable for other types of communication networks. Results obtained with these methods in the planning of the German research network are presented.</abstract>
    <identifier type="serial">02-41</identifier>
    <identifier type="opus3-id">709</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-7081</identifier>
    <enrichment key="SourceTitle">A slightly modified vers. appeared in: Modeling, Simulation and Optimization of Complex Processes: Proceedings of the 3rd International Conference on High Performance Scientific Computing, Hanoi, Vietnam, Springer 2006, pp. 87-110</enrichment>
    <author>Andreas Bley</author>
    <author>Thorsten Koch</author>
    <series>
      <title>ZIB-Report</title>
      <number>02-41</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Network design</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Traffic enineering</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Internet routing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Mixed-integer programming</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="90B18">Communication networks [See also 68M10, 94A05]</collection>
    <collection role="msc" number="90C11">Mixed 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="">ZIB Allgemein</collection>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
    <collection role="projects" number="G-WiN">G-WiN</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/708/ZR-02-41.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/708/ZR-02-41.pdf</file>
  </doc>
</export-example>
