Dr. rer. nat. Dominik Klein

• Second Interim Report for the DFG Project FunkOFDMA. Technical Report (489), . Wamser, Florian; Klein, Dominik; Tran-Gia, Phuoc. University of Wuerzburg, 2014.
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @techreport{info3-techreport-2014-263, author = {Wamser, Florian and Klein, Dominik and Tran-Gia, Phuoc}, institution = {University of Wuerzburg}, keywords = {sys:hidden:techreport}, month = {03}, number = 489, title = {Second Interim Report for the DFG Project FunkOFDMA}, year = 2014 }

  %0 Report %1 info3-techreport-2014-263 %A Wamser, Florian %A Klein, Dominik %A Tran-Gia, Phuoc %D 2014 %N 489 %T Second Interim Report for the DFG Project FunkOFDMA
• Design and Evaluation of Components for Future Internet Architectures. Klein, Dominik. 2014, February.
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @phdthesis{info3-dissertation-2014-35, author = {Klein, Dominik}, keywords = {sys:hidden:dissertation}, month = {02}, title = {Design and Evaluation of Components for Future Internet Architectures}, year = 2014 }

  %0 Thesis %1 info3-dissertation-2014-35 %A Klein, Dominik %D 2014 %T Design and Evaluation of Components for Future Internet Architectures

• Evaluation of Video Quality Monitoring based on Pre-computed Frame Distortions. Klein, Dominik; Zinner, Thomas; Borchert, Kathrin; Lange, Stanislav; Singeorzan, Vlad; Schmid, Matthias. In 19th EUNICE Workshop on Advances in Communication Networking, Best Paper Award. Chemnitz, Germany, 2013.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  A large fraction of the current Internet traffic is caused by video streaming. Due to the growing expectations of video consumers, monitoring video applications is getting more and more important for network and service providers. In a previous work, we proposed a video quality monitoring solution which utilizes the full reference SSIM metric to improve the monitoring in the network by distributing pre-computed distortion information induced by frame losses. To improve scalability, we introduced a less complex algorithm which infers the distortion for higher loss scenarios from single loss scenarios and inter-frame dependencies. In this work, we evaluate the accuracy of our algorithm by comparing it with the exact calculation of the SSIM metric for different frame loss scenarios. We further consider different high definition test video sequences and group of picture structures and investigate the influence on the accuracy of our proposed approximation.

  @inproceedings{info3-inproceedings-2013-474, abstract = {A large fraction of the current Internet traffic is caused by video streaming. Due to the growing expectations of video consumers, monitoring video applications is getting more and more important for network and service providers. In a previous work, we proposed a video quality monitoring solution which utilizes the full reference SSIM metric to improve the monitoring in the network by distributing pre-computed distortion information induced by frame losses. To improve scalability, we introduced a less complex algorithm which infers the distortion for higher loss scenarios from single loss scenarios and inter-frame dependencies. In this work, we evaluate the accuracy of our algorithm by comparing it with the exact calculation of the SSIM metric for different frame loss scenarios. We further consider different high definition test video sequences and group of picture structures and investigate the influence on the accuracy of our proposed approximation.}, address = {Chemnitz, Germany}, author = {Klein, Dominik and Zinner, Thomas and Borchert, Kathrin and Lange, Stanislav and Singeorzan, Vlad and Schmid, Matthias}, booktitle = {19th EUNICE Workshop on Advances in Communication Networking, Best Paper Award}, keywords = {video-quality}, month = {08}, title = {Evaluation of Video Quality Monitoring based on Pre-computed Frame Distortions}, year = 2013 }

  %0 Conference Paper %1 info3-inproceedings-2013-474 %A Klein, Dominik %A Zinner, Thomas %A Borchert, Kathrin %A Lange, Stanislav %A Singeorzan, Vlad %A Schmid, Matthias %B 19th EUNICE Workshop on Advances in Communication Networking, Best Paper Award %C Chemnitz, Germany %D 2013 %T Evaluation of Video Quality Monitoring based on Pre-computed Frame Distortions %X A large fraction of the current Internet traffic is caused by video streaming. Due to the growing expectations of video consumers, monitoring video applications is getting more and more important for network and service providers. In a previous work, we proposed a video quality monitoring solution which utilizes the full reference SSIM metric to improve the monitoring in the network by distributing pre-computed distortion information induced by frame losses. To improve scalability, we introduced a less complex algorithm which infers the distortion for higher loss scenarios from single loss scenarios and inter-frame dependencies. In this work, we evaluate the accuracy of our algorithm by comparing it with the exact calculation of the SSIM metric for different frame loss scenarios. We further consider different high definition test video sequences and group of picture structures and investigate the influence on the accuracy of our proposed approximation.
