Dr. rer. nat. Daniel Schlosser

• Internet Access Traffic Measurement and Analysis. Gebert, Steffen; Pries, Rastin; Schlosser, Daniel; Heck, Klaus. In Traffic Monitoring and Analysis (TMA) workshop co-located with the 13th Passive and Active Measurement (PAM) conference. Vienna, Austria, 2012.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  The fast changing application types and their behavior require consecutive measurements of access networks. In this paper, we present the results of a 14-day measurement in an access network connecting 600 users with the Internet. Our application classification reveals a trend back to HTTP traffic, underlines the immense usage of flash videos, and unveils a participant of a Botnet. In addition, flow and user statistics are presented, which resulting traffic models can be used for simulation and emulation of access networks.

  @inproceedings{info3-inproceedings-2012-432, abstract = {The fast changing application types and their behavior require consecutive measurements of access networks. In this paper, we present the results of a 14-day measurement in an access network connecting 600 users with the Internet. Our application classification reveals a trend back to HTTP traffic, underlines the immense usage of flash videos, and unveils a participant of a Botnet. In addition, flow and user statistics are presented, which resulting traffic models can be used for simulation and emulation of access networks.}, address = {Vienna, Austria}, author = {Gebert, Steffen and Pries, Rastin and Schlosser, Daniel and Heck, Klaus}, booktitle = {Traffic Monitoring and Analysis (TMA) workshop co-located with the 13th Passive and Active Measurement (PAM) conference}, keywords = {sys:hidden:inproceedings}, month = {03}, title = {Internet Access Traffic Measurement and Analysis}, year = 2012 }

  %0 Conference Paper %1 info3-inproceedings-2012-432 %A Gebert, Steffen %A Pries, Rastin %A Schlosser, Daniel %A Heck, Klaus %B Traffic Monitoring and Analysis (TMA) workshop co-located with the 13th Passive and Active Measurement (PAM) conference %C Vienna, Austria %D 2012 %T Internet Access Traffic Measurement and Analysis %X The fast changing application types and their behavior require consecutive measurements of access networks. In this paper, we present the results of a 14-day measurement in an access network connecting 600 users with the Internet. Our application classification reveals a trend back to HTTP traffic, underlines the immense usage of flash videos, and unveils a participant of a Botnet. In addition, flow and user statistics are presented, which resulting traffic models can be used for simulation and emulation of access networks.
• 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.
• Quality of Experience Management in Virtual Future Networks. Schlosser, Daniel. 2012, February.
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @phdthesis{info3-dissertation-2012-31, author = {Schlosser, Daniel}, keywords = {sys:hidden:dissertation}, month = {02}, title = {Quality of Experience Management in Virtual Future Networks}, year = 2012 }

  %0 Thesis %1 info3-dissertation-2012-31 %A Schlosser, Daniel %D 2012 %T Quality of Experience Management in Virtual Future Networks
• Gaming in the clouds: QoE and the users’ perspective. Jarschel, Michael; Schlosser, Daniel; Scheuring, Sven; Hoßfeld, Tobias. In Mathematical and Computer Modelling. 2012.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Cloud Gaming is a new kind of service, which combines the successful concepts of Cloud Computing and Online Gaming. It provides the entire game experience to the users remotely from a data center. The player is no longer dependent on a specific type or quality of gaming hardware, but is able to use common devices. The end device only needs a broadband internet connection and the ability to display High Definition (HD) video. While this may reduce hardware costs for users and increase the revenue for developers by leaving out the retail chain, it also raises new challenges for service quality in terms of bandwidth and latency for the underlying network. In this paper we present the results of a subjective user study we conducted into the user-perceived quality of experience (QoE) in Cloud Gaming. We design a measurement environment, that emulates this new type of service, define tests for users to assess the QoE, derive Key Influence Factors (KFI) and influences of content and perception from our results.

  @article{info3-article-2012-95, abstract = {Cloud Gaming is a new kind of service, which combines the successful concepts of Cloud Computing and Online Gaming. It provides the entire game experience to the users remotely from a data center. The player is no longer dependent on a specific type or quality of gaming hardware, but is able to use common devices. The end device only needs a broadband internet connection and the ability to display High Definition (HD) video. While this may reduce hardware costs for users and increase the revenue for developers by leaving out the retail chain, it also raises new challenges for service quality in terms of bandwidth and latency for the underlying network. In this paper we present the results of a subjective user study we conducted into the user-perceived quality of experience (QoE) in Cloud Gaming. We design a measurement environment, that emulates this new type of service, define tests for users to assess the QoE, derive Key Influence Factors (KFI) and influences of content and perception from our results.}, author = {Jarschel, Michael and Schlosser, Daniel and Scheuring, Sven and Hoßfeld, Tobias}, journal = {Mathematical and Computer Modelling}, keywords = {sys:hidden:article}, title = {Gaming in the clouds: QoE and the users’ perspective}, year = 2012 }

  %0 Journal Article %1 info3-article-2012-95 %A Jarschel, Michael %A Schlosser, Daniel %A Scheuring, Sven %A Hoßfeld, Tobias %D 2012 %J Mathematical and Computer Modelling %T Gaming in the clouds: QoE and the users’ perspective %X Cloud Gaming is a new kind of service, which combines the successful concepts of Cloud Computing and Online Gaming. It provides the entire game experience to the users remotely from a data center. The player is no longer dependent on a specific type or quality of gaming hardware, but is able to use common devices. The end device only needs a broadband internet connection and the ability to display High Definition (HD) video. While this may reduce hardware costs for users and increase the revenue for developers by leaving out the retail chain, it also raises new challenges for service quality in terms of bandwidth and latency for the underlying network. In this paper we present the results of a subjective user study we conducted into the user-perceived quality of experience (QoE) in Cloud Gaming. We design a measurement environment, that emulates this new type of service, define tests for users to assess the QoE, derive Key Influence Factors (KFI) and influences of content and perception from our results.

• 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.
• COntrol and Management of COexisting Networks (COMCON). Schlosser, Daniel; Jarschel, Michael; Meier, Sebastian; Hoffmann, Marco; Hoffmann, Klaus; Hoßfeld, Tobias; Khan, Ashiq; Kellerer, Wolfgang; Kirstädter, Andreas; Köhler, Stefan; Morper, Hans-Jochen; Schmid, Matthias. San Juan, Puerto Rico, 2011, March.
  • [ BibTeX ]
  • [ EndNote ]
  @misc{info3-poster-2011-26, address = {San Juan, Puerto Rico}, author = {Schlosser, Daniel and Jarschel, Michael and Meier, Sebastian and Hoffmann, Marco and Hoffmann, Klaus and Hoßfeld, Tobias and Khan, Ashiq and Kellerer, Wolfgang and Kirstädter, Andreas and Köhler, Stefan and Morper, Hans-Jochen and Schmid, Matthias}, booktitle = {1st DFG / NSF Young Researchers Workshop at GEC10}, keywords = {sys:hidden:poster}, month = {03}, title = {COntrol and Management of COexisting Networks (COMCON)}, year = 2011 }

  %0 Generic %1 info3-poster-2011-26 %A Schlosser, Daniel %A Jarschel, Michael %A Meier, Sebastian %A Hoffmann, Marco %A Hoffmann, Klaus %A Hoßfeld, Tobias %A Khan, Ashiq %A Kellerer, Wolfgang %A Kirstädter, Andreas %A Köhler, Stefan %A Morper, Hans-Jochen %A Schmid, Matthias %B 1st DFG / NSF Young Researchers Workshop at GEC10 %C San Juan, Puerto Rico %D 2011 %T COntrol and Management of COexisting Networks (COMCON)
• 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
• 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.
• Performance Comparison of Hardware Virtualization Platforms. Schlosser, Daniel. IFIP/TC6 NETWORKING 2011 (NETWORKING 2011), Valencia, Spain, 2011, May 10.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2011-414, address = {IFIP/TC6 NETWORKING 2011 (NETWORKING 2011), Valencia, Spain}, author = {Schlosser, Daniel}, keywords = {sys:hidden:presentation}, month = {05}, title = {Performance Comparison of Hardware Virtualization Platforms.}, year = 2011 }

  %0 Generic %1 info3-talk-2011-414 %A Schlosser, Daniel %C IFIP/TC6 NETWORKING 2011 (NETWORKING 2011), Valencia, Spain %D 2011 %T Performance Comparison of Hardware Virtualization Platforms.
