Dr. rer. nat. Matthias Hartmann

• Optimization and Design of Network Architectures for Future Internet Routing Hartmann, Matthias PhD thesis, University of Wuerzburg. (2015, May).
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @phdthesis{info3-dissertation-2015-2, author = {Hartmann, Matthias}, keywords = {sys:hidden:dissertation}, month = 5, school = {University of Wuerzburg}, title = {Optimization and Design of Network Architectures for Future Internet Routing}, year = 2015 }

  %0 Thesis %1 info3-dissertation-2015-2 %A Hartmann, Matthias %D 2015 %T Optimization and Design of Network Architectures for Future Internet Routing

• Including Energy Efficiency Aspects in Multi-Layer Optical Network Design Gebert, Steffen; Hock, David; Hartmann, Matthias; Spoerhase, Joachim; Zinner, Thomas; Tran-Gia, Phuoc in 5th International Conference on Communications and Electronics (ICCE 2014) (2014).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  This paper investigates the influence of the network planning process on a higher energy-awareness of optical multi-layer core networks. In particular, we propose to remove redundant links in the network, and to route corresponding network traffic on other links. Based on the reduced network topology, we compute the required network equipment for realistic traffic demands using a network planning tool. Due to the lack of an accurate model for operational expenditures and energy consumption, we choose the link length as cost function. We show the applicability of our idea and demonstrate the energy saving potential using realistic network topologies.

  @inproceedings{info3-inproceedings-2014-492, abstract = {This paper investigates the influence of the network planning process on a higher energy-awareness of optical multi-layer core networks. In particular, we propose to remove redundant links in the network, and to route corresponding network traffic on other links. Based on the reduced network topology, we compute the required network equipment for realistic traffic demands using a network planning tool. Due to the lack of an accurate model for operational expenditures and energy consumption, we choose the link length as cost function. We show the applicability of our idea and demonstrate the energy saving potential using realistic network topologies.}, address = {Da Nang, Vietnam}, author = {Gebert, Steffen and Hock, David and Hartmann, Matthias and Spoerhase, Joachim and Zinner, Thomas and Tran-Gia, Phuoc}, booktitle = {5th International Conference on Communications and Electronics (ICCE 2014)}, keywords = {saser-siegfried}, month = 7, title = {Including Energy Efficiency Aspects in Multi-Layer Optical Network Design}, year = 2014 }

  %0 Conference Paper %1 info3-inproceedings-2014-492 %A Gebert, Steffen %A Hock, David %A Hartmann, Matthias %A Spoerhase, Joachim %A Zinner, Thomas %A Tran-Gia, Phuoc %B 5th International Conference on Communications and Electronics (ICCE 2014) %C Da Nang, Vietnam %D 2014 %T Including Energy Efficiency Aspects in Multi-Layer Optical Network Design %X This paper investigates the influence of the network planning process on a higher energy-awareness of optical multi-layer core networks. In particular, we propose to remove redundant links in the network, and to route corresponding network traffic on other links. Based on the reduced network topology, we compute the required network equipment for realistic traffic demands using a network planning tool. Due to the lack of an accurate model for operational expenditures and energy consumption, we choose the link length as cost function. We show the applicability of our idea and demonstrate the energy saving potential using realistic network topologies.
• POCO-PLC: Enabling Dynamic Pareto-Optimal Resilient Controller Placement in SDN Networks Hock, David; Hartmann, Matthias; Gebert, Steffen; Zinner, Thomas; Tran-Gia, Phuoc (2014, April).
  • [ BibTeX ]
  • [ EndNote ]
  @misc{info3-software-2014-19, address = {Toronto, Canada}, author = {Hock, David and Hartmann, Matthias and Gebert, Steffen and Zinner, Thomas and Tran-Gia, Phuoc}, booktitle = {Computer Communications Workshops (INFOCOM WKSHPS)}, keywords = {poco}, month = 4, title = {POCO-PLC: Enabling Dynamic Pareto-Optimal Resilient Controller Placement in SDN Networks}, year = 2014 }

  %0 Generic %1 info3-software-2014-19 %A Hock, David %A Hartmann, Matthias %A Gebert, Steffen %A Zinner, Thomas %A Tran-Gia, Phuoc %B Computer Communications Workshops (INFOCOM WKSHPS) %C Toronto, Canada %D 2014 %T POCO-PLC: Enabling Dynamic Pareto-Optimal Resilient Controller Placement in SDN Networks
• POCO: A Framework for the Pareto-Optimal Resilient Controller Placement in SDN-based Core Networks Hock, David; Gebert, Steffen; Hartmann, Matthias; Zinner, Thomas; Tran-Gia, Phuoc (2014, May).
  • [ BibTeX ]
  • [ EndNote ]
  @misc{info3-software-2014-18, address = {Krakow, Poland}, author = {Hock, David and Gebert, Steffen and Hartmann, Matthias and Zinner, Thomas and Tran-Gia, Phuoc}, booktitle = {IEEE NOMS}, keywords = {poco}, month = 5, title = {POCO: A Framework for the Pareto-Optimal Resilient Controller Placement in SDN-based Core Networks}, year = 2014 }

  %0 Generic %1 info3-software-2014-18 %A Hock, David %A Gebert, Steffen %A Hartmann, Matthias %A Zinner, Thomas %A Tran-Gia, Phuoc %B IEEE NOMS %C Krakow, Poland %D 2014 %T POCO: A Framework for the Pareto-Optimal Resilient Controller Placement in SDN-based Core Networks

• Using Optimized Virtual Network Embedding for Network Dimensioning Inführ, Johannes; Stezenbach, David; Hartmann, Matthias; Tutschku, Kurt; Raidl, Günther R. in IEEE Conference on Networked Systems (NetSys) 2013 (2013).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Virtual Network Embedding will be one of the key concepts of the Future Internet. For an ISP it is important to know how many additional Virtual Networks (VNs) of a specific application (e.g. web, streaming, P2P, and VoIP) are mappable into the current resource substrate with a certain probability. In this work we calculate this probability with our embedding algorithm which enables us to consider side effects based on remapping of VNs (e.g. due to reduced link delay). Our results show that minimal extra resources can significantly increase embedding probability of additional VNs.

  @inproceedings{info3-inproceedings-2013-460, abstract = {Virtual Network Embedding will be one of the key concepts of the Future Internet. For an ISP it is important to know how many additional Virtual Networks (VNs) of a specific application (e.g. web, streaming, P2P, and VoIP) are mappable into the current resource substrate with a certain probability. In this work we calculate this probability with our embedding algorithm which enables us to consider side effects based on remapping of VNs (e.g. due to reduced link delay). Our results show that minimal extra resources can significantly increase embedding probability of additional VNs.}, address = {Stuttgart, Germany}, author = {Inführ, Johannes and Stezenbach, David and Hartmann, Matthias and Tutschku, Kurt and Raidl, Günther R.}, booktitle = {IEEE Conference on Networked Systems (NetSys) 2013}, keywords = {sys:hidden:inproceedings}, month = 3, title = {Using Optimized Virtual Network Embedding for Network Dimensioning}, year = 2013 }

  %0 Conference Paper %1 info3-inproceedings-2013-460 %A Inführ, Johannes %A Stezenbach, David %A Hartmann, Matthias %A Tutschku, Kurt %A Raidl, Günther R. %B IEEE Conference on Networked Systems (NetSys) 2013 %C Stuttgart, Germany %D 2013 %T Using Optimized Virtual Network Embedding for Network Dimensioning %X Virtual Network Embedding will be one of the key concepts of the Future Internet. For an ISP it is important to know how many additional Virtual Networks (VNs) of a specific application (e.g. web, streaming, P2P, and VoIP) are mappable into the current resource substrate with a certain probability. In this work we calculate this probability with our embedding algorithm which enables us to consider side effects based on remapping of VNs (e.g. due to reduced link delay). Our results show that minimal extra resources can significantly increase embedding probability of additional VNs.
• Crowdsourcing and its Impact on Future Internet Usage Tran-Gia, Phuoc; Hoßfeld, Tobias; Hartmann, Matthias; Hirth, Matthias in it - Information Technology (2013). 55 139–145.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Crowdsourcing is an emerging service platform and business model in the Internet. In contrast to outsourcing where a job is performed by a designated contractor, with Crowdsourcing, jobs are outsourced to a large, anonymous crowd of workers, the so-called human cloud. The rise of Crowdsourcing and its seamless integration in current workflows may have a huge impact on the Internet and on society, and will be a guiding paradigm that can form the evolution of work in the years to come. In this article, we discuss applications and use cases of Crowdsourcing to demonstrate the impact on Internet usage. Novel measurement approaches are presented and the impact of Crowdsourcing on Internet traffic is evaluated by measuring the activity of a particular Crowdsourcing platform. New technical solutions are necessary for the operation of efficient, distributed Crowdsourcing platforms. Special attention is drawn to the integration of machine clouds and human crowds, and appropriate inter-cloud solutions. Finally, we discuss current research challenges from a scientific and from the platform provider’s point of view.

  @article{info3-article-2013-113, abstract = {Crowdsourcing is an emerging service platform and business model in the Internet. In contrast to outsourcing where a job is performed by a designated contractor, with Crowdsourcing, jobs are outsourced to a large, anonymous crowd of workers, the so-called human cloud. The rise of Crowdsourcing and its seamless integration in current workflows may have a huge impact on the Internet and on society, and will be a guiding paradigm that can form the evolution of work in the years to come. In this article, we discuss applications and use cases of Crowdsourcing to demonstrate the impact on Internet usage. Novel measurement approaches are presented and the impact of Crowdsourcing on Internet traffic is evaluated by measuring the activity of a particular Crowdsourcing platform. New technical solutions are necessary for the operation of efficient, distributed Crowdsourcing platforms. Special attention is drawn to the integration of machine clouds and human crowds, and appropriate inter-cloud solutions. Finally, we discuss current research challenges from a scientific and from the platform provider’s point of view.}, author = {Tran-Gia, Phuoc and Hoßfeld, Tobias and Hartmann, Matthias and Hirth, Matthias}, journal = {it - Information Technology}, keywords = {sys:hidden:article}, month = 7, pages = {139-145}, title = {Crowdsourcing and its Impact on Future Internet Usage}, volume = 55, year = 2013 }

  %0 Journal Article %1 info3-article-2013-113 %A Tran-Gia, Phuoc %A Hoßfeld, Tobias %A Hartmann, Matthias %A Hirth, Matthias %D 2013 %J it - Information Technology %P 139-145 %T Crowdsourcing and its Impact on Future Internet Usage %V 55 %X Crowdsourcing is an emerging service platform and business model in the Internet. In contrast to outsourcing where a job is performed by a designated contractor, with Crowdsourcing, jobs are outsourced to a large, anonymous crowd of workers, the so-called human cloud. The rise of Crowdsourcing and its seamless integration in current workflows may have a huge impact on the Internet and on society, and will be a guiding paradigm that can form the evolution of work in the years to come. In this article, we discuss applications and use cases of Crowdsourcing to demonstrate the impact on Internet usage. Novel measurement approaches are presented and the impact of Crowdsourcing on Internet traffic is evaluated by measuring the activity of a particular Crowdsourcing platform. New technical solutions are necessary for the operation of efficient, distributed Crowdsourcing platforms. Special attention is drawn to the integration of machine clouds and human crowds, and appropriate inter-cloud solutions. Finally, we discuss current research challenges from a scientific and from the platform provider’s point of view.
• Aktuelles Schlagwort: Big Data Klein, Dominik; Tran-Gia, Phuoc; Hartmann, Matthias in Informatik-Spektrum (2013). 36 319–323.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Big Data ist neben Cloud Computing und Crowdsourcing eine der wichtigsten neuen Technologie-Treiber und wird daher im Aktuellen Schlagwort näher beleuchtet. Zu Beginn gehen wir auf die Definition von Big Data ein und erläutern die Unterschiede zu traditionellen Verfahren. Im Anschluss daran stellen wir zugrundeliegende Technologien vor und geben einen kurzen Überblick über wissenschaftliche Herausforderungen in diesem Bereich.

  @article{info3-article-2013-111, abstract = {Big Data ist neben Cloud Computing und Crowdsourcing eine der wichtigsten neuen Technologie-Treiber und wird daher im Aktuellen Schlagwort näher beleuchtet. Zu Beginn gehen wir auf die Definition von Big Data ein und erläutern die Unterschiede zu traditionellen Verfahren. Im Anschluss daran stellen wir zugrundeliegende Technologien vor und geben einen kurzen Überblick über wissenschaftliche Herausforderungen in diesem Bereich.}, author = {Klein, Dominik and Tran-Gia, Phuoc and Hartmann, Matthias}, journal = {Informatik-Spektrum}, keywords = {sys:hidden:article}, month = 6, pages = {319-323}, title = {Aktuelles Schlagwort: Big Data}, volume = 36, year = 2013 }

  %0 Journal Article %1 info3-article-2013-111 %A Klein, Dominik %A Tran-Gia, Phuoc %A Hartmann, Matthias %D 2013 %J Informatik-Spektrum %P 319-323 %T Aktuelles Schlagwort: Big Data %V 36 %X Big Data ist neben Cloud Computing und Crowdsourcing eine der wichtigsten neuen Technologie-Treiber und wird daher im Aktuellen Schlagwort näher beleuchtet. Zu Beginn gehen wir auf die Definition von Big Data ein und erläutern die Unterschiede zu traditionellen Verfahren. Im Anschluss daran stellen wir zugrundeliegende Technologien vor und geben einen kurzen Überblick über wissenschaftliche Herausforderungen in diesem Bereich.