• Aktuelles Schlagwort: Big Data. Klein, Dominik; Tran-Gia, Phuoc; Hartmann, Matthias. In Informatik-Spektrum, 36, pp. 319–323. 2013.
  • [ 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 = {06}, 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.
• Video Quality Monitoring based on Precomputed Frame Distortions. Klein, Dominik; Zinner, Thomas; Lange, Stanislav; Singeorzan, Vlad; Schmid, Matthias. In IFIP/IEEE International Workshop on Quality of Experience Centric Management (QCMan). Ghent, Belgium, 2013.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  In the past decade, video streaming has taken over a large part of the current Internet traffic and more and more TV broadcasters and network providers extend their portfolio of video streaming services. With the growing expectations of video consumers with respect to the service quality, monitoring is an important aspect for network providers to detect possible performance problems or high network load. In parallel, emerging technologies like software defined networking or network virtualization introduce support for specialized networks which allow enhanced functionality in the network. This development enables more sophisticated monitoring techniques in the specialized networks which use knowledge about the video content to better predict the service quality at consumers. In this work, we present a content-aware SSIM-based monitoring technique and compare it with the current state-of-the art which infers the service quality from the monitored packet loss. We further show how network conditions like packet loss or bursts influence the two different monitoring techniques.

  @inproceedings{info3-inproceedings-2013-464, abstract = {In the past decade, video streaming has taken over a large part of the current Internet traffic and more and more TV broadcasters and network providers extend their portfolio of video streaming services. With the growing expectations of video consumers with respect to the service quality, monitoring is an important aspect for network providers to detect possible performance problems or high network load. In parallel, emerging technologies like software defined networking or network virtualization introduce support for specialized networks which allow enhanced functionality in the network. This development enables more sophisticated monitoring techniques in the specialized networks which use knowledge about the video content to better predict the service quality at consumers. In this work, we present a content-aware SSIM-based monitoring technique and compare it with the current state-of-the art which infers the service quality from the monitored packet loss. We further show how network conditions like packet loss or bursts influence the two different monitoring techniques.}, address = {Ghent, Belgium}, author = {Klein, Dominik and Zinner, Thomas and Lange, Stanislav and Singeorzan, Vlad and Schmid, Matthias}, booktitle = {IFIP/IEEE International Workshop on Quality of Experience Centric Management (QCMan)}, keywords = {sys:hidden:inproceedings}, month = {05}, title = {Video Quality Monitoring based on Precomputed Frame Distortions}, year = 2013 }

  %0 Conference Paper %1 info3-inproceedings-2013-464 %A Klein, Dominik %A Zinner, Thomas %A Lange, Stanislav %A Singeorzan, Vlad %A Schmid, Matthias %B IFIP/IEEE International Workshop on Quality of Experience Centric Management (QCMan) %C Ghent, Belgium %D 2013 %T Video Quality Monitoring based on Precomputed Frame Distortions %X In the past decade, video streaming has taken over a large part of the current Internet traffic and more and more TV broadcasters and network providers extend their portfolio of video streaming services. With the growing expectations of video consumers with respect to the service quality, monitoring is an important aspect for network providers to detect possible performance problems or high network load. In parallel, emerging technologies like software defined networking or network virtualization introduce support for specialized networks which allow enhanced functionality in the network. This development enables more sophisticated monitoring techniques in the specialized networks which use knowledge about the video content to better predict the service quality at consumers. In this work, we present a content-aware SSIM-based monitoring technique and compare it with the current state-of-the art which infers the service quality from the monitored packet loss. We further show how network conditions like packet loss or bursts influence the two different monitoring techniques.
• Big Data: Definition und Stand der Entwicklung. Klein, Dominik; Tran-Gia, Phuoc. Datev Trendscout, Nürnberg, 2013, April 15.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2013-465, address = {Datev Trendscout, Nürnberg}, author = {Klein, Dominik and Tran-Gia, Phuoc}, keywords = {sys:hidden:presentation}, month = {04}, title = {Big Data: Definition und Stand der Entwicklung}, year = 2013 }

  %0 Generic %1 info3-talk-2013-465 %A Klein, Dominik %A Tran-Gia, Phuoc %C Datev Trendscout, Nürnberg %D 2013 %T Big Data: Definition und Stand der Entwicklung
