Dr. rer. nat. Michael Duelli

• Experimental Demonstration of Network Virtualization and Resource Flexibility in the COMCON Project. Duelli, Michael; Meier, Sebastian; Wagner, David; Zinner, Thomas; Schmid, Matthias; Hoffmann, Marco; Kiess, Wolfgang. In 8th International ICST Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities. Thessaloniki, 2012.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  In the recent past, Network Virtualization (NV) received much attention. In the beginning, the Future Internet research community was interested in deploying innovative protocols in isolated networks. Then, business models have been developed that separate functions today being united in the Internet Service Provider (ISP) and by that defining a vertically and horizontally divided market. Nevertheless, Virtual Net- works (VNs) are still not available on the market. The consortium of the COntrol and Management of COexisting Networks (COMCON) project examines the potential interactions in such divided market and evaluates the applicability of existing technologies for automated virtualizationenabled network management. To promote the manifold research, a selected scenario was demonstrated at the Euroview 2011. The network virtualization in this scenario is based on Generalized Multi-Protocol La- bel Switching (GMPLS) and allows exible resource provisioning, i.e. the topology and its elements may be changed during life time of the VN. As innovative service we selected a Video on Demand (VoD) service using a Scalable Video Codec (SVC) that allows to route the video on layer granularity. A multi-level multi-tennant monitoring system is used to provide status information on physical as well as on virtual network level. The scenario shows how exible VN provisioning and innovative services may interact across the different players and by that solving challenging situations. All necessary components have been implemented and the selected scenario has been executed on a real network based on Linux PCs. In this paper, we describe the components, the scenario and the insights gained in more detail.

  @inproceedings{info3-inproceedings-2012-443, abstract = {In the recent past, Network Virtualization (NV) received much attention. In the beginning, the Future Internet research community was interested in deploying innovative protocols in isolated networks. Then, business models have been developed that separate functions today being united in the Internet Service Provider (ISP) and by that defining a vertically and horizontally divided market. Nevertheless, Virtual Net- works (VNs) are still not available on the market. The consortium of the COntrol and Management of COexisting Networks (COMCON) project examines the potential interactions in such divided market and evaluates the applicability of existing technologies for automated virtualizationenabled network management. To promote the manifold research, a selected scenario was demonstrated at the Euroview 2011. The network virtualization in this scenario is based on Generalized Multi-Protocol La- bel Switching (GMPLS) and allows exible resource provisioning, i.e. the topology and its elements may be changed during life time of the VN. As innovative service we selected a Video on Demand (VoD) service using a Scalable Video Codec (SVC) that allows to route the video on layer granularity. A multi-level multi-tennant monitoring system is used to provide status information on physical as well as on virtual network level. The scenario shows how exible VN provisioning and innovative services may interact across the different players and by that solving challenging situations. All necessary components have been implemented and the selected scenario has been executed on a real network based on Linux PCs. In this paper, we describe the components, the scenario and the insights gained in more detail.}, address = {Thessaloniki}, author = {Duelli, Michael and Meier, Sebastian and Wagner, David and Zinner, Thomas and Schmid, Matthias and Hoffmann, Marco and Kiess, Wolfgang}, booktitle = {8th International ICST Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities}, keywords = {sys:hidden:inproceedings}, month = {06}, title = {Experimental Demonstration of Network Virtualization and Resource Flexibility in the COMCON Project}, year = 2012 }

  %0 Conference Paper %1 info3-inproceedings-2012-443 %A Duelli, Michael %A Meier, Sebastian %A Wagner, David %A Zinner, Thomas %A Schmid, Matthias %A Hoffmann, Marco %A Kiess, Wolfgang %B 8th International ICST Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities %C Thessaloniki %D 2012 %T Experimental Demonstration of Network Virtualization and Resource Flexibility in the COMCON Project %X In the recent past, Network Virtualization (NV) received much attention. In the beginning, the Future Internet research community was interested in deploying innovative protocols in isolated networks. Then, business models have been developed that separate functions today being united in the Internet Service Provider (ISP) and by that defining a vertically and horizontally divided market. Nevertheless, Virtual Net- works (VNs) are still not available on the market. The consortium of the COntrol and Management of COexisting Networks (COMCON) project examines the potential interactions in such divided market and evaluates the applicability of existing technologies for automated virtualizationenabled network management. To promote the manifold research, a selected scenario was demonstrated at the Euroview 2011. The network virtualization in this scenario is based on Generalized Multi-Protocol La- bel Switching (GMPLS) and allows exible resource provisioning, i.e. the topology and its elements may be changed during life time of the VN. As innovative service we selected a Video on Demand (VoD) service using a Scalable Video Codec (SVC) that allows to route the video on layer granularity. A multi-level multi-tennant monitoring system is used to provide status information on physical as well as on virtual network level. The scenario shows how exible VN provisioning and innovative services may interact across the different players and by that solving challenging situations. All necessary components have been implemented and the selected scenario has been executed on a real network based on Linux PCs. In this paper, we describe the components, the scenario and the insights gained in more detail.
• Energy Efficient Virtual Network Embedding. Felipe Botero, Juan; Hesselbach, Xavier; Duelli, Michael; Schlosser, Daniel; Fischer, Andreas; de Meer, Hermann. In IEEE Communication Letters, PP. 2012.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Waste of energy due to over-provisioning and over-dimensioning of network infrastructures has recently stimulated the interest on energy consumption reduction by Internet Service Providers (ISPs). By means of resource consolidation, network virtualization based architectures will enable energy saving. In this letter, we extend the well-known virtual network embedding problem (VNE) to energy awareness and propose a mixed integer program (MIP) which provides optimal energy efficient embeddings. Simulation results show the energy gains of the proposed MIP over the existing cost-based VNE approach.

  @article{info3-article-2012-100, abstract = {Waste of energy due to over-provisioning and over-dimensioning of network infrastructures has recently stimulated the interest on energy consumption reduction by Internet Service Providers (ISPs). By means of resource consolidation, network virtualization based architectures will enable energy saving. In this letter, we extend the well-known virtual network embedding problem (VNE) to energy awareness and propose a mixed integer program (MIP) which provides optimal energy efficient embeddings. Simulation results show the energy gains of the proposed MIP over the existing cost-based VNE approach.}, author = {Felipe Botero, Juan and Hesselbach, Xavier and Duelli, Michael and Schlosser, Daniel and Fischer, Andreas and de Meer, Hermann}, journal = {IEEE Communication Letters}, keywords = {sys:hidden:article}, month = {03}, title = {Energy Efficient Virtual Network Embedding}, volume = {PP}, year = 2012 }

  %0 Journal Article %1 info3-article-2012-100 %A Felipe Botero, Juan %A Hesselbach, Xavier %A Duelli, Michael %A Schlosser, Daniel %A Fischer, Andreas %A de Meer, Hermann %D 2012 %J IEEE Communication Letters %T Energy Efficient Virtual Network Embedding %V PP %X Waste of energy due to over-provisioning and over-dimensioning of network infrastructures has recently stimulated the interest on energy consumption reduction by Internet Service Providers (ISPs). By means of resource consolidation, network virtualization based architectures will enable energy saving. In this letter, we extend the well-known virtual network embedding problem (VNE) to energy awareness and propose a mixed integer program (MIP) which provides optimal energy efficient embeddings. Simulation results show the energy gains of the proposed MIP over the existing cost-based VNE approach.
• Heuristic Design and Provisioning of Resilient Multi-Layer Networks. Duelli, Michael. 2012, February.
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @phdthesis{info3-dissertation-2012-30, author = {Duelli, Michael}, keywords = {sys:hidden:dissertation}, month = {02}, title = {Heuristic Design and Provisioning of Resilient Multi-Layer Networks}, year = 2012 }

  %0 Thesis %1 info3-dissertation-2012-30 %A Duelli, Michael %D 2012 %T Heuristic Design and Provisioning of Resilient Multi-Layer Networks

• MuLaNEO: Eine Software zur Planung und Optimierung von Mehrdienstnetzen. Duelli, Michael; Ott, Julian; Qin, Xiaohua; Weber, Eduard. Kiel, Germany, 2011, March.
  • [ BibTeX ]
  • [ EndNote ]
  @misc{info3-software-2011-1, address = {Kiel, Germany}, author = {Duelli, Michael and Ott, Julian and Qin, Xiaohua and Weber, Eduard}, booktitle = {KiVS}, keywords = {sys:hidden:software}, month = {03}, title = {MuLaNEO: Eine Software zur Planung und Optimierung von Mehrdienstnetzen}, year = 2011 }

  %0 Generic %1 info3-software-2011-1 %A Duelli, Michael %A Ott, Julian %A Qin, Xiaohua %A Weber, Eduard %B KiVS %C Kiel, Germany %D 2011 %T MuLaNEO: Eine Software zur Planung und Optimierung von Mehrdienstnetzen