• 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.
• An Evaluation of QoE in Cloud Gaming Based on Subjective Tests. Jarschel, Michael; Schlosser, Daniel; Scheuring, Sven; Hoßfeld, Tobias. In Workshop on Future Internet and Next Generation Networks (FINGNet-2011). Seoul, Korea, 2011.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Cloud Gaming is a new kind of service, which combines the successful concepts of Cloud Computing and Online Gaming. It provides the entire game experience to the users remotely from a data center. The player is no longer dependent on a specific type or quality of gaming hardware, but is able to use common devices. The end device only needs a broadband internet connection and the ability to display High Definition (HD) video. While this may reduce hardware costs for users and increase the revenue for developers by leaving out the retail chain, it also raises new challenges for service quality in terms of bandwidth and latency for the underlying network. In this paper we present the results of a subjective user study we conducted into the user-perceived quality of experience (QoE) in Cloud Gaming. We design a measurement environment, that emulates this new type of service, define tests for users to assess the QoE, derive Key Influence Factors (KFI) and influences of content and perception from our results.

  @inproceedings{info3-inproceedings-2011-411, abstract = {Cloud Gaming is a new kind of service, which combines the successful concepts of Cloud Computing and Online Gaming. It provides the entire game experience to the users remotely from a data center. The player is no longer dependent on a specific type or quality of gaming hardware, but is able to use common devices. The end device only needs a broadband internet connection and the ability to display High Definition (HD) video. While this may reduce hardware costs for users and increase the revenue for developers by leaving out the retail chain, it also raises new challenges for service quality in terms of bandwidth and latency for the underlying network. In this paper we present the results of a subjective user study we conducted into the user-perceived quality of experience (QoE) in Cloud Gaming. We design a measurement environment, that emulates this new type of service, define tests for users to assess the QoE, derive Key Influence Factors (KFI) and influences of content and perception from our results.}, address = {Seoul, Korea}, author = {Jarschel, Michael and Schlosser, Daniel and Scheuring, Sven and Hoßfeld, Tobias}, booktitle = {Workshop on Future Internet and Next Generation Networks (FINGNet-2011)}, keywords = {sys:hidden:inproceedings}, month = {06}, title = {An Evaluation of QoE in Cloud Gaming Based on Subjective Tests}, year = 2011 }

  %0 Conference Paper %1 info3-inproceedings-2011-411 %A Jarschel, Michael %A Schlosser, Daniel %A Scheuring, Sven %A Hoßfeld, Tobias %B Workshop on Future Internet and Next Generation Networks (FINGNet-2011) %C Seoul, Korea %D 2011 %T An Evaluation of QoE in Cloud Gaming Based on Subjective Tests %X Cloud Gaming is a new kind of service, which combines the successful concepts of Cloud Computing and Online Gaming. It provides the entire game experience to the users remotely from a data center. The player is no longer dependent on a specific type or quality of gaming hardware, but is able to use common devices. The end device only needs a broadband internet connection and the ability to display High Definition (HD) video. While this may reduce hardware costs for users and increase the revenue for developers by leaving out the retail chain, it also raises new challenges for service quality in terms of bandwidth and latency for the underlying network. In this paper we present the results of a subjective user study we conducted into the user-perceived quality of experience (QoE) in Cloud Gaming. We design a measurement environment, that emulates this new type of service, define tests for users to assess the QoE, derive Key Influence Factors (KFI) and influences of content and perception from our results.
• 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
• An Evaluation of QoE in Cloud Gaming Based on Subjective Tests. Jarschel, Michael; Schlosser, Daniel; Scheuring, Sven; Hoßfeld, Tobias. Workshop on Future Internet and Next Generation Networks (FINGNet-2011), Seoul, Korea, 2011, July 2.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2011-426, address = {Workshop on Future Internet and Next Generation Networks (FINGNet-2011), Seoul, Korea}, author = {Jarschel, Michael and Schlosser, Daniel and Scheuring, Sven and Hoßfeld, Tobias}, keywords = {sys:hidden:presentation}, month = {07}, title = {An Evaluation of QoE in Cloud Gaming Based on Subjective Tests}, year = 2011 }

  %0 Generic %1 info3-talk-2011-426 %A Jarschel, Michael %A Schlosser, Daniel %A Scheuring, Sven %A Hoßfeld, Tobias %C Workshop on Future Internet and Next Generation Networks (FINGNet-2011), Seoul, Korea %D 2011 %T An Evaluation of QoE in Cloud Gaming Based on Subjective Tests
• 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.
• ECODANE - Reducing Energy COnsumption in DAta Center NEtworks based on Traffic Engineering. Thu Huong, Truong; Schlosser, Daniel; Ngoc Nam, Pham; Jarschel, Michael; Huu Thanh, Nguyen; Pries, Rastin. 2011, August.
  • [ BibTeX ]
  • [ EndNote ]
  @misc{info3-poster-2011-29, author = {Thu Huong, Truong and Schlosser, Daniel and Ngoc Nam, Pham and Jarschel, Michael and Huu Thanh, Nguyen and Pries, Rastin}, keywords = {sys:hidden:poster}, month = {08}, title = {ECODANE - Reducing Energy COnsumption in DAta Center NEtworks based on Traffic Engineering}, year = 2011 }

  %0 Generic %1 info3-poster-2011-29 %A Thu Huong, Truong %A Schlosser, Daniel %A Ngoc Nam, Pham %A Jarschel, Michael %A Huu Thanh, Nguyen %A Pries, Rastin %D 2011 %T ECODANE - Reducing Energy COnsumption in DAta Center NEtworks based on Traffic Engineering
• 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
• Modeling and Performance Evaluation of an OpenFlow Architecture. Jarschel, Michael; Oechsner, Simon; Schlosser, Daniel; Pries, Rastin; Goll, Sebastian; Tran-Gia, Phuoc. In 23rd International Teletraffic Congress (ITC 2011). San Francisco, CA, USA, 2011.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  The OpenFlow concept of flow-based forwarding and separation of the control plane from the data plane provides a new flexibility in network innovation. While initially used solely in the research domain, OpenFlow is now finding its way into commercial applications. However, this creates new challenges, as questions of OpenFlow scalability and performance have not yet been answered. This paper is a first step towards that goal. Based on measurements of switching times of current OpenFlow hardware, we derive a basic model for the forwarding speed and blocking probability of an OpenFlow switch combined with an OpenFlow controller and validate it using a simulation. This model can be used to estimate the packet sojourn time and the probability of lost packets in such a system and can give hints to developers and researchers on questions how an OpenFlow architecture will perform given certain parameters.

  @inproceedings{info3-inproceedings-2011-423, abstract = {The OpenFlow concept of flow-based forwarding and separation of the control plane from the data plane provides a new flexibility in network innovation. While initially used solely in the research domain, OpenFlow is now finding its way into commercial applications. However, this creates new challenges, as questions of OpenFlow scalability and performance have not yet been answered. This paper is a first step towards that goal. Based on measurements of switching times of current OpenFlow hardware, we derive a basic model for the forwarding speed and blocking probability of an OpenFlow switch combined with an OpenFlow controller and validate it using a simulation. This model can be used to estimate the packet sojourn time and the probability of lost packets in such a system and can give hints to developers and researchers on questions how an OpenFlow architecture will perform given certain parameters.}, address = {San Francisco, CA, USA}, author = {Jarschel, Michael and Oechsner, Simon and Schlosser, Daniel and Pries, Rastin and Goll, Sebastian and Tran-Gia, Phuoc}, booktitle = {23rd International Teletraffic Congress (ITC 2011)}, keywords = {openflow}, month = {09}, title = {Modeling and Performance Evaluation of an OpenFlow Architecture}, year = 2011 }

  %0 Conference Paper %1 info3-inproceedings-2011-423 %A Jarschel, Michael %A Oechsner, Simon %A Schlosser, Daniel %A Pries, Rastin %A Goll, Sebastian %A Tran-Gia, Phuoc %B 23rd International Teletraffic Congress (ITC 2011) %C San Francisco, CA, USA %D 2011 %T Modeling and Performance Evaluation of an OpenFlow Architecture %X The OpenFlow concept of flow-based forwarding and separation of the control plane from the data plane provides a new flexibility in network innovation. While initially used solely in the research domain, OpenFlow is now finding its way into commercial applications. However, this creates new challenges, as questions of OpenFlow scalability and performance have not yet been answered. This paper is a first step towards that goal. Based on measurements of switching times of current OpenFlow hardware, we derive a basic model for the forwarding speed and blocking probability of an OpenFlow switch combined with an OpenFlow controller and validate it using a simulation. This model can be used to estimate the packet sojourn time and the probability of lost packets in such a system and can give hints to developers and researchers on questions how an OpenFlow architecture will perform given certain parameters.
• Modeling and Performance Evaluation of an OpenFlow Architecture. Jarschel, Michael; Oechsner, Simon; Schlosser, Daniel; Pries, Rastin; Goll, Sebastian; Tran-Gia, Phuoc. 23rd International Teletraffic Congress (ITC 2011), San Francisco, CA, USA, 2011, September 6.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2011-431, address = {23rd International Teletraffic Congress (ITC 2011), San Francisco, CA, USA}, author = {Jarschel, Michael and Oechsner, Simon and Schlosser, Daniel and Pries, Rastin and Goll, Sebastian and Tran-Gia, Phuoc}, keywords = {openflow}, month = {09}, title = {Modeling and Performance Evaluation of an OpenFlow Architecture}, year = 2011 }

  %0 Generic %1 info3-talk-2011-431 %A Jarschel, Michael %A Oechsner, Simon %A Schlosser, Daniel %A Pries, Rastin %A Goll, Sebastian %A Tran-Gia, Phuoc %C 23rd International Teletraffic Congress (ITC 2011), San Francisco, CA, USA %D 2011 %T Modeling and Performance Evaluation of an OpenFlow Architecture