• An OpenFlow Extension for the OMNeT++ INET Framework. Klein, Dominik. 6th International Workshop on OMNeT++, Cannes, France, 2013, March 5.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2013-462, address = {6th International Workshop on OMNeT++, Cannes, France}, author = {Klein, Dominik}, keywords = {openflow}, month = {03}, title = {An OpenFlow Extension for the OMNeT++ INET Framework}, year = 2013 }

  %0 Generic %1 info3-talk-2013-462 %A Klein, Dominik %C 6th International Workshop on OMNeT++, Cannes, France %D 2013 %T An OpenFlow Extension for the OMNeT++ INET Framework
• An OpenFlow Extension for the OMNeT++ INET Framework. Klein, Dominik; Jarschel, Michael. In 6th International Workshop on OMNeT++. Cannes, France, 2013.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Software Defined Networking (SDN) is a new paradigm for communication networks which separates the control plane from the data plane of forwarding elements. This way, SDN constitutes a flexible architecture that allows quick and easy configuration of network devices. This ability is particularly useful when networks have to be adapted to changing traffic volumes of different applications running on the network. OpenFlow is currently the most prominent approach which implements the SDN concept and offers a high flexibility in the routing of network flows. In this paper, we describe the implementation of our model of the OpenFlow system in the INET framework for OMNeT++. We present performance results to show the correctness of our model. As a first application, we use the simulation model to assess the round-trip-times in a theoretical OpenFlow deployment in a real topology of a North-American Testbed.

  @inproceedings{info3-inproceedings-2013-461, abstract = {Software Defined Networking (SDN) is a new paradigm for communication networks which separates the control plane from the data plane of forwarding elements. This way, SDN constitutes a flexible architecture that allows quick and easy configuration of network devices. This ability is particularly useful when networks have to be adapted to changing traffic volumes of different applications running on the network. OpenFlow is currently the most prominent approach which implements the SDN concept and offers a high flexibility in the routing of network flows. In this paper, we describe the implementation of our model of the OpenFlow system in the INET framework for OMNeT++. We present performance results to show the correctness of our model. As a first application, we use the simulation model to assess the round-trip-times in a theoretical OpenFlow deployment in a real topology of a North-American Testbed.}, address = {Cannes, France}, author = {Klein, Dominik and Jarschel, Michael}, booktitle = {6th International Workshop on OMNeT++}, keywords = {openflow}, month = {03}, title = {An OpenFlow Extension for the OMNeT++ INET Framework}, year = 2013 }

  %0 Conference Paper %1 info3-inproceedings-2013-461 %A Klein, Dominik %A Jarschel, Michael %B 6th International Workshop on OMNeT++ %C Cannes, France %D 2013 %T An OpenFlow Extension for the OMNeT++ INET Framework %X Software Defined Networking (SDN) is a new paradigm for communication networks which separates the control plane from the data plane of forwarding elements. This way, SDN constitutes a flexible architecture that allows quick and easy configuration of network devices. This ability is particularly useful when networks have to be adapted to changing traffic volumes of different applications running on the network. OpenFlow is currently the most prominent approach which implements the SDN concept and offers a high flexibility in the routing of network flows. In this paper, we describe the implementation of our model of the OpenFlow system in the INET framework for OMNeT++. We present performance results to show the correctness of our model. As a first application, we use the simulation model to assess the round-trip-times in a theoretical OpenFlow deployment in a real topology of a North-American Testbed.