• Provisioning and Operation of Virtual Networks. Meier, Sebastian; Barisch, Marc; Kirstädter, Andreas; Schlosser, Daniel; Duelli, Michael; Jarschel, Michael; Hoßfeld, Tobias; Hoffmann, Klaus; Hoffmann, Marco; Kellerer, Wolfgang; Khan, Ashiq; Jurca, Dan; Kozu, Kazuyuki. In Electronic Communications of the EASST, Kommunikation in Verteilten Systemen 2011, 37. 2011.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  In today’s Internet, requirements of services regarding the underlying transport network are very diverse. In the future, this diversity will increase and make it harder to accommodate all services in a single network. A possible approach to keep up with this diversity in future networks is the deployment of isolated, custom tailored networks on top of a single shared physical substrate. The COMCON (COntrol and Monitoring of COexisting Networks) project aims to define a reference architecture for setup, control, and monitoring of virtual networks on a provider- and operator-grade level. In this paper, we present the building blocks and interfaces of our architecture.

  @article{info3-article-2011-87, abstract = {In today’s Internet, requirements of services regarding the underlying transport network are very diverse. In the future, this diversity will increase and make it harder to accommodate all services in a single network. A possible approach to keep up with this diversity in future networks is the deployment of isolated, custom tailored networks on top of a single shared physical substrate. The COMCON (COntrol and Monitoring of COexisting Networks) project aims to define a reference architecture for setup, control, and monitoring of virtual networks on a provider- and operator-grade level. In this paper, we present the building blocks and interfaces of our architecture.}, author = {Meier, Sebastian and Barisch, Marc and Kirstädter, Andreas and Schlosser, Daniel and Duelli, Michael and Jarschel, Michael and Hoßfeld, Tobias and Hoffmann, Klaus and Hoffmann, Marco and Kellerer, Wolfgang and Khan, Ashiq and Jurca, Dan and Kozu, Kazuyuki}, journal = {Electronic Communications of the EASST, Kommunikation in Verteilten Systemen 2011}, keywords = {sys:hidden:article}, month = {03}, title = {Provisioning and Operation of Virtual Networks}, volume = 37, year = 2011 }

  %0 Journal Article %1 info3-article-2011-87 %A Meier, Sebastian %A Barisch, Marc %A Kirstädter, Andreas %A Schlosser, Daniel %A Duelli, Michael %A Jarschel, Michael %A Hoßfeld, Tobias %A Hoffmann, Klaus %A Hoffmann, Marco %A Kellerer, Wolfgang %A Khan, Ashiq %A Jurca, Dan %A Kozu, Kazuyuki %D 2011 %J Electronic Communications of the EASST, Kommunikation in Verteilten Systemen 2011 %T Provisioning and Operation of Virtual Networks %V 37 %X In today’s Internet, requirements of services regarding the underlying transport network are very diverse. In the future, this diversity will increase and make it harder to accommodate all services in a single network. A possible approach to keep up with this diversity in future networks is the deployment of isolated, custom tailored networks on top of a single shared physical substrate. The COMCON (COntrol and Monitoring of COexisting Networks) project aims to define a reference architecture for setup, control, and monitoring of virtual networks on a provider- and operator-grade level. In this paper, we present the building blocks and interfaces of our architecture.
• Performance Comparison of Common Server Hardware Virtualization Solutions Regarding the Network Throughput of Virtualized Systems. Technical Report (479), . Schlosser, Daniel; Duelli, Michael; Goll, Sebastian. University of Wuerzburg, 2011.
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @techreport{info3-techreport-2011-257, author = {Schlosser, Daniel and Duelli, Michael and Goll, Sebastian}, institution = {University of Wuerzburg}, keywords = {sys:hidden:techreport}, month = {03}, number = 479, title = {Performance Comparison of Common Server Hardware Virtualization Solutions Regarding the Network Throughput of Virtualized Systems}, year = 2011 }

  %0 Report %1 info3-techreport-2011-257 %A Schlosser, Daniel %A Duelli, Michael %A Goll, Sebastian %D 2011 %N 479 %T Performance Comparison of Common Server Hardware Virtualization Solutions Regarding the Network Throughput of Virtualized Systems
• ALEVIN - A Framework to Develop, Compare, and Analyze Virtual Network Embedding Algorithms. Fischer, Andreas; Felipe Botero, Juan; Duelli, Michael; Schlosser, Daniel; Hesselbach, Xavier; de Meer, Hermann. In Electronic Communications of the EASST, Kommunikation in Verteilten Systemen 2011, 37. 2011.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Network virtualization is recognized as an enabling technology for the Future Internet. Applying virtualization of network resources leads to the problem of mapping virtual resources to physical resources, known as “Virtual Network Embedding” (VNE). Several algorithms attempting to solve this problem have been discussed in the literature, so far. However, comparison of VNE algorithms is hard, as each algorithm focuses on different criteria. To that end, we introduce a framework to compare different algorithms according to a set of metrics, which allow to evaluate the algorithms and compute their results on a given scenario for arbitrary parameters.

  @article{info3-article-2011-88, abstract = {Network virtualization is recognized as an enabling technology for the Future Internet. Applying virtualization of network resources leads to the problem of mapping virtual resources to physical resources, known as “Virtual Network Embedding” (VNE). Several algorithms attempting to solve this problem have been discussed in the literature, so far. However, comparison of VNE algorithms is hard, as each algorithm focuses on different criteria. To that end, we introduce a framework to compare different algorithms according to a set of metrics, which allow to evaluate the algorithms and compute their results on a given scenario for arbitrary parameters.}, author = {Fischer, Andreas and Felipe Botero, Juan and Duelli, Michael and Schlosser, Daniel and Hesselbach, Xavier and de Meer, Hermann}, journal = {Electronic Communications of the EASST, Kommunikation in Verteilten Systemen 2011}, keywords = {sys:hidden:article}, month = {03}, title = {ALEVIN - A Framework to Develop, Compare, and Analyze Virtual Network Embedding Algorithms}, volume = 37, year = 2011 }

  %0 Journal Article %1 info3-article-2011-88 %A Fischer, Andreas %A Felipe Botero, Juan %A Duelli, Michael %A Schlosser, Daniel %A Hesselbach, Xavier %A de Meer, Hermann %D 2011 %J Electronic Communications of the EASST, Kommunikation in Verteilten Systemen 2011 %T ALEVIN - A Framework to Develop, Compare, and Analyze Virtual Network Embedding Algorithms %V 37 %X Network virtualization is recognized as an enabling technology for the Future Internet. Applying virtualization of network resources leads to the problem of mapping virtual resources to physical resources, known as “Virtual Network Embedding” (VNE). Several algorithms attempting to solve this problem have been discussed in the literature, so far. However, comparison of VNE algorithms is hard, as each algorithm focuses on different criteria. To that end, we introduce a framework to compare different algorithms according to a set of metrics, which allow to evaluate the algorithms and compute their results on a given scenario for arbitrary parameters.
• MuLaNEO: Eine Software zur Planung und Optimierung von Mehrdienstnetzen. Duelli, Michael; Ott, Julian; Qin, Xiaohua; Weber, Eduard. Kiel, Germany, 2011, March.
  • [ BibTeX ]
  • [ EndNote ]
  @misc{info3-poster-2011-27, address = {Kiel, Germany}, author = {Duelli, Michael and Ott, Julian and Qin, Xiaohua and Weber, Eduard}, booktitle = {Endrunde des KuVS Communication Software-Preis im Rahmen der KiVS 2011}, keywords = {sys:hidden:poster}, month = {03}, title = {MuLaNEO: Eine Software zur Planung und Optimierung von Mehrdienstnetzen}, year = 2011 }

  %0 Generic %1 info3-poster-2011-27 %A Duelli, Michael %A Ott, Julian %A Qin, Xiaohua %A Weber, Eduard %B Endrunde des KuVS Communication Software-Preis im Rahmen der KiVS 2011 %C Kiel, Germany %D 2011 %T MuLaNEO: Eine Software zur Planung und Optimierung von Mehrdienstnetzen
• MuLaViTo: Multi-Layer Visualization Tool. Duelli, Michael; Ott, Julian; Müller, Thilo. 2011, April.
  • [ BibTeX ]
  • [ EndNote ]
  @misc{info3-software-2011-2, author = {Duelli, Michael and Ott, Julian and Müller, Thilo}, booktitle = {7th Euro-NF Conference on Next Generation Internet}, keywords = {sys:hidden:software}, month = {04}, title = {MuLaViTo: Multi-Layer Visualization Tool}, year = 2011 }

  %0 Generic %1 info3-software-2011-2 %A Duelli, Michael %A Ott, Julian %A Müller, Thilo %B 7th Euro-NF Conference on Next Generation Internet %D 2011 %T MuLaViTo: Multi-Layer Visualization Tool
• Performance Comparison of Hardware Virtualization Platforms. Schlosser, Daniel; Duelli, Michael; Goll, Sebastian. In IFIP/TC6 NETWORKING 2011 (NETWORKING 2011). Valencia, Spain, 2011.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Hosting virtual servers on a shared physical hardware by means of hardware virtualization is common use at data centers, web hosters, and research facilities. All platforms include isolation techniques that restrict resource consumption of the virtual guest machines. However, these isolation techniques have an impact on the performance of the guest systems. In this paper, we study how popular hardware virtualization approaches (OpenVZ, KVM, Xen v4, VirtualBox, VMware ESXi) affect the network throughput of a virtualized system. We compare their impact in a dedicated and a shared host scenario as well as to the bare host system. Our results provide an overview on the performance of popular hardware virtualization platforms on commodity hardware in terms of network throughput.

  @inproceedings{info3-inproceedings-2011-407, abstract = {Hosting virtual servers on a shared physical hardware by means of hardware virtualization is common use at data centers, web hosters, and research facilities. All platforms include isolation techniques that restrict resource consumption of the virtual guest machines. However, these isolation techniques have an impact on the performance of the guest systems. In this paper, we study how popular hardware virtualization approaches (OpenVZ, KVM, Xen v4, VirtualBox, VMware ESXi) affect the network throughput of a virtualized system. We compare their impact in a dedicated and a shared host scenario as well as to the bare host system. Our results provide an overview on the performance of popular hardware virtualization platforms on commodity hardware in terms of network throughput.}, address = {Valencia, Spain}, author = {Schlosser, Daniel and Duelli, Michael and Goll, Sebastian}, booktitle = {IFIP/TC6 NETWORKING 2011 (NETWORKING 2011)}, keywords = {sys:hidden:inproceedings}, month = {05}, title = {Performance Comparison of Hardware Virtualization Platforms}, year = 2011 }

  %0 Conference Paper %1 info3-inproceedings-2011-407 %A Schlosser, Daniel %A Duelli, Michael %A Goll, Sebastian %B IFIP/TC6 NETWORKING 2011 (NETWORKING 2011) %C Valencia, Spain %D 2011 %T Performance Comparison of Hardware Virtualization Platforms %X Hosting virtual servers on a shared physical hardware by means of hardware virtualization is common use at data centers, web hosters, and research facilities. All platforms include isolation techniques that restrict resource consumption of the virtual guest machines. However, these isolation techniques have an impact on the performance of the guest systems. In this paper, we study how popular hardware virtualization approaches (OpenVZ, KVM, Xen v4, VirtualBox, VMware ESXi) affect the network throughput of a virtualized system. We compare their impact in a dedicated and a shared host scenario as well as to the bare host system. Our results provide an overview on the performance of popular hardware virtualization platforms on commodity hardware in terms of network throughput.