• Power Consumption Analysis of Data Center Architectures. Pries, Rastin; Jarschel, Michael; Schlosser, Daniel; Klopf, Michael; Tran-Gia, Phuoc. In GreenNets. Colmar, France, 2011.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  The high power consumption of data centers confronts the providers with major challenges. However, not only the servers and the cooling consume a huge amount of energy, but also the data center network architecture makes an important contribution. In this paper, we introduce different data center architectures and compare them regarding their power consumption. The results show that there are some differences which should not be neglected and that with only minor modifications of the architecture, it is possible to save a huge amount of energy.

  @inproceedings{info3-inproceedings-2011-424, abstract = {The high power consumption of data centers confronts the providers with major challenges. However, not only the servers and the cooling consume a huge amount of energy, but also the data center network architecture makes an important contribution. In this paper, we introduce different data center architectures and compare them regarding their power consumption. The results show that there are some differences which should not be neglected and that with only minor modifications of the architecture, it is possible to save a huge amount of energy.}, address = {Colmar, France}, author = {Pries, Rastin and Jarschel, Michael and Schlosser, Daniel and Klopf, Michael and Tran-Gia, Phuoc}, booktitle = {GreenNets}, keywords = {sys:hidden:inproceedings}, month = 10, title = {Power Consumption Analysis of Data Center Architectures}, year = 2011 }

  %0 Conference Paper %1 info3-inproceedings-2011-424 %A Pries, Rastin %A Jarschel, Michael %A Schlosser, Daniel %A Klopf, Michael %A Tran-Gia, Phuoc %B GreenNets %C Colmar, France %D 2011 %T Power Consumption Analysis of Data Center Architectures %X The high power consumption of data centers confronts the providers with major challenges. However, not only the servers and the cooling consume a huge amount of energy, but also the data center network architecture makes an important contribution. In this paper, we introduce different data center architectures and compare them regarding their power consumption. The results show that there are some differences which should not be neglected and that with only minor modifications of the architecture, it is possible to save a huge amount of energy.

• Datenübertragung im Internet. Schlosser, Daniel. Informatik am Samstag, Würzburg, 2010, January 16.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2010-417, address = {Informatik am Samstag, Würzburg}, author = {Schlosser, Daniel}, keywords = {sys:hidden:presentation}, month = {01}, title = {Datenübertragung im Internet}, year = 2010 }

  %0 Generic %1 info3-talk-2010-417 %A Schlosser, Daniel %C Informatik am Samstag, Würzburg %D 2010 %T Datenübertragung im Internet
• COMCON: Use Cases for Virtual Future Networks. Jarschel, Michael; Kirstädter, Andreas; Kellerer, Wolfgang; Hoffmann, Marco; Hoßfeld, Tobias; Köhler, Stefan; Schlosser, Daniel. In TridentCom 2010. Berlin, 2010.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  In the Future Internet, a multitude of networks will coexist and complement each other. These networks allow specialization but require isolation of functionalities in order to provide dependable and predictable networks. This allows different networks to run in parallel but isolated from each other. Additionally, network resource scalability is supported to reduce the time and overhead required to introduce new services. The objective of the COMCON (COntrol and Management of COexisting Networks) project is to design novel control and management mechanisms that support the coexistence of networks in a future networking scenario and to illustrate the economic advantages. In this contribution we present three use cases defined in COMCON, which serve as a guideline for our virtual network architecture.

  @inproceedings{info3-inproceedings-2010-383, abstract = {In the Future Internet, a multitude of networks will coexist and complement each other. These networks allow specialization but require isolation of functionalities in order to provide dependable and predictable networks. This allows different networks to run in parallel but isolated from each other. Additionally, network resource scalability is supported to reduce the time and overhead required to introduce new services. The objective of the COMCON (COntrol and Management of COexisting Networks) project is to design novel control and management mechanisms that support the coexistence of networks in a future networking scenario and to illustrate the economic advantages. In this contribution we present three use cases defined in COMCON, which serve as a guideline for our virtual network architecture.}, address = {Berlin}, author = {Jarschel, Michael and Kirstädter, Andreas and Kellerer, Wolfgang and Hoffmann, Marco and Hoßfeld, Tobias and Köhler, Stefan and Schlosser, Daniel}, booktitle = {TridentCom 2010}, keywords = {sys:hidden:inproceedings}, month = {05}, title = {COMCON: Use Cases for Virtual Future Networks}, year = 2010 }

  %0 Conference Paper %1 info3-inproceedings-2010-383 %A Jarschel, Michael %A Kirstädter, Andreas %A Kellerer, Wolfgang %A Hoffmann, Marco %A Hoßfeld, Tobias %A Köhler, Stefan %A Schlosser, Daniel %B TridentCom 2010 %C Berlin %D 2010 %T COMCON: Use Cases for Virtual Future Networks %X In the Future Internet, a multitude of networks will coexist and complement each other. These networks allow specialization but require isolation of functionalities in order to provide dependable and predictable networks. This allows different networks to run in parallel but isolated from each other. Additionally, network resource scalability is supported to reduce the time and overhead required to introduce new services. The objective of the COMCON (COntrol and Management of COexisting Networks) project is to design novel control and management mechanisms that support the coexistence of networks in a future networking scenario and to illustrate the economic advantages. In this contribution we present three use cases defined in COMCON, which serve as a guideline for our virtual network architecture.
• Improving the QoE of Citrix Thin Client Users. Schlosser, Daniel; Staehle, Barbara; Binzenhöfer, Andreas; Boder, Björn. In IEEE International Conference on Communications (ICC 2010). Cape Town, South Africa, 2010.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  During the last years so-called 'Thin Client' architectures have become very popular. Thin Clients are simple end user devices, which are provided with content and services by powerful servers. Originally this concept was developed for Local Area Networks (LANs), which provide a high Quality of Service. If they are used in Wide Area Networks (WANs) they need to be adjusted accordingly in order to guarantee a good Quality of Experience (QoE). In this paper we investigate possibilities for configuring Citrix based Thin Client architectures to improve the QoE in WAN environments. We consider the benefits on the QoE as well as the costs on network layer.

  @inproceedings{info3-inproceedings-2010-385, abstract = {During the last years so-called 'Thin Client' architectures have become very popular. Thin Clients are simple end user devices, which are provided with content and services by powerful servers. Originally this concept was developed for Local Area Networks (LANs), which provide a high Quality of Service. If they are used in Wide Area Networks (WANs) they need to be adjusted accordingly in order to guarantee a good Quality of Experience (QoE). In this paper we investigate possibilities for configuring Citrix based Thin Client architectures to improve the QoE in WAN environments. We consider the benefits on the QoE as well as the costs on network layer.}, address = {Cape Town, South Africa}, author = {Schlosser, Daniel and Staehle, Barbara and Binzenhöfer, Andreas and Boder, Björn}, booktitle = {IEEE International Conference on Communications (ICC 2010)}, keywords = {sys:hidden:inproceedings}, month = {05}, title = {Improving the QoE of Citrix Thin Client Users}, year = 2010 }

  %0 Conference Paper %1 info3-inproceedings-2010-385 %A Schlosser, Daniel %A Staehle, Barbara %A Binzenhöfer, Andreas %A Boder, Björn %B IEEE International Conference on Communications (ICC 2010) %C Cape Town, South Africa %D 2010 %T Improving the QoE of Citrix Thin Client Users %X During the last years so-called 'Thin Client' architectures have become very popular. Thin Clients are simple end user devices, which are provided with content and services by powerful servers. Originally this concept was developed for Local Area Networks (LANs), which provide a high Quality of Service. If they are used in Wide Area Networks (WANs) they need to be adjusted accordingly in order to guarantee a good Quality of Experience (QoE). In this paper we investigate possibilities for configuring Citrix based Thin Client architectures to improve the QoE in WAN environments. We consider the benefits on the QoE as well as the costs on network layer.