• Global Locator, Local Locator, and Identifier Split (GLI-Split). Menth, Michael; Hartmann, Matthias; Klein, Dominik. In Future Internet, 5, pp. 67–94. 2013.
  • [ 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 = {03}, 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.

• User-Centric Network-Application Interaction for Live HD Video Streaming. Zinner, Thomas; Klein, Dominik; Hoßfeld, Tobias. In 4th International Conference on Mobile Networks and Management (MONAMI 2012). Hamburg, Germany, 2012.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Applications and resource allocation within the network become more and more exible in supporting divergent user demands. This is re ected by state-of-the-art video codecs like H.264/SVC which allow a dynamic adaptation of the video quality and therewith the required network resources. Within the network, techniques like network virtualization and multipath data transport allow exible allocation of network resources based on application demands. This paper outlines the potential of the interaction between application and network with an example of a scalable video streaming service and a multipath transport network.

  @inproceedings{info3-inproceedings-2012-456, abstract = {Applications and resource allocation within the network become more and more exible in supporting divergent user demands. This is re ected by state-of-the-art video codecs like H.264/SVC which allow a dynamic adaptation of the video quality and therewith the required network resources. Within the network, techniques like network virtualization and multipath data transport allow exible allocation of network resources based on application demands. This paper outlines the potential of the interaction between application and network with an example of a scalable video streaming service and a multipath transport network.}, address = {Hamburg, Germany}, author = {Zinner, Thomas and Klein, Dominik and Hoßfeld, Tobias}, booktitle = {4th International Conference on Mobile Networks and Management (MONAMI 2012)}, keywords = {sys:hidden:inproceedings}, month = {09}, title = {User-Centric Network-Application Interaction for Live HD Video Streaming}, year = 2012 }

  %0 Conference Paper %1 info3-inproceedings-2012-456 %A Zinner, Thomas %A Klein, Dominik %A Hoßfeld, Tobias %B 4th International Conference on Mobile Networks and Management (MONAMI 2012) %C Hamburg, Germany %D 2012 %T User-Centric Network-Application Interaction for Live HD Video Streaming %X Applications and resource allocation within the network become more and more exible in supporting divergent user demands. This is re ected by state-of-the-art video codecs like H.264/SVC which allow a dynamic adaptation of the video quality and therewith the required network resources. Within the network, techniques like network virtualization and multipath data transport allow exible allocation of network resources based on application demands. This paper outlines the potential of the interaction between application and network with an example of a scalable video streaming service and a multipath transport network.
• Modeling and Evaluation of Address Resolution Scalability in VPLS. Klein, Dominik; Pries, Rastin; Scharf, Michael; Söllner, Michael; Menth, Michael. In IEEE ICC 2012 - Next-Generation Networking Symposium. Ottawa, Canada, 2012.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  More and more services are provided by large data centers with a potentially very large number of physical or virtual hosts. As the number of hosted services and service consumers increases, also the number of hosts inside a data center raises to cope with the increasing end-user demand. Current data center networks are usually based on Ethernet and mechanisms like load balancing or redundancy between data centers require a transparent connection of these Ethernet networks over a Wide Area Network (WAN). Due to the large number of hosts, these interconnected data center networks face scalability problems on different protocol layers. One such issue, which is currently discussed within the IETF, is the scalability of the link layer Address Resolution Protocol (ARP). This paper studies the control traffic caused by address resolution for interconnected data centers. We develop an analytical model for the ARP traffic between data center locations that takes into account the number of hosts and connected sites. This model can then be used to quantify the ARP traffic for a data center interconnect solution. As an example, we apply our model to Virtual Private LAN Services (VPLS). In addition, we study how an ARP proxy can improve the overall scalability, and we show that a proxy significantly reduces the ARP traffic at VPLS switches.

  @inproceedings{info3-inproceedings-2012-434, abstract = {More and more services are provided by large data centers with a potentially very large number of physical or virtual hosts. As the number of hosted services and service consumers increases, also the number of hosts inside a data center raises to cope with the increasing end-user demand. Current data center networks are usually based on Ethernet and mechanisms like load balancing or redundancy between data centers require a transparent connection of these Ethernet networks over a Wide Area Network (WAN). Due to the large number of hosts, these interconnected data center networks face scalability problems on different protocol layers. One such issue, which is currently discussed within the IETF, is the scalability of the link layer Address Resolution Protocol (ARP). This paper studies the control traffic caused by address resolution for interconnected data centers. We develop an analytical model for the ARP traffic between data center locations that takes into account the number of hosts and connected sites. This model can then be used to quantify the ARP traffic for a data center interconnect solution. As an example, we apply our model to Virtual Private LAN Services (VPLS). In addition, we study how an ARP proxy can improve the overall scalability, and we show that a proxy significantly reduces the ARP traffic at VPLS switches.}, address = {Ottawa, Canada}, author = {Klein, Dominik and Pries, Rastin and Scharf, Michael and Söllner, Michael and Menth, Michael}, booktitle = {IEEE ICC 2012 - Next-Generation Networking Symposium}, keywords = {sys:hidden:inproceedings}, month = {06}, title = {Modeling and Evaluation of Address Resolution Scalability in VPLS}, year = 2012 }

  %0 Conference Paper %1 info3-inproceedings-2012-434 %A Klein, Dominik %A Pries, Rastin %A Scharf, Michael %A Söllner, Michael %A Menth, Michael %B IEEE ICC 2012 - Next-Generation Networking Symposium %C Ottawa, Canada %D 2012 %T Modeling and Evaluation of Address Resolution Scalability in VPLS %X More and more services are provided by large data centers with a potentially very large number of physical or virtual hosts. As the number of hosted services and service consumers increases, also the number of hosts inside a data center raises to cope with the increasing end-user demand. Current data center networks are usually based on Ethernet and mechanisms like load balancing or redundancy between data centers require a transparent connection of these Ethernet networks over a Wide Area Network (WAN). Due to the large number of hosts, these interconnected data center networks face scalability problems on different protocol layers. One such issue, which is currently discussed within the IETF, is the scalability of the link layer Address Resolution Protocol (ARP). This paper studies the control traffic caused by address resolution for interconnected data centers. We develop an analytical model for the ARP traffic between data center locations that takes into account the number of hosts and connected sites. This model can then be used to quantify the ARP traffic for a data center interconnect solution. As an example, we apply our model to Virtual Private LAN Services (VPLS). In addition, we study how an ARP proxy can improve the overall scalability, and we show that a proxy significantly reduces the ARP traffic at VPLS switches.
• Modeling and Evaluation of Address Resolution Scalability in VPLS. Klein, Dominik; Pries, Rastin; Scharf, Michael; Söllner, Michael; Menth, Michael. Ottawa, Canada, 2012, June.
  • [ BibTeX ]
  • [ EndNote ]
  @misc{info3-poster-2012-33, address = {Ottawa, Canada}, author = {Klein, Dominik and Pries, Rastin and Scharf, Michael and Söllner, Michael and Menth, Michael}, booktitle = {IEEE ICC 2012 - Next-Generation Networking Symposium}, keywords = {sys:hidden:poster}, month = {06}, title = {Modeling and Evaluation of Address Resolution Scalability in VPLS}, year = 2012 }

  %0 Generic %1 info3-poster-2012-33 %A Klein, Dominik %A Pries, Rastin %A Scharf, Michael %A Söllner, Michael %A Menth, Michael %B IEEE ICC 2012 - Next-Generation Networking Symposium %C Ottawa, Canada %D 2012 %T Modeling and Evaluation of Address Resolution Scalability in VPLS
• Integration of LISP and LISP-MN into INET. Klein, Dominik. 5th International OMNeT++ Workshop held in conjuntion with Simutools 2012, Desenzano, Italy, 2012, March 23.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2012-438, address = {5th International OMNeT++ Workshop held in conjuntion with Simutools 2012, Desenzano, Italy}, author = {Klein, Dominik}, keywords = {sys:hidden:presentation}, month = {03}, title = {Integration of LISP and LISP-MN into INET}, year = 2012 }

  %0 Generic %1 info3-talk-2012-438 %A Klein, Dominik %C 5th International OMNeT++ Workshop held in conjuntion with Simutools 2012, Desenzano, Italy %D 2012 %T Integration of LISP and LISP-MN into INET