• ALEVIN: Algorithms for Embedding VIrtual Networks. Duelli, Michael; Schlosser, Daniel; Singeorzan, Vlad; Felipe Botero, Juan; Hesselbach, Xavier; Diaz Cervantes, Lisset; Fischer, Andreas; Till Beck, Michael. 2011, May.
  • [ BibTeX ]
  • [ EndNote ]
  @misc{info3-software-2011-3, author = {Duelli, Michael and Schlosser, Daniel and Singeorzan, Vlad and Felipe Botero, Juan and Hesselbach, Xavier and Diaz Cervantes, Lisset and Fischer, Andreas and Till Beck, Michael}, booktitle = {7th Conference on Next Generation Internet, EURO-NGI}, keywords = {sys:hidden:software}, month = {05}, title = {ALEVIN: Algorithms for Embedding VIrtual Networks}, year = 2011 }

  %0 Generic %1 info3-software-2011-3 %A Duelli, Michael %A Schlosser, Daniel %A Singeorzan, Vlad %A Felipe Botero, Juan %A Hesselbach, Xavier %A Diaz Cervantes, Lisset %A Fischer, Andreas %A Till Beck, Michael %B 7th Conference on Next Generation Internet, EURO-NGI %D 2011 %T ALEVIN: Algorithms for Embedding VIrtual Networks
• VNREAL: Virtual Network Resource Embedding ALgorithms in the Framework ALEVIN. Duelli, Michael; Schlosser, Daniel; Felipe Botero, Juan; Hesselbach, Xavier; Fischer, Andreas; de Meer, Hermann. In 7th Euro-NF Conference on Next Generation Internet Networks (NGI 2011). Kaiserslautern, Germany, 2011.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Network virtualization is recognized as an enabling technology for the Future Internet that overcomes network ossification. However, it introduces a set of challenges. In any network virtualization environment, the problem of optimally mapping virtual resources to physical resources, known as virtual network embedding (VNE), is a critical challenge. Several algorithms attempting to solve this problem have been proposed in literature, so far. However, comparison of existing and new VNE algorithms is hard, as each algorithm focuses on different criteria. To that end, the VNREAL project introduces ALEVIN, a framework to compare different algorithms according to a set of metrics, easily incorporate new VNE algorithms, and evaluate these algorithms on a given scenario for arbitrary parameters.

  @inproceedings{info3-inproceedings-2011-421, abstract = {Network virtualization is recognized as an enabling technology for the Future Internet that overcomes network ossification. However, it introduces a set of challenges. In any network virtualization environment, the problem of optimally mapping virtual resources to physical resources, known as virtual network embedding (VNE), is a critical challenge. Several algorithms attempting to solve this problem have been proposed in literature, so far. However, comparison of existing and new VNE algorithms is hard, as each algorithm focuses on different criteria. To that end, the VNREAL project introduces ALEVIN, a framework to compare different algorithms according to a set of metrics, easily incorporate new VNE algorithms, and evaluate these algorithms on a given scenario for arbitrary parameters.}, address = {Kaiserslautern, Germany}, author = {Duelli, Michael and Schlosser, Daniel and Felipe Botero, Juan and Hesselbach, Xavier and Fischer, Andreas and de Meer, Hermann}, booktitle = {7th Euro-NF Conference on Next Generation Internet Networks (NGI 2011)}, keywords = {sys:hidden:inproceedings}, month = {06}, title = {VNREAL: Virtual Network Resource Embedding ALgorithms in the Framework ALEVIN}, year = 2011 }

  %0 Conference Paper %1 info3-inproceedings-2011-421 %A Duelli, Michael %A Schlosser, Daniel %A Felipe Botero, Juan %A Hesselbach, Xavier %A Fischer, Andreas %A de Meer, Hermann %B 7th Euro-NF Conference on Next Generation Internet Networks (NGI 2011) %C Kaiserslautern, Germany %D 2011 %T VNREAL: Virtual Network Resource Embedding ALgorithms in the Framework ALEVIN %X Network virtualization is recognized as an enabling technology for the Future Internet that overcomes network ossification. However, it introduces a set of challenges. In any network virtualization environment, the problem of optimally mapping virtual resources to physical resources, known as virtual network embedding (VNE), is a critical challenge. Several algorithms attempting to solve this problem have been proposed in literature, so far. However, comparison of existing and new VNE algorithms is hard, as each algorithm focuses on different criteria. To that end, the VNREAL project introduces ALEVIN, a framework to compare different algorithms according to a set of metrics, easily incorporate new VNE algorithms, and evaluate these algorithms on a given scenario for arbitrary parameters.
• IPOM: Interactive Proxy Management Tool for Future Communication Networks Using OpenFlow. Jarschel, Michael; Schlosser, Daniel; Duelli, Michael; Pries, Rastin. Kaiserslautern, Germany, 2011, June.
  • [ BibTeX ]
  • [ EndNote ]
  @misc{info3-software-2011-6, address = {Kaiserslautern, Germany}, author = {Jarschel, Michael and Schlosser, Daniel and Duelli, Michael and Pries, Rastin}, booktitle = {Next Generation Internet (NGI)}, keywords = {sys:hidden:software}, month = {06}, title = {IPOM: Interactive Proxy Management Tool for Future Communication Networks Using OpenFlow}, year = 2011 }

  %0 Generic %1 info3-software-2011-6 %A Jarschel, Michael %A Schlosser, Daniel %A Duelli, Michael %A Pries, Rastin %B Next Generation Internet (NGI) %C Kaiserslautern, Germany %D 2011 %T IPOM: Interactive Proxy Management Tool for Future Communication Networks Using OpenFlow
• VNREAL: Virtual Network Resource Embedding ALgorithms in the Framework ALEVIN. Duelli, Michael. 7th Euro-NF Conference on Next Generation Internet Networks (NGI 2011), Kaiserslautern, Germany, 2011, June 28.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2011-422, address = {7th Euro-NF Conference on Next Generation Internet Networks (NGI 2011), Kaiserslautern, Germany}, author = {Duelli, Michael}, keywords = {sys:hidden:presentation}, month = {06}, title = {VNREAL: Virtual Network Resource Embedding ALgorithms in the Framework ALEVIN}, year = 2011 }

  %0 Generic %1 info3-talk-2011-422 %A Duelli, Michael %C 7th Euro-NF Conference on Next Generation Internet Networks (NGI 2011), Kaiserslautern, Germany %D 2011 %T VNREAL: Virtual Network Resource Embedding ALgorithms in the Framework ALEVIN
• Flexible VNE Algorithms Analysis using ALEVIN. Felipe Botero, Juan; Hesselbach, Xavier; Duelli, Michael; Schlosser, Daniel; Fischer, Andreas; de Meer, Hermann. In Euroview 2011. 2011.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Network virtualization is recognized as an enabling technology for the Future Internet that overcomes network ossification. However, it introduces a set of challenges. In any network virtualization environment, the problem of optimally mapping virtual demands to physical resources, known as virtual network embedding (VNE), is a crucial challenge. This paper analyses the behaviour of the main algorithms proposed to solve VNE by means of the ALEVIN framework. The VNE algorithms are evaluated with regard to appropriate metrics such as: cost, revenue, and virtual network acceptance ratio. We also analyse the impact of the recently introduced hidden hop demand concept in the performance of the VNE algorithms.

  @inproceedings{info3-inproceedings-2011-427, abstract = {Network virtualization is recognized as an enabling technology for the Future Internet that overcomes network ossification. However, it introduces a set of challenges. In any network virtualization environment, the problem of optimally mapping virtual demands to physical resources, known as virtual network embedding (VNE), is a crucial challenge. This paper analyses the behaviour of the main algorithms proposed to solve VNE by means of the ALEVIN framework. The VNE algorithms are evaluated with regard to appropriate metrics such as: cost, revenue, and virtual network acceptance ratio. We also analyse the impact of the recently introduced hidden hop demand concept in the performance of the VNE algorithms.}, author = {Felipe Botero, Juan and Hesselbach, Xavier and Duelli, Michael and Schlosser, Daniel and Fischer, Andreas and de Meer, Hermann}, booktitle = {Euroview 2011}, keywords = {sys:hidden:inproceedings}, month = {08}, title = {Flexible VNE Algorithms Analysis using ALEVIN}, year = 2011 }

  %0 Conference Paper %1 info3-inproceedings-2011-427 %A Felipe Botero, Juan %A Hesselbach, Xavier %A Duelli, Michael %A Schlosser, Daniel %A Fischer, Andreas %A de Meer, Hermann %B Euroview 2011 %D 2011 %T Flexible VNE Algorithms Analysis using ALEVIN %X Network virtualization is recognized as an enabling technology for the Future Internet that overcomes network ossification. However, it introduces a set of challenges. In any network virtualization environment, the problem of optimally mapping virtual demands to physical resources, known as virtual network embedding (VNE), is a crucial challenge. This paper analyses the behaviour of the main algorithms proposed to solve VNE by means of the ALEVIN framework. The VNE algorithms are evaluated with regard to appropriate metrics such as: cost, revenue, and virtual network acceptance ratio. We also analyse the impact of the recently introduced hidden hop demand concept in the performance of the VNE algorithms.