• Pareto-Optimal Resilient Controller Placement in SDN-based Core Networks Hock, David; Hartmann, Matthias; Gebert, Steffen; Jarschel, Michael; Zinner, Thomas; Tran-Gia, Phuoc in 25th International Teletraffic Congress (ITC) (2013).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  With the introduction of Software Defined Networking (SDN), the concept of an external and optionally centralized network control plane, i.e. controller, is drawing the attention of researchers and industry. A particularly important task in the SDN context is the placement of such external resources in the network. In this paper, we discuss important aspects of the controller placement problem with a focus on SDN-based core networks, including different types of resilience and failure tolerance. When several performance and resilience metrics are considered, there is usually no single best controller placement solution, but a trade-off between these metrics. We introduce our framework for resilient Pareto-based Optimal COntroller-placement (POCO) that provides the operator of a network with all Pareto-optimal placements. The ideas and mechanisms are illustrated using the Internet2 OS3E topology and further evaluated on more than 140 topologies of the Topology Zoo. In particular, our findings reveal that for most of the topologies more than 20% of all nodes need to be controllers to assure a continuous connection of all nodes to one of the controllers in any arbitrary double link or node failure scenario.

  @inproceedings{info3-inproceedings-2013-466, abstract = {With the introduction of Software Defined Networking (SDN), the concept of an external and optionally centralized network control plane, i.e. controller, is drawing the attention of researchers and industry. A particularly important task in the SDN context is the placement of such external resources in the network. In this paper, we discuss important aspects of the controller placement problem with a focus on SDN-based core networks, including different types of resilience and failure tolerance. When several performance and resilience metrics are considered, there is usually no single best controller placement solution, but a trade-off between these metrics. We introduce our framework for resilient Pareto-based Optimal COntroller-placement (POCO) that provides the operator of a network with all Pareto-optimal placements. The ideas and mechanisms are illustrated using the Internet2 OS3E topology and further evaluated on more than 140 topologies of the Topology Zoo. In particular, our findings reveal that for most of the topologies more than 20% of all nodes need to be controllers to assure a continuous connection of all nodes to one of the controllers in any arbitrary double link or node failure scenario.}, address = {Shanghai, China}, author = {Hock, David and Hartmann, Matthias and Gebert, Steffen and Jarschel, Michael and Zinner, Thomas and Tran-Gia, Phuoc}, booktitle = {25th International Teletraffic Congress (ITC)}, keywords = {poco}, month = 9, title = {Pareto-Optimal Resilient Controller Placement in SDN-based Core Networks}, year = 2013 }

  %0 Conference Paper %1 info3-inproceedings-2013-466 %A Hock, David %A Hartmann, Matthias %A Gebert, Steffen %A Jarschel, Michael %A Zinner, Thomas %A Tran-Gia, Phuoc %B 25th International Teletraffic Congress (ITC) %C Shanghai, China %D 2013 %T Pareto-Optimal Resilient Controller Placement in SDN-based Core Networks %X With the introduction of Software Defined Networking (SDN), the concept of an external and optionally centralized network control plane, i.e. controller, is drawing the attention of researchers and industry. A particularly important task in the SDN context is the placement of such external resources in the network. In this paper, we discuss important aspects of the controller placement problem with a focus on SDN-based core networks, including different types of resilience and failure tolerance. When several performance and resilience metrics are considered, there is usually no single best controller placement solution, but a trade-off between these metrics. We introduce our framework for resilient Pareto-based Optimal COntroller-placement (POCO) that provides the operator of a network with all Pareto-optimal placements. The ideas and mechanisms are illustrated using the Internet2 OS3E topology and further evaluated on more than 140 topologies of the Topology Zoo. In particular, our findings reveal that for most of the topologies more than 20% of all nodes need to be controllers to assure a continuous connection of all nodes to one of the controllers in any arbitrary double link or node failure scenario.
• Global Locator, Local Locator, and Identifier Split (GLI-Split) Menth, Michael; Hartmann, Matthias; Klein, Dominik in Future Internet (2013). 5 67–94.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  The locator/identifier split is an approach for a new addressing and routing architecture to make routing in the core of the Internet more scalable. Based on this principle, we developed the GLI-Split framework, which separates the functionality of current IP addresses into a stable identifier and two independent locators, one for routing in the Internet core and one for edge networks. This makes routing in the Internet more stable and provides more flexibility for edge networks. GLI-Split can be incrementally deployed and it is backward-compatible with the IPv6 Internet. We describe its architecture, compare it to other approaches, present its benefits, and finally present a proof-of-concept implementation of GLI-Split.

  @article{info3-article-2013-110, abstract = {The locator/identifier split is an approach for a new addressing and routing architecture to make routing in the core of the Internet more scalable. Based on this principle, we developed the GLI-Split framework, which separates the functionality of current IP addresses into a stable identifier and two independent locators, one for routing in the Internet core and one for edge networks. This makes routing in the Internet more stable and provides more flexibility for edge networks. GLI-Split can be incrementally deployed and it is backward-compatible with the IPv6 Internet. We describe its architecture, compare it to other approaches, present its benefits, and finally present a proof-of-concept implementation of GLI-Split.}, author = {Menth, Michael and Hartmann, Matthias and Klein, Dominik}, journal = {Future Internet}, keywords = {sys:hidden:article}, month = 3, pages = {67-94}, title = {Global Locator, Local Locator, and Identifier Split (GLI-Split)}, volume = 5, year = 2013 }

  %0 Journal Article %1 info3-article-2013-110 %A Menth, Michael %A Hartmann, Matthias %A Klein, Dominik %D 2013 %J Future Internet %P 67-94 %T Global Locator, Local Locator, and Identifier Split (GLI-Split) %V 5 %X The locator/identifier split is an approach for a new addressing and routing architecture to make routing in the core of the Internet more scalable. Based on this principle, we developed the GLI-Split framework, which separates the functionality of current IP addresses into a stable identifier and two independent locators, one for routing in the Internet core and one for edge networks. This makes routing in the Internet more stable and provides more flexibility for edge networks. GLI-Split can be incrementally deployed and it is backward-compatible with the IPv6 Internet. We describe its architecture, compare it to other approaches, present its benefits, and finally present a proof-of-concept implementation of GLI-Split.
• A Survey of Mapping Systems for Locator/Identifier Split Internet Routing Hoefling, Michael; Menth, Michael; Hartmann, Matthias in IEEE Communications Surveys & Tutorials (2013). 14 1842–1858.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  The locator/identifier split is a core principle of many recently proposed routing architectures for a scalable future Internet. It splits the function of today’s IP addresses into two separate pieces. End-hosts are addressed using identifiers which are not globally routable while network attachment points have globally routable locators assigned. In most architectures, either the sending host or an intermediate node has to query a mapping system to obtain locators for identifiers. Such a mapping system must be fast, reliable, secure, and may be able to relay data packets. In this paper, we propose requirements and a general taxonomy for mapping systems and use it to provide a survey on recent proposals. We address general aspects of mapping systems and point out remaining research opportunities.

  @article{info3-article-2013-106, abstract = {The locator/identifier split is a core principle of many recently proposed routing architectures for a scalable future Internet. It splits the function of today’s IP addresses into two separate pieces. End-hosts are addressed using identifiers which are not globally routable while network attachment points have globally routable locators assigned. In most architectures, either the sending host or an intermediate node has to query a mapping system to obtain locators for identifiers. Such a mapping system must be fast, reliable, secure, and may be able to relay data packets. In this paper, we propose requirements and a general taxonomy for mapping systems and use it to provide a survey on recent proposals. We address general aspects of mapping systems and point out remaining research opportunities.}, author = {Hoefling, Michael and Menth, Michael and Hartmann, Matthias}, journal = {IEEE Communications Surveys & Tutorials}, keywords = {sys:hidden:article}, month = 11, pages = {1842 - 1858}, title = {A Survey of Mapping Systems for Locator/Identifier Split Internet Routing}, volume = 14, year = 2013 }

  %0 Journal Article %1 info3-article-2013-106 %A Hoefling, Michael %A Menth, Michael %A Hartmann, Matthias %D 2013 %J IEEE Communications Surveys & Tutorials %P 1842 - 1858 %T A Survey of Mapping Systems for Locator/Identifier Split Internet Routing %V 14 %X The locator/identifier split is a core principle of many recently proposed routing architectures for a scalable future Internet. It splits the function of today’s IP addresses into two separate pieces. End-hosts are addressed using identifiers which are not globally routable while network attachment points have globally routable locators assigned. In most architectures, either the sending host or an intermediate node has to query a mapping system to obtain locators for identifiers. Such a mapping system must be fast, reliable, secure, and may be able to relay data packets. In this paper, we propose requirements and a general taxonomy for mapping systems and use it to provide a survey on recent proposals. We address general aspects of mapping systems and point out remaining research opportunities.
• Comparison of IP-Based and Explicit Paths for One-to-One Fast Reroute in MPLS Networks Hock, David; Hartmann, Matthias; Menth, Michael; Pióro, Michał; Tomaszewski, Artur; Żukowski, Cezary in Telecommunication Systems (TS) Journal (2013). 52 947–958.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Primary and backup paths in MPLS fast reroute (FRR) may be established as shortest paths according to the administrative link costs of the IP control plane, or as explicitly calculated arbitrary paths. In both cases, the path layout can be optimized so that the maximum link utilization for a specific traffic matrix and for a set of considered failure scenarios is minimized. In this paper, we propose a linear program for the optimization of the path layout for explicitly calculated paths, which can either produce single paths and route entire traffic along those paths, or generate multiple paths and spread the traffic among those paths providing load balancing. We compare the resulting lowest maximum link utilization in both cases with the lowest maximum link utilization that can be obtained by optimizing unique IP-based paths. Our results quantify the gain in resource efficiency usage provided by optimized explicit multiple paths or explicit single paths as compared to optimized IP-based paths. Furthermore, we investigate if explicit path layouts cause an increased configuration effort compared to IP-based layouts and if yes, to what extend.

  @article{info3-article-2013-86, abstract = {Primary and backup paths in MPLS fast reroute (FRR) may be established as shortest paths according to the administrative link costs of the IP control plane, or as explicitly calculated arbitrary paths. In both cases, the path layout can be optimized so that the maximum link utilization for a specific traffic matrix and for a set of considered failure scenarios is minimized. In this paper, we propose a linear program for the optimization of the path layout for explicitly calculated paths, which can either produce single paths and route entire traffic along those paths, or generate multiple paths and spread the traffic among those paths providing load balancing. We compare the resulting lowest maximum link utilization in both cases with the lowest maximum link utilization that can be obtained by optimizing unique IP-based paths. Our results quantify the gain in resource efficiency usage provided by optimized explicit multiple paths or explicit single paths as compared to optimized IP-based paths. Furthermore, we investigate if explicit path layouts cause an increased configuration effort compared to IP-based layouts and if yes, to what extend.}, author = {Hock, David and Hartmann, Matthias and Menth, Michael and Pióro, Michał and Tomaszewski, Artur and Żukowski, Cezary}, journal = {Telecommunication Systems (TS) Journal}, keywords = {sys:hidden:article}, month = 2, pages = {947-958}, title = {Comparison of IP-Based and Explicit Paths for One-to-One Fast Reroute in MPLS Networks}, volume = 52, year = 2013 }

  %0 Journal Article %1 info3-article-2013-86 %A Hock, David %A Hartmann, Matthias %A Menth, Michael %A Pióro, Michał %A Tomaszewski, Artur %A Żukowski, Cezary %D 2013 %J Telecommunication Systems (TS) Journal %P 947-958 %T Comparison of IP-Based and Explicit Paths for One-to-One Fast Reroute in MPLS Networks %V 52 %X Primary and backup paths in MPLS fast reroute (FRR) may be established as shortest paths according to the administrative link costs of the IP control plane, or as explicitly calculated arbitrary paths. In both cases, the path layout can be optimized so that the maximum link utilization for a specific traffic matrix and for a set of considered failure scenarios is minimized. In this paper, we propose a linear program for the optimization of the path layout for explicitly calculated paths, which can either produce single paths and route entire traffic along those paths, or generate multiple paths and spread the traffic among those paths providing load balancing. We compare the resulting lowest maximum link utilization in both cases with the lowest maximum link utilization that can be obtained by optimizing unique IP-based paths. Our results quantify the gain in resource efficiency usage provided by optimized explicit multiple paths or explicit single paths as compared to optimized IP-based paths. Furthermore, we investigate if explicit path layouts cause an increased configuration effort compared to IP-based layouts and if yes, to what extend.