• Integration of LISP and LISP-MN into INET. Klein, Dominik; Höfling, Michael; Hartmann, Matthias; Menth, Michael. In 5th International Workshop on OMNeT++, pp. 299–306. Desenzano, Italy, 2012.
  • [ 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 = {03}, 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.

• A Subscription Model for Time-Scheduled Data Transfers. Klein, Dominik. 12th IFIP/IEEE International Symposium on Integrated Network Management, Dublin, Ireland, 2011, May 23.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2011-408, address = {12th IFIP/IEEE International Symposium on Integrated Network Management, Dublin, Ireland}, author = {Klein, Dominik}, keywords = {sys:hidden:presentation}, month = {05}, title = {A Subscription Model for Time-Scheduled Data Transfers}, year = 2011 }

  %0 Generic %1 info3-talk-2011-408 %A Klein, Dominik %C 12th IFIP/IEEE International Symposium on Integrated Network Management, Dublin, Ireland %D 2011 %T A Subscription Model for Time-Scheduled Data Transfers
• A Subscription Model for Time-Scheduled Data Transfers. Klein, Dominik; Menth, Michael; Pries, Rastin; Tran-Gia, Phuoc; Scharf, Michael; Söllner, Michael. In 12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011). Dublin, Ireland, 2011.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  We recently witness new services that can afford some delay until data transmission starts, but then benefit from a very large available bandwidth. A popular example is the migration of virtual machines between different sites of a geographically dispersed service provider. In this paper, we propose a subscription model for time-scheduled data transfers. Transmission requests are served consecutively, giving the flows access to the physical bandwidth. This is in contrast to today's Internet where flows are served in parallel so that they compete for the available bandwidth. We present the architecture to enable such data beams. Furthermore, we model and analyze the performance under different conditions and compare it with concurrent transmission.

  @inproceedings{info3-inproceedings-2011-400, abstract = {We recently witness new services that can afford some delay until data transmission starts, but then benefit from a very large available bandwidth. A popular example is the migration of virtual machines between different sites of a geographically dispersed service provider. In this paper, we propose a subscription model for time-scheduled data transfers. Transmission requests are served consecutively, giving the flows access to the physical bandwidth. This is in contrast to today's Internet where flows are served in parallel so that they compete for the available bandwidth. We present the architecture to enable such data beams. Furthermore, we model and analyze the performance under different conditions and compare it with concurrent transmission.}, address = {Dublin, Ireland}, author = {Klein, Dominik and Menth, Michael and Pries, Rastin and Tran-Gia, Phuoc and Scharf, Michael and Söllner, Michael}, booktitle = {12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011)}, keywords = {sys:hidden:inproceedings}, month = {05}, title = {A Subscription Model for Time-Scheduled Data Transfers}, year = 2011 }

  %0 Conference Paper %1 info3-inproceedings-2011-400 %A Klein, Dominik %A Menth, Michael %A Pries, Rastin %A Tran-Gia, Phuoc %A Scharf, Michael %A Söllner, Michael %B 12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) %C Dublin, Ireland %D 2011 %T A Subscription Model for Time-Scheduled Data Transfers %X We recently witness new services that can afford some delay until data transmission starts, but then benefit from a very large available bandwidth. A popular example is the migration of virtual machines between different sites of a geographically dispersed service provider. In this paper, we propose a subscription model for time-scheduled data transfers. Transmission requests are served consecutively, giving the flows access to the physical bandwidth. This is in contrast to today's Internet where flows are served in parallel so that they compete for the available bandwidth. We present the architecture to enable such data beams. Furthermore, we model and analyze the performance under different conditions and compare it with concurrent transmission.
• A Subscription Model for Time-Scheduled Data Transfers. Klein, Dominik. EuroNF Plenary Meeting, Soccer Stadium Kaiserslautern, 2011, June 29.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2011-423, address = {EuroNF Plenary Meeting, Soccer Stadium Kaiserslautern}, author = {Klein, Dominik}, keywords = {sys:hidden:presentation}, month = {06}, title = {A Subscription Model for Time-Scheduled Data Transfers}, year = 2011 }

  %0 Generic %1 info3-talk-2011-423 %A Klein, Dominik %C EuroNF Plenary Meeting, Soccer Stadium Kaiserslautern %D 2011 %T A Subscription Model for Time-Scheduled Data Transfers