• MuLaNEO: Planung und Optimierung von Mehrdienstnetzen. Duelli, Michael; Ott, Julian; Qin, Xiaohua; Weber, Eduard. In PIK - Praxis der Informationsverarbeitung und Kommunikation, 34, pp. 138–139. 2011.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Telekommunikationsanbieter benötigen Netze, die mehrere Dienste/Technologien unterstützen und im Rahmen gegebener Anforderungsprofile ausfallsicher und zugleich kostengünstig sind. Die Planung solcher Netze kann auf ein kombinatorisches Optimierungsproblem mit exponentieller Komplexität zurückgeführt werden. In diesem Beitrag stellen wir eine offene und modulare Software für die vereinfachte Entwicklung und den Vergleich solcher Planungsverfahren vor.

  @article{info3-article-2011-99, abstract = {Telekommunikationsanbieter benötigen Netze, die mehrere Dienste/Technologien unterstützen und im Rahmen gegebener Anforderungsprofile ausfallsicher und zugleich kostengünstig sind. Die Planung solcher Netze kann auf ein kombinatorisches Optimierungsproblem mit exponentieller Komplexität zurückgeführt werden. In diesem Beitrag stellen wir eine offene und modulare Software für die vereinfachte Entwicklung und den Vergleich solcher Planungsverfahren vor.}, author = {Duelli, Michael and Ott, Julian and Qin, Xiaohua and Weber, Eduard}, journal = {PIK - Praxis der Informationsverarbeitung und Kommunikation}, keywords = {sys:hidden:article}, month = {08}, pages = {138–139}, title = {MuLaNEO: Planung und Optimierung von Mehrdienstnetzen}, volume = 34, year = 2011 }

  %0 Journal Article %1 info3-article-2011-99 %A Duelli, Michael %A Ott, Julian %A Qin, Xiaohua %A Weber, Eduard %D 2011 %J PIK - Praxis der Informationsverarbeitung und Kommunikation %P 138--139 %T MuLaNEO: Planung und Optimierung von Mehrdienstnetzen %V 34 %X Telekommunikationsanbieter benötigen Netze, die mehrere Dienste/Technologien unterstützen und im Rahmen gegebener Anforderungsprofile ausfallsicher und zugleich kostengünstig sind. Die Planung solcher Netze kann auf ein kombinatorisches Optimierungsproblem mit exponentieller Komplexität zurückgeführt werden. In diesem Beitrag stellen wir eine offene und modulare Software für die vereinfachte Entwicklung und den Vergleich solcher Planungsverfahren vor.
• Service Component Mobility Enabled by Network Virtualization. Schlosser, Daniel; Duelli, Michael; Zinner, Thomas; Meier, Sebastian; Wagner, David; Barisch, Marc; Hoffmann, Marco; Kellerer, Wolfgang; Schmid, Matthias. In Euroview 2011. 2011.
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @inproceedings{info3-inproceedings-2011-429, author = {Schlosser, Daniel and Duelli, Michael and Zinner, Thomas and Meier, Sebastian and Wagner, David and Barisch, Marc and Hoffmann, Marco and Kellerer, Wolfgang and Schmid, Matthias}, booktitle = {Euroview 2011}, keywords = {sys:hidden:inproceedings}, month = {08}, title = {Service Component Mobility Enabled by Network Virtualization}, year = 2011 }

  %0 Conference Paper %1 info3-inproceedings-2011-429 %A Schlosser, Daniel %A Duelli, Michael %A Zinner, Thomas %A Meier, Sebastian %A Wagner, David %A Barisch, Marc %A Hoffmann, Marco %A Kellerer, Wolfgang %A Schmid, Matthias %B Euroview 2011 %D 2011 %T Service Component Mobility Enabled by Network Virtualization

• Deferring CAPEX Investments in Multi-Layer Networks through IP Traffic-Dependent Expansion Stages. Duelli, Michael; Endler, Anke; Menth, Michael. In 11. ITG-Fachtagung Photonische Netze, pp. 133–138. Leipzig, Germany, 2010.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Network design is performed for a traffic load in the future. This traffic load is far greater than traffic loads observed at intermediate stages. In this paper, we propose to plan a multi-layer network for such a future traffic load, but instead of provisioning the full network equipment at once, we suggest to defer the deployment of expensive IP interfaces and other enabling equipment only to stages when they are really needed to carry traffic. We develop an algorithm that concentrates IP traffic at an intermediate stage on a subset of those IP interfaces that are required to carry the full load in the future. This reduces the set of used IP interfaces which need to be installed at intermediate stages, and CAPEX investments for the other equipment can be deferred to the future.

  @inproceedings{info3-inproceedings-2010-374, abstract = {Network design is performed for a traffic load in the future. This traffic load is far greater than traffic loads observed at intermediate stages. In this paper, we propose to plan a multi-layer network for such a future traffic load, but instead of provisioning the full network equipment at once, we suggest to defer the deployment of expensive IP interfaces and other enabling equipment only to stages when they are really needed to carry traffic. We develop an algorithm that concentrates IP traffic at an intermediate stage on a subset of those IP interfaces that are required to carry the full load in the future. This reduces the set of used IP interfaces which need to be installed at intermediate stages, and CAPEX investments for the other equipment can be deferred to the future.}, address = {Leipzig, Germany}, author = {Duelli, Michael and Endler, Anke and Menth, Michael}, booktitle = {11. ITG-Fachtagung Photonische Netze}, keywords = {100get}, month = {05}, pages = {133–138}, title = {Deferring CAPEX Investments in Multi-Layer Networks through IP Traffic-Dependent Expansion Stages}, year = 2010 }

  %0 Conference Paper %1 info3-inproceedings-2010-374 %A Duelli, Michael %A Endler, Anke %A Menth, Michael %B 11. ITG-Fachtagung Photonische Netze %C Leipzig, Germany %D 2010 %P 133--138 %T Deferring CAPEX Investments in Multi-Layer Networks through IP Traffic-Dependent Expansion Stages %X Network design is performed for a traffic load in the future. This traffic load is far greater than traffic loads observed at intermediate stages. In this paper, we propose to plan a multi-layer network for such a future traffic load, but instead of provisioning the full network equipment at once, we suggest to defer the deployment of expensive IP interfaces and other enabling equipment only to stages when they are really needed to carry traffic. We develop an algorithm that concentrates IP traffic at an intermediate stage on a subset of those IP interfaces that are required to carry the full load in the future. This reduces the set of used IP interfaces which need to be installed at intermediate stages, and CAPEX investments for the other equipment can be deferred to the future.
• Deferring CAPEX Investments in Multi-Layer Networks through IP Traffic-Dependent Expansion Stages. Duelli, Michael. 11. ITG-Fachtagung Photonische Netze, Leipzig, Germany, 2010, May 4.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2010-369, address = {11. ITG-Fachtagung Photonische Netze, Leipzig, Germany}, author = {Duelli, Michael}, keywords = {sys:hidden:presentation}, month = {05}, title = {Deferring CAPEX Investments in Multi-Layer Networks through IP Traffic-Dependent Expansion Stages}, year = 2010 }

  %0 Generic %1 info3-talk-2010-369 %A Duelli, Michael %C 11. ITG-Fachtagung Photonische Netze, Leipzig, Germany %D 2010 %T Deferring CAPEX Investments in Multi-Layer Networks through IP Traffic-Dependent Expansion Stages
• Greedy Design of Resilient Multi-Layer Networks. Duelli, Michael; Qin, Xiaohua; Menth, Michael. In 6th Conference on Next Generation Internet Networks (NGI 2010). Paris, France, 2010.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  In this paper, we propose a deterministic greedy heuristic providing a construction layout for a cost-efficient multi-layer network that is able to carry a given set of traffic demands with and without protection on different layers. We apply the heuristic to different reference network topologies and protection requirements. Evaluations are conducted regarding equipment cost on different layers, blocking probability, path lengths, and number of demands affected by specific failures.

  @inproceedings{info3-inproceedings-2010-382, abstract = {In this paper, we propose a deterministic greedy heuristic providing a construction layout for a cost-efficient multi-layer network that is able to carry a given set of traffic demands with and without protection on different layers. We apply the heuristic to different reference network topologies and protection requirements. Evaluations are conducted regarding equipment cost on different layers, blocking probability, path lengths, and number of demands affected by specific failures.}, address = {Paris, France}, author = {Duelli, Michael and Qin, Xiaohua and Menth, Michael}, booktitle = {6th Conference on Next Generation Internet Networks (NGI 2010)}, keywords = {100get}, month = {06}, title = {Greedy Design of Resilient Multi-Layer Networks}, year = 2010 }

  %0 Conference Paper %1 info3-inproceedings-2010-382 %A Duelli, Michael %A Qin, Xiaohua %A Menth, Michael %B 6th Conference on Next Generation Internet Networks (NGI 2010) %C Paris, France %D 2010 %T Greedy Design of Resilient Multi-Layer Networks %X In this paper, we propose a deterministic greedy heuristic providing a construction layout for a cost-efficient multi-layer network that is able to carry a given set of traffic demands with and without protection on different layers. We apply the heuristic to different reference network topologies and protection requirements. Evaluations are conducted regarding equipment cost on different layers, blocking probability, path lengths, and number of demands affected by specific failures.