• Integration of LISP and LISP-MN into INET Klein, Dominik; Höfling, Michael; Hartmann, Matthias; Menth, Michael in 5th International Workshop on OMNeT++ (2012). 299–306.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  The Locator/Identifier Separation Protocol (LISP) is a new naming and addressing architecture which is currently standardized in the IETF and which is deemed to improve the scalability and flexibility of the current routing architecture. LISP mobile node (LISP-MN) is an extension to the basic LISP architecture and enables mobile nodes to roam into LISP and non-LISP domains. The basic LISP architecture is currently deployed in a beta-network which can be used to test the protocol behavior on a smaller scale. However, a realistic simulation model for the LISP architecture and its various extensions is still missing. Such a simulation model could be used by researchers to quickly test new extensions on a larger scale for different load and network scenarios. In this paper, we describe the implementation of our model of the LISP architecture and its various extensions in the INET framework for OMNeT++. We present performance results to show the correctness of our model. As a first application, we used the simulation model to assess proposed improvements to LISP-MN and to verify our proposed NAT traversal mechanism for LISP-MN.

  @inproceedings{info3-inproceedings-2012-435, abstract = {The Locator/Identifier Separation Protocol (LISP) is a new naming and addressing architecture which is currently standardized in the IETF and which is deemed to improve the scalability and flexibility of the current routing architecture. LISP mobile node (LISP-MN) is an extension to the basic LISP architecture and enables mobile nodes to roam into LISP and non-LISP domains. The basic LISP architecture is currently deployed in a beta-network which can be used to test the protocol behavior on a smaller scale. However, a realistic simulation model for the LISP architecture and its various extensions is still missing. Such a simulation model could be used by researchers to quickly test new extensions on a larger scale for different load and network scenarios. In this paper, we describe the implementation of our model of the LISP architecture and its various extensions in the INET framework for OMNeT++. We present performance results to show the correctness of our model. As a first application, we used the simulation model to assess proposed improvements to LISP-MN and to verify our proposed NAT traversal mechanism for LISP-MN.}, address = {Desenzano, Italy}, author = {Klein, Dominik and Höfling, Michael and Hartmann, Matthias and Menth, Michael}, booktitle = {5th International Workshop on OMNeT++}, keywords = {sys:hidden:inproceedings}, month = 3, pages = {299-306}, title = {Integration of LISP and LISP-MN into INET}, year = 2012 }

  %0 Conference Paper %1 info3-inproceedings-2012-435 %A Klein, Dominik %A Höfling, Michael %A Hartmann, Matthias %A Menth, Michael %B 5th International Workshop on OMNeT++ %C Desenzano, Italy %D 2012 %P 299-306 %T Integration of LISP and LISP-MN into INET %X The Locator/Identifier Separation Protocol (LISP) is a new naming and addressing architecture which is currently standardized in the IETF and which is deemed to improve the scalability and flexibility of the current routing architecture. LISP mobile node (LISP-MN) is an extension to the basic LISP architecture and enables mobile nodes to roam into LISP and non-LISP domains. The basic LISP architecture is currently deployed in a beta-network which can be used to test the protocol behavior on a smaller scale. However, a realistic simulation model for the LISP architecture and its various extensions is still missing. Such a simulation model could be used by researchers to quickly test new extensions on a larger scale for different load and network scenarios. In this paper, we describe the implementation of our model of the LISP architecture and its various extensions in the INET framework for OMNeT++. We present performance results to show the correctness of our model. As a first application, we used the simulation model to assess proposed improvements to LISP-MN and to verify our proposed NAT traversal mechanism for LISP-MN.
• Parameters and Challenges for Virtual Network Embedding in the Future Internet Stezenbach, David; Hartmann, Matthias; Tutschku, Kurt in First IEEE Workshop on Algorithms and Operating Procedures for Federated Virtualized Networks (FEDNET2012) – Collocated with IEEE NOMS 2012 (2012).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  Recent developments in network science will facilitate the Internet as we know it today to integrate existing and upcoming technologies into a heterogeneous and highly dynamic resource pool. This enables the design of new applications and services which will form the Future Internet (FI). From this, many interesting prospects and unknown flexibility in terms of resource usage arise. In order to achieve this flexibility and make it usable for Service Providers (SPs) the FI will be build upon Virtual Networks (VNs) embedded into this resource pool. Furthermore, a closer interaction, resource sharing, and information exchange between providers, we refer to as Federation will be an enabler for this freedom of design. This allows the operation of heterogeneous and divergent services on the same physical infrastructure substrate. It is clear to see that all these upcoming possibilities offer new areas of research. In this work we structure the parameters required to describe resources and services accurately. Furthermore, we summarize research questions that need to be resolved in order to make the FI a story of success.

  @inproceedings{info3-inproceedings-2012-440, abstract = {Recent developments in network science will facilitate the Internet as we know it today to integrate existing and upcoming technologies into a heterogeneous and highly dynamic resource pool. This enables the design of new applications and services which will form the Future Internet (FI). From this, many interesting prospects and unknown flexibility in terms of resource usage arise. In order to achieve this flexibility and make it usable for Service Providers (SPs) the FI will be build upon Virtual Networks (VNs) embedded into this resource pool. Furthermore, a closer interaction, resource sharing, and information exchange between providers, we refer to as Federation will be an enabler for this freedom of design. This allows the operation of heterogeneous and divergent services on the same physical infrastructure substrate. It is clear to see that all these upcoming possibilities offer new areas of research. In this work we structure the parameters required to describe resources and services accurately. Furthermore, we summarize research questions that need to be resolved in order to make the FI a story of success.}, address = {Maui, Hawaii, USA}, author = {Stezenbach, David and Hartmann, Matthias and Tutschku, Kurt}, booktitle = {First IEEE Workshop on Algorithms and Operating Procedures for Federated Virtualized Networks (FEDNET2012) – Collocated with IEEE NOMS 2012}, keywords = {sys:hidden:inproceedings}, month = 6, title = {Parameters and Challenges for Virtual Network Embedding in the Future Internet}, year = 2012 }

  %0 Conference Paper %1 info3-inproceedings-2012-440 %A Stezenbach, David %A Hartmann, Matthias %A Tutschku, Kurt %B First IEEE Workshop on Algorithms and Operating Procedures for Federated Virtualized Networks (FEDNET2012) – Collocated with IEEE NOMS 2012 %C Maui, Hawaii, USA %D 2012 %T Parameters and Challenges for Virtual Network Embedding in the Future Internet %X Recent developments in network science will facilitate the Internet as we know it today to integrate existing and upcoming technologies into a heterogeneous and highly dynamic resource pool. This enables the design of new applications and services which will form the Future Internet (FI). From this, many interesting prospects and unknown flexibility in terms of resource usage arise. In order to achieve this flexibility and make it usable for Service Providers (SPs) the FI will be build upon Virtual Networks (VNs) embedded into this resource pool. Furthermore, a closer interaction, resource sharing, and information exchange between providers, we refer to as Federation will be an enabler for this freedom of design. This allows the operation of heterogeneous and divergent services on the same physical infrastructure substrate. It is clear to see that all these upcoming possibilities offer new areas of research. In this work we structure the parameters required to describe resources and services accurately. Furthermore, we summarize research questions that need to be resolved in order to make the FI a story of success.
• Cloud Interoperability Hartmann, Matthias (2012, November 27).
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2012-460, address = {Datev Trendscout, Nürnberg}, author = {Hartmann, Matthias}, keywords = {sys:hidden:presentation}, month = 11, title = {Cloud Interoperability}, year = 2012 }

  %0 Generic %1 info3-talk-2012-460 %A Hartmann, Matthias %C Datev Trendscout, Nürnberg %D 2012 %T Cloud Interoperability

• Compact node-link formulations for the optimal single path MPLS Fast Reroute layout Żukowski, Cezary; Tomaszewski, Artur; Pióro, Michał; Hock, David; Hartmann, Matthias; Menth, Michael in Advances in Electronics and Telecommunications (2011). 2
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  This paper discusses compact node-link formulations for MPLS fast reroute optimal single path layout. We propose mathematical formulations for MPLS fast reroute local protection mechanisms. In fact, we compare one-to-one (also called detour) local protection and many-to-one (also called facility backup) local protection mechanisms with respect to minimized maximum link utilization. The optimal results provided by the node-links are compared with the suboptimal results provided by algorithms based on non-compact linear programming (path generation) approach and IP-based approach.

  @article{info3-article-2011-104, abstract = {This paper discusses compact node-link formulations for MPLS fast reroute optimal single path layout. We propose mathematical formulations for MPLS fast reroute local protection mechanisms. In fact, we compare one-to-one (also called detour) local protection and many-to-one (also called facility backup) local protection mechanisms with respect to minimized maximum link utilization. The optimal results provided by the node-links are compared with the suboptimal results provided by algorithms based on non-compact linear programming (path generation) approach and IP-based approach.}, author = {Żukowski, Cezary and Tomaszewski, Artur and Pióro, Michał and Hock, David and Hartmann, Matthias and Menth, Michael}, journal = {Advances in Electronics and Telecommunications}, keywords = {sys:hidden:article}, month = 9, title = {Compact node-link formulations for the optimal single path MPLS Fast Reroute layout}, volume = 2, year = 2011 }

  %0 Journal Article %1 info3-article-2011-104 %A Żukowski, Cezary %A Tomaszewski, Artur %A Pióro, Michał %A Hock, David %A Hartmann, Matthias %A Menth, Michael %D 2011 %J Advances in Electronics and Telecommunications %T Compact node-link formulations for the optimal single path MPLS Fast Reroute layout %V 2 %X This paper discusses compact node-link formulations for MPLS fast reroute optimal single path layout. We propose mathematical formulations for MPLS fast reroute local protection mechanisms. In fact, we compare one-to-one (also called detour) local protection and many-to-one (also called facility backup) local protection mechanisms with respect to minimized maximum link utilization. The optimal results provided by the node-links are compared with the suboptimal results provided by algorithms based on non-compact linear programming (path generation) approach and IP-based approach.
• ResiLyzer: Ein Werkzeug zur Analyse der Ausfallsicherheit in paketvermittelten Kommunikationsnetzen Hock, David; Hartmann, Matthias; Schwartz, Christian; Menth, Michael in PIK - Praxis der Informationsverarbeitung und Kommunikation (2011). 34 158–159.
  • [ BibTeX ]
  • [ EndNote ]
  @article{info3-article-2011-105, author = {Hock, David and Hartmann, Matthias and Schwartz, Christian and Menth, Michael}, journal = {PIK - Praxis der Informationsverarbeitung und Kommunikation}, keywords = {sys:hidden:article}, month = 8, pages = {158-159}, title = {ResiLyzer: Ein Werkzeug zur Analyse der Ausfallsicherheit in paketvermittelten Kommunikationsnetzen}, volume = 34, year = 2011 }

  %0 Journal Article %1 info3-article-2011-105 %A Hock, David %A Hartmann, Matthias %A Schwartz, Christian %A Menth, Michael %D 2011 %J PIK - Praxis der Informationsverarbeitung und Kommunikation %P 158-159 %T ResiLyzer: Ein Werkzeug zur Analyse der Ausfallsicherheit in paketvermittelten Kommunikationsnetzen %V 34
• Loop-Free Convergence using Ordered FIB Updates: Analysis and Routing Optimization Hock, David; Hartmann, Matthias; Neubert, Tim; Menth, Michael in 8th International Workshop on the Design of Reliable Communication Networks (DRCN) (2011).
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @inproceedings{info3-inproceedings-2011-420, address = {Krakow, Poland}, author = {Hock, David and Hartmann, Matthias and Neubert, Tim and Menth, Michael}, booktitle = {8th International Workshop on the Design of Reliable Communication Networks (DRCN)}, keywords = {sys:hidden:inproceedings}, month = 10, title = {Loop-Free Convergence using Ordered FIB Updates: Analysis and Routing Optimization}, year = 2011 }

  %0 Conference Paper %1 info3-inproceedings-2011-420 %A Hock, David %A Hartmann, Matthias %A Neubert, Tim %A Menth, Michael %B 8th International Workshop on the Design of Reliable Communication Networks (DRCN) %C Krakow, Poland %D 2011 %T Loop-Free Convergence using Ordered FIB Updates: Analysis and Routing Optimization