• Monitoring the User Perceived Quality of SILK-Based Voice Calls. Schlosser, Daniel; Jarschel, Michael; Burger, Valentin; Pries, Rastin. In Australasian Telecommunication Networks and Applications Conference (ATNAC 2010). Auckland, New Zealand, 2010.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Quality measurements are required to support VoIP traffic in the Internet. The widely used average Mean Opinion Score is, however, not sufficient for this task. In this paper, we provide a detailed analysis of the Skype SILK codec and compare it with the iLBC and GSM codec. The results show that the SILK codec is superior to the other codecs in scenarios with random and bulk packet loss. This increased tolerance of packet loss enables the option of QoE Monitoring under reasonable network conditions. From analysis, we derive an estimation, which can be used to monitor the MOS value of the users in the worst case. Furthermore, we show how sampling can effectively decrease the required measurement effort. This work was funded by the Federal Ministry of Education and Research of the Federal Republic of Germany (Förderkennzeichen 01BK0917, GLab). The authors alone are responsible for the content of the paper.

  @inproceedings{info3-inproceedings-2010-399, abstract = {Quality measurements are required to support VoIP traffic in the Internet. The widely used average Mean Opinion Score is, however, not sufficient for this task. In this paper, we provide a detailed analysis of the Skype SILK codec and compare it with the iLBC and GSM codec. The results show that the SILK codec is superior to the other codecs in scenarios with random and bulk packet loss. This increased tolerance of packet loss enables the option of QoE Monitoring under reasonable network conditions. From analysis, we derive an estimation, which can be used to monitor the MOS value of the users in the worst case. Furthermore, we show how sampling can effectively decrease the required measurement effort. This work was funded by the Federal Ministry of Education and Research of the Federal Republic of Germany (Förderkennzeichen 01BK0917, GLab). The authors alone are responsible for the content of the paper.}, address = {Auckland, New Zealand}, author = {Schlosser, Daniel and Jarschel, Michael and Burger, Valentin and Pries, Rastin}, booktitle = {Australasian Telecommunication Networks and Applications Conference (ATNAC 2010)}, keywords = {sys:hidden:inproceedings}, month = 11, title = {Monitoring the User Perceived Quality of SILK-Based Voice Calls}, year = 2010 }

  %0 Conference Paper %1 info3-inproceedings-2010-399 %A Schlosser, Daniel %A Jarschel, Michael %A Burger, Valentin %A Pries, Rastin %B Australasian Telecommunication Networks and Applications Conference (ATNAC 2010) %C Auckland, New Zealand %D 2010 %T Monitoring the User Perceived Quality of SILK-Based Voice Calls %X Quality measurements are required to support VoIP traffic in the Internet. The widely used average Mean Opinion Score is, however, not sufficient for this task. In this paper, we provide a detailed analysis of the Skype SILK codec and compare it with the iLBC and GSM codec. The results show that the SILK codec is superior to the other codecs in scenarios with random and bulk packet loss. This increased tolerance of packet loss enables the option of QoE Monitoring under reasonable network conditions. From analysis, we derive an estimation, which can be used to monitor the MOS value of the users in the worst case. Furthermore, we show how sampling can effectively decrease the required measurement effort. This work was funded by the Federal Ministry of Education and Research of the Federal Republic of Germany (Förderkennzeichen 01BK0917, GLab). The authors alone are responsible for the content of the paper.
• Performance Evaluation of P2P Caches: Flash-Crowd Case. Schlosser, Daniel; Cholda, Piotr. Australasian Telecommunication Networks and Applications Conference (ATNAC) 2010, Auckland, New Zealand, 2010, November 2.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2010-413, address = {Australasian Telecommunication Networks and Applications Conference (ATNAC) 2010, Auckland, New Zealand}, author = {Schlosser, Daniel and Cholda, Piotr}, keywords = {sys:hidden:presentation}, month = 11, title = {Performance Evaluation of P2P Caches: Flash-Crowd Case}, year = 2010 }

  %0 Generic %1 info3-talk-2010-413 %A Schlosser, Daniel %A Cholda, Piotr %C Australasian Telecommunication Networks and Applications Conference (ATNAC) 2010, Auckland, New Zealand %D 2010 %T Performance Evaluation of P2P Caches: Flash-Crowd Case
• Network Virtualization: Isolation Problems and Scalability Issues. Schlosser, Daniel. GI/ITG KuVs Fachgesprächen Future Internet, Hannover, Germany, 2010, November 21.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2010-418, address = {GI/ITG KuVs Fachgesprächen Future Internet, Hannover, Germany}, author = {Schlosser, Daniel}, keywords = {sys:hidden:presentation}, month = 11, title = {Network Virtualization: Isolation Problems and Scalability Issues}, year = 2010 }

  %0 Generic %1 info3-talk-2010-418 %A Schlosser, Daniel %C GI/ITG KuVs Fachgesprächen Future Internet, Hannover, Germany %D 2010 %T Network Virtualization: Isolation Problems and Scalability Issues
• Network Virtualization: Isolation Problems and Scalability Issues. Schlosser, Daniel; Jarschel, Michael. 6. GI/ITG KuVS Fachgespräch Future Internet, Hannover, Germany, 2010, November 22.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2010-405, address = {6. GI/ITG KuVS Fachgespräch Future Internet, Hannover, Germany}, author = {Schlosser, Daniel and Jarschel, Michael}, keywords = {sys:hidden:presentation}, month = 11, title = {Network Virtualization: Isolation Problems and Scalability Issues}, year = 2010 }

  %0 Generic %1 info3-talk-2010-405 %A Schlosser, Daniel %A Jarschel, Michael %C 6. GI/ITG KuVS Fachgespräch Future Internet, Hannover, Germany %D 2010 %T Network Virtualization: Isolation Problems and Scalability Issues
• 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.
• Monitoring the User Perceived Quality of SILK-Based Voice Calls. Schlosser, Daniel. Australasian Telecommunication Networks and Applications Conference (ATNAC) 2010, Auckland, New Zealand, 2010, November 2.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2010-412, address = {Australasian Telecommunication Networks and Applications Conference (ATNAC) 2010, Auckland, New Zealand}, author = {Schlosser, Daniel}, keywords = {sys:hidden:presentation}, month = 11, title = {Monitoring the User Perceived Quality of SILK-Based Voice Calls}, year = 2010 }

  %0 Generic %1 info3-talk-2010-412 %A Schlosser, Daniel %C Australasian Telecommunication Networks and Applications Conference (ATNAC) 2010, Auckland, New Zealand %D 2010 %T Monitoring the User Perceived Quality of SILK-Based Voice Calls

• Quality of ADSL-Bandwidth Estimations Using Active Measurement. Schlosser, Daniel. 5th COST TMA Action Meeting, Barcelona, Spain, 2009, October 6.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2009-419, address = {5th COST TMA Action Meeting, Barcelona, Spain}, author = {Schlosser, Daniel}, keywords = {sys:hidden:presentation}, month = 10, title = {Quality of ADSL-Bandwidth Estimations Using Active Measurement}, year = 2009 }

  %0 Generic %1 info3-talk-2009-419 %A Schlosser, Daniel %C 5th COST TMA Action Meeting, Barcelona, Spain %D 2009 %T Quality of ADSL-Bandwidth Estimations Using Active Measurement
• Netzwerkvirtualisierung und OpenFlow. Schlosser, Daniel. Datev Trendscout, Nürnberg, 2009, November 19.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2009-416, address = {Datev Trendscout, Nürnberg}, author = {Schlosser, Daniel}, keywords = {sys:hidden:presentation}, month = 11, title = {Netzwerkvirtualisierung und OpenFlow}, year = 2009 }

  %0 Generic %1 info3-talk-2009-416 %A Schlosser, Daniel %C Datev Trendscout, Nürnberg %D 2009 %T Netzwerkvirtualisierung und OpenFlow
• Service Oriented Network Framework Enabling Global QoS and Network Virtualization. Schlosser, Daniel. 20th ITC Specialist Seminar on Network Virtualization - Concept and Performance Aspects, 2009, May 19.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2009-411, address = {20th ITC Specialist Seminar on Network Virtualization - Concept and Performance Aspects}, author = {Schlosser, Daniel}, keywords = {sys:hidden:presentation}, month = {05}, title = {Service Oriented Network Framework Enabling Global QoS and Network Virtualization.}, year = 2009 }

  %0 Generic %1 info3-talk-2009-411 %A Schlosser, Daniel %C 20th ITC Specialist Seminar on Network Virtualization - Concept and Performance Aspects %D 2009 %T Service Oriented Network Framework Enabling Global QoS and Network Virtualization.
• Service Oriented Network Framework Enabling Global QoS and Network Virtualization. Schlosser, Daniel; Hoßfeld, Tobias. In ITC SS 2009. Hoi An, 2009.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Today’s Internet provides access to a large variety of services, which require high data rates and stable data flows for satisfactory service quality. New interactive services have high Quality of Service (QoS) requirements to the network. Packet loss, jitter, delay and effectively available bandwidth are parameters that heavily influence the Quality of Experience (QoE) of a user. The current architecture of the Internet cannot support these QoS requirements on a global scale, as solutions of one Internet Service Provider (ISP) do not necessarily work across borders of ISP domains. In order to provide QoS on a global level, the Internet of the future might offer virtual networks as data delivery services that can guarantee all the requirements of an application or service. We therefore propose a service oriented network framework. Within this framework different virtual network connections with the corresponding pricing schemes that satisfy a given request will be offered to the customer. In this paper we (1) introduce the architecture concept, (2) show how the QoS of a network path can be concluded from QoS description of its parts and (3) perform a measurement study to evaluate a measurement approach, which classifies the QoS of a network connection between two routers based on active measurements performed by the routers themselves.

  @inproceedings{info3-inproceedings-2009-353, abstract = {Today’s Internet provides access to a large variety of services, which require high data rates and stable data flows for satisfactory service quality. New interactive services have high Quality of Service (QoS) requirements to the network. Packet loss, jitter, delay and effectively available bandwidth are parameters that heavily influence the Quality of Experience (QoE) of a user. The current architecture of the Internet cannot support these QoS requirements on a global scale, as solutions of one Internet Service Provider (ISP) do not necessarily work across borders of ISP domains. In order to provide QoS on a global level, the Internet of the future might offer virtual networks as data delivery services that can guarantee all the requirements of an application or service. We therefore propose a service oriented network framework. Within this framework different virtual network connections with the corresponding pricing schemes that satisfy a given request will be offered to the customer. In this paper we (1) introduce the architecture concept, (2) show how the QoS of a network path can be concluded from QoS description of its parts and (3) perform a measurement study to evaluate a measurement approach, which classifies the QoS of a network connection between two routers based on active measurements performed by the routers themselves.}, address = {Hoi An}, author = {Schlosser, Daniel and Hoßfeld, Tobias}, booktitle = {ITC SS 2009}, keywords = {sys:hidden:inproceedings}, month = {05}, title = {Service Oriented Network Framework Enabling Global QoS and Network Virtualization}, year = 2009 }

  %0 Conference Paper %1 info3-inproceedings-2009-353 %A Schlosser, Daniel %A Hoßfeld, Tobias %B ITC SS 2009 %C Hoi An %D 2009 %T Service Oriented Network Framework Enabling Global QoS and Network Virtualization %X Today’s Internet provides access to a large variety of services, which require high data rates and stable data flows for satisfactory service quality. New interactive services have high Quality of Service (QoS) requirements to the network. Packet loss, jitter, delay and effectively available bandwidth are parameters that heavily influence the Quality of Experience (QoE) of a user. The current architecture of the Internet cannot support these QoS requirements on a global scale, as solutions of one Internet Service Provider (ISP) do not necessarily work across borders of ISP domains. In order to provide QoS on a global level, the Internet of the future might offer virtual networks as data delivery services that can guarantee all the requirements of an application or service. We therefore propose a service oriented network framework. Within this framework different virtual network connections with the corresponding pricing schemes that satisfy a given request will be offered to the customer. In this paper we (1) introduce the architecture concept, (2) show how the QoS of a network path can be concluded from QoS description of its parts and (3) perform a measurement study to evaluate a measurement approach, which classifies the QoS of a network connection between two routers based on active measurements performed by the routers themselves.