• Greedy Design of Resilient Multi-Layer Networks. Duelli, Michael. 6th Conference on Next Generation Internet Networks (NGI 2010), Paris, France, 2010, June 4.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2010-375, address = {6th Conference on Next Generation Internet Networks (NGI 2010), Paris, France}, author = {Duelli, Michael}, keywords = {100get}, month = {06}, title = {Greedy Design of Resilient Multi-Layer Networks}, year = 2010 }

  %0 Generic %1 info3-talk-2010-375 %A Duelli, Michael %C 6th Conference on Next Generation Internet Networks (NGI 2010), Paris, France %D 2010 %T Greedy Design of Resilient Multi-Layer Networks
• A Use Case Driven Approach to Network Virtualization. Schlosser, Daniel; Jarschel, Michael; Duelli, Michael; Hoßfeld, Tobias; Hoffmann, Klaus; Hoffmann, Marco; Jochen Morper, Hans; Jurca, Dan; Khan, Ashiq. In accepted at IEEE Kaleidoscope 2010, published via OPUS Würzburg under OpenAccess. Würzburg, 2010.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  In today's Internet, services are very different in their requirements on the underlying transport network. In the future, this diversity will increase and it will be more difficult to accommodate all services in a single network. A possible approach to cope with this diversity within future networks is the introduction of support for running isolated networks for different services on top of a single shared physical substrate. This would also enable easy network management and ensure an economically sound operation. End-customers will readily adopt this approach as it enables new and innovative services without being expensive. In order to arrive at a concept that enables this kind of network, it needs to be designed around and constantly checked against realistic use cases. In this contribution, we present three use cases for future networks. We describe functional blocks of a virtual network architecture, which are necessary to support these use cases within the network. Furthermore, we discuss the interfaces needed between the functional blocks and consider standardization issues that arise in order to achieve a global consistent control and management structure of virtual networks.

  @inproceedings{info3-inproceedings-2010-412, abstract = {In today's Internet, services are very different in their requirements on the underlying transport network. In the future, this diversity will increase and it will be more difficult to accommodate all services in a single network. A possible approach to cope with this diversity within future networks is the introduction of support for running isolated networks for different services on top of a single shared physical substrate. This would also enable easy network management and ensure an economically sound operation. End-customers will readily adopt this approach as it enables new and innovative services without being expensive. In order to arrive at a concept that enables this kind of network, it needs to be designed around and constantly checked against realistic use cases. In this contribution, we present three use cases for future networks. We describe functional blocks of a virtual network architecture, which are necessary to support these use cases within the network. Furthermore, we discuss the interfaces needed between the functional blocks and consider standardization issues that arise in order to achieve a global consistent control and management structure of virtual networks.}, address = {Würzburg}, author = {Schlosser, Daniel and Jarschel, Michael and Duelli, Michael and Hoßfeld, Tobias and Hoffmann, Klaus and Hoffmann, Marco and Jochen Morper, Hans and Jurca, Dan and Khan, Ashiq}, booktitle = {accepted at IEEE Kaleidoscope 2010, published via OPUS Würzburg under OpenAccess}, keywords = {sys:hidden:inproceedings}, month = 12, title = {A Use Case Driven Approach to Network Virtualization}, year = 2010 }

  %0 Conference Paper %1 info3-inproceedings-2010-412 %A Schlosser, Daniel %A Jarschel, Michael %A Duelli, Michael %A Hoßfeld, Tobias %A Hoffmann, Klaus %A Hoffmann, Marco %A Jochen Morper, Hans %A Jurca, Dan %A Khan, Ashiq %B accepted at IEEE Kaleidoscope 2010, published via OPUS Würzburg under OpenAccess %C Würzburg %D 2010 %T A Use Case Driven Approach to Network Virtualization %X In today's Internet, services are very different in their requirements on the underlying transport network. In the future, this diversity will increase and it will be more difficult to accommodate all services in a single network. A possible approach to cope with this diversity within future networks is the introduction of support for running isolated networks for different services on top of a single shared physical substrate. This would also enable easy network management and ensure an economically sound operation. End-customers will readily adopt this approach as it enables new and innovative services without being expensive. In order to arrive at a concept that enables this kind of network, it needs to be designed around and constantly checked against realistic use cases. In this contribution, we present three use cases for future networks. We describe functional blocks of a virtual network architecture, which are necessary to support these use cases within the network. Furthermore, we discuss the interfaces needed between the functional blocks and consider standardization issues that arise in order to achieve a global consistent control and management structure of virtual networks.
• Routing, Grooming, Resilience, and Resource Management (100GET-E3-R3G). Duelli, Michael. BMBF/CELTIC Status Meeting 100GET, Stuttgart, Germany, 2010, June 16.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2010-379, address = {BMBF/CELTIC Status Meeting 100GET, Stuttgart, Germany}, author = {Duelli, Michael}, keywords = {sys:hidden:presentation}, month = {06}, title = {Routing, Grooming, Resilience, and Resource Management (100GET-E3-R3G)}, year = 2010 }

  %0 Generic %1 info3-talk-2010-379 %A Duelli, Michael %C BMBF/CELTIC Status Meeting 100GET, Stuttgart, Germany %D 2010 %T Routing, Grooming, Resilience, and Resource Management (100GET-E3-R3G)

• A Generic Algorithm for CAPEX-Aware Multi-Layer Network Design. Duelli, Michael. 10. ITG-Fachtagung Photonische Netze, Leipzig, Germany, 2009, May 5.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2009-336, address = {10. ITG-Fachtagung Photonische Netze, Leipzig, Germany}, author = {Duelli, Michael}, keywords = {100get}, month = {05}, title = {A Generic Algorithm for CAPEX-Aware Multi-Layer Network Design}, year = 2009 }

  %0 Generic %1 info3-talk-2009-336 %A Duelli, Michael %C 10. ITG-Fachtagung Photonische Netze, Leipzig, Germany %D 2009 %T A Generic Algorithm for CAPEX-Aware Multi-Layer Network Design
• A Framework for Multi-Layer Network Design in 100GET-E3-R3G. Duelli, Michael; Weber, Eduard; Menth, Michael. Brunswick, Germany, 2009, February.
  • [ BibTeX ]
  • [ EndNote ]
  @misc{info3-poster-2009-21, address = {Brunswick, Germany}, author = {Duelli, Michael and Weber, Eduard and Menth, Michael}, booktitle = {Invited Poster, ONDM 2009}, keywords = {sys:hidden:poster}, month = {02}, title = {A Framework for Multi-Layer Network Design in 100GET-E3-R3G}, year = 2009 }

  %0 Generic %1 info3-poster-2009-21 %A Duelli, Michael %A Weber, Eduard %A Menth, Michael %B Invited Poster, ONDM 2009 %C Brunswick, Germany %D 2009 %T A Framework for Multi-Layer Network Design in 100GET-E3-R3G
• A Generic Algorithm for CAPEX-Aware Multi-Layer Network Design. Duelli, Michael; Weber, Eduard; Menth, Michael. In 10. ITG-Fachtagung Photonische Netze, pp. 167–174. Leipzig, Germany, 2009.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Capital expenditure (CAPEX), i.e. equipment cost, is a decisive criterion for the design of a new network infrastructure. The design of efficient transport networks requires the interconnection of multiple technologies which form separate layers with their own networking view and routing. This leads to the notion of multi-layer networks. CAPEX-aware design of such networks requires algorithms which propose multi-layer hardware configurations that are able to carry a given set of traffic demands at minimal CAPEX. We present a generic algorithm for CAPEX-aware multi-layer network design as well as a computationally viable implementation and perform evaluations on realistic network topologies. The underlying CAPEX and multi-layer technology models are explained in detail.

  @inproceedings{info3-inproceedings-2009-343, abstract = {Capital expenditure (CAPEX), i.e. equipment cost, is a decisive criterion for the design of a new network infrastructure. The design of efficient transport networks requires the interconnection of multiple technologies which form separate layers with their own networking view and routing. This leads to the notion of multi-layer networks. CAPEX-aware design of such networks requires algorithms which propose multi-layer hardware configurations that are able to carry a given set of traffic demands at minimal CAPEX. We present a generic algorithm for CAPEX-aware multi-layer network design as well as a computationally viable implementation and perform evaluations on realistic network topologies. The underlying CAPEX and multi-layer technology models are explained in detail.}, address = {Leipzig, Germany}, author = {Duelli, Michael and Weber, Eduard and Menth, Michael}, booktitle = {10. ITG-Fachtagung Photonische Netze}, keywords = {100get}, month = {05}, pages = {167–174}, title = {A Generic Algorithm for CAPEX-Aware Multi-Layer Network Design}, year = 2009 }

  %0 Conference Paper %1 info3-inproceedings-2009-343 %A Duelli, Michael %A Weber, Eduard %A Menth, Michael %B 10. ITG-Fachtagung Photonische Netze %C Leipzig, Germany %D 2009 %P 167--174 %T A Generic Algorithm for CAPEX-Aware Multi-Layer Network Design %X Capital expenditure (CAPEX), i.e. equipment cost, is a decisive criterion for the design of a new network infrastructure. The design of efficient transport networks requires the interconnection of multiple technologies which form separate layers with their own networking view and routing. This leads to the notion of multi-layer networks. CAPEX-aware design of such networks requires algorithms which propose multi-layer hardware configurations that are able to carry a given set of traffic demands at minimal CAPEX. We present a generic algorithm for CAPEX-aware multi-layer network design as well as a computationally viable implementation and perform evaluations on realistic network topologies. The underlying CAPEX and multi-layer technology models are explained in detail.