• Compact node-link formulations for the optimal single path MPLS Fast Reroute layout Żukowski, Cezary; Tomaszewski, Artur; Pióro, Michał; Hock, David; Hartmann, Matthias; Menth, Michael in 1st European Teletraffic Seminar (ETS) (2011).
  • [ BibTeX ]
  • [ EndNote ]
  @inproceedings{info3-inproceedings-2011-408, address = {Poznan, Poland}, author = {Żukowski, Cezary and Tomaszewski, Artur and Pióro, Michał and Hock, David and Hartmann, Matthias and Menth, Michael}, booktitle = {1st European Teletraffic Seminar (ETS)}, keywords = {sys:hidden:inproceedings}, month = 2, title = {Compact node-link formulations for the optimal single path MPLS Fast Reroute layout}, year = 2011 }

  %0 Conference Paper %1 info3-inproceedings-2011-408 %A Żukowski, Cezary %A Tomaszewski, Artur %A Pióro, Michał %A Hock, David %A Hartmann, Matthias %A Menth, Michael %B 1st European Teletraffic Seminar (ETS) %C Poznan, Poland %D 2011 %T Compact node-link formulations for the optimal single path MPLS Fast Reroute layout
• ResiLyzer: Ein Werkzeug zur Analyse der Ausfallsicherheit in paketvermittelten Kommunikationsnetzen Hock, David; Hartmann, Matthias; Schwartz, Christian; Menth, Michael (2011, March).
  • [ BibTeX ]
  • [ EndNote ]
  @misc{info3-software-2011-4, address = {Kiel, Germany}, author = {Hock, David and Hartmann, Matthias and Schwartz, Christian and Menth, Michael}, booktitle = {PIK-Praxis der Informationsverarbeitung und Kommunikation}, keywords = {sys:hidden:software}, month = 3, title = {ResiLyzer: Ein Werkzeug zur Analyse der Ausfallsicherheit in paketvermittelten Kommunikationsnetzen}, year = 2011 }

  %0 Generic %1 info3-software-2011-4 %A Hock, David %A Hartmann, Matthias %A Schwartz, Christian %A Menth, Michael %B PIK-Praxis der Informationsverarbeitung und Kommunikation %C Kiel, Germany %D 2011 %T ResiLyzer: Ein Werkzeug zur Analyse der Ausfallsicherheit in paketvermittelten Kommunikationsnetzen

• Loop-Free Alternates and Not-Via Addresses: A Proper Combination for IP Fast Reroute? Menth, Michael; Hartmann, Matthias; Martin, Rüdiger; Cicic, Tarik; Kvalbein, Amund in Computer Networks (2010). 54 1300–1315.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  The IETF currently discusses fast reroute mechanisms for IP networks (IP FRR). IP FRR accelerates the recovery in case of network element failures and avoids micro-loops during re-convergence. Several mechanisms are proposed. Loop-free alternates (LFAs) are simple but cannot cover all single link and node failures. Not-via addresses can protect against these failures but are more complex, in particular, they use tunneling techniques to deviate backup traffic. In the IETF it has been proposed to combine both mechanisms to merge their advantages: simplicity and full failure coverage. This work analyzes LFAs and classifies them according to their abilities. We qualitatively compare LFAs and not-via addresses and develop a concept for their combined application to achieve 100% single failure coverage, while using simple LFAs wherever possible. The applicability of existing LFAs depends on the resilience requirements of the network. We study the backup path length and the link utilization for both IP FRR methods and quantify the decapsulation load and the increase of the routing table size caused by not-via addresses. We conclude that the combined usage of both methods has no advantage compared to the application of not-via addresses only.

  @article{info3-article-2010-70, abstract = {The IETF currently discusses fast reroute mechanisms for IP networks (IP FRR). IP FRR accelerates the recovery in case of network element failures and avoids micro-loops during re-convergence. Several mechanisms are proposed. Loop-free alternates (LFAs) are simple but cannot cover all single link and node failures. Not-via addresses can protect against these failures but are more complex, in particular, they use tunneling techniques to deviate backup traffic. In the IETF it has been proposed to combine both mechanisms to merge their advantages: simplicity and full failure coverage. This work analyzes LFAs and classifies them according to their abilities. We qualitatively compare LFAs and not-via addresses and develop a concept for their combined application to achieve 100% single failure coverage, while using simple LFAs wherever possible. The applicability of existing LFAs depends on the resilience requirements of the network. We study the backup path length and the link utilization for both IP FRR methods and quantify the decapsulation load and the increase of the routing table size caused by not-via addresses. We conclude that the combined usage of both methods has no advantage compared to the application of not-via addresses only.}, author = {Menth, Michael and Hartmann, Matthias and Martin, Rüdiger and Cicic, Tarik and Kvalbein, Amund}, journal = {Computer Networks}, keywords = {sys:hidden:article}, month = 6, pages = {1300-1315}, title = {Loop-Free Alternates and Not-Via Addresses: A Proper Combination for IP Fast Reroute?}, volume = 54, year = 2010 }

  %0 Journal Article %1 info3-article-2010-70 %A Menth, Michael %A Hartmann, Matthias %A Martin, Rüdiger %A Cicic, Tarik %A Kvalbein, Amund %D 2010 %J Computer Networks %P 1300-1315 %T Loop-Free Alternates and Not-Via Addresses: A Proper Combination for IP Fast Reroute? %V 54 %X The IETF currently discusses fast reroute mechanisms for IP networks (IP FRR). IP FRR accelerates the recovery in case of network element failures and avoids micro-loops during re-convergence. Several mechanisms are proposed. Loop-free alternates (LFAs) are simple but cannot cover all single link and node failures. Not-via addresses can protect against these failures but are more complex, in particular, they use tunneling techniques to deviate backup traffic. In the IETF it has been proposed to combine both mechanisms to merge their advantages: simplicity and full failure coverage. This work analyzes LFAs and classifies them according to their abilities. We qualitatively compare LFAs and not-via addresses and develop a concept for their combined application to achieve 100% single failure coverage, while using simple LFAs wherever possible. The applicability of existing LFAs depends on the resilience requirements of the network. We study the backup path length and the link utilization for both IP FRR methods and quantify the decapsulation load and the increase of the routing table size caused by not-via addresses. We conclude that the combined usage of both methods has no advantage compared to the application of not-via addresses only.
• FIRMS - Demonstration of a Mapping System for Loc/ID Split Internet Routing in G-Lab Hartmann, Matthias; Hock, David; Höfling, Michael; Neubert, Tim; Menth, Michael (2010, July).
  • [ BibTeX ]
  • [ EndNote ]
  @misc{info3-software-2010-12, address = {Würzburg, Germany}, author = {Hartmann, Matthias and Hock, David and Höfling, Michael and Neubert, Tim and Menth, Michael}, keywords = {sys:hidden:software}, month = 7, title = {FIRMS - Demonstration of a Mapping System for Loc/ID Split Internet Routing in G-Lab}, year = 2010 }

  %0 Generic %1 info3-software-2010-12 %A Hartmann, Matthias %A Hock, David %A Höfling, Michael %A Neubert, Tim %A Menth, Michael %C Würzburg, Germany %D 2010 %T FIRMS - Demonstration of a Mapping System for Loc/ID Split Internet Routing in G-Lab
• Improvements to LISP Mobile Node Including NAT Traversal Klein, Dominik; Hartmann, Matthias; Höfling, Michael; Menth, Michael (2010, August).
  • [ BibTeX ]
  • [ EndNote ]
  @misc{info3-software-2010-15, address = {Würzburg, Germany}, author = {Klein, Dominik and Hartmann, Matthias and Höfling, Michael and Menth, Michael}, keywords = {sys:hidden:software}, month = 8, title = {Improvements to LISP Mobile Node Including NAT Traversal}, year = 2010 }

  %0 Generic %1 info3-software-2010-15 %A Klein, Dominik %A Hartmann, Matthias %A Höfling, Michael %A Menth, Michael %C Würzburg, Germany %D 2010 %T Improvements to LISP Mobile Node Including NAT Traversal
• FIRMS: A Mapping System for Future Internet Routing Menth, Michael; Hartmann, Matthias; Hoefling, Michael in IEEE Journal on Selected Areas in Communications (JSAC), Special Issue on Internet Routing Scalability (2010). 28 1326–1331.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  The locator/identifier split is a design principle for new routing architectures that make Internet routing more scalable. To find the location of a host, it requires a mapping system that returns appropriate locators in response to map-requests for specific identifiers. In this paper, we propose FIRMS, a 'Future Internet Routing Mapping System'. It is fast, scalable, reliable, secure, and it is able to relay initial packets. We introduce its design, show how it deals with partial failures, explain its security concept, and evaluate its scalability.

  @article{info3-article-2010-81, abstract = {The locator/identifier split is a design principle for new routing architectures that make Internet routing more scalable. To find the location of a host, it requires a mapping system that returns appropriate locators in response to map-requests for specific identifiers. In this paper, we propose FIRMS, a 'Future Internet Routing Mapping System'. It is fast, scalable, reliable, secure, and it is able to relay initial packets. We introduce its design, show how it deals with partial failures, explain its security concept, and evaluate its scalability.}, author = {Menth, Michael and Hartmann, Matthias and Hoefling, Michael}, journal = {IEEE Journal on Selected Areas in Communications (JSAC), Special Issue on Internet Routing Scalability}, keywords = {sys:hidden:article}, month = 10, pages = {1326-1331}, title = {FIRMS: A Mapping System for Future Internet Routing}, volume = 28, year = 2010 }

  %0 Journal Article %1 info3-article-2010-81 %A Menth, Michael %A Hartmann, Matthias %A Hoefling, Michael %D 2010 %J IEEE Journal on Selected Areas in Communications (JSAC), Special Issue on Internet Routing Scalability %P 1326-1331 %T FIRMS: A Mapping System for Future Internet Routing %V 28 %X The locator/identifier split is a design principle for new routing architectures that make Internet routing more scalable. To find the location of a host, it requires a mapping system that returns appropriate locators in response to map-requests for specific identifiers. In this paper, we propose FIRMS, a 'Future Internet Routing Mapping System'. It is fast, scalable, reliable, secure, and it is able to relay initial packets. We introduce its design, show how it deals with partial failures, explain its security concept, and evaluate its scalability.
• ResiLyzer: A Tool for Resilience Analysis in Packet-Switched Communication Networks Hock, David; Menth, Michael; Hartmann, Matthias; Schwartz, Christian; Stezenbach, David in 15th International GI/ITG Conference on Measurement, Modelling and Evaluation of Computing Systems and Dependability and Fault Tolerance (MMB & DFT 2010) (2010).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  We present a tool for the analysis of fault-tolerance in packet-switched communication networks. Network elements like links or routers can fail or unexpected traffic surges may occur. They lead to service disruptions and degradations. Our tool quantifies these risks and presents a comprehensive digest of the results. We explain the core idea of the analysis and illustrate the tool.

  @inproceedings{info3-inproceedings-2010-365, abstract = {We present a tool for the analysis of fault-tolerance in packet-switched communication networks. Network elements like links or routers can fail or unexpected traffic surges may occur. They lead to service disruptions and degradations. Our tool quantifies these risks and presents a comprehensive digest of the results. We explain the core idea of the analysis and illustrate the tool.}, address = {Essen, Germany}, author = {Hock, David and Menth, Michael and Hartmann, Matthias and Schwartz, Christian and Stezenbach, David}, booktitle = {15th International GI/ITG Conference on Measurement, Modelling and Evaluation of Computing Systems and Dependability and Fault Tolerance (MMB & DFT 2010)}, keywords = {sys:hidden:inproceedings}, month = 3, title = {ResiLyzer: A Tool for Resilience Analysis in Packet-Switched Communication Networks}, year = 2010 }

  %0 Conference Paper %1 info3-inproceedings-2010-365 %A Hock, David %A Menth, Michael %A Hartmann, Matthias %A Schwartz, Christian %A Stezenbach, David %B 15th International GI/ITG Conference on Measurement, Modelling and Evaluation of Computing Systems and Dependability and Fault Tolerance (MMB & DFT 2010) %C Essen, Germany %D 2010 %T ResiLyzer: A Tool for Resilience Analysis in Packet-Switched Communication Networks %X We present a tool for the analysis of fault-tolerance in packet-switched communication networks. Network elements like links or routers can fail or unexpected traffic surges may occur. They lead to service disruptions and degradations. Our tool quantifies these risks and presents a comprehensive digest of the results. We explain the core idea of the analysis and illustrate the tool.