• Performance of Concurrent Multipath Transmissions - Measurements and Model Validation. Zinner, Thomas; Klein, Dominik; Tutschku, Kurt; Zseby, Tanja; Tran-Gia, Phuoc; Shavitt, Yuval. In Proceedings of the 7th Conference on Next Generation Internet Networks (NGI). Kaiserslautern, Germany, 2011.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Concurrent multipath transport layer mechanisms have gained recently increasing interest in research and standardization because of the potential for bandwidth aggregation, load balancing and increased reliability. Multihomed end devices may benefit from IP-based multipath protocols like Multipath TCP or Concurrent Multipath Transmission via SCTP. In the future, concurrent multipath transport might be transparent to network and transport layer protocols as proposed by the concept of Transport Virtualization. This mechanism enables the pooling of heterogeneous transmission technologies or physical paths. However, the selection and application of multiple paths and its impact on the transmission is non-intuitive. Our prior work on transport virtualization discussed the impact of delay diversity of pooled paths on concurrent data transmissions. A mathematical model was introduced enabling the analysis of packet re-ordering that occurs due to different path delays. In this paper we extend our investigations by validating the previously presented analytical and simulative models with measurements performed in Planetlab Europe and the Etomic testbed.

  @inproceedings{info3-inproceedings-2011-416, abstract = {Concurrent multipath transport layer mechanisms have gained recently increasing interest in research and standardization because of the potential for bandwidth aggregation, load balancing and increased reliability. Multihomed end devices may benefit from IP-based multipath protocols like Multipath TCP or Concurrent Multipath Transmission via SCTP. In the future, concurrent multipath transport might be transparent to network and transport layer protocols as proposed by the concept of Transport Virtualization. This mechanism enables the pooling of heterogeneous transmission technologies or physical paths. However, the selection and application of multiple paths and its impact on the transmission is non-intuitive. Our prior work on transport virtualization discussed the impact of delay diversity of pooled paths on concurrent data transmissions. A mathematical model was introduced enabling the analysis of packet re-ordering that occurs due to different path delays. In this paper we extend our investigations by validating the previously presented analytical and simulative models with measurements performed in Planetlab Europe and the Etomic testbed.}, address = {Kaiserslautern, Germany}, author = {Zinner, Thomas and Klein, Dominik and Tutschku, Kurt and Zseby, Tanja and Tran-Gia, Phuoc and Shavitt, Yuval}, booktitle = {Proceedings of the 7th Conference on Next Generation Internet Networks (NGI)}, keywords = {sys:hidden:inproceedings}, month = {06}, title = {Performance of Concurrent Multipath Transmissions - Measurements and Model Validation}, year = 2011 }

  %0 Conference Paper %1 info3-inproceedings-2011-416 %A Zinner, Thomas %A Klein, Dominik %A Tutschku, Kurt %A Zseby, Tanja %A Tran-Gia, Phuoc %A Shavitt, Yuval %B Proceedings of the 7th Conference on Next Generation Internet Networks (NGI) %C Kaiserslautern, Germany %D 2011 %T Performance of Concurrent Multipath Transmissions - Measurements and Model Validation %X Concurrent multipath transport layer mechanisms have gained recently increasing interest in research and standardization because of the potential for bandwidth aggregation, load balancing and increased reliability. Multihomed end devices may benefit from IP-based multipath protocols like Multipath TCP or Concurrent Multipath Transmission via SCTP. In the future, concurrent multipath transport might be transparent to network and transport layer protocols as proposed by the concept of Transport Virtualization. This mechanism enables the pooling of heterogeneous transmission technologies or physical paths. However, the selection and application of multiple paths and its impact on the transmission is non-intuitive. Our prior work on transport virtualization discussed the impact of delay diversity of pooled paths on concurrent data transmissions. A mathematical model was introduced enabling the analysis of packet re-ordering that occurs due to different path delays. In this paper we extend our investigations by validating the previously presented analytical and simulative models with measurements performed in Planetlab Europe and the Etomic testbed.