• Chapter VII: Cooperation Strategies for P2P Content Distribution in Cellular Mobile Networks: Considering Selfishness and Heterogeneity. Hoßfeld, Tobias; Schlosser, Daniel; Tutschku, Kurt; Tran-Gia, Phuoc. In Mobile Peer-to-Peer Computing for Next Generation Distributed Environments: Advancing Conceptual and Algorithmic Applications, B.-C. Seet (ed.). 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 this chapter, we review common cooperation strategies using multi-source downloads. We demonstrate the fundamental “last chunk” problem of typical strategies as used by eDonkey or BitTorrent. This is caused by the selfishness of users; however, an ordered chunk delivery evades this problem. In the coherent, subsequent chapter “Cooperation Strategies for P2P Content Distribution in Cellular Mobile Networks: Considering Mobility and Heterogeneity”, the impact of mobility and vertical handover between heterogeneous wireless access technologies is investigated.

  @incollection{info3-incollection-2009-9, 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 this chapter, we review common cooperation strategies using multi-source downloads. We demonstrate the fundamental “last chunk” problem of typical strategies as used by eDonkey or BitTorrent. This is caused by the selfishness of users; however, an ordered chunk delivery evades this problem. In the coherent, subsequent chapter “Cooperation Strategies for P2P Content Distribution in Cellular Mobile Networks: Considering Mobility and Heterogeneity”, the impact of mobility and vertical handover between heterogeneous wireless access technologies is investigated.}, author = {Hoßfeld, Tobias and Schlosser, Daniel and Tutschku, Kurt 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}, publisher = {Information Science Reference, ISBN: 978-1-60566-715-7}, title = {Chapter VII: Cooperation Strategies for P2P Content Distribution in Cellular Mobile Networks: Considering Selfishness and Heterogeneity}, year = 2009 }

  %0 Book Section %1 info3-incollection-2009-9 %A Hoßfeld, Tobias %A Schlosser, Daniel %A Tutschku, Kurt %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 %T Chapter VII: Cooperation Strategies for P2P Content Distribution in Cellular Mobile Networks: Considering Selfishness 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 this chapter, we review common cooperation strategies using multi-source downloads. We demonstrate the fundamental “last chunk” problem of typical strategies as used by eDonkey or BitTorrent. This is caused by the selfishness of users; however, an ordered chunk delivery evades this problem. In the coherent, subsequent chapter “Cooperation Strategies for P2P Content Distribution in Cellular Mobile Networks: Considering Mobility and Heterogeneity”, the impact of mobility and vertical handover between heterogeneous wireless access technologies is investigated.
• Mastering Selfishness and Heterogeneity in Mobile P2P Content Distribution Networks with Multiple Source Download in Cellular Networks. Schlosser, Daniel; Hoßfeld, Tobias. In Peer-to-Peer Networking and Applications, Special Issue on Mobile P2P Networking and Computing. 2009.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  The performance of Peer-to-Peer (P2P) content distribution networks depends highly on the coordination of the peers. This is especially true for cellular networks with mobile and often selfish users, as the resource constraints on accessible bandwidth and battery power are even more limitating in this context. Thus, it is a major challenge to indentify mobile network specific problems and to develop sophisticated cooperation strategies to overcome these difficulties. Cooperation strategies, which are able to cope these problems, are the foundation for efficient mobile file exchange. The detailed performance of the strategies are determined by the peer capabilities and the peer behavior, such as the number of parallel upload connections, the selfishness, or the altruistic re-distribution of data. The purpose of this work is to evaluate and investigate different cooperation strategies which are based on multiple source download and select the best one for mobile scenarios with even leeching peers, i.e. peers which depart as soon as they have finished their download. The question arises whether the cooperation strategy can smoothen the overall performance degradation caused by a selfish peer behavior. As performance indicators the efficiency, fairness, and robustness of the cooperation strategies are applied. The considered scenarios comprise best-case (altruistic peers) and worst-case scenarios (selfish peers). We further propose a new cooperation strategy to improve the file transfer even when mainly selfish peers are present, the CycPriM (cyclic priority masking) strategy. The strategy allows an efficient P2P based content distribution using ordered chunk delivery with only local information available at a peer.

  @article{info3-article-2009-58, abstract = {The performance of Peer-to-Peer (P2P) content distribution networks depends highly on the coordination of the peers. This is especially true for cellular networks with mobile and often selfish users, as the resource constraints on accessible bandwidth and battery power are even more limitating in this context. Thus, it is a major challenge to indentify mobile network specific problems and to develop sophisticated cooperation strategies to overcome these difficulties. Cooperation strategies, which are able to cope these problems, are the foundation for efficient mobile file exchange. The detailed performance of the strategies are determined by the peer capabilities and the peer behavior, such as the number of parallel upload connections, the selfishness, or the altruistic re-distribution of data. The purpose of this work is to evaluate and investigate different cooperation strategies which are based on multiple source download and select the best one for mobile scenarios with even leeching peers, i.e. peers which depart as soon as they have finished their download. The question arises whether the cooperation strategy can smoothen the overall performance degradation caused by a selfish peer behavior. As performance indicators the efficiency, fairness, and robustness of the cooperation strategies are applied. The considered scenarios comprise best-case (altruistic peers) and worst-case scenarios (selfish peers). We further propose a new cooperation strategy to improve the file transfer even when mainly selfish peers are present, the CycPriM (cyclic priority masking) strategy. The strategy allows an efficient P2P based content distribution using ordered chunk delivery with only local information available at a peer.}, author = {Schlosser, Daniel and Hoßfeld, Tobias}, journal = {Peer-to-Peer Networking and Applications, Special Issue on Mobile P2P Networking and Computing}, keywords = {sys:hidden:article}, title = {Mastering Selfishness and Heterogeneity in Mobile P2P Content Distribution Networks with Multiple Source Download in Cellular Networks}, year = 2009 }

  %0 Journal Article %1 info3-article-2009-58 %A Schlosser, Daniel %A Hoßfeld, Tobias %D 2009 %J Peer-to-Peer Networking and Applications, Special Issue on Mobile P2P Networking and Computing %T Mastering Selfishness and Heterogeneity in Mobile P2P Content Distribution Networks with Multiple Source Download in Cellular Networks %X The performance of Peer-to-Peer (P2P) content distribution networks depends highly on the coordination of the peers. This is especially true for cellular networks with mobile and often selfish users, as the resource constraints on accessible bandwidth and battery power are even more limitating in this context. Thus, it is a major challenge to indentify mobile network specific problems and to develop sophisticated cooperation strategies to overcome these difficulties. Cooperation strategies, which are able to cope these problems, are the foundation for efficient mobile file exchange. The detailed performance of the strategies are determined by the peer capabilities and the peer behavior, such as the number of parallel upload connections, the selfishness, or the altruistic re-distribution of data. The purpose of this work is to evaluate and investigate different cooperation strategies which are based on multiple source download and select the best one for mobile scenarios with even leeching peers, i.e. peers which depart as soon as they have finished their download. The question arises whether the cooperation strategy can smoothen the overall performance degradation caused by a selfish peer behavior. As performance indicators the efficiency, fairness, and robustness of the cooperation strategies are applied. The considered scenarios comprise best-case (altruistic peers) and worst-case scenarios (selfish peers). We further propose a new cooperation strategy to improve the file transfer even when mainly selfish peers are present, the CycPriM (cyclic priority masking) strategy. The strategy allows an efficient P2P based content distribution using ordered chunk delivery with only local information available at a peer.