• Optimizing Unique Shortest Paths for Resilient Routing and Fast Reroute in IP-Based Networks Hock, David; Hartmann, Matthias; Menth, Michael; Schwartz, Christian in IEEE/IFIP Network Operations and Management Symposium (NOMS) (2010).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Intradomain routing in IP networks follows shortest paths according to administrative link costs. When several equalcost shortest paths exist, routers that use equal-cost multipath (ECMP) distribute the traffic over all of them. To produce singleshortest path (SSP) routing, a selection mechanism (tie-breaker) chooses just one of the equal-cost paths. Tie-breakers are poorly standardized and use information that may change over time, which makes SSP routing unpredictable. Therefore, link costs producing unique shortest paths (USP) are preferred. In this paper, we show that optimized SSP routing can lead to significantly higher link utilization than expected in case of non-deterministic tie-breakers. We investigate the impact of the allowed link cost range on the general availability of USP routing. We use a heuristic algorithm to generate link costs for USP routing and to minimize the maximum link utilization in networks with and without failures. Fast reroute (FRR) mechanisms can repair failures faster than conventional IP rerouting by pre-computing shortest backup paths around failed network elements. However, when multiple equal-cost paths exist, the backup path layout is unpredictable. We adapt our heuristic to optimize USP routing for IP-FRR using not-via addresses and MPLS-FRR with facility and oneto- one backup. Finally, we compare the performance of USP with various other routing schemes using realistic Rocketfuel topologies.

  @inproceedings{info3-inproceedings-2010-363, abstract = {Intradomain routing in IP networks follows shortest paths according to administrative link costs. When several equalcost shortest paths exist, routers that use equal-cost multipath (ECMP) distribute the traffic over all of them. To produce singleshortest path (SSP) routing, a selection mechanism (tie-breaker) chooses just one of the equal-cost paths. Tie-breakers are poorly standardized and use information that may change over time, which makes SSP routing unpredictable. Therefore, link costs producing unique shortest paths (USP) are preferred. In this paper, we show that optimized SSP routing can lead to significantly higher link utilization than expected in case of non-deterministic tie-breakers. We investigate the impact of the allowed link cost range on the general availability of USP routing. We use a heuristic algorithm to generate link costs for USP routing and to minimize the maximum link utilization in networks with and without failures. Fast reroute (FRR) mechanisms can repair failures faster than conventional IP rerouting by pre-computing shortest backup paths around failed network elements. However, when multiple equal-cost paths exist, the backup path layout is unpredictable. We adapt our heuristic to optimize USP routing for IP-FRR using not-via addresses and MPLS-FRR with facility and oneto- one backup. Finally, we compare the performance of USP with various other routing schemes using realistic Rocketfuel topologies.}, address = {Osaka, Japan}, author = {Hock, David and Hartmann, Matthias and Menth, Michael and Schwartz, Christian}, booktitle = {IEEE/IFIP Network Operations and Management Symposium (NOMS)}, keywords = {sys:hidden:inproceedings}, month = 4, title = {Optimizing Unique Shortest Paths for Resilient Routing and Fast Reroute in IP-Based Networks}, year = 2010 }

  %0 Conference Paper %1 info3-inproceedings-2010-363 %A Hock, David %A Hartmann, Matthias %A Menth, Michael %A Schwartz, Christian %B IEEE/IFIP Network Operations and Management Symposium (NOMS) %C Osaka, Japan %D 2010 %T Optimizing Unique Shortest Paths for Resilient Routing and Fast Reroute in IP-Based Networks %X Intradomain routing in IP networks follows shortest paths according to administrative link costs. When several equalcost shortest paths exist, routers that use equal-cost multipath (ECMP) distribute the traffic over all of them. To produce singleshortest path (SSP) routing, a selection mechanism (tie-breaker) chooses just one of the equal-cost paths. Tie-breakers are poorly standardized and use information that may change over time, which makes SSP routing unpredictable. Therefore, link costs producing unique shortest paths (USP) are preferred. In this paper, we show that optimized SSP routing can lead to significantly higher link utilization than expected in case of non-deterministic tie-breakers. We investigate the impact of the allowed link cost range on the general availability of USP routing. We use a heuristic algorithm to generate link costs for USP routing and to minimize the maximum link utilization in networks with and without failures. Fast reroute (FRR) mechanisms can repair failures faster than conventional IP rerouting by pre-computing shortest backup paths around failed network elements. However, when multiple equal-cost paths exist, the backup path layout is unpredictable. We adapt our heuristic to optimize USP routing for IP-FRR using not-via addresses and MPLS-FRR with facility and oneto- one backup. Finally, we compare the performance of USP with various other routing schemes using realistic Rocketfuel topologies.
• Effectiveness of Link Cost Optimization for IP Rerouting and IP Fast Reroute Hock, David; Hartmann, Matthias; Schwartz, Christian; Menth, Michael in 15th International GI/ITG Conference on Measurement, Modelling and Evaluation of Computing Systems and Dependability and Fault Tolerance (MMB & DFT 2010) (2010).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  In this paper, we bring together resilience analysis and routing optimization for IP-based intra-domain networks. When link, node, or multiple failures occur, traffic is rerouted which increases the link load on backup paths and possibly causes congestion. Resilience analysis detects the risk of overload situations a priori based on a large set of most likely failure scenarios. To counteract, the routing can be optimized and configured that such bottlenecks are avoided at least for a smaller set of failure scenarios. In this paper, we demonstrate the effectiveness of this routing optimization in IP networks. We use resilience analysis with suitable aggregate views on relative link loads. Furthermore, we compare conventional IP rerouting with IP fast reroute (IP-FRR) and show that IP-FRR can also significantly profit from routing optimization. This paper reviews major parts of previous publications and presents a new method to visualize and compare the resilience of different routing schemes.

  @inproceedings{info3-inproceedings-2010-364, abstract = {In this paper, we bring together resilience analysis and routing optimization for IP-based intra-domain networks. When link, node, or multiple failures occur, traffic is rerouted which increases the link load on backup paths and possibly causes congestion. Resilience analysis detects the risk of overload situations a priori based on a large set of most likely failure scenarios. To counteract, the routing can be optimized and configured that such bottlenecks are avoided at least for a smaller set of failure scenarios. In this paper, we demonstrate the effectiveness of this routing optimization in IP networks. We use resilience analysis with suitable aggregate views on relative link loads. Furthermore, we compare conventional IP rerouting with IP fast reroute (IP-FRR) and show that IP-FRR can also significantly profit from routing optimization. This paper reviews major parts of previous publications and presents a new method to visualize and compare the resilience of different routing schemes.}, address = {Essen, Germany}, author = {Hock, David and Hartmann, Matthias and Schwartz, Christian and Menth, Michael}, booktitle = {15th International GI/ITG Conference on Measurement, Modelling and Evaluation of Computing Systems and Dependability and Fault Tolerance (MMB & DFT 2010)}, keywords = {sys:hidden:inproceedings}, month = 3, title = {Effectiveness of Link Cost Optimization for IP Rerouting and IP Fast Reroute}, year = 2010 }

  %0 Conference Paper %1 info3-inproceedings-2010-364 %A Hock, David %A Hartmann, Matthias %A Schwartz, Christian %A Menth, Michael %B 15th International GI/ITG Conference on Measurement, Modelling and Evaluation of Computing Systems and Dependability and Fault Tolerance (MMB & DFT 2010) %C Essen, Germany %D 2010 %T Effectiveness of Link Cost Optimization for IP Rerouting and IP Fast Reroute %X In this paper, we bring together resilience analysis and routing optimization for IP-based intra-domain networks. When link, node, or multiple failures occur, traffic is rerouted which increases the link load on backup paths and possibly causes congestion. Resilience analysis detects the risk of overload situations a priori based on a large set of most likely failure scenarios. To counteract, the routing can be optimized and configured that such bottlenecks are avoided at least for a smaller set of failure scenarios. In this paper, we demonstrate the effectiveness of this routing optimization in IP networks. We use resilience analysis with suitable aggregate views on relative link loads. Furthermore, we compare conventional IP rerouting with IP fast reroute (IP-FRR) and show that IP-FRR can also significantly profit from routing optimization. This paper reviews major parts of previous publications and presents a new method to visualize and compare the resilience of different routing schemes.
• Improvements to LISP Mobile Node Menth, Michael; Klein, Dominik; Hartmann, Matthias in 22nd International Teletraffic Congress (ITC) (2010).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  The Locator/Identifier Separation Protocol (LISP) is a new routing architecture for the Internet that separates local and global routing. It offers more flexibility to edge networks and has the potential to reduce the growths of the BGP routing tables. Recently, a concept for mobility in LISP (LISP Mobile Node, LISP-MN) was presented. We analyze LISP-MN and show that it needs double mapping lookups in all LISP gateways, leads to triangle routing under some conditions, and requires double encapsulation. We propose gradual improvements to LISP-MN that avoid these drawbacks under many conditions.

  @inproceedings{info3-inproceedings-2010-381, abstract = {The Locator/Identifier Separation Protocol (LISP) is a new routing architecture for the Internet that separates local and global routing. It offers more flexibility to edge networks and has the potential to reduce the growths of the BGP routing tables. Recently, a concept for mobility in LISP (LISP Mobile Node, LISP-MN) was presented. We analyze LISP-MN and show that it needs double mapping lookups in all LISP gateways, leads to triangle routing under some conditions, and requires double encapsulation. We propose gradual improvements to LISP-MN that avoid these drawbacks under many conditions.}, address = {Amsterdam, The Netherlands}, author = {Menth, Michael and Klein, Dominik and Hartmann, Matthias}, booktitle = {22nd International Teletraffic Congress (ITC)}, keywords = {sys:hidden:inproceedings}, month = 9, title = {Improvements to LISP Mobile Node}, year = 2010 }

  %0 Conference Paper %1 info3-inproceedings-2010-381 %A Menth, Michael %A Klein, Dominik %A Hartmann, Matthias %B 22nd International Teletraffic Congress (ITC) %C Amsterdam, The Netherlands %D 2010 %T Improvements to LISP Mobile Node %X The Locator/Identifier Separation Protocol (LISP) is a new routing architecture for the Internet that separates local and global routing. It offers more flexibility to edge networks and has the potential to reduce the growths of the BGP routing tables. Recently, a concept for mobility in LISP (LISP Mobile Node, LISP-MN) was presented. We analyze LISP-MN and show that it needs double mapping lookups in all LISP gateways, leads to triangle routing under some conditions, and requires double encapsulation. We propose gradual improvements to LISP-MN that avoid these drawbacks under many conditions.
• Optimized IP-Based vs. Explicit Paths for One-to-One Backup in MPLS Fast Reroute Pióro, Michał; Tomaszewski, Artur; Żukowski, Cezary; Hock, David; Hartmann, Matthias; Menth, Michael in 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS 2010), Best Paper Award (2010).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Primary and backup paths in MPLS fast reroute (FRR) may be established as shortest paths according to the administrative link costs of the IP control plane, or as explicitly calculated arbitrary paths. In both cases, the path layout can be optimized so that the maximum link utilization for a set of considered failure scenarios is minimized. In this paper, we propose a linear program for the optimization of the path layout for explicitly calculated paths, which can either produce single paths and route entire traffic along those paths, or generate multiple paths and spread the traffic among those paths providing load balancing. We compare the resulting lowest maximum link utilization in both cases with the lowest maximum link utilization that can be obtained by optimizing unique IP-based paths. Our results quantify the gain in resource efficiency usage provided by optimized explicit multiple paths or explicit single paths as compared to optimized IP-based paths.

  @inproceedings{info3-inproceedings-2010-389, abstract = {Primary and backup paths in MPLS fast reroute (FRR) may be established as shortest paths according to the administrative link costs of the IP control plane, or as explicitly calculated arbitrary paths. In both cases, the path layout can be optimized so that the maximum link utilization for a set of considered failure scenarios is minimized. In this paper, we propose a linear program for the optimization of the path layout for explicitly calculated paths, which can either produce single paths and route entire traffic along those paths, or generate multiple paths and spread the traffic among those paths providing load balancing. We compare the resulting lowest maximum link utilization in both cases with the lowest maximum link utilization that can be obtained by optimizing unique IP-based paths. Our results quantify the gain in resource efficiency usage provided by optimized explicit multiple paths or explicit single paths as compared to optimized IP-based paths.}, address = {Warsaw, Poland}, author = {Pióro, Michał and Tomaszewski, Artur and Żukowski, Cezary and Hock, David and Hartmann, Matthias and Menth, Michael}, booktitle = {14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS 2010), Best Paper Award}, keywords = {sys:hidden:inproceedings}, month = 9, title = {Optimized IP-Based vs. Explicit Paths for One-to-One Backup in MPLS Fast Reroute}, year = 2010 }

  %0 Conference Paper %1 info3-inproceedings-2010-389 %A Pióro, Michał %A Tomaszewski, Artur %A Żukowski, Cezary %A Hock, David %A Hartmann, Matthias %A Menth, Michael %B 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS 2010), Best Paper Award %C Warsaw, Poland %D 2010 %T Optimized IP-Based vs. Explicit Paths for One-to-One Backup in MPLS Fast Reroute %X Primary and backup paths in MPLS fast reroute (FRR) may be established as shortest paths according to the administrative link costs of the IP control plane, or as explicitly calculated arbitrary paths. In both cases, the path layout can be optimized so that the maximum link utilization for a set of considered failure scenarios is minimized. In this paper, we propose a linear program for the optimization of the path layout for explicitly calculated paths, which can either produce single paths and route entire traffic along those paths, or generate multiple paths and spread the traffic among those paths providing load balancing. We compare the resulting lowest maximum link utilization in both cases with the lowest maximum link utilization that can be obtained by optimizing unique IP-based paths. Our results quantify the gain in resource efficiency usage provided by optimized explicit multiple paths or explicit single paths as compared to optimized IP-based paths.