• Evaluating OpenFlow Performance using Queueing Models. Jarschel, Michael; Klein, Dominik. Berlin, Germany, 2011, November.
  • [ BibTeX ]
  • [ EndNote ]
  @misc{info3-poster-2011-31, address = {Berlin, Germany}, author = {Jarschel, Michael and Klein, Dominik}, booktitle = {CHANGE & OFELIA Summer School}, keywords = {sys:hidden:poster}, month = 11, title = {Evaluating OpenFlow Performance using Queueing Models}, year = 2011 }

  %0 Generic %1 info3-poster-2011-31 %A Jarschel, Michael %A Klein, Dominik %B CHANGE & OFELIA Summer School %C Berlin, Germany %D 2011 %T Evaluating OpenFlow Performance using Queueing Models

• NAT Traversal for LISP Mobile Node. Klein, Dominik. ACM CoNEXT workshop Re-Architecting the Internet (ReArch), Philadelphia, PA, USA, 2010, November 30.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2010-399, address = {ACM CoNEXT workshop Re-Architecting the Internet (ReArch), Philadelphia, PA, USA}, author = {Klein, Dominik}, keywords = {sys:hidden:presentation}, month = 11, title = {NAT Traversal for LISP Mobile Node}, year = 2010 }

  %0 Generic %1 info3-talk-2010-399 %A Klein, Dominik %C ACM CoNEXT workshop Re-Architecting the Internet (ReArch), Philadelphia, PA, USA %D 2010 %T NAT Traversal for LISP Mobile Node