• Quantifying the Influence of Network Conditions on the Service Quality Experienced by a Thin Client User. Schlosser, Daniel. 14. GI/ITG Konferenz Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen (MMB 2008), 2008, April.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2008-410, address = {14. GI/ITG Konferenz Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen (MMB 2008)}, author = {Schlosser, Daniel}, keywords = {sys:hidden:presentation}, month = {04}, title = {Quantifying the Influence of Network Conditions on the Service Quality Experienced by a Thin Client User}, year = 2008 }

  %0 Generic %1 info3-talk-2008-410 %A Schlosser, Daniel %C 14. GI/ITG Konferenz Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen (MMB 2008) %D 2008 %T Quantifying the Influence of Network Conditions on the Service Quality Experienced by a Thin Client User
• Quantifying the Influence of Network Conditions on the Service Quality Experienced by a Thin Client User. Staehle, Barbara; Binzenhöfer, Andreas; Schlosser, Daniel; Boder, Björn. In 14. GI/ITG Konferenz Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen (MMB 2008). Dortmund, Germany, 2008.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Quality of Experience (QoE) is a measure for the satisfaction of a user with a given service. Despite the popularity of the term, there is a lack of understanding of how to capture or quantify QoE. In this paper we therefore take a step forward in this direction using the example of thin client architectures, where the client is only used as a dumb terminal while the applications run on a central server. The satisfaction of a thin client user is thus heavily influenced by the quality of the network connection between the client and the server. We study this influence by varying different network parameters like packet loss, jitter, and delay in a controlled testbed environment. The service quality is assessed using objective measurements on application level (oQoE) and verified by means of a survey among test persons capturing subjective user satisfactions (sQoE).

  @inproceedings{info3-inproceedings-2008-303, abstract = {Quality of Experience (QoE) is a measure for the satisfaction of a user with a given service. Despite the popularity of the term, there is a lack of understanding of how to capture or quantify QoE. In this paper we therefore take a step forward in this direction using the example of thin client architectures, where the client is only used as a dumb terminal while the applications run on a central server. The satisfaction of a thin client user is thus heavily influenced by the quality of the network connection between the client and the server. We study this influence by varying different network parameters like packet loss, jitter, and delay in a controlled testbed environment. The service quality is assessed using objective measurements on application level (oQoE) and verified by means of a survey among test persons capturing subjective user satisfactions (sQoE).}, address = {Dortmund, Germany}, author = {Staehle, Barbara and Binzenhöfer, Andreas and Schlosser, Daniel and Boder, Björn}, booktitle = {14. GI/ITG Konferenz Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen (MMB 2008)}, keywords = {sys:hidden:inproceedings}, month = {04}, title = {Quantifying the Influence of Network Conditions on the Service Quality Experienced by a Thin Client User}, year = 2008 }

  %0 Conference Paper %1 info3-inproceedings-2008-303 %A Staehle, Barbara %A Binzenhöfer, Andreas %A Schlosser, Daniel %A Boder, Björn %B 14. GI/ITG Konferenz Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen (MMB 2008) %C Dortmund, Germany %D 2008 %T Quantifying the Influence of Network Conditions on the Service Quality Experienced by a Thin Client User %X Quality of Experience (QoE) is a measure for the satisfaction of a user with a given service. Despite the popularity of the term, there is a lack of understanding of how to capture or quantify QoE. In this paper we therefore take a step forward in this direction using the example of thin client architectures, where the client is only used as a dumb terminal while the applications run on a central server. The satisfaction of a thin client user is thus heavily influenced by the quality of the network connection between the client and the server. We study this influence by varying different network parameters like packet loss, jitter, and delay in a controlled testbed environment. The service quality is assessed using objective measurements on application level (oQoE) and verified by means of a survey among test persons capturing subjective user satisfactions (sQoE).
• Traffic Engineering. Schlosser, Daniel. Bosch Network Workshop, Stuttgart, Germany, 2008, July 15.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2008-415, address = {Bosch Network Workshop, Stuttgart, Germany}, author = {Schlosser, Daniel}, keywords = {sys:hidden:presentation}, month = {07}, title = {Traffic Engineering}, year = 2008 }

  %0 Generic %1 info3-talk-2008-415 %A Schlosser, Daniel %C Bosch Network Workshop, Stuttgart, Germany %D 2008 %T Traffic Engineering

• Performance Comparison of Windows-based Thin-Client Architectures. Schlosser, Daniel. Christchurch, New Zealand, 2007, December 3.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2007-409, address = {Christchurch, New Zealand}, author = {Schlosser, Daniel}, keywords = {sys:hidden:presentation}, month = 12, title = {Performance Comparison of Windows-based Thin-Client Architectures}, year = 2007 }

  %0 Generic %1 info3-talk-2007-409 %A Schlosser, Daniel %C Christchurch, New Zealand %D 2007 %T Performance Comparison of Windows-based Thin-Client Architectures
• Performance Comparison of Windows-based Thin-Client Architectures. Schlosser, Daniel; Binzenhöfer, Andreas; Staehle, Barbara. In Proc. of the Australasian Telecommunication Networks and Applications Conference 2007. Christchurch, New Zealand, 2007.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  The basic idea behind thin-client architectures is to run applications on a central server instead of installing them separately on each client. The Windows Remote Desktop Protocol (RDP) and the Citrix Presentation Server are two well known approaches to separate the location of where the user input is processed from the computer he is actually working on. While both alternatives solve the same problem, they rely on significantly different mechanisms to handle the exchange of user input and screen updates between client and server. In this paper we therefore compare the performance of both protocols under different aspects. In particular, we study the load caused on network layer as well as the satisfaction of the end user with the service quality achieved by the different terminal services. As this performance heavily depends on the current network conditions, we emulate realistic scenarios in a controlled testbed environment and measure the time required for typical office tasks on application layer. As a result, we quantify the Quality-of-Experience (QoE) perceived by the end-user, compare the overhead required by the different available protocols, and unveil their advantages and disadvantages. Our results can be used to decide which protocol to use in which scenario.

  @inproceedings{info3-inproceedings-2007-300, abstract = {The basic idea behind thin-client architectures is to run applications on a central server instead of installing them separately on each client. The Windows Remote Desktop Protocol (RDP) and the Citrix Presentation Server are two well known approaches to separate the location of where the user input is processed from the computer he is actually working on. While both alternatives solve the same problem, they rely on significantly different mechanisms to handle the exchange of user input and screen updates between client and server. In this paper we therefore compare the performance of both protocols under different aspects. In particular, we study the load caused on network layer as well as the satisfaction of the end user with the service quality achieved by the different terminal services. As this performance heavily depends on the current network conditions, we emulate realistic scenarios in a controlled testbed environment and measure the time required for typical office tasks on application layer. As a result, we quantify the Quality-of-Experience (QoE) perceived by the end-user, compare the overhead required by the different available protocols, and unveil their advantages and disadvantages. Our results can be used to decide which protocol to use in which scenario.}, address = {Christchurch, New Zealand}, author = {Schlosser, Daniel and Binzenhöfer, Andreas and Staehle, Barbara}, booktitle = {Proc. of the Australasian Telecommunication Networks and Applications Conference 2007}, keywords = {sys:hidden:inproceedings}, month = 12, title = {Performance Comparison of Windows-based Thin-Client Architectures}, year = 2007 }

  %0 Conference Paper %1 info3-inproceedings-2007-300 %A Schlosser, Daniel %A Binzenhöfer, Andreas %A Staehle, Barbara %B Proc. of the Australasian Telecommunication Networks and Applications Conference 2007 %C Christchurch, New Zealand %D 2007 %T Performance Comparison of Windows-based Thin-Client Architectures %X The basic idea behind thin-client architectures is to run applications on a central server instead of installing them separately on each client. The Windows Remote Desktop Protocol (RDP) and the Citrix Presentation Server are two well known approaches to separate the location of where the user input is processed from the computer he is actually working on. While both alternatives solve the same problem, they rely on significantly different mechanisms to handle the exchange of user input and screen updates between client and server. In this paper we therefore compare the performance of both protocols under different aspects. In particular, we study the load caused on network layer as well as the satisfaction of the end user with the service quality achieved by the different terminal services. As this performance heavily depends on the current network conditions, we emulate realistic scenarios in a controlled testbed environment and measure the time required for typical office tasks on application layer. As a result, we quantify the Quality-of-Experience (QoE) perceived by the end-user, compare the overhead required by the different available protocols, and unveil their advantages and disadvantages. Our results can be used to decide which protocol to use in which scenario.