• NAT Traversal for LISP Mobile Node Klein, Dominik; Hartmann, Matthias; Menth, Michael in ACM CoNEXT workshop Re-Architecting the Internet (ReArch) (2010).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  The Locator/ID Separation Protocol (LISP) is currently being developed and standardized in the IETF aiming to solve the Internet's routing scaling problem. It separates global routing in the Internet from local routing in end-user networks (so-called LISP-domains). It also provides additional benefits like simplified multihoming or the avoidance of network renumbering. The basic LISP architecture does not support mobility. Recently, the mobility extension LISP Mobile Node (LISP-MN) was presented. It describes a mechanism that enables LISP mobile nodes to roam into LISP and non-LISP networks while being reachable under the same identifier address. Currently, LISP-MN does not support networks that use network address translation (NAT). In this paper, we present a NAT traversal mechanism for LISP mobile nodes and a slight adaptation which is also applicable to stationary LISP domains behind a NAT.

  @inproceedings{info3-inproceedings-2010-398, abstract = {The Locator/ID Separation Protocol (LISP) is currently being developed and standardized in the IETF aiming to solve the Internet's routing scaling problem. It separates global routing in the Internet from local routing in end-user networks (so-called LISP-domains). It also provides additional benefits like simplified multihoming or the avoidance of network renumbering. The basic LISP architecture does not support mobility. Recently, the mobility extension LISP Mobile Node (LISP-MN) was presented. It describes a mechanism that enables LISP mobile nodes to roam into LISP and non-LISP networks while being reachable under the same identifier address. Currently, LISP-MN does not support networks that use network address translation (NAT). In this paper, we present a NAT traversal mechanism for LISP mobile nodes and a slight adaptation which is also applicable to stationary LISP domains behind a NAT.}, address = {Philadelphia, PA, USA}, author = {Klein, Dominik and Hartmann, Matthias and Menth, Michael}, booktitle = {ACM CoNEXT workshop Re-Architecting the Internet (ReArch)}, keywords = {sys:hidden:inproceedings}, month = 11, title = {NAT Traversal for LISP Mobile Node}, year = 2010 }

  %0 Conference Paper %1 info3-inproceedings-2010-398 %A Klein, Dominik %A Hartmann, Matthias %A Menth, Michael %B ACM CoNEXT workshop Re-Architecting the Internet (ReArch) %C Philadelphia, PA, USA %D 2010 %T NAT Traversal for LISP Mobile Node %X The Locator/ID Separation Protocol (LISP) is currently being developed and standardized in the IETF aiming to solve the Internet's routing scaling problem. It separates global routing in the Internet from local routing in end-user networks (so-called LISP-domains). It also provides additional benefits like simplified multihoming or the avoidance of network renumbering. The basic LISP architecture does not support mobility. Recently, the mobility extension LISP Mobile Node (LISP-MN) was presented. It describes a mechanism that enables LISP mobile nodes to roam into LISP and non-LISP networks while being reachable under the same identifier address. Currently, LISP-MN does not support networks that use network address translation (NAT). In this paper, we present a NAT traversal mechanism for LISP mobile nodes and a slight adaptation which is also applicable to stationary LISP domains behind a NAT.
• Improvements to LISP Mobile Node Menth, Michael; Klein, Dominik; Hartmann, Matthias (2010, June).
  • [ BibTeX ]
  • [ EndNote ]
  @misc{info3-poster-2010-24, author = {Menth, Michael and Klein, Dominik and Hartmann, Matthias}, booktitle = {5. Fachgespräch der GI/ITG-Fachgruppe "Kommunikation und Verteilte Systeme"}, keywords = {sys:hidden:poster}, month = 6, title = {Improvements to LISP Mobile Node}, year = 2010 }

  %0 Generic %1 info3-poster-2010-24 %A Menth, Michael %A Klein, Dominik %A Hartmann, Matthias %B 5. Fachgespräch der GI/ITG-Fachgruppe "Kommunikation und Verteilte Systeme" %D 2010 %T Improvements to LISP Mobile Node
• Mapping Systems for Loc/ID Split Internet Routing Menth, Michael; Hartmann, Matthias; Hoefling, Michael (2010).
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @techreport{info3-techreport-2010-252, author = {Menth, Michael and Hartmann, Matthias and Hoefling, Michael}, institution = {University of Wuerzburg}, keywords = {sys:hidden:techreport}, month = 5, number = 472, title = {Mapping Systems for Loc/ID Split Internet Routing}, year = 2010 }

  %0 Report %1 info3-techreport-2010-252 %A Menth, Michael %A Hartmann, Matthias %A Hoefling, Michael %D 2010 %N 472 %T Mapping Systems for Loc/ID Split Internet Routing
• Global Locator, Local Locator, and Identifier Split (GLI-Split) Menth, Michael; Hartmann, Matthias; Klein, Dominik (2010).
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @techreport{info3-techreport-2010-250, author = {Menth, Michael and Hartmann, Matthias and Klein, Dominik}, institution = {University of Wuerzburg}, keywords = {sys:hidden:techreport}, month = 4, number = 470, title = {Global Locator, Local Locator, and Identifier Split (GLI-Split)}, year = 2010 }

  %0 Report %1 info3-techreport-2010-250 %A Menth, Michael %A Hartmann, Matthias %A Klein, Dominik %D 2010 %N 470 %T Global Locator, Local Locator, and Identifier Split (GLI-Split)
• Efficiency of Routing and Resilience Mechanisms in Packet-Switched Communication Networks Menth, Michael; Martin, Rüdiger; Hartmann, Matthias; Spörlein, Ulrich in European Transactions on Telecommunications (2010). 21 108–120.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  In this work we compare the efficiency of various routing and resilience mechanisms. Their path layout determines the utilization of links in the network under normal operation and in failure scenarios. For the comparison, the performance measure is the maximum utilization rS of all links for a set of protected failures S. A routing mechanism is considered more efficient than another if it leads to a lower maximum link utilization rS. We consider standard and optimized versions of IP routing and rerouting, optimized routing using explicit paths and end-to-end protection switching, as well as standard and optimized versions of MPLS fast reroute. The results show that routing optimization reduces the maximum link utilization significantly both with and without failure protection. The optimization potential for resilient routing is limited by the applied mechanism and depends heavily on the network structure and the set of protected failure scenarios S.

  @article{info3-article-2010-66, abstract = {In this work we compare the efficiency of various routing and resilience mechanisms. Their path layout determines the utilization of links in the network under normal operation and in failure scenarios. For the comparison, the performance measure is the maximum utilization rS of all links for a set of protected failures S. A routing mechanism is considered more efficient than another if it leads to a lower maximum link utilization rS. We consider standard and optimized versions of IP routing and rerouting, optimized routing using explicit paths and end-to-end protection switching, as well as standard and optimized versions of MPLS fast reroute. The results show that routing optimization reduces the maximum link utilization significantly both with and without failure protection. The optimization potential for resilient routing is limited by the applied mechanism and depends heavily on the network structure and the set of protected failure scenarios S.}, author = {Menth, Michael and Martin, Rüdiger and Hartmann, Matthias and Spörlein, Ulrich}, journal = {European Transactions on Telecommunications}, keywords = {sys:hidden:article}, month = 3, pages = {108-120}, title = {Efficiency of Routing and Resilience Mechanisms in Packet-Switched Communication Networks}, volume = 21, year = 2010 }

  %0 Journal Article %1 info3-article-2010-66 %A Menth, Michael %A Martin, Rüdiger %A Hartmann, Matthias %A Spörlein, Ulrich %D 2010 %J European Transactions on Telecommunications %P 108-120 %T Efficiency of Routing and Resilience Mechanisms in Packet-Switched Communication Networks %V 21 %X In this work we compare the efficiency of various routing and resilience mechanisms. Their path layout determines the utilization of links in the network under normal operation and in failure scenarios. For the comparison, the performance measure is the maximum utilization rS of all links for a set of protected failures S. A routing mechanism is considered more efficient than another if it leads to a lower maximum link utilization rS. We consider standard and optimized versions of IP routing and rerouting, optimized routing using explicit paths and end-to-end protection switching, as well as standard and optimized versions of MPLS fast reroute. The results show that routing optimization reduces the maximum link utilization significantly both with and without failure protection. The optimization potential for resilient routing is limited by the applied mechanism and depends heavily on the network structure and the set of protected failure scenarios S.
• Neue Routing-Paradigmen für das zukünftige Internet Hartmann, Matthias (2010, December 2).
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2010-459, address = {Datev Trendscout, Nürnberg}, author = {Hartmann, Matthias}, keywords = {sys:hidden:presentation}, month = 12, title = {Neue Routing-Paradigmen für das zukünftige Internet}, year = 2010 }

  %0 Generic %1 info3-talk-2010-459 %A Hartmann, Matthias %C Datev Trendscout, Nürnberg %D 2010 %T Neue Routing-Paradigmen für das zukünftige Internet

• Global Locator, Local Locator, and Identifier Split (GLI-Split) Menth, Michael; Hartmann, Matthias; Klein, Dominik (2009, July).
  • [ BibTeX ]
  • [ EndNote ]
  @misc{info3-software-2009-13, address = {Würzburg, Germany}, author = {Menth, Michael and Hartmann, Matthias and Klein, Dominik}, keywords = {sys:hidden:software}, month = 7, title = {Global Locator, Local Locator, and Identifier Split (GLI-Split)}, year = 2009 }

  %0 Generic %1 info3-software-2009-13 %A Menth, Michael %A Hartmann, Matthias %A Klein, Dominik %C Würzburg, Germany %D 2009 %T Global Locator, Local Locator, and Identifier Split (GLI-Split)
• FIRMS: Future Internet Mapping System Menth, Michael; Hartmann, Matthias; Höfling, Michael (2009, July).
  • [ BibTeX ]
  • [ EndNote ]
  @misc{info3-software-2009-14, address = {Würzburg, Germany}, author = {Menth, Michael and Hartmann, Matthias and Höfling, Michael}, keywords = {sys:hidden:software}, month = 7, title = {FIRMS: Future Internet Mapping System}, year = 2009 }

  %0 Generic %1 info3-software-2009-14 %A Menth, Michael %A Hartmann, Matthias %A Höfling, Michael %C Würzburg, Germany %D 2009 %T FIRMS: Future Internet Mapping System
• Objective Functions for Optimization of Resilient and Non-Resilient IP Routing Hartmann, Matthias; Hock, David; Menth, Michael; Schwartz, Christian in 7th International Workshop on the Design of Reliable Communication Networks (DRCN) (2009).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Intradomain routing in IP networks follows leastcost paths according to administrative link costs. Routing optimization modifies these values to minimize an objective function for a network with given link capacities and traffic matrix. An example for an objective function is the maximum utilization of all links under failure-free conditions or also after rerouting in case of network failures. Many papers have provided heuristic algorithms for routing optimization using different objective functions, but the investigation and comparison of various objective functions has not attracted much attention so far. In this work we present several objective functions for resilient IP routing. We also propose a new combined optimization approach which can simultaneously optimize different objective functions with almost no additional computation effort and describe new techniques to minimize overall computation time. The different objective functions and combinations thereof are then analyzed and compared experimentally.

  @inproceedings{info3-inproceedings-2009-358, abstract = {Intradomain routing in IP networks follows leastcost paths according to administrative link costs. Routing optimization modifies these values to minimize an objective function for a network with given link capacities and traffic matrix. An example for an objective function is the maximum utilization of all links under failure-free conditions or also after rerouting in case of network failures. Many papers have provided heuristic algorithms for routing optimization using different objective functions, but the investigation and comparison of various objective functions has not attracted much attention so far. In this work we present several objective functions for resilient IP routing. We also propose a new combined optimization approach which can simultaneously optimize different objective functions with almost no additional computation effort and describe new techniques to minimize overall computation time. The different objective functions and combinations thereof are then analyzed and compared experimentally.}, address = {Washington, D.C., USA}, author = {Hartmann, Matthias and Hock, David and Menth, Michael and Schwartz, Christian}, booktitle = {7th International Workshop on the Design of Reliable Communication Networks (DRCN)}, keywords = {sys:hidden:inproceedings}, month = 10, title = {Objective Functions for Optimization of Resilient and Non-Resilient IP Routing}, year = 2009 }

  %0 Conference Paper %1 info3-inproceedings-2009-358 %A Hartmann, Matthias %A Hock, David %A Menth, Michael %A Schwartz, Christian %B 7th International Workshop on the Design of Reliable Communication Networks (DRCN) %C Washington, D.C., USA %D 2009 %T Objective Functions for Optimization of Resilient and Non-Resilient IP Routing %X Intradomain routing in IP networks follows leastcost paths according to administrative link costs. Routing optimization modifies these values to minimize an objective function for a network with given link capacities and traffic matrix. An example for an objective function is the maximum utilization of all links under failure-free conditions or also after rerouting in case of network failures. Many papers have provided heuristic algorithms for routing optimization using different objective functions, but the investigation and comparison of various objective functions has not attracted much attention so far. In this work we present several objective functions for resilient IP routing. We also propose a new combined optimization approach which can simultaneously optimize different objective functions with almost no additional computation effort and describe new techniques to minimize overall computation time. The different objective functions and combinations thereof are then analyzed and compared experimentally.
• Relaxed Multiple Routing Configurations: IP Fast Reroute for Single and Correlated Failures Cicic, Tarik; Fosselie Hansen, Audun; Kvalbein, Amund; Hartmann, Matthias; Martin, Rüdiger; Menth, Michael; Gjessing, Stein; Lysne, Olav in IEEE Transactions on Network and Service Managment (2009). 6 1–14.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Multi-topology routing is an increasingly popular IP network management concept that allows transport of different traffic types over disjoint network paths. The concept is of particular interest for implementation of IP fast reroute (IP FRR). The authors have previously proposed an IP FRR scheme based on multi-topology routing called Multiple Routing Configurations (MRC). MRC supports guaranteed, instantaneous recovery from any single link or node failure in biconnected networks as well as from many combined failures, provided sufficient bandwidth on the surviving links. Furthermore, in MRC different failures result in routing over different network topologies, which gives a good control of the traffic distribution in the networks after a failure. In this paper we present two contributions. First we define an enhanced IP FRR scheme which we call 'relaxed MRC' (rMRC). Through experiments we demonstrate that rMRC is an improvement over MRC in all important aspects. Resource utilization in the presence of failures is significantly better, both in terms of paths lengths and in terms of load distribution between the links. The requirement to internal state in the routers is reduced as rMRC requires fewer backup topologies to provide the same degree of protection. In addition to this, the preprocessing needed to generate the backup topologies is simplified. The second contribution is an extension of rMRC that can provide fast reroute in the presence of multiple correlated failures. Our evaluations demonstrate only a small penalty in path lengths and in the number of backup topologies required.

  @article{info3-article-2009-67, abstract = {Multi-topology routing is an increasingly popular IP network management concept that allows transport of different traffic types over disjoint network paths. The concept is of particular interest for implementation of IP fast reroute (IP FRR). The authors have previously proposed an IP FRR scheme based on multi-topology routing called Multiple Routing Configurations (MRC). MRC supports guaranteed, instantaneous recovery from any single link or node failure in biconnected networks as well as from many combined failures, provided sufficient bandwidth on the surviving links. Furthermore, in MRC different failures result in routing over different network topologies, which gives a good control of the traffic distribution in the networks after a failure. In this paper we present two contributions. First we define an enhanced IP FRR scheme which we call 'relaxed MRC' (rMRC). Through experiments we demonstrate that rMRC is an improvement over MRC in all important aspects. Resource utilization in the presence of failures is significantly better, both in terms of paths lengths and in terms of load distribution between the links. The requirement to internal state in the routers is reduced as rMRC requires fewer backup topologies to provide the same degree of protection. In addition to this, the preprocessing needed to generate the backup topologies is simplified. The second contribution is an extension of rMRC that can provide fast reroute in the presence of multiple correlated failures. Our evaluations demonstrate only a small penalty in path lengths and in the number of backup topologies required.}, author = {Cicic, Tarik and Fosselie Hansen, Audun and Kvalbein, Amund and Hartmann, Matthias and Martin, Rüdiger and Menth, Michael and Gjessing, Stein and Lysne, Olav}, journal = {IEEE Transactions on Network and Service Managment}, keywords = {sys:hidden:article}, month = 3, pages = {1-14}, title = {Relaxed Multiple Routing Configurations: IP Fast Reroute for Single and Correlated Failures}, volume = 6, year = 2009 }

  %0 Journal Article %1 info3-article-2009-67 %A Cicic, Tarik %A Fosselie Hansen, Audun %A Kvalbein, Amund %A Hartmann, Matthias %A Martin, Rüdiger %A Menth, Michael %A Gjessing, Stein %A Lysne, Olav %D 2009 %J IEEE Transactions on Network and Service Managment %P 1-14 %T Relaxed Multiple Routing Configurations: IP Fast Reroute for Single and Correlated Failures %V 6 %X Multi-topology routing is an increasingly popular IP network management concept that allows transport of different traffic types over disjoint network paths. The concept is of particular interest for implementation of IP fast reroute (IP FRR). The authors have previously proposed an IP FRR scheme based on multi-topology routing called Multiple Routing Configurations (MRC). MRC supports guaranteed, instantaneous recovery from any single link or node failure in biconnected networks as well as from many combined failures, provided sufficient bandwidth on the surviving links. Furthermore, in MRC different failures result in routing over different network topologies, which gives a good control of the traffic distribution in the networks after a failure. In this paper we present two contributions. First we define an enhanced IP FRR scheme which we call 'relaxed MRC' (rMRC). Through experiments we demonstrate that rMRC is an improvement over MRC in all important aspects. Resource utilization in the presence of failures is significantly better, both in terms of paths lengths and in terms of load distribution between the links. The requirement to internal state in the routers is reduced as rMRC requires fewer backup topologies to provide the same degree of protection. In addition to this, the preprocessing needed to generate the backup topologies is simplified. The second contribution is an extension of rMRC that can provide fast reroute in the presence of multiple correlated failures. Our evaluations demonstrate only a small penalty in path lengths and in the number of backup topologies required.
• Threshold Configuration and Routing Optimization for PCN-Based Resilient Admission Control Menth, Michael; Hartmann, Matthias in Computer Networks (2009). Volume 53, Issue 11
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Pre-congestion notification (PCN) in IP networks uses packet metering and marking within a PCN domain to notify its egress nodes whether link-specific admissible or supportable rate thresholds have been exceeded by high priority traffic. Based on this information simple admission control and flow termination is implemented. The latter is a new flow control function and useful in case of overload through high priority traffic which can occur in spite of admission control, e.g., when traffic is rerouted in failure cases. Resilient admission control admits only so much traffic that admitted traffic can be rerouted without causing congestion on backup paths in case of a likely failures, e.g., single link failures. We propose algorithms to configure the link-specific PCN rate thresholds such that resources are utilized efficiently and fairly by competing traffic aggregates while meeting resilience constraints. This is done for the single and dual marking PCN architecture whereby the single marking case is more demanding since it requires that the supportable rate is a fixed multiple of the admissible rate on all links within a single PCN domain. Furthermore, we derive objective functions to optimize the underlying routing system for both cases. Our performance results for various network types show that the dual marking PCN architecture leads to significantly better resource efficiency than the single marking PCN architecture.

  @article{info3-article-2009-68, abstract = {Pre-congestion notification (PCN) in IP networks uses packet metering and marking within a PCN domain to notify its egress nodes whether link-specific admissible or supportable rate thresholds have been exceeded by high priority traffic. Based on this information simple admission control and flow termination is implemented. The latter is a new flow control function and useful in case of overload through high priority traffic which can occur in spite of admission control, e.g., when traffic is rerouted in failure cases. Resilient admission control admits only so much traffic that admitted traffic can be rerouted without causing congestion on backup paths in case of a likely failures, e.g., single link failures. We propose algorithms to configure the link-specific PCN rate thresholds such that resources are utilized efficiently and fairly by competing traffic aggregates while meeting resilience constraints. This is done for the single and dual marking PCN architecture whereby the single marking case is more demanding since it requires that the supportable rate is a fixed multiple of the admissible rate on all links within a single PCN domain. Furthermore, we derive objective functions to optimize the underlying routing system for both cases. Our performance results for various network types show that the dual marking PCN architecture leads to significantly better resource efficiency than the single marking PCN architecture.}, author = {Menth, Michael and Hartmann, Matthias}, journal = {Computer Networks}, keywords = {sys:hidden:article}, month = 7, title = {Threshold Configuration and Routing Optimization for PCN-Based Resilient Admission Control}, volume = {Volume 53, Issue 11}, year = 2009 }

  %0 Journal Article %1 info3-article-2009-68 %A Menth, Michael %A Hartmann, Matthias %D 2009 %J Computer Networks %T Threshold Configuration and Routing Optimization for PCN-Based Resilient Admission Control %V Volume 53, Issue 11 %X Pre-congestion notification (PCN) in IP networks uses packet metering and marking within a PCN domain to notify its egress nodes whether link-specific admissible or supportable rate thresholds have been exceeded by high priority traffic. Based on this information simple admission control and flow termination is implemented. The latter is a new flow control function and useful in case of overload through high priority traffic which can occur in spite of admission control, e.g., when traffic is rerouted in failure cases. Resilient admission control admits only so much traffic that admitted traffic can be rerouted without causing congestion on backup paths in case of a likely failures, e.g., single link failures. We propose algorithms to configure the link-specific PCN rate thresholds such that resources are utilized efficiently and fairly by competing traffic aggregates while meeting resilience constraints. This is done for the single and dual marking PCN architecture whereby the single marking case is more demanding since it requires that the supportable rate is a fixed multiple of the admissible rate on all links within a single PCN domain. Furthermore, we derive objective functions to optimize the underlying routing system for both cases. Our performance results for various network types show that the dual marking PCN architecture leads to significantly better resource efficiency than the single marking PCN architecture.

• Transitionspfade zu IPv6 Zinner, Thomas; Hartmann, Matthias (2008, November 27).
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2008-330, address = {Datev Trendscout, Nürnberg}, author = {Zinner, Thomas and Hartmann, Matthias}, keywords = {sys:hidden:presentation}, month = 11, title = {Transitionspfade zu IPv6}, year = 2008 }

  %0 Generic %1 info3-talk-2008-330 %A Zinner, Thomas %A Hartmann, Matthias %C Datev Trendscout, Nürnberg %D 2008 %T Transitionspfade zu IPv6