• Neue Ansätze für Massendatentransfer. Pries, Rastin; Klein, Dominik. Datev Trendscout, Nürnberg, 2010, December 2.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2010-400, address = {Datev Trendscout, Nürnberg}, author = {Pries, Rastin and Klein, Dominik}, keywords = {sys:hidden:presentation}, month = 12, title = {Neue Ansätze für Massendatentransfer}, year = 2010 }

  %0 Generic %1 info3-talk-2010-400 %A Pries, Rastin %A Klein, Dominik %C Datev Trendscout, Nürnberg %D 2010 %T Neue Ansätze für Massendatentransfer
• NAT Traversal for LISP Mobile Node. Klein, Dominik; Hartmann, Matthias; Menth, Michael. In ACM CoNEXT workshop Re-Architecting the Internet (ReArch). Philadelphia, PA, USA, 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. Klein, Dominik. 22nd International Teletraffic Congress (ITC22), Amsterdam, The Netherlands, 2010, September 7.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2010-390, address = {22nd International Teletraffic Congress (ITC22), Amsterdam, The Netherlands}, author = {Klein, Dominik}, keywords = {sys:hidden:presentation}, month = {09}, title = {Improvements to LISP Mobile Node}, year = 2010 }

  %0 Generic %1 info3-talk-2010-390 %A Klein, Dominik %C 22nd International Teletraffic Congress (ITC22), Amsterdam, The Netherlands %D 2010 %T Improvements to LISP Mobile Node
• Improvements to LISP Mobile Node. Menth, Michael; Klein, Dominik; Hartmann, Matthias. In 22nd International Teletraffic Congress (ITC). Amsterdam, The Netherlands, 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 = {09}, 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.
• Improvements to LISP Mobile Node Including NAT Traversal. Klein, Dominik; Hartmann, Matthias; Höfling, Michael; Menth, Michael. Würzburg, Germany, 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 = {08}, 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
• Measurement-based Topology and Performance Investigations of D-A-CH Research Networks. Technical Report (473), . Klein, Dominik; Tutschku, Kurt; Zinner, Thomas. University of Wuerzburg, 2010.
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @techreport{info3-techreport-2010-253, author = {Klein, Dominik and Tutschku, Kurt and Zinner, Thomas}, institution = {University of Wuerzburg}, keywords = {sys:hidden:techreport}, month = {08}, number = 473, title = {Measurement-based Topology and Performance Investigations of D-A-CH Research Networks}, year = 2010 }

  %0 Report %1 info3-techreport-2010-253 %A Klein, Dominik %A Tutschku, Kurt %A Zinner, Thomas %D 2010 %N 473 %T Measurement-based Topology and Performance Investigations of D-A-CH Research Networks
• 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 = {06}, 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
• Global Locator, Local Locator, and Identifier Split (GLI-Split). Technical Report (470), . Menth, Michael; Hartmann, Matthias; Klein, Dominik. University of Wuerzburg, 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 = {04}, 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)

• Global Locator, Local Locator, and Identifier Split (GLI-Split). Menth, Michael; Hartmann, Matthias; Klein, Dominik. Würzburg, Germany, 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 = {07}, 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)

• Future Internet Routing: Motivation and Design Issues. Menth, Michael; Hartmann, Matthias; Tran-Gia, Phuoc; Klein, Dominik. In it - Information Technology, 50(6). 2008.
  • [ 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.