• Source Traffic Characterization for Thin Client Based Office Applications. Emmert, Barbara; Binzenhöfer, Andreas; Schlosser, Daniel; Weiß, Markus. In 13th EUNICE Open European Summer School and IFIP TC6.6 Workshop on Dependable and Adaptable Networks and Services. University of Twente, the Netherlands, 2007.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  A thin client is a small network computer which is used as a remote screen visualizing the output of software applications running on a central server. To provide a seamless service to thin client users the network connection between the client and the server must be dimensioned properly. In this paper we therefore characterize the traffic generated by different types of thin client users when working with popular office applications like Microsoft Word, Excel, or PowerPoint. We analyze the traffic patterns measured in our testbed environment and thus provide a basis for subsequent research studies as well as for administrators to estimate the amount and the characteristics of user generated traffic.

  @inproceedings{info3-inproceedings-2007-282, abstract = {A thin client is a small network computer which is used as a remote screen visualizing the output of software applications running on a central server. To provide a seamless service to thin client users the network connection between the client and the server must be dimensioned properly. In this paper we therefore characterize the traffic generated by different types of thin client users when working with popular office applications like Microsoft Word, Excel, or PowerPoint. We analyze the traffic patterns measured in our testbed environment and thus provide a basis for subsequent research studies as well as for administrators to estimate the amount and the characteristics of user generated traffic.}, address = {University of Twente, the Netherlands}, author = {Emmert, Barbara and Binzenhöfer, Andreas and Schlosser, Daniel and Weiß, Markus}, booktitle = {13th EUNICE Open European Summer School and IFIP TC6.6 Workshop on Dependable and Adaptable Networks and Services}, keywords = {sys:hidden:inproceedings}, month = {07}, title = {Source Traffic Characterization for Thin Client Based Office Applications}, year = 2007 }

  %0 Conference Paper %1 info3-inproceedings-2007-282 %A Emmert, Barbara %A Binzenhöfer, Andreas %A Schlosser, Daniel %A Weiß, Markus %B 13th EUNICE Open European Summer School and IFIP TC6.6 Workshop on Dependable and Adaptable Networks and Services %C University of Twente, the Netherlands %D 2007 %T Source Traffic Characterization for Thin Client Based Office Applications %X A thin client is a small network computer which is used as a remote screen visualizing the output of software applications running on a central server. To provide a seamless service to thin client users the network connection between the client and the server must be dimensioned properly. In this paper we therefore characterize the traffic generated by different types of thin client users when working with popular office applications like Microsoft Word, Excel, or PowerPoint. We analyze the traffic patterns measured in our testbed environment and thus provide a basis for subsequent research studies as well as for administrators to estimate the amount and the characteristics of user generated traffic.
• An Autonomic Approach to Verify End-to-End Communication Quality. Binzenhöfer, Andreas; Schlosser, Daniel; Tutschku, Kurt; Fiedler, Markus. In Tenth IFIP-IEEE International Symposium on Integrated Network Management (IM 2007). Munich, Germany, 2007.
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @inproceedings{info3-inproceedings-2007-263, address = {Munich, Germany}, author = {Binzenhöfer, Andreas and Schlosser, Daniel and Tutschku, Kurt and Fiedler, Markus}, booktitle = {Tenth IFIP-IEEE International Symposium on Integrated Network Management (IM 2007)}, keywords = {sys:hidden:inproceedings}, month = {05}, title = {An Autonomic Approach to Verify End-to-End Communication Quality}, year = 2007 }

  %0 Conference Paper %1 info3-inproceedings-2007-263 %A Binzenhöfer, Andreas %A Schlosser, Daniel %A Tutschku, Kurt %A Fiedler, Markus %B Tenth IFIP-IEEE International Symposium on Integrated Network Management (IM 2007) %C Munich, Germany %D 2007 %T An Autonomic Approach to Verify End-to-End Communication Quality
• Source Traffic Characterization for Thin Client Based Office Applications. Technical Report (406), . Emmert, Barbara; Binzenhöfer, Andreas; Schlosser, Daniel; Weiß, Markus. University of Wuerzburg, 2007.
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @techreport{info3-techreport-2007-205, author = {Emmert, Barbara and Binzenhöfer, Andreas and Schlosser, Daniel and Weiß, Markus}, institution = {University of Wuerzburg}, keywords = {sys:hidden:techreport}, month = {04}, number = 406, title = {Source Traffic Characterization for Thin Client Based Office Applications}, year = 2007 }

  %0 Report %1 info3-techreport-2007-205 %A Emmert, Barbara %A Binzenhöfer, Andreas %A Schlosser, Daniel %A Weiß, Markus %D 2007 %N 406 %T Source Traffic Characterization for Thin Client Based Office Applications

• Comparison of Robust Cooperation Strategies for P2P Content Distribution Networks with Multiple Source Download. Schlosser, Daniel; Hoßfeld, Tobias; Tutschku, Kurt. In Sixth IEEE International Conference on Peer-to-Peer Computing (P2P2006). Cambridge, UK, 2006.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  The performance of Peer-to-Peer (P2P) content distribution networks depends highly on the coordination of the peers. Sophisticated cooperation strategies, such as the multiple source download, are the foundation for efficient file exchange. The detailed performance of the strategies are determined by the peer characteristics and the peer behaviour, such as the number of parallel upload connections, the selfishness, or the altruistic re-distribution of data. The purpose of this work is to evaluate and investigate different cooperation strategies for multiple source download and select the best one for a scenario for even leeching peers, i.e. peers which depart as soon as they have finished their download. The question arises whether the cooperation strategy can smoothen the overall performance degradation caused by a selfish peer behaviour. As performance indicator the evolution of the numbers of copies of a chunk and the experienced download times of files is applied. The considered scenarios comprise best-case (altruistic peers) and worst-case scenarios (selfish peers). We further propose a new cooperation strategy to improve the file transfer even when mainly selfish peers are present, the CygPriM (cyclic priority masking) strategy. The strategy allows an efficient P2P based content distribution using ordered chunk delivery with only local information available at a peer.

  @inproceedings{info3-inproceedings-2006-239, abstract = {The performance of Peer-to-Peer (P2P) content distribution networks depends highly on the coordination of the peers. Sophisticated cooperation strategies, such as the multiple source download, are the foundation for efficient file exchange. The detailed performance of the strategies are determined by the peer characteristics and the peer behaviour, such as the number of parallel upload connections, the selfishness, or the altruistic re-distribution of data. The purpose of this work is to evaluate and investigate different cooperation strategies for multiple source download and select the best one for a scenario for even leeching peers, i.e. peers which depart as soon as they have finished their download. The question arises whether the cooperation strategy can smoothen the overall performance degradation caused by a selfish peer behaviour. As performance indicator the evolution of the numbers of copies of a chunk and the experienced download times of files is applied. The considered scenarios comprise best-case (altruistic peers) and worst-case scenarios (selfish peers). We further propose a new cooperation strategy to improve the file transfer even when mainly selfish peers are present, the CygPriM (cyclic priority masking) strategy. The strategy allows an efficient P2P based content distribution using ordered chunk delivery with only local information available at a peer.}, address = {Cambridge, UK}, author = {Schlosser, Daniel and Hoßfeld, Tobias and Tutschku, Kurt}, booktitle = {Sixth IEEE International Conference on Peer-to-Peer Computing (P2P2006)}, keywords = {redlarf}, month = {09}, title = {Comparison of Robust Cooperation Strategies for P2P Content Distribution Networks with Multiple Source Download}, year = 2006 }

  %0 Conference Paper %1 info3-inproceedings-2006-239 %A Schlosser, Daniel %A Hoßfeld, Tobias %A Tutschku, Kurt %B Sixth IEEE International Conference on Peer-to-Peer Computing (P2P2006) %C Cambridge, UK %D 2006 %T Comparison of Robust Cooperation Strategies for P2P Content Distribution Networks with Multiple Source Download %X The performance of Peer-to-Peer (P2P) content distribution networks depends highly on the coordination of the peers. Sophisticated cooperation strategies, such as the multiple source download, are the foundation for efficient file exchange. The detailed performance of the strategies are determined by the peer characteristics and the peer behaviour, such as the number of parallel upload connections, the selfishness, or the altruistic re-distribution of data. The purpose of this work is to evaluate and investigate different cooperation strategies for multiple source download and select the best one for a scenario for even leeching peers, i.e. peers which depart as soon as they have finished their download. The question arises whether the cooperation strategy can smoothen the overall performance degradation caused by a selfish peer behaviour. As performance indicator the evolution of the numbers of copies of a chunk and the experienced download times of files is applied. The considered scenarios comprise best-case (altruistic peers) and worst-case scenarios (selfish peers). We further propose a new cooperation strategy to improve the file transfer even when mainly selfish peers are present, the CygPriM (cyclic priority masking) strategy. The strategy allows an efficient P2P based content distribution using ordered chunk delivery with only local information available at a peer.
• Self-Organizing Measurement of User Perceived Quality: Demonstration of the Prototype. Binzenhöfer, Andreas; Schlosser, Daniel. Datev Trendscout, Nürnberg, 2006, July 20.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2006-218, address = {Datev Trendscout, Nürnberg}, author = {Binzenhöfer, Andreas and Schlosser, Daniel}, keywords = {sys:hidden:presentation}, month = {07}, title = {Self-Organizing Measurement of User Perceived Quality: Demonstration of the Prototype}, year = 2006 }

  %0 Generic %1 info3-talk-2006-218 %A Binzenhöfer, Andreas %A Schlosser, Daniel %C Datev Trendscout, Nürnberg %D 2006 %T Self-Organizing Measurement of User Perceived Quality: Demonstration of the Prototype