• Performance Evaluation of IP over Cost-Optimized Optical Multilayer Networks with SRLGs Duelli, Michael; Hartmann, Matthias; Menth, Michael; Hülsermann, Ralf; Düser, Michael in 9. ITG-Fachtagung Photonische Netze (2008). 21–29.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  The design of optical transport and IP networks is investigated with respect to the effect on overall network perfor mance when the two aspects are combined in the same network architecture. The focus is on the identification of advantages in the joint design of IP and transport networks, as well as on the shortcomings and network bottlenecks which may result from sub-optimal design. The impact of different IP routing strategies (shortest path, equal-cost multipath) on the network utilization is quantified, and potential sources for overload in the IP domain are determined. Simulations were carried out to systematically assess technical metrics like link utilization and economic parameters such as cost for a 50-node transport network with line rates up to 40 Gbit/s. The impact of fiber cuts was taken into account, leading to multiple logical IP links to fail simultaneously, i.e. shared risk link groups (SRLGs), and triggering massive IP rerouting. Applying the results allows to identify bottlenecks in the design, and to devise mechanisms which allow cost-optimal network design of future IP and optical transport networks.

  @inproceedings{info3-inproceedings-2008-312, abstract = {The design of optical transport and IP networks is investigated with respect to the effect on overall network perfor mance when the two aspects are combined in the same network architecture. The focus is on the identification of advantages in the joint design of IP and transport networks, as well as on the shortcomings and network bottlenecks which may result from sub-optimal design. The impact of different IP routing strategies (shortest path, equal-cost multipath) on the network utilization is quantified, and potential sources for overload in the IP domain are determined. Simulations were carried out to systematically assess technical metrics like link utilization and economic parameters such as cost for a 50-node transport network with line rates up to 40 Gbit/s. The impact of fiber cuts was taken into account, leading to multiple logical IP links to fail simultaneously, i.e. shared risk link groups (SRLGs), and triggering massive IP rerouting. Applying the results allows to identify bottlenecks in the design, and to devise mechanisms which allow cost-optimal network design of future IP and optical transport networks.}, address = {Leipzig, Germany}, author = {Duelli, Michael and Hartmann, Matthias and Menth, Michael and Hülsermann, Ralf and Düser, Michael}, booktitle = {9. ITG-Fachtagung Photonische Netze}, keywords = {100get}, month = 4, pages = {21–29}, title = {Performance Evaluation of IP over Cost-Optimized Optical Multilayer Networks with SRLGs}, year = 2008 }

  %0 Conference Paper %1 info3-inproceedings-2008-312 %A Duelli, Michael %A Hartmann, Matthias %A Menth, Michael %A Hülsermann, Ralf %A Düser, Michael %B 9. ITG-Fachtagung Photonische Netze %C Leipzig, Germany %D 2008 %P 21--29 %T Performance Evaluation of IP over Cost-Optimized Optical Multilayer Networks with SRLGs %X The design of optical transport and IP networks is investigated with respect to the effect on overall network perfor mance when the two aspects are combined in the same network architecture. The focus is on the identification of advantages in the joint design of IP and transport networks, as well as on the shortcomings and network bottlenecks which may result from sub-optimal design. The impact of different IP routing strategies (shortest path, equal-cost multipath) on the network utilization is quantified, and potential sources for overload in the IP domain are determined. Simulations were carried out to systematically assess technical metrics like link utilization and economic parameters such as cost for a 50-node transport network with line rates up to 40 Gbit/s. The impact of fiber cuts was taken into account, leading to multiple logical IP links to fail simultaneously, i.e. shared risk link groups (SRLGs), and triggering massive IP rerouting. Applying the results allows to identify bottlenecks in the design, and to devise mechanisms which allow cost-optimal network design of future IP and optical transport networks.