• Chapter VIII: Cooperation Strategies for P2P Content Distribution in Cellular Mobile Networks: Considering Mobility and Heterogeneity. Hoßfeld, Tobias; Duelli, Michael; Staehle, Dirk; Tran-Gia, Phuoc. In Mobile Peer-to-Peer Computing for Next Generation Distributed Environments: Advancing Conceptual and Algorithmic Applications, B.-C. Seet (ed.), pp. 1234–5678. Information Science Reference, ISBN: 978-1-60566-715-7, 2009.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  The performance of P2P content distribution in cellular networks depends highly on the cooperation and coordination of heterogeneous and often selfish mobile users. The major challenges are the identification of problems specifically arising in cellular mobile networks and the development of new cooperation strategies to overcome these problems. In the coherent previous chapter, we focused on the selfishness of users in such heterogeneous environments. This discussion is now extended by emphasizing the impact of mobility and vertical handover between different wireless access technologies. An abstract mobility model is required to allow the performance evaluation in feasible computational time. As a result, the performance in today’s and future cellular networks is predicted and new approaches to master heterogeneity in cellular networks are derived.

  @incollection{info3-incollection-2009-10, abstract = {The performance of P2P content distribution in cellular networks depends highly on the cooperation and coordination of heterogeneous and often selfish mobile users. The major challenges are the identification of problems specifically arising in cellular mobile networks and the development of new cooperation strategies to overcome these problems. In the coherent previous chapter, we focused on the selfishness of users in such heterogeneous environments. This discussion is now extended by emphasizing the impact of mobility and vertical handover between different wireless access technologies. An abstract mobility model is required to allow the performance evaluation in feasible computational time. As a result, the performance in today’s and future cellular networks is predicted and new approaches to master heterogeneity in cellular networks are derived.}, author = {Hoßfeld, Tobias and Duelli, Michael and Staehle, Dirk and Tran-Gia, Phuoc}, booktitle = {Mobile Peer-to-Peer Computing for Next Generation Distributed Environments: Advancing Conceptual and Algorithmic Applications}, editor = {Seet, Boon-Chong}, keywords = {myown}, month = {05}, pages = {1234–5678}, publisher = {Information Science Reference, ISBN: 978-1-60566-715-7}, title = {Chapter VIII: Cooperation Strategies for P2P Content Distribution in Cellular Mobile Networks: Considering Mobility and Heterogeneity}, year = 2009 }

  %0 Book Section %1 info3-incollection-2009-10 %A Hoßfeld, Tobias %A Duelli, Michael %A Staehle, Dirk %A Tran-Gia, Phuoc %B Mobile Peer-to-Peer Computing for Next Generation Distributed Environments: Advancing Conceptual and Algorithmic Applications %D 2009 %E Seet, Boon-Chong %I Information Science Reference, ISBN: 978-1-60566-715-7 %P 1234--5678 %T Chapter VIII: Cooperation Strategies for P2P Content Distribution in Cellular Mobile Networks: Considering Mobility and Heterogeneity %X The performance of P2P content distribution in cellular networks depends highly on the cooperation and coordination of heterogeneous and often selfish mobile users. The major challenges are the identification of problems specifically arising in cellular mobile networks and the development of new cooperation strategies to overcome these problems. In the coherent previous chapter, we focused on the selfishness of users in such heterogeneous environments. This discussion is now extended by emphasizing the impact of mobility and vertical handover between different wireless access technologies. An abstract mobility model is required to allow the performance evaluation in feasible computational time. As a result, the performance in today’s and future cellular networks is predicted and new approaches to master heterogeneity in cellular networks are derived.
• CAPEX-Aware Design of Survivable DWDM Mesh Networks. Pluntke, Christopher; Menth, Michael; Duelli, Michael. In IEEE International Conference on Communications (ICC). Dresden, Germany, 2009.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  This paper reviews the basic architecture and component costs of opaque, transparent, and semi-transparent DWDM networks and looks at the network design problem from a capital expenditure (CAPEX) point of view. Given are a fiber topology and a demand matrix with different bit rates. Required is the least-cost optical equipment for that topology together with the routing and potential muxponder-based aggregation of all demands such that they can be supported by the newly designed network. We look at the problem for networks without resilience requirements and for survivable networks using 1+1 protection against single fiber cuts. We model this problem for the three types of optical networks by integer linear programs (ILPs) in a canonical way.

  @inproceedings{info3-inproceedings-2009-342, abstract = {This paper reviews the basic architecture and component costs of opaque, transparent, and semi-transparent DWDM networks and looks at the network design problem from a capital expenditure (CAPEX) point of view. Given are a fiber topology and a demand matrix with different bit rates. Required is the least-cost optical equipment for that topology together with the routing and potential muxponder-based aggregation of all demands such that they can be supported by the newly designed network. We look at the problem for networks without resilience requirements and for survivable networks using 1+1 protection against single fiber cuts. We model this problem for the three types of optical networks by integer linear programs (ILPs) in a canonical way.}, address = {Dresden, Germany}, author = {Pluntke, Christopher and Menth, Michael and Duelli, Michael}, booktitle = {IEEE International Conference on Communications (ICC)}, keywords = {100get}, month = {06}, title = {CAPEX-Aware Design of Survivable DWDM Mesh Networks}, year = 2009 }

  %0 Conference Paper %1 info3-inproceedings-2009-342 %A Pluntke, Christopher %A Menth, Michael %A Duelli, Michael %B IEEE International Conference on Communications (ICC) %C Dresden, Germany %D 2009 %T CAPEX-Aware Design of Survivable DWDM Mesh Networks %X This paper reviews the basic architecture and component costs of opaque, transparent, and semi-transparent DWDM networks and looks at the network design problem from a capital expenditure (CAPEX) point of view. Given are a fiber topology and a demand matrix with different bit rates. Required is the least-cost optical equipment for that topology together with the routing and potential muxponder-based aggregation of all demands such that they can be supported by the newly designed network. We look at the problem for networks without resilience requirements and for survivable networks using 1+1 protection against single fiber cuts. We model this problem for the three types of optical networks by integer linear programs (ILPs) in a canonical way.
• Routing, Grooming, Resilience, and Resource Management (100GET-E3-R3G). Duelli, Michael. BMBF/CELTIC Status Meeting 100GET, Dresden, Germany, 2009, June 24.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2009-345, address = {BMBF/CELTIC Status Meeting 100GET, Dresden, Germany}, author = {Duelli, Michael}, keywords = {sys:hidden:presentation}, month = {06}, title = {Routing, Grooming, Resilience, and Resource Management (100GET-E3-R3G)}, year = 2009 }

  %0 Generic %1 info3-talk-2009-345 %A Duelli, Michael %C BMBF/CELTIC Status Meeting 100GET, Dresden, Germany %D 2009 %T Routing, Grooming, Resilience, and Resource Management (100GET-E3-R3G)
• Network Planning, Control and Management Perspectives on Dynamic Networking. Michaelis, Thomas; Duelli, Michael; Chamania, Mohit; Lichtinger, Bernhard; Rambach, Franz; Türk, Stefan. In European Conference and Exhibition on Optical Communication (ECOC). Vienna, Austria, 2009.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Besides the frequently claimed cost savings due to automation, one major advantage of dynamic networking is that this networking paradigm matches the mode of operation which is observed in the Internet and is essential for making transport networks a native part of it. This talk highlights three essential ingredients of dynamic networking: Firstly, network planning creates the required degrees of freedom in the data plane for a dynamic control plane. Secondly, service provisioning and restoration provide the required agility for dynamic network operation, no matter if implemented on the management or on a control plane. Eventually, service management ensures adequate service performance across all involved network domains. We conclude that all of these aspects need to be addressed adequately in order to realize dynamic networking.

  @inproceedings{info3-inproceedings-2009-356, abstract = {Besides the frequently claimed cost savings due to automation, one major advantage of dynamic networking is that this networking paradigm matches the mode of operation which is observed in the Internet and is essential for making transport networks a native part of it. This talk highlights three essential ingredients of dynamic networking: Firstly, network planning creates the required degrees of freedom in the data plane for a dynamic control plane. Secondly, service provisioning and restoration provide the required agility for dynamic network operation, no matter if implemented on the management or on a control plane. Eventually, service management ensures adequate service performance across all involved network domains. We conclude that all of these aspects need to be addressed adequately in order to realize dynamic networking.}, address = {Vienna, Austria}, author = {Michaelis, Thomas and Duelli, Michael and Chamania, Mohit and Lichtinger, Bernhard and Rambach, Franz and Türk, Stefan}, booktitle = {European Conference and Exhibition on Optical Communication (ECOC)}, keywords = {100get}, month = {09}, title = {Network Planning, Control and Management Perspectives on Dynamic Networking}, year = 2009 }

  %0 Conference Paper %1 info3-inproceedings-2009-356 %A Michaelis, Thomas %A Duelli, Michael %A Chamania, Mohit %A Lichtinger, Bernhard %A Rambach, Franz %A Türk, Stefan %B European Conference and Exhibition on Optical Communication (ECOC) %C Vienna, Austria %D 2009 %T Network Planning, Control and Management Perspectives on Dynamic Networking %X Besides the frequently claimed cost savings due to automation, one major advantage of dynamic networking is that this networking paradigm matches the mode of operation which is observed in the Internet and is essential for making transport networks a native part of it. This talk highlights three essential ingredients of dynamic networking: Firstly, network planning creates the required degrees of freedom in the data plane for a dynamic control plane. Secondly, service provisioning and restoration provide the required agility for dynamic network operation, no matter if implemented on the management or on a control plane. Eventually, service management ensures adequate service performance across all involved network domains. We conclude that all of these aspects need to be addressed adequately in order to realize dynamic networking.