• The Redlarf PlanetLab Management Envrionment. Binzenhöfer, Andreas; Schlosser, Daniel. Redlarf Project Meeting, Politecnico di Torino, Italy, 2006, June 14.
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2006-176, address = {Redlarf Project Meeting, Politecnico di Torino, Italy}, author = {Binzenhöfer, Andreas and Schlosser, Daniel}, keywords = {sys:hidden:presentation}, month = {06}, title = {The Redlarf PlanetLab Management Envrionment}, year = 2006 }

  %0 Generic %1 info3-talk-2006-176 %A Binzenhöfer, Andreas %A Schlosser, Daniel %C Redlarf Project Meeting, Politecnico di Torino, Italy %D 2006 %T The Redlarf PlanetLab Management Envrionment
• Comparison of Robust Cooperation Strategies for P2P Content Distribution Networks with Multiple Source Download. Technical Report (385), . Schlosser, Daniel; Hoßfeld, Tobias; Tutschku, Kurt. University of Wuerzburg, 2006.
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @techreport{info3-techreport-2006-196, author = {Schlosser, Daniel and Hoßfeld, Tobias and Tutschku, Kurt}, institution = {University of Wuerzburg}, keywords = {sys:hidden:techreport}, month = {05}, number = 385, title = {Comparison of Robust Cooperation Strategies for P2P Content Distribution Networks with Multiple Source Download}, year = 2006 }

  %0 Report %1 info3-techreport-2006-196 %A Schlosser, Daniel %A Hoßfeld, Tobias %A Tutschku, Kurt %D 2006 %N 385 %T Comparison of Robust Cooperation Strategies for P2P Content Distribution Networks with Multiple Source Download
• A Novel Approach to Verify End-to-End Connectivity in an Autonomic Way. Technical Report (383), . Binzenhöfer, Andreas; Schlosser, Daniel; auf dem Graben, Björn. University of Wuerzburg, 2006.
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @techreport{info3-techreport-2006-195, author = {Binzenhöfer, Andreas and Schlosser, Daniel and auf dem Graben, Björn}, institution = {University of Wuerzburg}, keywords = {sys:hidden:techreport}, month = {04}, number = 383, title = {A Novel Approach to Verify End-to-End Connectivity in an Autonomic Way}, year = 2006 }

  %0 Report %1 info3-techreport-2006-195 %A Binzenhöfer, Andreas %A Schlosser, Daniel %A auf dem Graben, Björn %D 2006 %N 383 %T A Novel Approach to Verify End-to-End Connectivity in an Autonomic Way

• Towards Efficient Simulation of Large Scale P2P Networks. Technical Report (371), . Hoßfeld, Tobias; Binzenhöfer, Andreas; Schlosser, Daniel; Eger, Kolja; Oberender, Jens; Dedinski, Ivan; Kunzmann, Gerald. University of Wuerzburg, 2005.
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @techreport{info3-techreport-2005-188, author = {Hoßfeld, Tobias and Binzenhöfer, Andreas and Schlosser, Daniel and Eger, Kolja and Oberender, Jens and Dedinski, Ivan and Kunzmann, Gerald}, institution = {University of Wuerzburg}, keywords = {sys:hidden:techreport}, month = 10, number = 371, title = {Towards Efficient Simulation of Large Scale P2P Networks}, year = 2005 }

  %0 Report %1 info3-techreport-2005-188 %A Hoßfeld, Tobias %A Binzenhöfer, Andreas %A Schlosser, Daniel %A Eger, Kolja %A Oberender, Jens %A Dedinski, Ivan %A Kunzmann, Gerald %D 2005 %N 371 %T Towards Efficient Simulation of Large Scale P2P Networks
• Influence of the Size of Swapping Entities in Mobile P2P File-Sharing Networks. Hoßfeld, Tobias; Tutschku, Kurt; Schlosser, Daniel. In Peer-to-Peer-Systeme und -Anwendungen. GI/ITG-Workshop in Kooperation mit KiVS 2005, Kaiserslautern, 2005.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Peer-to-Peer (P2P) file-sharing has become the killer application in the wired Internet and might also be highly attractive for mobile networks. In particular since UMTS operators are searching for new applications which do both: a) exploit the potential of the UMTS technology and b) motivate the user to adopt the new technology. Mobile networks differ from wireline networks mainly by the limited capacity of the radio link, the mobility of the users, and the anticipated content exchanged in these networks. P2P networks, in contrast, are overlays which run on top of a transport network. They consider the transport network only in an abstract way. P2P performance is typically considered on overlay level only. In a mobile environment, the question arises, whether the abstraction can be maintained for underlying mobile transport networks, too, and whether there will be a performance impact. In this paper we investigate the performance of a multiple source download mechanism as used in the popular eDonkey file-sharing network. The performance of the proposed mobile P2P architecture has already been considered for several factors, like the capacity of the mobile access network, the mobility of the users, the application of the cache peer, and the size of typical contents of mobile users such as ring tones, images, and mp3 audio files. However, the performance may be increased by adapting the size of the swapping entities in dependence on these main influence factors. The swapping entities are the smallest units for uploading and downloading user data and are called chunks and blocks, respectively. In this work, we show if and how the swapping entities influence the entire system.

  @inproceedings{info3-inproceedings-2005-158, abstract = {Peer-to-Peer (P2P) file-sharing has become the killer application in the wired Internet and might also be highly attractive for mobile networks. In particular since UMTS operators are searching for new applications which do both: a) exploit the potential of the UMTS technology and b) motivate the user to adopt the new technology. Mobile networks differ from wireline networks mainly by the limited capacity of the radio link, the mobility of the users, and the anticipated content exchanged in these networks. P2P networks, in contrast, are overlays which run on top of a transport network. They consider the transport network only in an abstract way. P2P performance is typically considered on overlay level only. In a mobile environment, the question arises, whether the abstraction can be maintained for underlying mobile transport networks, too, and whether there will be a performance impact. In this paper we investigate the performance of a multiple source download mechanism as used in the popular eDonkey file-sharing network. The performance of the proposed mobile P2P architecture has already been considered for several factors, like the capacity of the mobile access network, the mobility of the users, the application of the cache peer, and the size of typical contents of mobile users such as ring tones, images, and mp3 audio files. However, the performance may be increased by adapting the size of the swapping entities in dependence on these main influence factors. The swapping entities are the smallest units for uploading and downloading user data and are called chunks and blocks, respectively. In this work, we show if and how the swapping entities influence the entire system.}, address = {GI/ITG-Workshop in Kooperation mit KiVS 2005, Kaiserslautern}, author = {Hoßfeld, Tobias and Tutschku, Kurt and Schlosser, Daniel}, booktitle = {Peer-to-Peer-Systeme und -Anwendungen}, keywords = {mobileptp}, month = {03}, title = {Influence of the Size of Swapping Entities in Mobile P2P File-Sharing Networks}, year = 2005 }

  %0 Conference Paper %1 info3-inproceedings-2005-158 %A Hoßfeld, Tobias %A Tutschku, Kurt %A Schlosser, Daniel %B Peer-to-Peer-Systeme und -Anwendungen %C GI/ITG-Workshop in Kooperation mit KiVS 2005, Kaiserslautern %D 2005 %T Influence of the Size of Swapping Entities in Mobile P2P File-Sharing Networks %X Peer-to-Peer (P2P) file-sharing has become the killer application in the wired Internet and might also be highly attractive for mobile networks. In particular since UMTS operators are searching for new applications which do both: a) exploit the potential of the UMTS technology and b) motivate the user to adopt the new technology. Mobile networks differ from wireline networks mainly by the limited capacity of the radio link, the mobility of the users, and the anticipated content exchanged in these networks. P2P networks, in contrast, are overlays which run on top of a transport network. They consider the transport network only in an abstract way. P2P performance is typically considered on overlay level only. In a mobile environment, the question arises, whether the abstraction can be maintained for underlying mobile transport networks, too, and whether there will be a performance impact. In this paper we investigate the performance of a multiple source download mechanism as used in the popular eDonkey file-sharing network. The performance of the proposed mobile P2P architecture has already been considered for several factors, like the capacity of the mobile access network, the mobility of the users, the application of the cache peer, and the size of typical contents of mobile users such as ring tones, images, and mp3 audio files. However, the performance may be increased by adapting the size of the swapping entities in dependence on these main influence factors. The swapping entities are the smallest units for uploading and downloading user data and are called chunks and blocks, respectively. In this work, we show if and how the swapping entities influence the entire system.
• Influence of the Size of Swapping Entities in Mobile Networks P2P File-Sharing Networks. Hoßfeld, Tobias; Tutschku, Kurt; Schlosser, Daniel. 2005, March.
  • [ BibTeX ]
  • [ EndNote ]
  @misc{info3-poster-2005-16, author = {Hoßfeld, Tobias and Tutschku, Kurt and Schlosser, Daniel}, booktitle = {KIVS 2005}, keywords = {sys:hidden:poster}, month = {03}, title = {Influence of the Size of Swapping Entities in Mobile Networks P2P File-Sharing Networks}, year = 2005 }

  %0 Generic %1 info3-poster-2005-16 %A Hoßfeld, Tobias %A Tutschku, Kurt %A Schlosser, Daniel %B KIVS 2005 %D 2005 %T Influence of the Size of Swapping Entities in Mobile Networks P2P File-Sharing Networks