• Relaxed Multiple Routing Configurations for IP Fast Reroute Cicic, Tarik; Fosselie Hansen, Audun; Kvalbein, Amund; Hartmann, Matthias; Martin, Rüdiger; Menth, Michael in IEEE/IFIP Network Operations and Management Symposium (2008).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Multi-topology routing is an increasingly popular IP network management concept that allows transport of different traffic types over disjoint network paths. The concept is of particular interest for implementation of IP fast reroute (IP FRR). First, it can support guaranteed, instantaneous recovery from any link or node failure. Second, different failures result in routing over different network topologies, which augments the parameter space for load distribution optimizations. Multiple Routing Configurations (MRC) is the state-of-the-art IP FRR scheme based on multi-topology routing today. In this paper we present a new, enhanced IP FRR scheme which we call 'relaxed MRC' (rMRC). rMRC simplifies the topology construction and increases the routing flexibility in each topology. According to our experimental evaluation, rMRC has several benefits compared to MRC. The number of backup topologies required to provide protection against the same set of failures is reduced, hence reducing state in routers. In addition, the backup paths are shorter, and the link utilization is significantly better.

  @inproceedings{info3-inproceedings-2008-302, abstract = {Multi-topology routing is an increasingly popular IP network management concept that allows transport of different traffic types over disjoint network paths. The concept is of particular interest for implementation of IP fast reroute (IP FRR). First, it can support guaranteed, instantaneous recovery from any link or node failure. Second, different failures result in routing over different network topologies, which augments the parameter space for load distribution optimizations. Multiple Routing Configurations (MRC) is the state-of-the-art IP FRR scheme based on multi-topology routing today. In this paper we present a new, enhanced IP FRR scheme which we call 'relaxed MRC' (rMRC). rMRC simplifies the topology construction and increases the routing flexibility in each topology. According to our experimental evaluation, rMRC has several benefits compared to MRC. The number of backup topologies required to provide protection against the same set of failures is reduced, hence reducing state in routers. In addition, the backup paths are shorter, and the link utilization is significantly better.}, address = {Salvador, Bahia, Brazil}, author = {Cicic, Tarik and Fosselie Hansen, Audun and Kvalbein, Amund and Hartmann, Matthias and Martin, Rüdiger and Menth, Michael}, booktitle = {IEEE/IFIP Network Operations and Management Symposium}, keywords = {sys:hidden:inproceedings}, month = 4, title = {Relaxed Multiple Routing Configurations for IP Fast Reroute}, year = 2008 }

  %0 Conference Paper %1 info3-inproceedings-2008-302 %A Cicic, Tarik %A Fosselie Hansen, Audun %A Kvalbein, Amund %A Hartmann, Matthias %A Martin, Rüdiger %A Menth, Michael %B IEEE/IFIP Network Operations and Management Symposium %C Salvador, Bahia, Brazil %D 2008 %T Relaxed Multiple Routing Configurations for IP Fast Reroute %X Multi-topology routing is an increasingly popular IP network management concept that allows transport of different traffic types over disjoint network paths. The concept is of particular interest for implementation of IP fast reroute (IP FRR). First, it can support guaranteed, instantaneous recovery from any link or node failure. Second, different failures result in routing over different network topologies, which augments the parameter space for load distribution optimizations. Multiple Routing Configurations (MRC) is the state-of-the-art IP FRR scheme based on multi-topology routing today. In this paper we present a new, enhanced IP FRR scheme which we call 'relaxed MRC' (rMRC). rMRC simplifies the topology construction and increases the routing flexibility in each topology. According to our experimental evaluation, rMRC has several benefits compared to MRC. The number of backup topologies required to provide protection against the same set of failures is reduced, hence reducing state in routers. In addition, the backup paths are shorter, and the link utilization is significantly better.
• Future Internet Routing: Motivation and Design Issues Menth, Michael; Hartmann, Matthias; Tran-Gia, Phuoc; Klein, Dominik in it - Information Technology (2008). 50(6)
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Pre-congestion notification (PCN) in IP networks uses packet metering and marking within a PCN domain to notify its egress nodes whether link-specific admissible or supportable rate thresholds have been exceeded by high priority traffic. Based on this information simple admission control and flow termination is implemented. The latter is a new flow control function and useful in case of overload through high priority traffic which can occur in spite of admission control, e.g., when traffic is rerouted in failure cases. Resilient admission control admits only so much traffic that admitted traffic can be rerouted without causing congestion on backup paths in case of a likely failures, e.g., single link failures. We propose algorithms to configure the link-specific PCN rate thresholds such that resources are utilized efficiently and fairly by competing traffic aggregates while meeting resilience constraints. This is done for the single and dual marking PCN architecture whereby the single marking case is more demanding since it requires that the supportable rate is a fixed multiple of the admissible rate on all links within a single PCN domain. Furthermore, we derive objective functions to optimize the underlying routing system for both cases. Our performance results for various network types show that the dual marking PCN architecture leads to significantly better resource efficiency than the single marking PCN architecture.

  @article{info3-article-2008-55, abstract = {Pre-congestion notification (PCN) in IP networks uses packet metering and marking within a PCN domain to notify its egress nodes whether link-specific admissible or supportable rate thresholds have been exceeded by high priority traffic. Based on this information simple admission control and flow termination is implemented. The latter is a new flow control function and useful in case of overload through high priority traffic which can occur in spite of admission control, e.g., when traffic is rerouted in failure cases. Resilient admission control admits only so much traffic that admitted traffic can be rerouted without causing congestion on backup paths in case of a likely failures, e.g., single link failures. We propose algorithms to configure the link-specific PCN rate thresholds such that resources are utilized efficiently and fairly by competing traffic aggregates while meeting resilience constraints. This is done for the single and dual marking PCN architecture whereby the single marking case is more demanding since it requires that the supportable rate is a fixed multiple of the admissible rate on all links within a single PCN domain. Furthermore, we derive objective functions to optimize the underlying routing system for both cases. Our performance results for various network types show that the dual marking PCN architecture leads to significantly better resource efficiency than the single marking PCN architecture.}, author = {Menth, Michael and Hartmann, Matthias and Tran-Gia, Phuoc and Klein, Dominik}, journal = {it - Information Technology}, keywords = {sys:hidden:article}, month = 12, title = {Future Internet Routing: Motivation and Design Issues}, volume = {50(6)}, year = 2008 }

  %0 Journal Article %1 info3-article-2008-55 %A Menth, Michael %A Hartmann, Matthias %A Tran-Gia, Phuoc %A Klein, Dominik %D 2008 %J it - Information Technology %T Future Internet Routing: Motivation and Design Issues %V 50(6) %X Pre-congestion notification (PCN) in IP networks uses packet metering and marking within a PCN domain to notify its egress nodes whether link-specific admissible or supportable rate thresholds have been exceeded by high priority traffic. Based on this information simple admission control and flow termination is implemented. The latter is a new flow control function and useful in case of overload through high priority traffic which can occur in spite of admission control, e.g., when traffic is rerouted in failure cases. Resilient admission control admits only so much traffic that admitted traffic can be rerouted without causing congestion on backup paths in case of a likely failures, e.g., single link failures. We propose algorithms to configure the link-specific PCN rate thresholds such that resources are utilized efficiently and fairly by competing traffic aggregates while meeting resilience constraints. This is done for the single and dual marking PCN architecture whereby the single marking case is more demanding since it requires that the supportable rate is a fixed multiple of the admissible rate on all links within a single PCN domain. Furthermore, we derive objective functions to optimize the underlying routing system for both cases. Our performance results for various network types show that the dual marking PCN architecture leads to significantly better resource efficiency than the single marking PCN architecture.

• Robust IP Link Costs for Multilayer Resilience Menth, Michael; Hartmann, Matthias; Martin, Rüdiger (2007).
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @techreport{info3-techreport-2007-220, author = {Menth, Michael and Hartmann, Matthias and Martin, Rüdiger}, institution = {University of Wuerzburg}, keywords = {sys:hidden:techreport}, month = 5, number = 427, title = {Robust IP Link Costs for Multilayer Resilience}, year = 2007 }

  %0 Report %1 info3-techreport-2007-220 %A Menth, Michael %A Hartmann, Matthias %A Martin, Rüdiger %D 2007 %N 427 %T Robust IP Link Costs for Multilayer Resilience
• The Effect of Combining Loop-Free Alternates and Not-Via Addresses in IP Fast Reroute Martin, Rüdiger; Menth, Michael; Hartmann, Matthias; Cicic, Tarik; Kvalbein, Amund (2007).
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @techreport{info3-techreport-2007-226, author = {Martin, Rüdiger and Menth, Michael and Hartmann, Matthias and Cicic, Tarik and Kvalbein, Amund}, institution = {University of Wuerzburg}, keywords = {sys:hidden:techreport}, month = 9, number = 432, title = {The Effect of Combining Loop-Free Alternates and Not-Via Addresses in IP Fast Reroute}, year = 2007 }

  %0 Report %1 info3-techreport-2007-226 %A Martin, Rüdiger %A Menth, Michael %A Hartmann, Matthias %A Cicic, Tarik %A Kvalbein, Amund %D 2007 %N 432 %T The Effect of Combining Loop-Free Alternates and Not-Via Addresses in IP Fast Reroute
• Efficiency of Routing and Resilience Mechanisms in Packet-Switched Networks Menth, Michael; Martin, Rüdiger; Hartmann, Matthias; Spörlein, Ulrich (2007).
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @techreport{info3-techreport-2007-225, author = {Menth, Michael and Martin, Rüdiger and Hartmann, Matthias and Spörlein, Ulrich}, institution = {University of Wuerzburg}, keywords = {sys:hidden:techreport}, month = 5, number = 425, title = {Efficiency of Routing and Resilience Mechanisms in Packet-Switched Networks}, year = 2007 }

  %0 Report %1 info3-techreport-2007-225 %A Menth, Michael %A Martin, Rüdiger %A Hartmann, Matthias %A Spörlein, Ulrich %D 2007 %N 425 %T Efficiency of Routing and Resilience Mechanisms in Packet-Switched Networks
• Robust IP Link Costs for Multilayer Resilience Menth, Michael; Hartmann, Matthias; Martin, Rüdiger in 6th IFIP-TC6 Networking Conference (Networking) (2007).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  In this work we optimize administrative link costs of IP networks in such a way that the maximum utilization of all links is as low as possible for a set of considered failure scenarios (e.g., all single link failures). To that aim, we present the new 'hill hopping' heuristic with three different variants and compare their computation times and the quality of their results. We adapt the objective function of the heuristic to make the link cost settings robust to single link failures, single node failures, and single link or node failures, and compare the results. In particular, we optimize the routing for multilayer networks where unused backup capacity of the link layer can be reused to redirect traffic on the network layer in case of an IP node failure.

  @inproceedings{info3-inproceedings-2007-284, abstract = {In this work we optimize administrative link costs of IP networks in such a way that the maximum utilization of all links is as low as possible for a set of considered failure scenarios (e.g., all single link failures). To that aim, we present the new 'hill hopping' heuristic with three different variants and compare their computation times and the quality of their results. We adapt the objective function of the heuristic to make the link cost settings robust to single link failures, single node failures, and single link or node failures, and compare the results. In particular, we optimize the routing for multilayer networks where unused backup capacity of the link layer can be reused to redirect traffic on the network layer in case of an IP node failure.}, address = {Atlanta, GA, USA}, author = {Menth, Michael and Hartmann, Matthias and Martin, Rüdiger}, booktitle = {6th IFIP-TC6 Networking Conference (Networking)}, keywords = {sys:hidden:inproceedings}, month = 5, title = {Robust IP Link Costs for Multilayer Resilience}, year = 2007 }

  %0 Conference Paper %1 info3-inproceedings-2007-284 %A Menth, Michael %A Hartmann, Matthias %A Martin, Rüdiger %B 6th IFIP-TC6 Networking Conference (Networking) %C Atlanta, GA, USA %D 2007 %T Robust IP Link Costs for Multilayer Resilience %X In this work we optimize administrative link costs of IP networks in such a way that the maximum utilization of all links is as low as possible for a set of considered failure scenarios (e.g., all single link failures). To that aim, we present the new 'hill hopping' heuristic with three different variants and compare their computation times and the quality of their results. We adapt the objective function of the heuristic to make the link cost settings robust to single link failures, single node failures, and single link or node failures, and compare the results. In particular, we optimize the routing for multilayer networks where unused backup capacity of the link layer can be reused to redirect traffic on the network layer in case of an IP node failure.