• Resilience Analysis for Packet-Switched Communication Networks. Menth, Michael; Duelli, Michael; Martin, Rüdiger; Milbrandt, Jens. In IEEE/ACM Transactions on Networking, 17. 2009.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  In the presence of local network outages, restoration and protection switching mechanisms redirect the traffic over alternative paths to mitigate the effect of failures. However, some failure combinations still lead to loss of ingress-egress connectivity within a network or to severe congestion due to rerouted traffic. Congestion may also be caused by unexpected traffic shifts due to changed user behavior or due to changes of interdomain routing. This paper presents a framework for the analysis of ingress-egress unavailability and congestion due to (1) failures, (2) changes of user behavior, and (3) changed interdomain routing. It proposes algorithms to find the most probable combinations of (1), (2), and (3), and to evaluate the connectivity and the relative link load of the network under these conditions. We have implemented this concept in a software tool and its visualization of the results leads to a comprehensive view of the network’s resilience. It helps to anticipate potential ingress-egress disconnection and congestion before failures and overload occur or before planned modifications (new infrastructure, new routing, new customers) take effect. Thus, it detects weak points in a network, predicts the effectiveness of potential upgrades, and thereby supports careful bandwidth overprovisioning.

  @article{info3-article-2009-59, abstract = {In the presence of local network outages, restoration and protection switching mechanisms redirect the traffic over alternative paths to mitigate the effect of failures. However, some failure combinations still lead to loss of ingress-egress connectivity within a network or to severe congestion due to rerouted traffic. Congestion may also be caused by unexpected traffic shifts due to changed user behavior or due to changes of interdomain routing. This paper presents a framework for the analysis of ingress-egress unavailability and congestion due to (1) failures, (2) changes of user behavior, and (3) changed interdomain routing. It proposes algorithms to find the most probable combinations of (1), (2), and (3), and to evaluate the connectivity and the relative link load of the network under these conditions. We have implemented this concept in a software tool and its visualization of the results leads to a comprehensive view of the network’s resilience. It helps to anticipate potential ingress-egress disconnection and congestion before failures and overload occur or before planned modifications (new infrastructure, new routing, new customers) take effect. Thus, it detects weak points in a network, predicts the effectiveness of potential upgrades, and thereby supports careful bandwidth overprovisioning.}, author = {Menth, Michael and Duelli, Michael and Martin, Rüdiger and Milbrandt, Jens}, journal = {IEEE/ACM Transactions on Networking}, keywords = {sys:hidden:article}, month = 12, title = {Resilience Analysis for Packet-Switched Communication Networks}, volume = 17, year = 2009 }

  %0 Journal Article %1 info3-article-2009-59 %A Menth, Michael %A Duelli, Michael %A Martin, Rüdiger %A Milbrandt, Jens %D 2009 %J IEEE/ACM Transactions on Networking %T Resilience Analysis for Packet-Switched Communication Networks %V 17 %X In the presence of local network outages, restoration and protection switching mechanisms redirect the traffic over alternative paths to mitigate the effect of failures. However, some failure combinations still lead to loss of ingress-egress connectivity within a network or to severe congestion due to rerouted traffic. Congestion may also be caused by unexpected traffic shifts due to changed user behavior or due to changes of interdomain routing. This paper presents a framework for the analysis of ingress-egress unavailability and congestion due to (1) failures, (2) changes of user behavior, and (3) changed interdomain routing. It proposes algorithms to find the most probable combinations of (1), (2), and (3), and to evaluate the connectivity and the relative link load of the network under these conditions. We have implemented this concept in a software tool and its visualization of the results leads to a comprehensive view of the network’s resilience. It helps to anticipate potential ingress-egress disconnection and congestion before failures and overload occur or before planned modifications (new infrastructure, new routing, new customers) take effect. Thus, it detects weak points in a network, predicts the effectiveness of potential upgrades, and thereby supports careful bandwidth overprovisioning.

• Performance Evaluation of IP over Cost-Optimized Optical Multilayer Networks with SRLGs. Duelli, Michael. 9. ITG-Fachtagung Photonische Netze, Leipzig, Germany, 2008, April 28.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2008-271, address = {9. ITG-Fachtagung Photonische Netze, Leipzig, Germany}, author = {Duelli, Michael}, keywords = {100get}, month = {04}, title = {Performance Evaluation of IP over Cost-Optimized Optical Multilayer Networks with SRLGs}, year = 2008 }

  %0 Generic %1 info3-talk-2008-271 %A Duelli, Michael %C 9. ITG-Fachtagung Photonische Netze, Leipzig, Germany %D 2008 %T Performance Evaluation of IP over Cost-Optimized Optical Multilayer Networks with SRLGs
• CAPEX-Aware Multi-Layer Network Design. Duelli, Michael. Workshop der ITG-Fachgruppe 5.2.1 "Systemarchitektur und Traffic Engineering", Munich, Germany, 2008, November 14.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2008-329, address = {Workshop der ITG-Fachgruppe 5.2.1 "Systemarchitektur und Traffic Engineering", Munich, Germany}, author = {Duelli, Michael}, keywords = {sys:hidden:presentation}, month = 11, title = {CAPEX-Aware Multi-Layer Network Design}, year = 2008 }

  %0 Generic %1 info3-talk-2008-329 %A Duelli, Michael %C Workshop der ITG-Fachgruppe 5.2.1 "Systemarchitektur und Traffic Engineering", Munich, Germany %D 2008 %T CAPEX-Aware Multi-Layer Network Design
• 100GET-E3-R3G Kick-Off Presentation. Duelli, Michael. 100GET Kick-Off Meeting, Berlin, Germany, 2008, February 21.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2008-267, address = {100GET Kick-Off Meeting, Berlin, Germany}, author = {Duelli, Michael}, keywords = {sys:hidden:presentation}, month = {02}, title = {100GET-E3-R3G Kick-Off Presentation}, year = 2008 }

  %0 Generic %1 info3-talk-2008-267 %A Duelli, Michael %C 100GET Kick-Off Meeting, Berlin, Germany %D 2008 %T 100GET-E3-R3G Kick-Off Presentation
• Resource Management in Resilient Multilayer Networks. Duelli, Michael. BMBF/CELTIC Status Meeting 100GET and EIBONE, Hamburg, Germany, 2008, June 5.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2008-315, address = {BMBF/CELTIC Status Meeting 100GET and EIBONE, Hamburg, Germany}, author = {Duelli, Michael}, keywords = {sys:hidden:presentation}, month = {06}, title = {Resource Management in Resilient Multilayer Networks}, year = 2008 }

  %0 Generic %1 info3-talk-2008-315 %A Duelli, Michael %C BMBF/CELTIC Status Meeting 100GET and EIBONE, Hamburg, Germany %D 2008 %T Resource Management in Resilient Multilayer Networks
• Three Methods for Optimizing Single-Shortest Path Routing. Dzida, Mateusz; Zagozdzon, Michał; Zotkiewicz, Mateusz; Pióro, Michał; Pettersson, Mats Petter; Duelli, Michael; Menth, Michael. In 4th Euro-NGI Conference on Next Generation Internet Networks (NGI 2008). Krakow, Poland, 2008.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Intra-domain routing in IP networks is based on the shortest path principle by assigning administrative weights (costs) to links. The resulting least-cost paths determine routes between pairs of routers. If several such equal-cost paths exist between a pair of routers, it may not be clear which of them is actually used to route traffic. This makes it difficult to predict the network traffic flow distribution. Therefore, the selected link costs should assure uniqueness of the shortest paths. On top of that, the link costs can be optimized with respect to some traffic objective. The resulting optimization problem, referred to as SSPP, turns out to be N P-hard. SSPP can be formulated as a mixed-integer programming problem and, as such, solved with branch-and-bound (B&B). In this paper, we consider three methods for SSPP. Two of them are exact methods based on B&B, namely branch-and-cut and constraint programming. Since the exact solutions of SSPP may require excessive computation time and may not always be effective when applied to practical networks, we also study a fast heuristic method. Finally, in a numerical study, we compare the effectiveness of the three approaches.

  @inproceedings{info3-inproceedings-2008-310, abstract = {Intra-domain routing in IP networks is based on the shortest path principle by assigning administrative weights (costs) to links. The resulting least-cost paths determine routes between pairs of routers. If several such equal-cost paths exist between a pair of routers, it may not be clear which of them is actually used to route traffic. This makes it difficult to predict the network traffic flow distribution. Therefore, the selected link costs should assure uniqueness of the shortest paths. On top of that, the link costs can be optimized with respect to some traffic objective. The resulting optimization problem, referred to as SSPP, turns out to be N P-hard. SSPP can be formulated as a mixed-integer programming problem and, as such, solved with branch-and-bound (B&B). In this paper, we consider three methods for SSPP. Two of them are exact methods based on B&B, namely branch-and-cut and constraint programming. Since the exact solutions of SSPP may require excessive computation time and may not always be effective when applied to practical networks, we also study a fast heuristic method. Finally, in a numerical study, we compare the effectiveness of the three approaches.}, address = {Krakow, Poland}, author = {Dzida, Mateusz and Zagozdzon, Michał and Zotkiewicz, Mateusz and Pióro, Michał and Pettersson, Mats Petter and Duelli, Michael and Menth, Michael}, booktitle = {4th Euro-NGI Conference on Next Generation Internet Networks (NGI 2008)}, keywords = {sys:hidden:inproceedings}, month = {04}, title = {Three Methods for Optimizing Single-Shortest Path Routing}, year = 2008 }

  %0 Conference Paper %1 info3-inproceedings-2008-310 %A Dzida, Mateusz %A Zagozdzon, Michał %A Zotkiewicz, Mateusz %A Pióro, Michał %A Pettersson, Mats Petter %A Duelli, Michael %A Menth, Michael %B 4th Euro-NGI Conference on Next Generation Internet Networks (NGI 2008) %C Krakow, Poland %D 2008 %T Three Methods for Optimizing Single-Shortest Path Routing %X Intra-domain routing in IP networks is based on the shortest path principle by assigning administrative weights (costs) to links. The resulting least-cost paths determine routes between pairs of routers. If several such equal-cost paths exist between a pair of routers, it may not be clear which of them is actually used to route traffic. This makes it difficult to predict the network traffic flow distribution. Therefore, the selected link costs should assure uniqueness of the shortest paths. On top of that, the link costs can be optimized with respect to some traffic objective. The resulting optimization problem, referred to as SSPP, turns out to be N P-hard. SSPP can be formulated as a mixed-integer programming problem and, as such, solved with branch-and-bound (B&B). In this paper, we consider three methods for SSPP. Two of them are exact methods based on B&B, namely branch-and-cut and constraint programming. Since the exact solutions of SSPP may require excessive computation time and may not always be effective when applied to practical networks, we also study a fast heuristic method. Finally, in a numerical study, we compare the effectiveness of the three approaches.
• 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, pp. 21–29. Leipzig, Germany, 2008.
  • [ 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 = {04}, 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.
• Minimizing Installation Costs of Survivable DWDM-Mesh Networks: A Heuristic Approach. Duelli, Michael; Pluntke, Christopher; Menth, Michael. In 4th Euro-NGI Conference on Next Generation Internet Networks (NGI 2008), pp. 15–22. Krakow, Poland, 2008.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  The cost function for the capacity of optical links follows a step function. That means, the support of one more lightpath might require a costly upgrade of an optical cross connect (OXC), but then additional lightpaths can be supported at almost no further cost. This should be considered when lightpaths are routed through an optical network. In this paper we optimize the routing of the lightpaths to minimize the costs for the required optical equipment. We consider this problem for the failure-free case only and for survivable networks using dedicated path protection. We formulate the problems by integer linear programs (ILPs). In addition, we propose heuristics to solve the problem since solving ILPs is computationally expensive and not feasible for large problem instances. We show that our heuristics lead to good results within a fraction of time compared to ILP solvers.

  @inproceedings{info3-inproceedings-2008-311, abstract = {The cost function for the capacity of optical links follows a step function. That means, the support of one more lightpath might require a costly upgrade of an optical cross connect (OXC), but then additional lightpaths can be supported at almost no further cost. This should be considered when lightpaths are routed through an optical network. In this paper we optimize the routing of the lightpaths to minimize the costs for the required optical equipment. We consider this problem for the failure-free case only and for survivable networks using dedicated path protection. We formulate the problems by integer linear programs (ILPs). In addition, we propose heuristics to solve the problem since solving ILPs is computationally expensive and not feasible for large problem instances. We show that our heuristics lead to good results within a fraction of time compared to ILP solvers.}, address = {Krakow, Poland}, author = {Duelli, Michael and Pluntke, Christopher and Menth, Michael}, booktitle = {4th Euro-NGI Conference on Next Generation Internet Networks (NGI 2008)}, keywords = {100get}, month = {04}, pages = {15–22}, title = {Minimizing Installation Costs of Survivable DWDM-Mesh Networks: A Heuristic Approach}, year = 2008 }

  %0 Conference Paper %1 info3-inproceedings-2008-311 %A Duelli, Michael %A Pluntke, Christopher %A Menth, Michael %B 4th Euro-NGI Conference on Next Generation Internet Networks (NGI 2008) %C Krakow, Poland %D 2008 %P 15--22 %T Minimizing Installation Costs of Survivable DWDM-Mesh Networks: A Heuristic Approach %X The cost function for the capacity of optical links follows a step function. That means, the support of one more lightpath might require a costly upgrade of an optical cross connect (OXC), but then additional lightpaths can be supported at almost no further cost. This should be considered when lightpaths are routed through an optical network. In this paper we optimize the routing of the lightpaths to minimize the costs for the required optical equipment. We consider this problem for the failure-free case only and for survivable networks using dedicated path protection. We formulate the problems by integer linear programs (ILPs). In addition, we propose heuristics to solve the problem since solving ILPs is computationally expensive and not feasible for large problem instances. We show that our heuristics lead to good results within a fraction of time compared to ILP solvers.

• Impact of Vertical Handovers on Cooperative Content Distribution Systems. Duelli, Michael. Seventh IEEE International Conference on Peer-to-Peer Computing (P2P2007), Galway, Ireland, 2007, September 5.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2007-255, address = {Seventh IEEE International Conference on Peer-to-Peer Computing (P2P2007), Galway, Ireland}, author = {Duelli, Michael}, keywords = {sys:hidden:presentation}, month = {09}, title = {Impact of Vertical Handovers on Cooperative Content Distribution Systems}, year = 2007 }

  %0 Generic %1 info3-talk-2007-255 %A Duelli, Michael %C Seventh IEEE International Conference on Peer-to-Peer Computing (P2P2007), Galway, Ireland %D 2007 %T Impact of Vertical Handovers on Cooperative Content Distribution Systems
• Impact of Vertical Handovers on Cooperative Content Distribution Systems. Duelli, Michael; Hoßfeld, Tobias; Staehle, Dirk. In Seventh IEEE International Conference on Peer-to-Peer Computing (P2P2007), pp. 177–184. Best Student Paper, Galway, Ireland, 2007.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  In this paper, we evaluate the performance of a P2P-based content distribution system in heterogeneous, wireless networks. The mobile users coordinate each other with cooperation strategies enabled by the multi-source download mechanism, as in eDonkey or BitTorrent. Due to the mobility, vertical handovers between different wireless access technologies are required which may result in transmission delays and IP address changes of the switching peer. Hence, connections among users have to be reestablished and downloading users are requeued at a providing peer’s waiting queue. In detail, we investigate the impact of requeueing with each VHO as well as the use of mechanisms that preserve the IP address and connections beyond VHOs, like MobileIP. Another important phenomenon occurring with VHOs is the abrupt change of the available bandwidth, e.g., from a fast WLAN connection to a rather slow UMTS connection. We evaluate the download times for files by means of simulation while considering different load scenarios in today’s and future network layouts of the B3G network. As a result of the performance evaluation, we derive a new time-based cooperation strategy that counters the impact of mobility. Instead of downloading individual blocks of a file, a user gets a time slot at a providing peer. We show that this leads to a significant performance gain.

  @inproceedings{info3-inproceedings-2007-290, abstract = {In this paper, we evaluate the performance of a P2P-based content distribution system in heterogeneous, wireless networks. The mobile users coordinate each other with cooperation strategies enabled by the multi-source download mechanism, as in eDonkey or BitTorrent. Due to the mobility, vertical handovers between different wireless access technologies are required which may result in transmission delays and IP address changes of the switching peer. Hence, connections among users have to be reestablished and downloading users are requeued at a providing peer’s waiting queue. In detail, we investigate the impact of requeueing with each VHO as well as the use of mechanisms that preserve the IP address and connections beyond VHOs, like MobileIP. Another important phenomenon occurring with VHOs is the abrupt change of the available bandwidth, e.g., from a fast WLAN connection to a rather slow UMTS connection. We evaluate the download times for files by means of simulation while considering different load scenarios in today’s and future network layouts of the B3G network. As a result of the performance evaluation, we derive a new time-based cooperation strategy that counters the impact of mobility. Instead of downloading individual blocks of a file, a user gets a time slot at a providing peer. We show that this leads to a significant performance gain.}, address = {Best Student Paper, Galway, Ireland}, author = {Duelli, Michael and Hoßfeld, Tobias and Staehle, Dirk}, booktitle = {Seventh IEEE International Conference on Peer-to-Peer Computing (P2P2007)}, keywords = {sys:hidden:inproceedings}, month = {09}, pages = {177–184}, title = {Impact of Vertical Handovers on Cooperative Content Distribution Systems}, year = 2007 }

  %0 Conference Paper %1 info3-inproceedings-2007-290 %A Duelli, Michael %A Hoßfeld, Tobias %A Staehle, Dirk %B Seventh IEEE International Conference on Peer-to-Peer Computing (P2P2007) %C Best Student Paper, Galway, Ireland %D 2007 %P 177--184 %T Impact of Vertical Handovers on Cooperative Content Distribution Systems %X In this paper, we evaluate the performance of a P2P-based content distribution system in heterogeneous, wireless networks. The mobile users coordinate each other with cooperation strategies enabled by the multi-source download mechanism, as in eDonkey or BitTorrent. Due to the mobility, vertical handovers between different wireless access technologies are required which may result in transmission delays and IP address changes of the switching peer. Hence, connections among users have to be reestablished and downloading users are requeued at a providing peer’s waiting queue. In detail, we investigate the impact of requeueing with each VHO as well as the use of mechanisms that preserve the IP address and connections beyond VHOs, like MobileIP. Another important phenomenon occurring with VHOs is the abrupt change of the available bandwidth, e.g., from a fast WLAN connection to a rather slow UMTS connection. We evaluate the download times for files by means of simulation while considering different load scenarios in today’s and future network layouts of the B3G network. As a result of the performance evaluation, we derive a new time-based cooperation strategy that counters the impact of mobility. Instead of downloading individual blocks of a file, a user gets a time slot at a providing peer. We show that this leads to a significant performance gain.
• Impact of Vertical Handovers on Cooperative Content Distribution Systems. Technical Report (428), . Duelli, Michael; Hoßfeld, Tobias; Staehle, Dirk. University of Wuerzburg, 2007.
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @techreport{info3-techreport-2007-223, author = {Duelli, Michael and Hoßfeld, Tobias and Staehle, Dirk}, institution = {University of Wuerzburg}, keywords = {sys:hidden:techreport}, month = {06}, number = 428, title = {Impact of Vertical Handovers on Cooperative Content Distribution Systems}, year = 2007 }

  %0 Report %1 info3-techreport-2007-223 %A Duelli, Michael %A Hoßfeld, Tobias %A Staehle, Dirk %D 2007 %N 428 %T Impact of Vertical Handovers on Cooperative Content Distribution Systems