Dr. rer. nat. Simon Oechsner

• Visions and Challenges for Sensor Network Collaboration in the Cloud Oechsner, Simon; Bellalta, Boris; Dimitrova, Desislava; Hoßfeld, Tobias in The Eighth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS-2014) (2014).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  The rapid growth in sensor network coverage, aided by the use of smartphones as capable sensing devices, leads to an enormous amount of gathered data from a multitude of different sources. However, generally data from one specific sensor network is only used by a very limited set of users and applications. This wastes a potentially greater usefulness for other, related data sinks that could use this additional input to improve their performance or services. In this paper, we outline visions and challenges for a widespread application of sensor network collaboration in the sense of sharing and exchanging information. We also describe a basic cloud-based architecture enabling this collaboration by providing the required support to store, manage and combine the gathered data. In particular, we include collaboration between sensor networks themselves to optimize performance, a facet that was up to now neglected in literature.

  @inproceedings{info3-inproceedings-2014-491, abstract = {The rapid growth in sensor network coverage, aided by the use of smartphones as capable sensing devices, leads to an enormous amount of gathered data from a multitude of different sources. However, generally data from one specific sensor network is only used by a very limited set of users and applications. This wastes a potentially greater usefulness for other, related data sinks that could use this additional input to improve their performance or services. In this paper, we outline visions and challenges for a widespread application of sensor network collaboration in the sense of sharing and exchanging information. We also describe a basic cloud-based architecture enabling this collaboration by providing the required support to store, manage and combine the gathered data. In particular, we include collaboration between sensor networks themselves to optimize performance, a facet that was up to now neglected in literature.}, address = {Birmingham, UK}, author = {Oechsner, Simon and Bellalta, Boris and Dimitrova, Desislava and Hoßfeld, Tobias}, booktitle = {The Eighth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS-2014)}, keywords = {sys:hidden:inproceedings}, month = 7, title = {Visions and Challenges for Sensor Network Collaboration in the Cloud}, year = 2014 }

  %0 Conference Paper %1 info3-inproceedings-2014-491 %A Oechsner, Simon %A Bellalta, Boris %A Dimitrova, Desislava %A Hoßfeld, Tobias %B The Eighth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS-2014) %C Birmingham, UK %D 2014 %T Visions and Challenges for Sensor Network Collaboration in the Cloud %X The rapid growth in sensor network coverage, aided by the use of smartphones as capable sensing devices, leads to an enormous amount of gathered data from a multitude of different sources. However, generally data from one specific sensor network is only used by a very limited set of users and applications. This wastes a potentially greater usefulness for other, related data sinks that could use this additional input to improve their performance or services. In this paper, we outline visions and challenges for a widespread application of sensor network collaboration in the sense of sharing and exchanging information. We also describe a basic cloud-based architecture enabling this collaboration by providing the required support to store, manage and combine the gathered data. In particular, we include collaboration between sensor networks themselves to optimize performance, a facet that was up to now neglected in literature.

• Caching for BitTorrent-like P2P Systems: A Simple Fluid Model and its Implications Lehrieder, Frank; Dán, György; Hoßfeld, Tobias; Oechsner, Simon; Singeorzan, Vlad in IEEE/ACM Transactions on Networking (2012). 20(4)
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Peer-to-peer file-sharing systems are responsible for a significant share of the traffic between Internet service providers (ISPs) in the Internet. In order to decrease their peer-to-peer-related transit traffic costs, many ISPs have deployed caches for peer-to-peer traffic in recent years. We consider how the different types of peer-to-peer caches—caches already available on the market and caches expected to become available in the future—can possibly affect the amount of inter-ISP traffic. We develop a fluid model that captures the effects of the caches on the system dynamics of peer-to-peer networks and show that caches can have adverse effects on the system dynamics depending on the system parameters. We combine the fluid model with a simple model of inter-ISP traffic and show that the impact of caches cannot be accurately assessed without considering the effects of the caches on the system dynamics. We identify scenarios when caching actually leads to increased transit traffic. Motivated by our findings, we propose a proximity-aware peer-selection mechanism that avoids the increase of the transit traffic and improves the cache efficiency.We support the analytical results by extensive simulations and experiments with real BitTorrent clients.

  @article{info3-article-2012-94, abstract = {Peer-to-peer file-sharing systems are responsible for a significant share of the traffic between Internet service providers (ISPs) in the Internet. In order to decrease their peer-to-peer-related transit traffic costs, many ISPs have deployed caches for peer-to-peer traffic in recent years. We consider how the different types of peer-to-peer caches—caches already available on the market and caches expected to become available in the future—can possibly affect the amount of inter-ISP traffic. We develop a fluid model that captures the effects of the caches on the system dynamics of peer-to-peer networks and show that caches can have adverse effects on the system dynamics depending on the system parameters. We combine the fluid model with a simple model of inter-ISP traffic and show that the impact of caches cannot be accurately assessed without considering the effects of the caches on the system dynamics. We identify scenarios when caching actually leads to increased transit traffic. Motivated by our findings, we propose a proximity-aware peer-selection mechanism that avoids the increase of the transit traffic and improves the cache efficiency.We support the analytical results by extensive simulations and experiments with real BitTorrent clients.}, author = {Lehrieder, Frank and Dán, György and Hoßfeld, Tobias and Oechsner, Simon and Singeorzan, Vlad}, journal = {IEEE/ACM Transactions on Networking}, keywords = {sys:hidden:article}, title = {Caching for BitTorrent-like P2P Systems: A Simple Fluid Model and its Implications}, volume = {20(4)}, year = 2012 }

  %0 Journal Article %1 info3-article-2012-94 %A Lehrieder, Frank %A Dán, György %A Hoßfeld, Tobias %A Oechsner, Simon %A Singeorzan, Vlad %D 2012 %J IEEE/ACM Transactions on Networking %T Caching for BitTorrent-like P2P Systems: A Simple Fluid Model and its Implications %V 20(4) %X Peer-to-peer file-sharing systems are responsible for a significant share of the traffic between Internet service providers (ISPs) in the Internet. In order to decrease their peer-to-peer-related transit traffic costs, many ISPs have deployed caches for peer-to-peer traffic in recent years. We consider how the different types of peer-to-peer caches—caches already available on the market and caches expected to become available in the future—can possibly affect the amount of inter-ISP traffic. We develop a fluid model that captures the effects of the caches on the system dynamics of peer-to-peer networks and show that caches can have adverse effects on the system dynamics depending on the system parameters. We combine the fluid model with a simple model of inter-ISP traffic and show that the impact of caches cannot be accurately assessed without considering the effects of the caches on the system dynamics. We identify scenarios when caching actually leads to increased transit traffic. Motivated by our findings, we propose a proximity-aware peer-selection mechanism that avoids the increase of the transit traffic and improves the cache efficiency.We support the analytical results by extensive simulations and experiments with real BitTorrent clients.
• Cooperative Traffic Management for Video Streaming Overlays Pussep, Konstantin; Lehrieder, Frank; Gross, Christian; Oechsner, Simon; Guenther, Markus; Meyer, Sebastian in Computer Networks (2012). 56(3) 1118–1130.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Peer-to-Peer (P2P) based overlays often ignore the boundaries of network domains and make traffic management challenging for network operators. Locality-aware techniques are a promising approach to alleviate this impact, but often benefit only network operators and fail to provide similar benefits to end-users and overlay providers. This is especially severe with video streaming overlays that are responsible for large amount of Internet traffic. In this paper we present and evaluate a collaborative approach where a network operator measures the behavior of overlay users and promotes a subset of them in terms of up- and download bandwidth. This creates an incentive to users and overlay providers to cooperate by using locality awareness according to the operator's policies. We evaluate our approach both with a real application and via extensive simulations to analyze the user selection metrics and the impact on different network operators. Our study shows that this cooperative traffic management approach leads to a situation that is beneficial for users, content providers, and network operators.

  @article{info3-article-2012-92, abstract = {Peer-to-Peer (P2P) based overlays often ignore the boundaries of network domains and make traffic management challenging for network operators. Locality-aware techniques are a promising approach to alleviate this impact, but often benefit only network operators and fail to provide similar benefits to end-users and overlay providers. This is especially severe with video streaming overlays that are responsible for large amount of Internet traffic. In this paper we present and evaluate a collaborative approach where a network operator measures the behavior of overlay users and promotes a subset of them in terms of up- and download bandwidth. This creates an incentive to users and overlay providers to cooperate by using locality awareness according to the operator's policies. We evaluate our approach both with a real application and via extensive simulations to analyze the user selection metrics and the impact on different network operators. Our study shows that this cooperative traffic management approach leads to a situation that is beneficial for users, content providers, and network operators.}, author = {Pussep, Konstantin and Lehrieder, Frank and Gross, Christian and Oechsner, Simon and Guenther, Markus and Meyer, Sebastian}, journal = {Computer Networks}, keywords = {sys:hidden:article}, pages = {1118–1130}, title = {Cooperative Traffic Management for Video Streaming Overlays}, volume = {56(3)}, year = 2012 }

  %0 Journal Article %1 info3-article-2012-92 %A Pussep, Konstantin %A Lehrieder, Frank %A Gross, Christian %A Oechsner, Simon %A Guenther, Markus %A Meyer, Sebastian %D 2012 %J Computer Networks %P 1118–1130 %T Cooperative Traffic Management for Video Streaming Overlays %V 56(3) %X Peer-to-Peer (P2P) based overlays often ignore the boundaries of network domains and make traffic management challenging for network operators. Locality-aware techniques are a promising approach to alleviate this impact, but often benefit only network operators and fail to provide similar benefits to end-users and overlay providers. This is especially severe with video streaming overlays that are responsible for large amount of Internet traffic. In this paper we present and evaluate a collaborative approach where a network operator measures the behavior of overlay users and promotes a subset of them in terms of up- and download bandwidth. This creates an incentive to users and overlay providers to cooperate by using locality awareness according to the operator's policies. We evaluate our approach both with a real application and via extensive simulations to analyze the user selection metrics and the impact on different network operators. Our study shows that this cooperative traffic management approach leads to a situation that is beneficial for users, content providers, and network operators.

• Cache Capacity Allocation to Overlay Swarms Papafili, Ioanna; Stamoulis, George D.; Lehrieder, Frank; Kleine, Benjamin; Oechsner, Simon in International Workshop on Self-Organizing Systems (2011).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Peer-to-peer applications generate huge volumes of Internet traffic, thus leading to higher congestion, as well as higher costs for the ISPs particularly due to inter-domain traffic. The traditional traffic management approaches employed by ISPs (e.g. traffic shaping or even throttling) often lead to a deterioration of users‟ Quality-of-Experience. Previous works have verified that the insertion of ISP-owned Peers (IoPs) can deal effectively with this situation. The mechanism offers caching while exploiting the self-organizing structure of overlays. Thus, it leads to both improved performance for peers and reduced inter-domain traffic costs for ISPs. In this paper, we study how the available IoP bandwidth capacity should be allocated among the various swarms that it can possibly join. In particular, we identify a variety of factors that influence the effectiveness of Swarm Selection and Bandwidth Allocation, and we investigate their impact on the practically relevant example of BitTorrent, primarily by means of simulations.

  @inproceedings{info3-inproceedings-2011-402, abstract = {Peer-to-peer applications generate huge volumes of Internet traffic, thus leading to higher congestion, as well as higher costs for the ISPs particularly due to inter-domain traffic. The traditional traffic management approaches employed by ISPs (e.g. traffic shaping or even throttling) often lead to a deterioration of users‟ Quality-of-Experience. Previous works have verified that the insertion of ISP-owned Peers (IoPs) can deal effectively with this situation. The mechanism offers caching while exploiting the self-organizing structure of overlays. Thus, it leads to both improved performance for peers and reduced inter-domain traffic costs for ISPs. In this paper, we study how the available IoP bandwidth capacity should be allocated among the various swarms that it can possibly join. In particular, we identify a variety of factors that influence the effectiveness of Swarm Selection and Bandwidth Allocation, and we investigate their impact on the practically relevant example of BitTorrent, primarily by means of simulations.}, address = {Karlsruhe, Germany}, author = {Papafili, Ioanna and Stamoulis, George D. and Lehrieder, Frank and Kleine, Benjamin and Oechsner, Simon}, booktitle = {International Workshop on Self-Organizing Systems}, keywords = {sys:hidden:inproceedings}, month = 2, title = {Cache Capacity Allocation to Overlay Swarms}, year = 2011 }

  %0 Conference Paper %1 info3-inproceedings-2011-402 %A Papafili, Ioanna %A Stamoulis, George D. %A Lehrieder, Frank %A Kleine, Benjamin %A Oechsner, Simon %B International Workshop on Self-Organizing Systems %C Karlsruhe, Germany %D 2011 %T Cache Capacity Allocation to Overlay Swarms %X Peer-to-peer applications generate huge volumes of Internet traffic, thus leading to higher congestion, as well as higher costs for the ISPs particularly due to inter-domain traffic. The traditional traffic management approaches employed by ISPs (e.g. traffic shaping or even throttling) often lead to a deterioration of users‟ Quality-of-Experience. Previous works have verified that the insertion of ISP-owned Peers (IoPs) can deal effectively with this situation. The mechanism offers caching while exploiting the self-organizing structure of overlays. Thus, it leads to both improved performance for peers and reduced inter-domain traffic costs for ISPs. In this paper, we study how the available IoP bandwidth capacity should be allocated among the various swarms that it can possibly join. In particular, we identify a variety of factors that influence the effectiveness of Swarm Selection and Bandwidth Allocation, and we investigate their impact on the practically relevant example of BitTorrent, primarily by means of simulations.
• Influence of traffic management solutions on Quality of Experience for prevailing overlay applications Stankiewicz, Rafal; Cholda, Piotr; Domzal, Jerzy; Wojcik, Robert; Hoßfeld, Tobias; Zinner, Thomas; Oechsner, Simon; Lehrieder, Frank in Proceedings of the 7th Conference on Next Generation Internet Networks (NGI) (2011).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Different sorts of peer-to-peer (P2P) applications emerge every day and they are becoming more and more popular. The performance of such applications may be measured by means of Quality of Experience (QoE) metrics. In this paper, we survey the factors that influence these metrics. Moreover, we assess the impact of traffic management solutions (e.g. proposed by ALTO or SmoothIT) on perceived QoE for the dominant overlay applications. The possible regulatory issues regarding QoE for P2P applications are also mentioned.

  @inproceedings{info3-inproceedings-2011-414, abstract = {Different sorts of peer-to-peer (P2P) applications emerge every day and they are becoming more and more popular. The performance of such applications may be measured by means of Quality of Experience (QoE) metrics. In this paper, we survey the factors that influence these metrics. Moreover, we assess the impact of traffic management solutions (e.g. proposed by ALTO or SmoothIT) on perceived QoE for the dominant overlay applications. The possible regulatory issues regarding QoE for P2P applications are also mentioned.}, address = {Kaiserslautern, Germany}, author = {Stankiewicz, Rafal and Cholda, Piotr and Domzal, Jerzy and Wojcik, Robert and Hoßfeld, Tobias and Zinner, Thomas and Oechsner, Simon and Lehrieder, Frank}, booktitle = {Proceedings of the 7th Conference on Next Generation Internet Networks (NGI)}, keywords = {sys:hidden:inproceedings}, month = 6, title = {Influence of traffic management solutions on Quality of Experience for prevailing overlay applications}, year = 2011 }

  %0 Conference Paper %1 info3-inproceedings-2011-414 %A Stankiewicz, Rafal %A Cholda, Piotr %A Domzal, Jerzy %A Wojcik, Robert %A Hoßfeld, Tobias %A Zinner, Thomas %A Oechsner, Simon %A Lehrieder, Frank %B Proceedings of the 7th Conference on Next Generation Internet Networks (NGI) %C Kaiserslautern, Germany %D 2011 %T Influence of traffic management solutions on Quality of Experience for prevailing overlay applications %X Different sorts of peer-to-peer (P2P) applications emerge every day and they are becoming more and more popular. The performance of such applications may be measured by means of Quality of Experience (QoE) metrics. In this paper, we survey the factors that influence these metrics. Moreover, we assess the impact of traffic management solutions (e.g. proposed by ALTO or SmoothIT) on perceived QoE for the dominant overlay applications. The possible regulatory issues regarding QoE for P2P applications are also mentioned.
• Assessment of Economic Traffic Management of Overlay Traffic: Methodology and Results Papafili, Ioanna; Stamoulis, George D.; Stankiewicz, Rafal; Oechsner, Simon; Pussep, Konstantin; Wojcik, Robert; Domzal, Jerzy; Staehle, Dirk; Lehrieder, Frank; Stiller, Burkhard in Future Internet Assembly (FIA) Book: Future Internet Achievements and Promising Technology, J. D. et al. (ed.) (2011).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  Overlay applications generate huge amounts of traffic in the Internet, which determines a problem for Internet Service Providers, since it results in high charges for inter-domain traffic. Traditional traffic management techniques cannot deal successfully with overlay traffic. An incentive-based approach that employs economic concepts and mechanisms is required in order to deal with the overlay traffic in a way that is mutually beneficial for all stakeholders of the Future Internet. This TripleWin situation is the target of Economic Traffic Management (ETM). A wide variety of techniques are employed by ETM for optimizing overlay traffic management considering performance requirements of overlay and underlay networks together with cost implications for ISPs. However, the assessment of ETM requires an innovative methodology. In this article this methodology is described and major results are presented as obtained accordingly from the evaluation of different ETM mechanisms.

  @incollection{info3-incollection-2011-16, abstract = {Overlay applications generate huge amounts of traffic in the Internet, which determines a problem for Internet Service Providers, since it results in high charges for inter-domain traffic. Traditional traffic management techniques cannot deal successfully with overlay traffic. An incentive-based approach that employs economic concepts and mechanisms is required in order to deal with the overlay traffic in a way that is mutually beneficial for all stakeholders of the Future Internet. This TripleWin situation is the target of Economic Traffic Management (ETM). A wide variety of techniques are employed by ETM for optimizing overlay traffic management considering performance requirements of overlay and underlay networks together with cost implications for ISPs. However, the assessment of ETM requires an innovative methodology. In this article this methodology is described and major results are presented as obtained accordingly from the evaluation of different ETM mechanisms.}, author = {Papafili, Ioanna and Stamoulis, George D. and Stankiewicz, Rafal and Oechsner, Simon and Pussep, Konstantin and Wojcik, Robert and Domzal, Jerzy and Staehle, Dirk and Lehrieder, Frank and Stiller, Burkhard}, booktitle = {Future Internet Assembly (FIA) Book: Future Internet Achievements and Promising Technology}, editor = {et al., John Domingue}, keywords = {myown}, publisher = {Springer LNCS}, title = {Assessment of Economic Traffic Management of Overlay Traffic: Methodology and Results}, year = 2011 }

  %0 Book Section %1 info3-incollection-2011-16 %A Papafili, Ioanna %A Stamoulis, George D. %A Stankiewicz, Rafal %A Oechsner, Simon %A Pussep, Konstantin %A Wojcik, Robert %A Domzal, Jerzy %A Staehle, Dirk %A Lehrieder, Frank %A Stiller, Burkhard %B Future Internet Assembly (FIA) Book: Future Internet Achievements and Promising Technology %D 2011 %E et al., John Domingue %I Springer LNCS %T Assessment of Economic Traffic Management of Overlay Traffic: Methodology and Results %X Overlay applications generate huge amounts of traffic in the Internet, which determines a problem for Internet Service Providers, since it results in high charges for inter-domain traffic. Traditional traffic management techniques cannot deal successfully with overlay traffic. An incentive-based approach that employs economic concepts and mechanisms is required in order to deal with the overlay traffic in a way that is mutually beneficial for all stakeholders of the Future Internet. This TripleWin situation is the target of Economic Traffic Management (ETM). A wide variety of techniques are employed by ETM for optimizing overlay traffic management considering performance requirements of overlay and underlay networks together with cost implications for ISPs. However, the assessment of ETM requires an innovative methodology. In this article this methodology is described and major results are presented as obtained accordingly from the evaluation of different ETM mechanisms.
• 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) (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 = 9, 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.
• Characterization of BitTorrent Swarms and their Distribution in the Internet Hoßfeld, Tobias; Lehrieder, Frank; Hock, David; Oechsner, Simon; Despotovic, Zoran; Kellerer, Wolfgang; Michel, Maximilian in Computer Networks (2011). 55(5) 1197–1215.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  The optimization of overlay traffic resulting from applications such as BitTorrent is a challenge addressed by several recent research initiatives. However, the assessment of such optimization techniques and their performance in the real Internet remains difficult. Despite a considerable set of works measuring real-life BitTorrent swarms, several characteristics of those swarms relevant for the optimization of overlay traffic have not yet been investigated. In this work, we address this lack of realistic swarm statistics by presenting our measurement results. In particular, we provide a statistical characterization of the swarm sizes, the distribution of peers over autonomous systems (ASs), the fraction of peers in the largest AS, and the size of the shared files. To this end, we consider different types of shared content and identify particular characteristics of regional swarms. The selection of the presented data is inspired by ongoing discussions in the IETF working group on application layer traffic optimization (ALTO). Our study is intended to provide input for the design and the assessment of ALTO solutions for BitTorrent, but the applicability of the results is not limited to that purpose.

  @article{info3-article-2011-83, abstract = {The optimization of overlay traffic resulting from applications such as BitTorrent is a challenge addressed by several recent research initiatives. However, the assessment of such optimization techniques and their performance in the real Internet remains difficult. Despite a considerable set of works measuring real-life BitTorrent swarms, several characteristics of those swarms relevant for the optimization of overlay traffic have not yet been investigated. In this work, we address this lack of realistic swarm statistics by presenting our measurement results. In particular, we provide a statistical characterization of the swarm sizes, the distribution of peers over autonomous systems (ASs), the fraction of peers in the largest AS, and the size of the shared files. To this end, we consider different types of shared content and identify particular characteristics of regional swarms. The selection of the presented data is inspired by ongoing discussions in the IETF working group on application layer traffic optimization (ALTO). Our study is intended to provide input for the design and the assessment of ALTO solutions for BitTorrent, but the applicability of the results is not limited to that purpose.}, author = {Hoßfeld, Tobias and Lehrieder, Frank and Hock, David and Oechsner, Simon and Despotovic, Zoran and Kellerer, Wolfgang and Michel, Maximilian}, journal = {Computer Networks}, keywords = {sys:hidden:article}, month = 4, pages = {1197-1215}, title = {Characterization of BitTorrent Swarms and their Distribution in the Internet}, volume = {55(5)}, year = 2011 }

  %0 Journal Article %1 info3-article-2011-83 %A Hoßfeld, Tobias %A Lehrieder, Frank %A Hock, David %A Oechsner, Simon %A Despotovic, Zoran %A Kellerer, Wolfgang %A Michel, Maximilian %D 2011 %J Computer Networks %P 1197-1215 %T Characterization of BitTorrent Swarms and their Distribution in the Internet %V 55(5) %X The optimization of overlay traffic resulting from applications such as BitTorrent is a challenge addressed by several recent research initiatives. However, the assessment of such optimization techniques and their performance in the real Internet remains difficult. Despite a considerable set of works measuring real-life BitTorrent swarms, several characteristics of those swarms relevant for the optimization of overlay traffic have not yet been investigated. In this work, we address this lack of realistic swarm statistics by presenting our measurement results. In particular, we provide a statistical characterization of the swarm sizes, the distribution of peers over autonomous systems (ASs), the fraction of peers in the largest AS, and the size of the shared files. To this end, we consider different types of shared content and identify particular characteristics of regional swarms. The selection of the presented data is inspired by ongoing discussions in the IETF working group on application layer traffic optimization (ALTO). Our study is intended to provide input for the design and the assessment of ALTO solutions for BitTorrent, but the applicability of the results is not limited to that purpose.
• Modeling and Performance Evaluation of an OpenFlow Architecture Jarschel, Michael; Oechsner, Simon; Schlosser, Daniel; Pries, Rastin; Goll, Sebastian; Tran-Gia, Phuoc (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 = 9, 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
• Mitigating Unfairness in Locality-Aware Peer-to-Peer Networks Lehrieder, Frank; Oechsner, Simon; Hoßfeld, Tobias; Staehle, Dirk; Despotovic, Zoran; Kellerer, Wolfgang; Michel, Maximilian in International Journal of Network Management (IJNM), Special Issue on Economic Traffic Management (2011). 21(1)
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Locality-awareness is considered as a promising approach to increase the efficiency of content distribution by peer-to-peer (P2P) networks, e.g., BitTorrent. It is intended to reduce the inter-domain traffic which is costly for Internet service providers (ISPs) and to simultaneously increase the performance from the viewpoint of the P2P users, i.e., to shorten download times. This win-win situation should be achieved by a preferred exchange of information between peers which are located closely to each other in the underlying network topology. A set of studies shows that these approaches can lead to a win-win situation under certain conditions, and to a win-no lose situation in most cases. However, the scenarios used mostly assume homogeneous peer distributions. This is not the case in practice according to recent measurement studies. Therefore, we extend previous work in this paper by studying scenarios with real-life, skewed peer distributions. We show that even a win-no lose situation is difficult to achieve under those conditions and that the actual impact for a specific peer heavily depends on the used locality-aware peer selection and the specific scenario. This contradicts the principle of economic traffic management (ETM) which aims for a solution where all involved players benefit and consequently have an incentive to adopt locality-awareness. Therefore, we propose and evaluate refinements of current proposals, achieving that all users of P2P networks can be sure that their application performance is not reduced. This mitigates the unfairness introduced by current proposals which is a key requirement for a broad acceptance of the concept of locality-awareness in the user community of P2P networks.

  @article{info3-article-2011-82, abstract = {Locality-awareness is considered as a promising approach to increase the efficiency of content distribution by peer-to-peer (P2P) networks, e.g., BitTorrent. It is intended to reduce the inter-domain traffic which is costly for Internet service providers (ISPs) and to simultaneously increase the performance from the viewpoint of the P2P users, i.e., to shorten download times. This win-win situation should be achieved by a preferred exchange of information between peers which are located closely to each other in the underlying network topology. A set of studies shows that these approaches can lead to a win-win situation under certain conditions, and to a win-no lose situation in most cases. However, the scenarios used mostly assume homogeneous peer distributions. This is not the case in practice according to recent measurement studies. Therefore, we extend previous work in this paper by studying scenarios with real-life, skewed peer distributions. We show that even a win-no lose situation is difficult to achieve under those conditions and that the actual impact for a specific peer heavily depends on the used locality-aware peer selection and the specific scenario. This contradicts the principle of economic traffic management (ETM) which aims for a solution where all involved players benefit and consequently have an incentive to adopt locality-awareness. Therefore, we propose and evaluate refinements of current proposals, achieving that all users of P2P networks can be sure that their application performance is not reduced. This mitigates the unfairness introduced by current proposals which is a key requirement for a broad acceptance of the concept of locality-awareness in the user community of P2P networks.}, author = {Lehrieder, Frank and Oechsner, Simon and Hoßfeld, Tobias and Staehle, Dirk and Despotovic, Zoran and Kellerer, Wolfgang and Michel, Maximilian}, journal = {International Journal of Network Management (IJNM), Special Issue on Economic Traffic Management}, keywords = {sys:hidden:article}, month = 1, title = {Mitigating Unfairness in Locality-Aware Peer-to-Peer Networks}, volume = {21(1)}, year = 2011 }

  %0 Journal Article %1 info3-article-2011-82 %A Lehrieder, Frank %A Oechsner, Simon %A Hoßfeld, Tobias %A Staehle, Dirk %A Despotovic, Zoran %A Kellerer, Wolfgang %A Michel, Maximilian %D 2011 %J International Journal of Network Management (IJNM), Special Issue on Economic Traffic Management %T Mitigating Unfairness in Locality-Aware Peer-to-Peer Networks %V 21(1) %X Locality-awareness is considered as a promising approach to increase the efficiency of content distribution by peer-to-peer (P2P) networks, e.g., BitTorrent. It is intended to reduce the inter-domain traffic which is costly for Internet service providers (ISPs) and to simultaneously increase the performance from the viewpoint of the P2P users, i.e., to shorten download times. This win-win situation should be achieved by a preferred exchange of information between peers which are located closely to each other in the underlying network topology. A set of studies shows that these approaches can lead to a win-win situation under certain conditions, and to a win-no lose situation in most cases. However, the scenarios used mostly assume homogeneous peer distributions. This is not the case in practice according to recent measurement studies. Therefore, we extend previous work in this paper by studying scenarios with real-life, skewed peer distributions. We show that even a win-no lose situation is difficult to achieve under those conditions and that the actual impact for a specific peer heavily depends on the used locality-aware peer selection and the specific scenario. This contradicts the principle of economic traffic management (ETM) which aims for a solution where all involved players benefit and consequently have an incentive to adopt locality-awareness. Therefore, we propose and evaluate refinements of current proposals, achieving that all users of P2P networks can be sure that their application performance is not reduced. This mitigates the unfairness introduced by current proposals which is a key requirement for a broad acceptance of the concept of locality-awareness in the user community of P2P networks.

• Supporting Scalable Video Codecs in a P2P Video-on-Demand Streaming System Oechsner, Simon; Zinner, Thomas; Prokopetz, Jochen; Hoßfeld, Tobias in 21th ITC Specialist Seminar on Multimedia Applications - Traffic, Performance and QoE (2010).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  There are currently two complementing and concurrent trends in the Internet. The first is the rise of video streaming and especially Video-on-Demand (VoD) as the most popular application for end users, expressed by a continuously increasing amount of video traffic. In this context, P2P is seen as a promising technology for providing video content efficiently to the users while reducing the cost for the content providers. The second trend is the diversification of end user devices used for watching these videos. This is reflected by the Scalable Video Codec (SVC) extension to the state-of-the-art H.264 video codec, which allows for a stream to be separated into substreams of varying quality and size. In this paper, we propose and evaluate a P2P VoD architecture based on the Tribler application which is enhanced to support such a SVC video. Thus, the proposed system is able to adapt the video quality on-the-fly to the network situation and access capabilities of the user devices.

  @inproceedings{info3-inproceedings-2010-368, abstract = {There are currently two complementing and concurrent trends in the Internet. The first is the rise of video streaming and especially Video-on-Demand (VoD) as the most popular application for end users, expressed by a continuously increasing amount of video traffic. In this context, P2P is seen as a promising technology for providing video content efficiently to the users while reducing the cost for the content providers. The second trend is the diversification of end user devices used for watching these videos. This is reflected by the Scalable Video Codec (SVC) extension to the state-of-the-art H.264 video codec, which allows for a stream to be separated into substreams of varying quality and size. In this paper, we propose and evaluate a P2P VoD architecture based on the Tribler application which is enhanced to support such a SVC video. Thus, the proposed system is able to adapt the video quality on-the-fly to the network situation and access capabilities of the user devices.}, address = {Miyazaki, Jap}, author = {Oechsner, Simon and Zinner, Thomas and Prokopetz, Jochen and Hoßfeld, Tobias}, booktitle = {21th ITC Specialist Seminar on Multimedia Applications - Traffic, Performance and QoE}, keywords = {sys:hidden:inproceedings}, month = 3, title = {Supporting Scalable Video Codecs in a P2P Video-on-Demand Streaming System}, year = 2010 }

  %0 Conference Paper %1 info3-inproceedings-2010-368 %A Oechsner, Simon %A Zinner, Thomas %A Prokopetz, Jochen %A Hoßfeld, Tobias %B 21th ITC Specialist Seminar on Multimedia Applications - Traffic, Performance and QoE %C Miyazaki, Jap %D 2010 %T Supporting Scalable Video Codecs in a P2P Video-on-Demand Streaming System %X There are currently two complementing and concurrent trends in the Internet. The first is the rise of video streaming and especially Video-on-Demand (VoD) as the most popular application for end users, expressed by a continuously increasing amount of video traffic. In this context, P2P is seen as a promising technology for providing video content efficiently to the users while reducing the cost for the content providers. The second trend is the diversification of end user devices used for watching these videos. This is reflected by the Scalable Video Codec (SVC) extension to the state-of-the-art H.264 video codec, which allows for a stream to be separated into substreams of varying quality and size. In this paper, we propose and evaluate a P2P VoD architecture based on the Tribler application which is enhanced to support such a SVC video. Thus, the proposed system is able to adapt the video quality on-the-fly to the network situation and access capabilities of the user devices.
• Overlay Connection Usage in BitTorrent Swarms Oechsner, Simon; Lehrieder, Frank; Staehle, Dirk in 3rd Workshop on Economic Traffic Management (2010).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  The amount of peer-to-peer (P2P) traffic and its inefficient utilization of network resources make it a high priority for traffic management. Due to the distributed nature of P2P overlays, a promising approach for a management scheme is to change the client behavior and its utilization of overlay connections. However, from the viewpoint of a client, there are different categories of overlay connections. In this paper, we discern between these different types of overlay connections in BitTorrent, the currently most popular P2P file-sharing application. A simulation study of BitTorrent and a video-streaming derivate called Tribler provides insights into the usage of these types of connections for data exchange. Thus, traffic management based on client behavior can be optimized by efficiently targeting connections which carry the most traffic. We also show the implications of these results for locality-awareness mechanisms such as Biased Neighbor Selection and Biased Unchoking.

  @inproceedings{info3-inproceedings-2010-386, abstract = {The amount of peer-to-peer (P2P) traffic and its inefficient utilization of network resources make it a high priority for traffic management. Due to the distributed nature of P2P overlays, a promising approach for a management scheme is to change the client behavior and its utilization of overlay connections. However, from the viewpoint of a client, there are different categories of overlay connections. In this paper, we discern between these different types of overlay connections in BitTorrent, the currently most popular P2P file-sharing application. A simulation study of BitTorrent and a video-streaming derivate called Tribler provides insights into the usage of these types of connections for data exchange. Thus, traffic management based on client behavior can be optimized by efficiently targeting connections which carry the most traffic. We also show the implications of these results for locality-awareness mechanisms such as Biased Neighbor Selection and Biased Unchoking.}, address = {Collocated with 22nd International Teletraffic Congress (ITC 22), Amsterdam, Netherlands}, author = {Oechsner, Simon and Lehrieder, Frank and Staehle, Dirk}, booktitle = {3rd Workshop on Economic Traffic Management}, keywords = {sys:hidden:inproceedings}, month = 9, title = {Overlay Connection Usage in BitTorrent Swarms}, year = 2010 }

  %0 Conference Paper %1 info3-inproceedings-2010-386 %A Oechsner, Simon %A Lehrieder, Frank %A Staehle, Dirk %B 3rd Workshop on Economic Traffic Management %C Collocated with 22nd International Teletraffic Congress (ITC 22), Amsterdam, Netherlands %D 2010 %T Overlay Connection Usage in BitTorrent Swarms %X The amount of peer-to-peer (P2P) traffic and its inefficient utilization of network resources make it a high priority for traffic management. Due to the distributed nature of P2P overlays, a promising approach for a management scheme is to change the client behavior and its utilization of overlay connections. However, from the viewpoint of a client, there are different categories of overlay connections. In this paper, we discern between these different types of overlay connections in BitTorrent, the currently most popular P2P file-sharing application. A simulation study of BitTorrent and a video-streaming derivate called Tribler provides insights into the usage of these types of connections for data exchange. Thus, traffic management based on client behavior can be optimized by efficiently targeting connections which carry the most traffic. We also show the implications of these results for locality-awareness mechanisms such as Biased Neighbor Selection and Biased Unchoking.
• Can P2P-Users Benefit from Locality-Awareness? Lehrieder, Frank; Oechsner, Simon; Hoßfeld, Tobias; Despotovic, Zoran; Kellerer, Wolfgang; Michel, Maximilian in 10th IEEE International Conference on Peer-to-Peer Computing 2010 - IEEE P2P 2010 (2010).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Locality-awareness is considered as a promising approach to increase the efficiency of content distribution by peer-to-peer (P2P) networks, e.g., BitTorrent. It is intended to reduce the inter-domain traffic which is costly for Internet service providers (ISPs) and simultaneously increase the performance from the viewpoint of the P2P users, i.e, shorten download times. This win-win situation should be achieved by a preferred exchange of information between peers which are located closely to each other in the underlying network topology. A set of studies shows that these approaches can lead to a win-win situation under certain conditions, and to a win-no lose situation in most cases. However, the scenarios used assume mostly homogeneous peer distributions and that all peers have the same access speed. This is not the case in practice according to several measurement studies. Therefore, we extend previous work in this paper by studying scenarios with real-life, skewed peer distributions and heterogeneous access bandwidths of peers. We show that even a win-no lose situation is difficult to achieve under those conditions and that the actual impact for a specific peer depends heavily on the used locality-aware peer selection and the concrete scenario. Therefore, we conclude that current proposals need to be refined so that users of P2P networks can be sure that they also benefit from their use. Otherwise, a broad acceptance of the concept of locality-awareness in the user community of P2P networks will not take place.

  @inproceedings{info3-inproceedings-2010-388, abstract = {Locality-awareness is considered as a promising approach to increase the efficiency of content distribution by peer-to-peer (P2P) networks, e.g., BitTorrent. It is intended to reduce the inter-domain traffic which is costly for Internet service providers (ISPs) and simultaneously increase the performance from the viewpoint of the P2P users, i.e, shorten download times. This win-win situation should be achieved by a preferred exchange of information between peers which are located closely to each other in the underlying network topology. A set of studies shows that these approaches can lead to a win-win situation under certain conditions, and to a win-no lose situation in most cases. However, the scenarios used assume mostly homogeneous peer distributions and that all peers have the same access speed. This is not the case in practice according to several measurement studies. Therefore, we extend previous work in this paper by studying scenarios with real-life, skewed peer distributions and heterogeneous access bandwidths of peers. We show that even a win-no lose situation is difficult to achieve under those conditions and that the actual impact for a specific peer depends heavily on the used locality-aware peer selection and the concrete scenario. Therefore, we conclude that current proposals need to be refined so that users of P2P networks can be sure that they also benefit from their use. Otherwise, a broad acceptance of the concept of locality-awareness in the user community of P2P networks will not take place.}, address = {Delft, the Netherlands}, author = {Lehrieder, Frank and Oechsner, Simon and Hoßfeld, Tobias and Despotovic, Zoran and Kellerer, Wolfgang and Michel, Maximilian}, booktitle = {10th IEEE International Conference on Peer-to-Peer Computing 2010 - IEEE P2P 2010}, keywords = {sys:hidden:inproceedings}, month = 8, title = {Can P2P-Users Benefit from Locality-Awareness?}, year = 2010 }

  %0 Conference Paper %1 info3-inproceedings-2010-388 %A Lehrieder, Frank %A Oechsner, Simon %A Hoßfeld, Tobias %A Despotovic, Zoran %A Kellerer, Wolfgang %A Michel, Maximilian %B 10th IEEE International Conference on Peer-to-Peer Computing 2010 - IEEE P2P 2010 %C Delft, the Netherlands %D 2010 %T Can P2P-Users Benefit from Locality-Awareness? %X Locality-awareness is considered as a promising approach to increase the efficiency of content distribution by peer-to-peer (P2P) networks, e.g., BitTorrent. It is intended to reduce the inter-domain traffic which is costly for Internet service providers (ISPs) and simultaneously increase the performance from the viewpoint of the P2P users, i.e, shorten download times. This win-win situation should be achieved by a preferred exchange of information between peers which are located closely to each other in the underlying network topology. A set of studies shows that these approaches can lead to a win-win situation under certain conditions, and to a win-no lose situation in most cases. However, the scenarios used assume mostly homogeneous peer distributions and that all peers have the same access speed. This is not the case in practice according to several measurement studies. Therefore, we extend previous work in this paper by studying scenarios with real-life, skewed peer distributions and heterogeneous access bandwidths of peers. We show that even a win-no lose situation is difficult to achieve under those conditions and that the actual impact for a specific peer depends heavily on the used locality-aware peer selection and the concrete scenario. Therefore, we conclude that current proposals need to be refined so that users of P2P networks can be sure that they also benefit from their use. Otherwise, a broad acceptance of the concept of locality-awareness in the user community of P2P networks will not take place.
• The Impact of Caching on BitTorrent-like Peer-to-peer Systems Lehrieder, Frank; Dán, György; Hoßfeld, Tobias; Oechsner, Simon; Singeorzan, Vlad in 10th IEEE International Conference on Peer-to-Peer Computing 2010 - IEEE P2P 2010 (2010).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Peer-to-peer file-sharing systems are responsible for a significant share of the traffic between Internet service providers (ISPs) in the Internet. In order to decrease their peer-to-peer related transit traffic costs, many ISPs have deployed caches for peer-to-peer traffic in recent years. We consider how the different types of peer-to-peer caches - caches already available on the market and caches expected to become available in the future - can possibly affect the amount of inter-ISP traffic. We develop a fluid model that captures the effects of the caches on the system dynamics of peer-to-peer networks, and show that caches can have adverse effects on the system dynamics depending on the system parameters. We combine the fluid model with a simple model of inter-ISP traffic and show that the impact of caches cannot be accurately assessed without considering the effects of the caches on the system dynamics. We identify scenarios when caching actually leads to increased transit traffic. Our analytical results are supported by extensive simulations and experiments with real BitTorrent clients.

  @inproceedings{info3-inproceedings-2010-387, abstract = {Peer-to-peer file-sharing systems are responsible for a significant share of the traffic between Internet service providers (ISPs) in the Internet. In order to decrease their peer-to-peer related transit traffic costs, many ISPs have deployed caches for peer-to-peer traffic in recent years. We consider how the different types of peer-to-peer caches - caches already available on the market and caches expected to become available in the future - can possibly affect the amount of inter-ISP traffic. We develop a fluid model that captures the effects of the caches on the system dynamics of peer-to-peer networks, and show that caches can have adverse effects on the system dynamics depending on the system parameters. We combine the fluid model with a simple model of inter-ISP traffic and show that the impact of caches cannot be accurately assessed without considering the effects of the caches on the system dynamics. We identify scenarios when caching actually leads to increased transit traffic. Our analytical results are supported by extensive simulations and experiments with real BitTorrent clients.}, address = {Best Paper Award, Delft, the Netherlands}, author = {Lehrieder, Frank and Dán, György and Hoßfeld, Tobias and Oechsner, Simon and Singeorzan, Vlad}, booktitle = {10th IEEE International Conference on Peer-to-Peer Computing 2010 - IEEE P2P 2010}, keywords = {ispeer}, month = 8, title = {The Impact of Caching on BitTorrent-like Peer-to-peer Systems}, year = 2010 }

  %0 Conference Paper %1 info3-inproceedings-2010-387 %A Lehrieder, Frank %A Dán, György %A Hoßfeld, Tobias %A Oechsner, Simon %A Singeorzan, Vlad %B 10th IEEE International Conference on Peer-to-Peer Computing 2010 - IEEE P2P 2010 %C Best Paper Award, Delft, the Netherlands %D 2010 %T The Impact of Caching on BitTorrent-like Peer-to-peer Systems %X Peer-to-peer file-sharing systems are responsible for a significant share of the traffic between Internet service providers (ISPs) in the Internet. In order to decrease their peer-to-peer related transit traffic costs, many ISPs have deployed caches for peer-to-peer traffic in recent years. We consider how the different types of peer-to-peer caches - caches already available on the market and caches expected to become available in the future - can possibly affect the amount of inter-ISP traffic. We develop a fluid model that captures the effects of the caches on the system dynamics of peer-to-peer networks, and show that caches can have adverse effects on the system dynamics depending on the system parameters. We combine the fluid model with a simple model of inter-ISP traffic and show that the impact of caches cannot be accurately assessed without considering the effects of the caches on the system dynamics. We identify scenarios when caching actually leads to increased transit traffic. Our analytical results are supported by extensive simulations and experiments with real BitTorrent clients.
• A QoE-Aware P2P Streaming System based on Scalable Video Coding Abboud, Osama; Zinner, Thomas; Pussep, Konstantin; Oechsner, Simon; Steinmetz, Ralf; Tran-Gia, Phuoc in 10th IEEE International Conference on Peer-to-Peer Computing 2010 - IEEE P2P 2010 (2010).
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @inproceedings{info3-inproceedings-2010-392, address = {Delft, Netherlands}, author = {Abboud, Osama and Zinner, Thomas and Pussep, Konstantin and Oechsner, Simon and Steinmetz, Ralf and Tran-Gia, Phuoc}, booktitle = {10th IEEE International Conference on Peer-to-Peer Computing 2010 - IEEE P2P 2010}, keywords = {sys:hidden:inproceedings}, month = 8, title = {A QoE-Aware P2P Streaming System based on Scalable Video Coding}, year = 2010 }

  %0 Conference Paper %1 info3-inproceedings-2010-392 %A Abboud, Osama %A Zinner, Thomas %A Pussep, Konstantin %A Oechsner, Simon %A Steinmetz, Ralf %A Tran-Gia, Phuoc %B 10th IEEE International Conference on Peer-to-Peer Computing 2010 - IEEE P2P 2010 %C Delft, Netherlands %D 2010 %T A QoE-Aware P2P Streaming System based on Scalable Video Coding
• Performance Evaluation of P2P Caches: Flash-Crowd Case Chołda, Piotr; Domzał, Jerzy; Wojcik, Robert; Stankiewicz, Rafał; Lehrieder, Frank; Hoßfeld, Tobias; Oechsner, Simon; Singeorzan, Vlad in Australasian Telecommunication Networks and Applications Conference (ATNAC) 2010 (2010).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Peer-to-peer (P2P) based content distribution networks (CDNs), e.g., BitTorrent, are widely used in the today’s Internet. Since all peers interested in a specific content provide storage and upload capacity those CDNs facilitate a cheap and easy distribution of large amounts of data. However, they generate a lot of costs for Internet Service Providers (ISPs) as normal users also act as a source for downloads. One option for ISPs to encounter the problem of the costly inter-domain traffic is to establish P2P caches. In this study we investigate the potential of those caches in flash-crowd scenarios, i.e., when a large number of peers tries to download the content at the same time. To that end, we perform simulations as well as experiments with real BitTorrent clients. The evaluation shows that ISPs as well as P2P users will benefit from the use of caches.

  @inproceedings{info3-inproceedings-2010-395, abstract = {Peer-to-peer (P2P) based content distribution networks (CDNs), e.g., BitTorrent, are widely used in the today’s Internet. Since all peers interested in a specific content provide storage and upload capacity those CDNs facilitate a cheap and easy distribution of large amounts of data. However, they generate a lot of costs for Internet Service Providers (ISPs) as normal users also act as a source for downloads. One option for ISPs to encounter the problem of the costly inter-domain traffic is to establish P2P caches. In this study we investigate the potential of those caches in flash-crowd scenarios, i.e., when a large number of peers tries to download the content at the same time. To that end, we perform simulations as well as experiments with real BitTorrent clients. The evaluation shows that ISPs as well as P2P users will benefit from the use of caches.}, address = {Auckland, New Zealand}, author = {Chołda, Piotr and Domzał, Jerzy and Wojcik, Robert and Stankiewicz, Rafał and Lehrieder, Frank and Hoßfeld, Tobias and Oechsner, Simon and Singeorzan, Vlad}, booktitle = {Australasian Telecommunication Networks and Applications Conference (ATNAC) 2010}, keywords = {sys:hidden:inproceedings}, month = 11, title = {Performance Evaluation of P2P Caches: Flash-Crowd Case}, year = 2010 }

  %0 Conference Paper %1 info3-inproceedings-2010-395 %A Chołda, Piotr %A Domzał, Jerzy %A Wojcik, Robert %A Stankiewicz, Rafał %A Lehrieder, Frank %A Hoßfeld, Tobias %A Oechsner, Simon %A Singeorzan, Vlad %B Australasian Telecommunication Networks and Applications Conference (ATNAC) 2010 %C Auckland, New Zealand %D 2010 %T Performance Evaluation of P2P Caches: Flash-Crowd Case %X Peer-to-peer (P2P) based content distribution networks (CDNs), e.g., BitTorrent, are widely used in the today’s Internet. Since all peers interested in a specific content provide storage and upload capacity those CDNs facilitate a cheap and easy distribution of large amounts of data. However, they generate a lot of costs for Internet Service Providers (ISPs) as normal users also act as a source for downloads. One option for ISPs to encounter the problem of the costly inter-domain traffic is to establish P2P caches. In this study we investigate the potential of those caches in flash-crowd scenarios, i.e., when a large number of peers tries to download the content at the same time. To that end, we perform simulations as well as experiments with real BitTorrent clients. The evaluation shows that ISPs as well as P2P users will benefit from the use of caches.
• Performance Challenges and Optimization Potential of Current P2P Overlay Technologies Oechsner, Simon; Hoßfeld, Tobias (2010).
  • [ BibTeX ]
  • [ EndNote ]
  @misc{info3-tutorial-2010-14, address = {Warsaw, Poland}, author = {Oechsner, Simon and Hoßfeld, Tobias}, booktitle = {14th International Telecommunications Network Strategy and Planning Symposium, NETWORKS 2010}, keywords = {sys:hidden:tutorial}, title = {Performance Challenges and Optimization Potential of Current P2P Overlay Technologies}, year = 2010 }

  %0 Generic %1 info3-tutorial-2010-14 %A Oechsner, Simon %A Hoßfeld, Tobias %B 14th International Telecommunications Network Strategy and Planning Symposium, NETWORKS 2010 %C Warsaw, Poland %D 2010 %T Performance Challenges and Optimization Potential of Current P2P Overlay Technologies
• BGP-based Locality Promotion for P2P Applications Racz, Peter; Oechsner, Simon; Lehrieder, Frank in International Conference on Computer Communication Networks (ICCCN) 2010 (2010).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  P2P applications attract a lot of users and generate the dominant portion of the overall traffic in the Internet today. On the one hand, this large amount of traffic results in high operational costs for ISPs, mainly because of expensive interdomain connections. On the other hand, the performance of P2P applications is constricted by suboptimal peer selection or by bandwidth limitations of ISPs. To overcome these problems, the collaboration of P2P applications and ISPs is desirable, where locality promotion is one of the possible approaches. In this paper, we propose a locality promotion mechanism based on BGP routing information of an ISP and show by simulations that it can reduce inter-domain traffic, prefers shorter connections and peering links over transit links while P2P applications can achieve a better performance as well.

  @inproceedings{info3-inproceedings-2010-377, abstract = {P2P applications attract a lot of users and generate the dominant portion of the overall traffic in the Internet today. On the one hand, this large amount of traffic results in high operational costs for ISPs, mainly because of expensive interdomain connections. On the other hand, the performance of P2P applications is constricted by suboptimal peer selection or by bandwidth limitations of ISPs. To overcome these problems, the collaboration of P2P applications and ISPs is desirable, where locality promotion is one of the possible approaches. In this paper, we propose a locality promotion mechanism based on BGP routing information of an ISP and show by simulations that it can reduce inter-domain traffic, prefers shorter connections and peering links over transit links while P2P applications can achieve a better performance as well.}, address = {Zurich, Switzerland}, author = {Racz, Peter and Oechsner, Simon and Lehrieder, Frank}, booktitle = {International Conference on Computer Communication Networks (ICCCN) 2010}, keywords = {sys:hidden:inproceedings}, month = 8, title = {BGP-based Locality Promotion for P2P Applications}, year = 2010 }

  %0 Conference Paper %1 info3-inproceedings-2010-377 %A Racz, Peter %A Oechsner, Simon %A Lehrieder, Frank %B International Conference on Computer Communication Networks (ICCCN) 2010 %C Zurich, Switzerland %D 2010 %T BGP-based Locality Promotion for P2P Applications %X P2P applications attract a lot of users and generate the dominant portion of the overall traffic in the Internet today. On the one hand, this large amount of traffic results in high operational costs for ISPs, mainly because of expensive interdomain connections. On the other hand, the performance of P2P applications is constricted by suboptimal peer selection or by bandwidth limitations of ISPs. To overcome these problems, the collaboration of P2P applications and ISPs is desirable, where locality promotion is one of the possible approaches. In this paper, we propose a locality promotion mechanism based on BGP routing information of an ISP and show by simulations that it can reduce inter-domain traffic, prefers shorter connections and peering links over transit links while P2P applications can achieve a better performance as well.
• Interaction Patterns between P2P Content Distribution Systems and ISPs Dán, György; Stamoulis, George D.; Hoßfeld, Tobias; Oechsner, Simon; Cholda, Piotr; Stankiewicz, Rafal; Papafili, Ioanna in to be published in IEEE Communications Magazine (2010).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Peer-to-peer (P2P) content distribution systems are a major source of traffic in the Internet, but the application layer protocols they use are mostly unaware of the underlying network in accordance with the layered structure of the Internet’s protocol stack. Nevertheless, the need for improved network efficiency and the business interests of Internet service providers (ISPs) are both strong drivers towards a cross-layer approach in peer-to-peer protocol design, calling for P2P systems that would in some way interact with the ISPs. Recent research shows that the interaction, which can rely on information provided by both parties, can be mutually beneficial. In this paper first we give an overview of the kinds of information that could potentially be exchanged between the P2P systems and the ISPs, and discuss their usefulness and the ease of obtaining and exchanging them. We also present a classification of the possible approaches for interaction based on the level of involvement of the ISPs and the P2P systems, and we discuss the potential strengths and the weaknesses of these approaches.

  @article{info3-article-2010-78, abstract = {Peer-to-peer (P2P) content distribution systems are a major source of traffic in the Internet, but the application layer protocols they use are mostly unaware of the underlying network in accordance with the layered structure of the Internet’s protocol stack. Nevertheless, the need for improved network efficiency and the business interests of Internet service providers (ISPs) are both strong drivers towards a cross-layer approach in peer-to-peer protocol design, calling for P2P systems that would in some way interact with the ISPs. Recent research shows that the interaction, which can rely on information provided by both parties, can be mutually beneficial. In this paper first we give an overview of the kinds of information that could potentially be exchanged between the P2P systems and the ISPs, and discuss their usefulness and the ease of obtaining and exchanging them. We also present a classification of the possible approaches for interaction based on the level of involvement of the ISPs and the P2P systems, and we discuss the potential strengths and the weaknesses of these approaches.}, author = {Dán, György and Stamoulis, George D. and Hoßfeld, Tobias and Oechsner, Simon and Cholda, Piotr and Stankiewicz, Rafal and Papafili, Ioanna}, journal = {to be published in IEEE Communications Magazine}, keywords = {ispeer}, title = {Interaction Patterns between P2P Content Distribution Systems and ISPs}, year = 2010 }

  %0 Journal Article %1 info3-article-2010-78 %A Dán, György %A Stamoulis, George D. %A Hoßfeld, Tobias %A Oechsner, Simon %A Cholda, Piotr %A Stankiewicz, Rafal %A Papafili, Ioanna %D 2010 %J to be published in IEEE Communications Magazine %T Interaction Patterns between P2P Content Distribution Systems and ISPs %X Peer-to-peer (P2P) content distribution systems are a major source of traffic in the Internet, but the application layer protocols they use are mostly unaware of the underlying network in accordance with the layered structure of the Internet’s protocol stack. Nevertheless, the need for improved network efficiency and the business interests of Internet service providers (ISPs) are both strong drivers towards a cross-layer approach in peer-to-peer protocol design, calling for P2P systems that would in some way interact with the ISPs. Recent research shows that the interaction, which can rely on information provided by both parties, can be mutually beneficial. In this paper first we give an overview of the kinds of information that could potentially be exchanged between the P2P systems and the ISPs, and discuss their usefulness and the ease of obtaining and exchanging them. We also present a classification of the possible approaches for interaction based on the level of involvement of the ISPs and the P2P systems, and we discuss the potential strengths and the weaknesses of these approaches.
• Performance Challenges and Optimization Potential of Peer-to-Peer Overlay Technologies Oechsner, Simon (2010, July).
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @phdthesis{info3-dissertation-2010-26, author = {Oechsner, Simon}, keywords = {sys:hidden:dissertation}, month = 7, title = {Performance Challenges and Optimization Potential of Peer-to-Peer Overlay Technologies}, year = 2010 }

  %0 Thesis %1 info3-dissertation-2010-26 %A Oechsner, Simon %D 2010 %T Performance Challenges and Optimization Potential of Peer-to-Peer Overlay Technologies
• Self-organizing QoE and Bandwidth Control in P2P VoD Streaming Oechsner, Simon (2010, June 9).
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2010-376, address = {5th GI/ITG KuVS Workshop on „Future Internet“}, author = {Oechsner, Simon}, keywords = {sys:hidden:presentation}, month = 6, title = {Self-organizing QoE and Bandwidth Control in P2P VoD Streaming}, year = 2010 }

  %0 Generic %1 info3-talk-2010-376 %A Oechsner, Simon %C 5th GI/ITG KuVS Workshop on „Future Internet“ %D 2010 %T Self-organizing QoE and Bandwidth Control in P2P VoD Streaming

• An Economic Traffic Management Approach to Enable the TripleWin for Users, ISPs, and Overlay Providers Hoßfeld, Tobias; Hausheer, David; Hecht, Fabio; Lehrieder, Frank; Oechsner, Simon; Papafili, Ioanna; Racz, Peter; Soursos, Sergios; Staehle, Dirk; Stamoulis, George D.; Tran-Gia, Phuoc; Stiller, Burkhard in FIA Prague Book, ISBN 978-1-60750-007-0, G. Tselentis, J. Domingue, A. Galis, A. Gavras, D. Hausheer, S. Krco, V. Lotz, T. Zahariadis (eds.) (2009).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  Socio-economic aspects play an increasingly important role in the Future Internet. To enable a TripleWin situation for the involved players, i.e. the end users, the ISPs and telecommunication operators, and the service providers, a new, incentive-based concept is proposed referred to as Economic Traffic Management (ETM). It aims at reducing costs within the network while improving the Quality-of-Experience (QoE) for end users. In particular, peer-to-peer (P2P) overlay applications generate a large amount of costs due to inter-domain traffic. ETM solution approaches have to take into account (a) the traffic patterns stemming from the overlay application, (b) the charging models for transit traffic, and (c) the applicability and efficiency of the proposed solution. The complex interaction between these three components and its consequences is demonstrated on selected examples. As a result it is shown that different ETM approaches have to be combined for an overall solution. To this end, the paper derives functional and non-functional requirements for designing ETM and provides a suitable architecture enabling the implementation of a TripleWin solution.

  @incollection{info3-incollection-2009-12, abstract = {Socio-economic aspects play an increasingly important role in the Future Internet. To enable a TripleWin situation for the involved players, i.e. the end users, the ISPs and telecommunication operators, and the service providers, a new, incentive-based concept is proposed referred to as Economic Traffic Management (ETM). It aims at reducing costs within the network while improving the Quality-of-Experience (QoE) for end users. In particular, peer-to-peer (P2P) overlay applications generate a large amount of costs due to inter-domain traffic. ETM solution approaches have to take into account (a) the traffic patterns stemming from the overlay application, (b) the charging models for transit traffic, and (c) the applicability and efficiency of the proposed solution. The complex interaction between these three components and its consequences is demonstrated on selected examples. As a result it is shown that different ETM approaches have to be combined for an overall solution. To this end, the paper derives functional and non-functional requirements for designing ETM and provides a suitable architecture enabling the implementation of a TripleWin solution.}, author = {Hoßfeld, Tobias and Hausheer, David and Hecht, Fabio and Lehrieder, Frank and Oechsner, Simon and Papafili, Ioanna and Racz, Peter and Soursos, Sergios and Staehle, Dirk and Stamoulis, George D. and Tran-Gia, Phuoc and Stiller, Burkhard}, booktitle = {FIA Prague Book, ISBN 978-1-60750-007-0}, editor = {Tselentis, Georgios and Domingue, John and Galis, Alex and Gavras, Anastasius and Hausheer, David and Krco, Srdjan and Lotz, Volkmar and Zahariadis, Theodore}, keywords = {myown}, month = 5, publisher = {IOS Press Books Online}, title = {An Economic Traffic Management Approach to Enable the TripleWin for Users, ISPs, and Overlay Providers}, year = 2009 }

  %0 Book Section %1 info3-incollection-2009-12 %A Hoßfeld, Tobias %A Hausheer, David %A Hecht, Fabio %A Lehrieder, Frank %A Oechsner, Simon %A Papafili, Ioanna %A Racz, Peter %A Soursos, Sergios %A Staehle, Dirk %A Stamoulis, George D. %A Tran-Gia, Phuoc %A Stiller, Burkhard %B FIA Prague Book, ISBN 978-1-60750-007-0 %D 2009 %E Tselentis, Georgios %E Domingue, John %E Galis, Alex %E Gavras, Anastasius %E Hausheer, David %E Krco, Srdjan %E Lotz, Volkmar %E Zahariadis, Theodore %I IOS Press Books Online %T An Economic Traffic Management Approach to Enable the TripleWin for Users, ISPs, and Overlay Providers %X Socio-economic aspects play an increasingly important role in the Future Internet. To enable a TripleWin situation for the involved players, i.e. the end users, the ISPs and telecommunication operators, and the service providers, a new, incentive-based concept is proposed referred to as Economic Traffic Management (ETM). It aims at reducing costs within the network while improving the Quality-of-Experience (QoE) for end users. In particular, peer-to-peer (P2P) overlay applications generate a large amount of costs due to inter-domain traffic. ETM solution approaches have to take into account (a) the traffic patterns stemming from the overlay application, (b) the charging models for transit traffic, and (c) the applicability and efficiency of the proposed solution. The complex interaction between these three components and its consequences is demonstrated on selected examples. As a result it is shown that different ETM approaches have to be combined for an overall solution. To this end, the paper derives functional and non-functional requirements for designing ETM and provides a suitable architecture enabling the implementation of a TripleWin solution.
• Performance Evaluation of a Distributed Lookup System for a Virtual Database Server Oechsner, Simon (2009, May 20).
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2009-357, address = {20th ITC Specialist Seminar, Hoi An, Vietnam}, author = {Oechsner, Simon}, keywords = {sys:hidden:presentation}, month = 5, title = {Performance Evaluation of a Distributed Lookup System for a Virtual Database Server}, year = 2009 }

  %0 Generic %1 info3-talk-2009-357 %A Oechsner, Simon %C 20th ITC Specialist Seminar, Hoi An, Vietnam %D 2009 %T Performance Evaluation of a Distributed Lookup System for a Virtual Database Server
• Wissenschaftliche Ergebnisse aus der Kooperation DATEVasp Oechsner, Simon (2009, July 30).
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2009-358, address = {DATEV Trendscout, Nürnberg}, author = {Oechsner, Simon}, keywords = {sys:hidden:presentation}, month = 7, title = {Wissenschaftliche Ergebnisse aus der Kooperation DATEVasp}, year = 2009 }

  %0 Generic %1 info3-talk-2009-358 %A Oechsner, Simon %C DATEV Trendscout, Nürnberg %D 2009 %T Wissenschaftliche Ergebnisse aus der Kooperation DATEVasp
• Impact of Self-Organization in P2P Overlays on Underlay Utilization Pussep, Konstantin; Oechsner, Simon; Abboud, Osama; Kantor, Miroslaw; Stiller, Burkhard in The Fourth International Conference on Internet and Web Applications and Services (2009).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Peer-to-Peer (P2P) systems gained popularity and are responsible for a large share of today’s Internet traffic. Nevertheless, their dynamic nature and the intended lack of control through central instances make their behavior unpredictable and, therefore, it is difficult to achieve a high level of Quality-of-Service for P2P traffic. Thus, peers are themselves responsible for dealing with these issues by applying so-called self-organization mechanisms to deal with their heterogeneity, unpredictable behavior, and asymmetric resources. This paper discusses and classifies relevant self-organizing aspects of P2P systems, including metrics and mechanisms. Hereby, the key focus is in better understanding on how such self-organizing mechanisms - originally designed to improve the performance of P2P overlays - affect the underlying Internet infrastructure.

  @inproceedings{info3-inproceedings-2009-340, abstract = {Peer-to-Peer (P2P) systems gained popularity and are responsible for a large share of today’s Internet traffic. Nevertheless, their dynamic nature and the intended lack of control through central instances make their behavior unpredictable and, therefore, it is difficult to achieve a high level of Quality-of-Service for P2P traffic. Thus, peers are themselves responsible for dealing with these issues by applying so-called self-organization mechanisms to deal with their heterogeneity, unpredictable behavior, and asymmetric resources. This paper discusses and classifies relevant self-organizing aspects of P2P systems, including metrics and mechanisms. Hereby, the key focus is in better understanding on how such self-organizing mechanisms - originally designed to improve the performance of P2P overlays - affect the underlying Internet infrastructure.}, address = {Venice, Italy}, author = {Pussep, Konstantin and Oechsner, Simon and Abboud, Osama and Kantor, Miroslaw and Stiller, Burkhard}, booktitle = {The Fourth International Conference on Internet and Web Applications and Services}, keywords = {sys:hidden:inproceedings}, month = 5, title = {Impact of Self-Organization in P2P Overlays on Underlay Utilization}, year = 2009 }

  %0 Conference Paper %1 info3-inproceedings-2009-340 %A Pussep, Konstantin %A Oechsner, Simon %A Abboud, Osama %A Kantor, Miroslaw %A Stiller, Burkhard %B The Fourth International Conference on Internet and Web Applications and Services %C Venice, Italy %D 2009 %T Impact of Self-Organization in P2P Overlays on Underlay Utilization %X Peer-to-Peer (P2P) systems gained popularity and are responsible for a large share of today’s Internet traffic. Nevertheless, their dynamic nature and the intended lack of control through central instances make their behavior unpredictable and, therefore, it is difficult to achieve a high level of Quality-of-Service for P2P traffic. Thus, peers are themselves responsible for dealing with these issues by applying so-called self-organization mechanisms to deal with their heterogeneity, unpredictable behavior, and asymmetric resources. This paper discusses and classifies relevant self-organizing aspects of P2P systems, including metrics and mechanisms. Hereby, the key focus is in better understanding on how such self-organizing mechanisms - originally designed to improve the performance of P2P overlays - affect the underlying Internet infrastructure.
• On the Unfair Channel Access Phenomenon in Wireless LANs Pries, Rastin; Staehle, Dirk; Oechsner, Simon; Menth, Michael; Menth, Stefan; Tran-Gia, Phuoc in 21st International Teletraffic Congress (ITC 21) (2009).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  This paper shows that the relative collision probability for packets in Wireless LAN 802.11 networks decreases with increasing load offered by the respective station. This denotes a clearly unfair channel access which is important to be aware of, e.g., when collision probabilities are measured and used for reactive control of contention windows. We model the unfair channel access phenomenon analytically and semi-analytically for bidirectional constant bit rate and unidirectional TCP traffic and compare the results with those from simulations.

  @inproceedings{info3-inproceedings-2009-352, abstract = {This paper shows that the relative collision probability for packets in Wireless LAN 802.11 networks decreases with increasing load offered by the respective station. This denotes a clearly unfair channel access which is important to be aware of, e.g., when collision probabilities are measured and used for reactive control of contention windows. We model the unfair channel access phenomenon analytically and semi-analytically for bidirectional constant bit rate and unidirectional TCP traffic and compare the results with those from simulations.}, address = {Paris, France}, author = {Pries, Rastin and Staehle, Dirk and Oechsner, Simon and Menth, Michael and Menth, Stefan and Tran-Gia, Phuoc}, booktitle = {21st International Teletraffic Congress (ITC 21)}, keywords = {sys:hidden:inproceedings}, month = 9, title = {On the Unfair Channel Access Phenomenon in Wireless LANs}, year = 2009 }

  %0 Conference Paper %1 info3-inproceedings-2009-352 %A Pries, Rastin %A Staehle, Dirk %A Oechsner, Simon %A Menth, Michael %A Menth, Stefan %A Tran-Gia, Phuoc %B 21st International Teletraffic Congress (ITC 21) %C Paris, France %D 2009 %T On the Unfair Channel Access Phenomenon in Wireless LANs %X This paper shows that the relative collision probability for packets in Wireless LAN 802.11 networks decreases with increasing load offered by the respective station. This denotes a clearly unfair channel access which is important to be aware of, e.g., when collision probabilities are measured and used for reactive control of contention windows. We model the unfair channel access phenomenon analytically and semi-analytically for bidirectional constant bit rate and unidirectional TCP traffic and compare the results with those from simulations.
• Pushing the Performance of Biased Neighbor Selection through Biased Unchoking Oechsner, Simon; Lehrieder, Frank; Hoßfeld, Tobias; Metzger, Florian; Pussep, Konstantin; Staehle, Dirk in 9th International Conference on Peer-to-Peer Computing (2009).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Locality promotion in P2P content distribution networks is currently a major research topic. One of the goals of all discussed approaches is to reduce the interdomain traffic that causes high costs for ISPs. However, the focus of the work in this field is generally on the type of locality information that is provided to the overlay and on the entities that exchange this information. An aspect that is generally neglected is how this information is used by the peers. In this paper, we consider the predominant approach of Biased Neighbor Selection and compare it with Biased Unchoking, an alternative locality aware peer selection strategy we propose in this paper. We show that both mechanisms complement each other for the BitTorrent file sharing application and achieve the best performance when combined.

  @inproceedings{info3-inproceedings-2009-355, abstract = {Locality promotion in P2P content distribution networks is currently a major research topic. One of the goals of all discussed approaches is to reduce the interdomain traffic that causes high costs for ISPs. However, the focus of the work in this field is generally on the type of locality information that is provided to the overlay and on the entities that exchange this information. An aspect that is generally neglected is how this information is used by the peers. In this paper, we consider the predominant approach of Biased Neighbor Selection and compare it with Biased Unchoking, an alternative locality aware peer selection strategy we propose in this paper. We show that both mechanisms complement each other for the BitTorrent file sharing application and achieve the best performance when combined.}, address = {Seattle, USA}, author = {Oechsner, Simon and Lehrieder, Frank and Hoßfeld, Tobias and Metzger, Florian and Pussep, Konstantin and Staehle, Dirk}, booktitle = {9th International Conference on Peer-to-Peer Computing}, keywords = {sys:hidden:inproceedings}, month = 9, title = {Pushing the Performance of Biased Neighbor Selection through Biased Unchoking}, year = 2009 }

  %0 Conference Paper %1 info3-inproceedings-2009-355 %A Oechsner, Simon %A Lehrieder, Frank %A Hoßfeld, Tobias %A Metzger, Florian %A Pussep, Konstantin %A Staehle, Dirk %B 9th International Conference on Peer-to-Peer Computing %C Seattle, USA %D 2009 %T Pushing the Performance of Biased Neighbor Selection through Biased Unchoking %X Locality promotion in P2P content distribution networks is currently a major research topic. One of the goals of all discussed approaches is to reduce the interdomain traffic that causes high costs for ISPs. However, the focus of the work in this field is generally on the type of locality information that is provided to the overlay and on the entities that exchange this information. An aspect that is generally neglected is how this information is used by the peers. In this paper, we consider the predominant approach of Biased Neighbor Selection and compare it with Biased Unchoking, an alternative locality aware peer selection strategy we propose in this paper. We show that both mechanisms complement each other for the BitTorrent file sharing application and achieve the best performance when combined.
• Performance Evaluation of a Distributed Lookup System for a Virtual Database Server Oechsner, Simon; Hoßfeld, Tobias; Tran-Gia, Phuoc in 20th ITC Specialist Seminar (2009).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Services offered today rely on large amounts of data that can be accessed fast and reliably. One technical solution providing both acceptable speed and high reliability are distributed databases, which can be accessed from an application as one virtual database server. The virtualization here hides complexity introduced by distributing the service to a set of machines. In this paper, we will present a DHT-based architecture implementing a lookup layer for such a database, which preserves important features such as self-organization from its DHT roots, but still offers a good performance for time-critical applications. Additionally, first anaytical results are given, which show some of the basic mechanisms at work in such systems.

  @inproceedings{info3-inproceedings-2009-344, abstract = {Services offered today rely on large amounts of data that can be accessed fast and reliably. One technical solution providing both acceptable speed and high reliability are distributed databases, which can be accessed from an application as one virtual database server. The virtualization here hides complexity introduced by distributing the service to a set of machines. In this paper, we will present a DHT-based architecture implementing a lookup layer for such a database, which preserves important features such as self-organization from its DHT roots, but still offers a good performance for time-critical applications. Additionally, first anaytical results are given, which show some of the basic mechanisms at work in such systems.}, address = {Hoi An, Vietnam}, author = {Oechsner, Simon and Hoßfeld, Tobias and Tran-Gia, Phuoc}, booktitle = {20th ITC Specialist Seminar}, keywords = {sys:hidden:inproceedings}, month = 5, title = {Performance Evaluation of a Distributed Lookup System for a Virtual Database Server}, year = 2009 }

  %0 Conference Paper %1 info3-inproceedings-2009-344 %A Oechsner, Simon %A Hoßfeld, Tobias %A Tran-Gia, Phuoc %B 20th ITC Specialist Seminar %C Hoi An, Vietnam %D 2009 %T Performance Evaluation of a Distributed Lookup System for a Virtual Database Server %X Services offered today rely on large amounts of data that can be accessed fast and reliably. One technical solution providing both acceptable speed and high reliability are distributed databases, which can be accessed from an application as one virtual database server. The virtualization here hides complexity introduced by distributing the service to a set of machines. In this paper, we will present a DHT-based architecture implementing a lookup layer for such a database, which preserves important features such as self-organization from its DHT roots, but still offers a good performance for time-critical applications. Additionally, first anaytical results are given, which show some of the basic mechanisms at work in such systems.
• Measurement of BitTorrent Swarms and their AS Topologies Hoßfeld, Tobias; Hock, David; Oechsner, Simon; Lehrieder, Frank; Despotovic, Zoran; Kellerer, Wolfgang; Michel, Maximilian (2009).
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @techreport{info3-techreport-2009-246, author = {Hoßfeld, Tobias and Hock, David and Oechsner, Simon and Lehrieder, Frank and Despotovic, Zoran and Kellerer, Wolfgang and Michel, Maximilian}, institution = {University of Wuerzburg}, keywords = {sys:hidden:techreport}, month = 11, number = 464, title = {Measurement of BitTorrent Swarms and their AS Topologies}, year = 2009 }

  %0 Report %1 info3-techreport-2009-246 %A Hoßfeld, Tobias %A Hock, David %A Oechsner, Simon %A Lehrieder, Frank %A Despotovic, Zoran %A Kellerer, Wolfgang %A Michel, Maximilian %D 2009 %N 464 %T Measurement of BitTorrent Swarms and their AS Topologies
• Pushing the Performance of Biased Neighbor Selection through Biased Unchoking Oechsner, Simon; Lehrieder, Frank; Hoßfeld, Tobias; Metzger, Florian; Pussep, Konstantin; Staehle, Dirk (2009).
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @techreport{info3-techreport-2009-245, author = {Oechsner, Simon and Lehrieder, Frank and Hoßfeld, Tobias and Metzger, Florian and Pussep, Konstantin and Staehle, Dirk}, institution = {University of Wuerzburg}, keywords = {sys:hidden:techreport}, month = 8, number = 459, title = {Pushing the Performance of Biased Neighbor Selection through Biased Unchoking}, year = 2009 }

  %0 Report %1 info3-techreport-2009-245 %A Oechsner, Simon %A Lehrieder, Frank %A Hoßfeld, Tobias %A Metzger, Florian %A Pussep, Konstantin %A Staehle, Dirk %D 2009 %N 459 %T Pushing the Performance of Biased Neighbor Selection through Biased Unchoking
• An Analytical Model for the Evaluation of the Information Processing in Multi-Probe Networks Zinner, Thomas; Staehle, Dirk; Oechsner, Simon; Tran-Gia, Phuoc; Tutschku, Kurt (2009).
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @techreport{info3-techreport-2009-244, author = {Zinner, Thomas and Staehle, Dirk and Oechsner, Simon and Tran-Gia, Phuoc and Tutschku, Kurt}, institution = {University of Wuerzburg}, keywords = {sys:hidden:techreport}, month = 3, number = 456, title = {An Analytical Model for the Evaluation of the Information Processing in Multi-Probe Networks}, year = 2009 }

  %0 Report %1 info3-techreport-2009-244 %A Zinner, Thomas %A Staehle, Dirk %A Oechsner, Simon %A Tran-Gia, Phuoc %A Tutschku, Kurt %D 2009 %N 456 %T An Analytical Model for the Evaluation of the Information Processing in Multi-Probe Networks

• On the Trade-off between Efficiency and Congestion in Location-aware Overlay Networks - Example of a Vertical Handover Support System Zinner, Thomas; Hoßfeld, Tobias; Oechsner, Simon; Tran-Gia, Phuoc in Eighth International Conference on Peer-to-Peer Computing (P2P 2008) (2008).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Introducing location-awareness in overlay networks allows for a higher efficiency of the offered services, e.g., shorter search times or higher throughput. This is especially important for business applications supported by overlays. In this paper, we will illustrate how such an increase in efficiency causes congestion in an otherwise well-dimensioned locality-aware overlay using a Distributed Hash Table (DHT). In particular, we will use a Vertical Handover (VHO) support system using a Pastry substrate as an example. We will describe the occuring congestion problem and identify the underlying reasons. Thus, we describe the basic trade-off between efficiency and load-inequality. Furthermore, we introduce a solution for the specific issue observed, and conduct a performance evaluation identifying the major influence factors and optimization potential for future work.

  @inproceedings{info3-inproceedings-2008-323, abstract = {Introducing location-awareness in overlay networks allows for a higher efficiency of the offered services, e.g., shorter search times or higher throughput. This is especially important for business applications supported by overlays. In this paper, we will illustrate how such an increase in efficiency causes congestion in an otherwise well-dimensioned locality-aware overlay using a Distributed Hash Table (DHT). In particular, we will use a Vertical Handover (VHO) support system using a Pastry substrate as an example. We will describe the occuring congestion problem and identify the underlying reasons. Thus, we describe the basic trade-off between efficiency and load-inequality. Furthermore, we introduce a solution for the specific issue observed, and conduct a performance evaluation identifying the major influence factors and optimization potential for future work.}, address = {Aachen, Germany}, author = {Zinner, Thomas and Hoßfeld, Tobias and Oechsner, Simon and Tran-Gia, Phuoc}, booktitle = {Eighth International Conference on Peer-to-Peer Computing (P2P 2008)}, keywords = {sys:hidden:inproceedings}, month = 9, title = {On the Trade-off between Efficiency and Congestion in Location-aware Overlay Networks - Example of a Vertical Handover Support System}, year = 2008 }

  %0 Conference Paper %1 info3-inproceedings-2008-323 %A Zinner, Thomas %A Hoßfeld, Tobias %A Oechsner, Simon %A Tran-Gia, Phuoc %B Eighth International Conference on Peer-to-Peer Computing (P2P 2008) %C Aachen, Germany %D 2008 %T On the Trade-off between Efficiency and Congestion in Location-aware Overlay Networks - Example of a Vertical Handover Support System %X Introducing location-awareness in overlay networks allows for a higher efficiency of the offered services, e.g., shorter search times or higher throughput. This is especially important for business applications supported by overlays. In this paper, we will illustrate how such an increase in efficiency causes congestion in an otherwise well-dimensioned locality-aware overlay using a Distributed Hash Table (DHT). In particular, we will use a Vertical Handover (VHO) support system using a Pastry substrate as an example. We will describe the occuring congestion problem and identify the underlying reasons. Thus, we describe the basic trade-off between efficiency and load-inequality. Furthermore, we introduce a solution for the specific issue observed, and conduct a performance evaluation identifying the major influence factors and optimization potential for future work.
• A framework of economic traffic management employing self-organization overlay mechanisms Oechsner, Simon; Soursos, Sergios; Papafili, Ioanna; Hoßfeld, Tobias; Stamoulis, George D.; Stiller, Burkhard; Angeles Callejo, Maria; Staehle, Dirk in IWSOS’08 (2008).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Applications based on overlays have become very popular, due to the separation they provide and the improvement of perceived QoS by the end-user. Recent studies show that overlays have a significant impact on the traffic management and the expenditures of the underlying network operators. In this paper, we define a framework for Economic Traffic Management (ETM) mechanisms that optimize the traffic impact of overlay applications on ISP and telecommunication operator networks based on the interaction of network operators, overlay providers and users. We first provide a definition and an overview of Self- Organization Mechanisms (SOMs) and ETM for overlays. We then describe a basic framework for the interaction of components of SOMs and ETM, in terms of information and metrics provided, decisions made etc. Finally, we describe in detail how SOMs can be used to support ETM and we illustrate our approach and its implications by means of a specific example.

  @inproceedings{info3-inproceedings-2008-331, abstract = {Applications based on overlays have become very popular, due to the separation they provide and the improvement of perceived QoS by the end-user. Recent studies show that overlays have a significant impact on the traffic management and the expenditures of the underlying network operators. In this paper, we define a framework for Economic Traffic Management (ETM) mechanisms that optimize the traffic impact of overlay applications on ISP and telecommunication operator networks based on the interaction of network operators, overlay providers and users. We first provide a definition and an overview of Self- Organization Mechanisms (SOMs) and ETM for overlays. We then describe a basic framework for the interaction of components of SOMs and ETM, in terms of information and metrics provided, decisions made etc. Finally, we describe in detail how SOMs can be used to support ETM and we illustrate our approach and its implications by means of a specific example.}, address = {Vienna, Austria}, author = {Oechsner, Simon and Soursos, Sergios and Papafili, Ioanna and Hoßfeld, Tobias and Stamoulis, George D. and Stiller, Burkhard and Angeles Callejo, Maria and Staehle, Dirk}, booktitle = {IWSOS'08}, keywords = {sys:hidden:inproceedings}, month = 12, title = {A framework of economic traffic management employing self-organization overlay mechanisms}, year = 2008 }

  %0 Conference Paper %1 info3-inproceedings-2008-331 %A Oechsner, Simon %A Soursos, Sergios %A Papafili, Ioanna %A Hoßfeld, Tobias %A Stamoulis, George D. %A Stiller, Burkhard %A Angeles Callejo, Maria %A Staehle, Dirk %B IWSOS'08 %C Vienna, Austria %D 2008 %T A framework of economic traffic management employing self-organization overlay mechanisms %X Applications based on overlays have become very popular, due to the separation they provide and the improvement of perceived QoS by the end-user. Recent studies show that overlays have a significant impact on the traffic management and the expenditures of the underlying network operators. In this paper, we define a framework for Economic Traffic Management (ETM) mechanisms that optimize the traffic impact of overlay applications on ISP and telecommunication operator networks based on the interaction of network operators, overlay providers and users. We first provide a definition and an overview of Self- Organization Mechanisms (SOMs) and ETM for overlays. We then describe a basic framework for the interaction of components of SOMs and ETM, in terms of information and metrics provided, decisions made etc. Finally, we describe in detail how SOMs can be used to support ETM and we illustrate our approach and its implications by means of a specific example.
• Investigation of chunk selection strategies in peer-assisted video-on-demand systems Hoßfeld, Tobias; Oechsner, Simon; Lehrieder, Frank; Bergner, Christian; Tran-Gia, Phuoc (2008).
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @techreport{info3-techreport-2008-235, author = {Hoßfeld, Tobias and Oechsner, Simon and Lehrieder, Frank and Bergner, Christian and Tran-Gia, Phuoc}, institution = {University of Wuerzburg}, keywords = {sys:hidden:techreport}, month = 7, number = 446, title = {Investigation of chunk selection strategies in peer-assisted video-on-demand systems}, year = 2008 }

  %0 Report %1 info3-techreport-2008-235 %A Hoßfeld, Tobias %A Oechsner, Simon %A Lehrieder, Frank %A Bergner, Christian %A Tran-Gia, Phuoc %D 2008 %N 446 %T Investigation of chunk selection strategies in peer-assisted video-on-demand systems

• Performance Evaluation of a Reliable Content Mediation Platform in the Emerging Future Internet Oechsner, Simon; Tran-Gia, Phuoc in 20th International Teletraffic Congress (ITC20) (2007).
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @inproceedings{info3-inproceedings-2007-272, address = {Ottawa, Canada}, author = {Oechsner, Simon and Tran-Gia, Phuoc}, booktitle = {20th International Teletraffic Congress (ITC20)}, keywords = {sys:hidden:inproceedings}, month = 6, title = {Performance Evaluation of a Reliable Content Mediation Platform in the Emerging Future Internet}, year = 2007 }

  %0 Conference Paper %1 info3-inproceedings-2007-272 %A Oechsner, Simon %A Tran-Gia, Phuoc %B 20th International Teletraffic Congress (ITC20) %C Ottawa, Canada %D 2007 %T Performance Evaluation of a Reliable Content Mediation Platform in the Emerging Future Internet
• Overlay Networks and Teletraffic Issues Tran-Gia, Phuoc; Oechsner, Simon; Hoßfeld, Tobias; Binzenhöfer, Andreas (2007, June).
  • [ BibTeX ]
  • [ EndNote ]
  @misc{info3-tutorial-2007-10, address = {Ottawa, Canada}, author = {Tran-Gia, Phuoc and Oechsner, Simon and Hoßfeld, Tobias and Binzenhöfer, Andreas}, booktitle = {20th International Teletraffic Congress (ITC20)}, keywords = {sys:hidden:tutorial}, month = 6, title = {Overlay Networks and Teletraffic Issues}, year = 2007 }

  %0 Generic %1 info3-tutorial-2007-10 %A Tran-Gia, Phuoc %A Oechsner, Simon %A Hoßfeld, Tobias %A Binzenhöfer, Andreas %B 20th International Teletraffic Congress (ITC20) %C Ottawa, Canada %D 2007 %T Overlay Networks and Teletraffic Issues
• Performance Evaluation of a Reliable Content Mediation Platform in the Emerging Future Internet Oechsner, Simon; Tran-Gia, Phuoc (2007).
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @techreport{info3-techreport-2007-207, author = {Oechsner, Simon and Tran-Gia, Phuoc}, institution = {University of Wuerzburg}, keywords = {sys:hidden:techreport}, month = 4, number = 408, title = {Performance Evaluation of a Reliable Content Mediation Platform in the Emerging Future Internet}, year = 2007 }

  %0 Report %1 info3-techreport-2007-207 %A Oechsner, Simon %A Tran-Gia, Phuoc %D 2007 %N 408 %T Performance Evaluation of a Reliable Content Mediation Platform in the Emerging Future Internet
• Performance Evaluation of a Reliable Content Mediation Platform in the Emerging Future Internet Oechsner, Simon (2007, June 18).
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2007-356, address = {20th International Teletraffic Congress (ITC20), Ottawa, Canada}, author = {Oechsner, Simon}, keywords = {sys:hidden:presentation}, month = 6, title = {Performance Evaluation of a Reliable Content Mediation Platform in the Emerging Future Internet}, year = 2007 }

  %0 Generic %1 info3-talk-2007-356 %A Oechsner, Simon %C 20th International Teletraffic Congress (ITC20), Ottawa, Canada %D 2007 %T Performance Evaluation of a Reliable Content Mediation Platform in the Emerging Future Internet
• A New Perspective on the Unfair Channel Access Phenomenon in Wireless Local Area Networks Pries, Rastin; Staehle, Dirk; Oechsner, Simon; Menth, Michael; Menth, Stefan (2007).
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @techreport{info3-techreport-2007-228, author = {Pries, Rastin and Staehle, Dirk and Oechsner, Simon and Menth, Michael and Menth, Stefan}, institution = {University of Wuerzburg}, keywords = {sys:hidden:techreport}, month = 12, number = 439, title = {A New Perspective on the Unfair Channel Access Phenomenon in Wireless Local Area Networks}, year = 2007 }

  %0 Report %1 info3-techreport-2007-228 %A Pries, Rastin %A Staehle, Dirk %A Oechsner, Simon %A Menth, Michael %A Menth, Stefan %D 2007 %N 439 %T A New Perspective on the Unfair Channel Access Phenomenon in Wireless Local Area Networks

• Supporting Vertical Handover by a Self-Organizing Multi-Dimensional P2P Overlay Oechsner, Simon; Hoßfeld, Tobias; Tutschku, Kurt; Andersen, Frank-Uwe in 2006 IEEE 63rd Vehicular Technology Conference (2006).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Vertical handovers (VHO) are expected to be a key feature in Beyond 3G (B3G) networks. This paper presents a CAN-based P2P overlay network for supporting vertical handover in B3G networks. The P2P overlay is used to quickly locate attachment points (APs) for mobile entities and to retrieve rapidly the configuration and coverage information of these APs. The advantage of the P2P-based solution is its distributed nature, its scalability, and its self-organizing capability. We show by means of simulation the efficiency and the scalability of our approach in comparison to a standard CAN implementation.

  @inproceedings{info3-inproceedings-2006-214, abstract = {Vertical handovers (VHO) are expected to be a key feature in Beyond 3G (B3G) networks. This paper presents a CAN-based P2P overlay network for supporting vertical handover in B3G networks. The P2P overlay is used to quickly locate attachment points (APs) for mobile entities and to retrieve rapidly the configuration and coverage information of these APs. The advantage of the P2P-based solution is its distributed nature, its scalability, and its self-organizing capability. We show by means of simulation the efficiency and the scalability of our approach in comparison to a standard CAN implementation.}, address = {Melbourne, Australia}, author = {Oechsner, Simon and Hoßfeld, Tobias and Tutschku, Kurt and Andersen, Frank-Uwe}, booktitle = {2006 IEEE 63rd Vehicular Technology Conference}, keywords = {sys:hidden:inproceedings}, month = 5, title = {Supporting Vertical Handover by a Self-Organizing Multi-Dimensional P2P Overlay}, year = 2006 }

  %0 Conference Paper %1 info3-inproceedings-2006-214 %A Oechsner, Simon %A Hoßfeld, Tobias %A Tutschku, Kurt %A Andersen, Frank-Uwe %B 2006 IEEE 63rd Vehicular Technology Conference %C Melbourne, Australia %D 2006 %T Supporting Vertical Handover by a Self-Organizing Multi-Dimensional P2P Overlay %X Vertical handovers (VHO) are expected to be a key feature in Beyond 3G (B3G) networks. This paper presents a CAN-based P2P overlay network for supporting vertical handover in B3G networks. The P2P overlay is used to quickly locate attachment points (APs) for mobile entities and to retrieve rapidly the configuration and coverage information of these APs. The advantage of the P2P-based solution is its distributed nature, its scalability, and its self-organizing capability. We show by means of simulation the efficiency and the scalability of our approach in comparison to a standard CAN implementation.
• Supporting Vertical Handover by Using a Pastry Peer-to-Peer Overlay Network Hoßfeld, Tobias; Oechsner, Simon; Tutschku, Kurt; Andersen, Frank-Uwe; Caviglione, Luca in Mobile Peer-to-Peer Computing MP2P’06, in conjunction with the 4th IEEE International Conference on Pervasive Computing and Communications (PerCom’06) (2006).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Vertical handovers (VHO) are expected to be a key feature in Beyond 3G (B3G) networks. This paper presents a Pastry-based P2P overlay network for supporting vertical handover in B3G networks. The P2P overlay is used to quickly locate attachment points (APs) for mobile entities and to rapidly retrieve the configuration and coverage information of these APs. The advantage of the P2P-based solution is its distributed nature, its scalability, and its self-organizing capability.

  @inproceedings{info3-inproceedings-2006-205, abstract = {Vertical handovers (VHO) are expected to be a key feature in Beyond 3G (B3G) networks. This paper presents a Pastry-based P2P overlay network for supporting vertical handover in B3G networks. The P2P overlay is used to quickly locate attachment points (APs) for mobile entities and to rapidly retrieve the configuration and coverage information of these APs. The advantage of the P2P-based solution is its distributed nature, its scalability, and its self-organizing capability.}, address = {Pisa, Italy}, author = {Hoßfeld, Tobias and Oechsner, Simon and Tutschku, Kurt and Andersen, Frank-Uwe and Caviglione, Luca}, booktitle = {Mobile Peer-to-Peer Computing MP2P'06, in conjunction with the 4th IEEE International Conference on Pervasive Computing and Communications (PerCom'06)}, keywords = {sys:hidden:inproceedings}, month = 3, title = {Supporting Vertical Handover by Using a Pastry Peer-to-Peer Overlay Network}, year = 2006 }

  %0 Conference Paper %1 info3-inproceedings-2006-205 %A Hoßfeld, Tobias %A Oechsner, Simon %A Tutschku, Kurt %A Andersen, Frank-Uwe %A Caviglione, Luca %B Mobile Peer-to-Peer Computing MP2P'06, in conjunction with the 4th IEEE International Conference on Pervasive Computing and Communications (PerCom'06) %C Pisa, Italy %D 2006 %T Supporting Vertical Handover by Using a Pastry Peer-to-Peer Overlay Network %X Vertical handovers (VHO) are expected to be a key feature in Beyond 3G (B3G) networks. This paper presents a Pastry-based P2P overlay network for supporting vertical handover in B3G networks. The P2P overlay is used to quickly locate attachment points (APs) for mobile entities and to rapidly retrieve the configuration and coverage information of these APs. The advantage of the P2P-based solution is its distributed nature, its scalability, and its self-organizing capability.
• Using Kademlia for the Configuration of B3G Radio Access Nodes Oechsner, Simon; Hoßfeld, Tobias; Tutschku, Kurt; Andersen, Frank-Uwe; Caviglione, Luca in Mobile Peer-to-Peer Computing MP2P’06, in conjunction with the 4th IEEE International Conference on Pervasive Computing and Communications (PerCom’06) (2006).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Configuration and management of radio access nodes in Beyond 3G (B3G) networks such as NodeBs, Wireless LAN or WIMAX access points is a complex task that consumes a high amount of resources. Most configuration changes have to be done by an operator, especially when it comes to the adaption of a node to its environment, i.e., the cells surrounding its own. This is an expensive and inflexible method. Moreover, the required manual interference hampers the adaptivity of B3G networks towards topology changes. In this work, we present an architecture that allows for the detection of neighboring cells, thereby enabling an easy or even autonomic configuration of the access nodes. In addition to this, the presented Kademlia-based overlay network enables the storage of information needed for network management, such as configuration data or performance measures.

  @inproceedings{info3-inproceedings-2006-206, abstract = {Configuration and management of radio access nodes in Beyond 3G (B3G) networks such as NodeBs, Wireless LAN or WIMAX access points is a complex task that consumes a high amount of resources. Most configuration changes have to be done by an operator, especially when it comes to the adaption of a node to its environment, i.e., the cells surrounding its own. This is an expensive and inflexible method. Moreover, the required manual interference hampers the adaptivity of B3G networks towards topology changes. In this work, we present an architecture that allows for the detection of neighboring cells, thereby enabling an easy or even autonomic configuration of the access nodes. In addition to this, the presented Kademlia-based overlay network enables the storage of information needed for network management, such as configuration data or performance measures.}, address = {Pisa, Italy}, author = {Oechsner, Simon and Hoßfeld, Tobias and Tutschku, Kurt and Andersen, Frank-Uwe and Caviglione, Luca}, booktitle = {Mobile Peer-to-Peer Computing MP2P'06, in conjunction with the 4th IEEE International Conference on Pervasive Computing and Communications (PerCom'06)}, keywords = {sys:hidden:inproceedings}, month = 3, title = {Using Kademlia for the Configuration of B3G Radio Access Nodes}, year = 2006 }

  %0 Conference Paper %1 info3-inproceedings-2006-206 %A Oechsner, Simon %A Hoßfeld, Tobias %A Tutschku, Kurt %A Andersen, Frank-Uwe %A Caviglione, Luca %B Mobile Peer-to-Peer Computing MP2P'06, in conjunction with the 4th IEEE International Conference on Pervasive Computing and Communications (PerCom'06) %C Pisa, Italy %D 2006 %T Using Kademlia for the Configuration of B3G Radio Access Nodes %X Configuration and management of radio access nodes in Beyond 3G (B3G) networks such as NodeBs, Wireless LAN or WIMAX access points is a complex task that consumes a high amount of resources. Most configuration changes have to be done by an operator, especially when it comes to the adaption of a node to its environment, i.e., the cells surrounding its own. This is an expensive and inflexible method. Moreover, the required manual interference hampers the adaptivity of B3G networks towards topology changes. In this work, we present an architecture that allows for the detection of neighboring cells, thereby enabling an easy or even autonomic configuration of the access nodes. In addition to this, the presented Kademlia-based overlay network enables the storage of information needed for network management, such as configuration data or performance measures.
• Evaluation of a Pastry-Based P2P Overlay for Supporting Vertical Handover Oechsner, Simon (2006, April 4).
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2006-183, address = {Wireless Communications and Networking Conference 2006}, author = {Oechsner, Simon}, keywords = {sys:hidden:presentation}, month = 4, title = {Evaluation of a Pastry-Based P2P Overlay for Supporting Vertical Handover}, year = 2006 }

  %0 Generic %1 info3-talk-2006-183 %A Oechsner, Simon %C Wireless Communications and Networking Conference 2006 %D 2006 %T Evaluation of a Pastry-Based P2P Overlay for Supporting Vertical Handover
• Evaluation of a Pastry-based P2P Overlay for Supporting Vertical Handover Hoßfeld, Tobias; Oechsner, Simon; Tutschku, Kurt; Andersen, Frank-Uwe in IEEE Wireless Communications and Networking Conference (2006). 6.
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Vertical handovers (VHO) are expected to be a key feature in Beyond 3G (B3G) networks. This paper presents and evaluates a Pastry-based P2P overlay network for supporting vertical handover in B3G networks. The P2P overlay is used to quickly locate attachment points (APs) for mobile entities and to retrieve rapidly the configuration and coverage information of these APs. The advantage of the P2P-based solution is its distributed nature, its scalability, and its self-organizing capability. The performance of the P2P-based VHO support architecture is evaluated in terms of the search time for APs, the scalability of the algorithm, and for homogenous and heterogeneous network layouts. In addition, the solution is compared with the conventional client/server approach.

  @inproceedings{info3-inproceedings-2006-213, abstract = {Vertical handovers (VHO) are expected to be a key feature in Beyond 3G (B3G) networks. This paper presents and evaluates a Pastry-based P2P overlay network for supporting vertical handover in B3G networks. The P2P overlay is used to quickly locate attachment points (APs) for mobile entities and to retrieve rapidly the configuration and coverage information of these APs. The advantage of the P2P-based solution is its distributed nature, its scalability, and its self-organizing capability. The performance of the P2P-based VHO support architecture is evaluated in terms of the search time for APs, the scalability of the algorithm, and for homogenous and heterogeneous network layouts. In addition, the solution is compared with the conventional client/server approach.}, address = {Las Vegas, NV, USA}, author = {Hoßfeld, Tobias and Oechsner, Simon and Tutschku, Kurt and Andersen, Frank-Uwe}, booktitle = {IEEE Wireless Communications and Networking Conference}, keywords = {sys:hidden:inproceedings}, month = 4, pages = 6, title = {Evaluation of a Pastry-based P2P Overlay for Supporting Vertical Handover}, year = 2006 }

  %0 Conference Paper %1 info3-inproceedings-2006-213 %A Hoßfeld, Tobias %A Oechsner, Simon %A Tutschku, Kurt %A Andersen, Frank-Uwe %B IEEE Wireless Communications and Networking Conference %C Las Vegas, NV, USA %D 2006 %P 6 %T Evaluation of a Pastry-based P2P Overlay for Supporting Vertical Handover %X Vertical handovers (VHO) are expected to be a key feature in Beyond 3G (B3G) networks. This paper presents and evaluates a Pastry-based P2P overlay network for supporting vertical handover in B3G networks. The P2P overlay is used to quickly locate attachment points (APs) for mobile entities and to retrieve rapidly the configuration and coverage information of these APs. The advantage of the P2P-based solution is its distributed nature, its scalability, and its self-organizing capability. The performance of the P2P-based VHO support architecture is evaluated in terms of the search time for APs, the scalability of the algorithm, and for homogenous and heterogeneous network layouts. In addition, the solution is compared with the conventional client/server approach.
• Verlässliche Peer-to-Peer Technologie als Steuerungsverfahren für zukünftige mobile Zugangsnetze Andersen, Frank-Uwe; Tutschku, Kurt; Hoßfeld, Tobias; Oechsner, Simon in 11. ITG-Mobilfunktagung, Technologien und Anwendungen, ISBN 3-8007-2942-3 (2006).
  • [ Abstract ]
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  Gegenstand unserer Untersuchung ist der Einsatz von verlässlicher „Peer-to-Peer“ (P2P) Technologie innerhalb Betreiber-eigener Kernnetze mit dem Ziel, eine Dezentralisierung von Steuerungsdiensten zu erreichen. Als Anwendung besonders aussichtsreich erscheint die Unterstützung von Handover-Vorgängen in heterogenen Radio- Zugangsnetzen (z.B. 802.11x und 3G). Während hierfür zwar recht schnell P2P-Lösungen gefunden werden können, die grundsätzlich funktionieren, besteht die Herausforderung darin, die als immanent angenommenen Vorteile von P2P wie Skalierbarkeit, Selbstorganisation und Robustheit den hohen Anforderungen von Betreibern nach „Verlässlichkeit“ gegenüberzustellen, und, wo möglich, die Zuverlässigkeit zu erhöhen. Anhand zweier Beispiele werden solche Optimierungen beschrieben. Als Referenz dienen ein neues Handover-Verfahren für „Beyond 3G“ (B3G) Netze mit heterogenen Funktechniken sowie ein verallgemeinertes, klassisches Netzwerkmanagement in 3G-Netzen.

  @inproceedings{info3-inproceedings-2006-233, abstract = {Gegenstand unserer Untersuchung ist der Einsatz von verlässlicher „Peer-to-Peer“ (P2P) Technologie innerhalb Betreiber-eigener Kernnetze mit dem Ziel, eine Dezentralisierung von Steuerungsdiensten zu erreichen. Als Anwendung besonders aussichtsreich erscheint die Unterstützung von Handover-Vorgängen in heterogenen Radio- Zugangsnetzen (z.B. 802.11x und 3G). Während hierfür zwar recht schnell P2P-Lösungen gefunden werden können, die grundsätzlich funktionieren, besteht die Herausforderung darin, die als immanent angenommenen Vorteile von P2P wie Skalierbarkeit, Selbstorganisation und Robustheit den hohen Anforderungen von Betreibern nach „Verlässlichkeit“ gegenüberzustellen, und, wo möglich, die Zuverlässigkeit zu erhöhen. Anhand zweier Beispiele werden solche Optimierungen beschrieben. Als Referenz dienen ein neues Handover-Verfahren für „Beyond 3G“ (B3G) Netze mit heterogenen Funktechniken sowie ein verallgemeinertes, klassisches Netzwerkmanagement in 3G-Netzen.}, address = {Osnabrück, Germany}, author = {Andersen, Frank-Uwe and Tutschku, Kurt and Hoßfeld, Tobias and Oechsner, Simon}, booktitle = {11. ITG-Mobilfunktagung, Technologien und Anwendungen, ISBN 3-8007-2942-3}, keywords = {sys:hidden:inproceedings}, month = 5, title = {Verlässliche Peer-to-Peer Technologie als Steuerungsverfahren für zukünftige mobile Zugangsnetze}, year = 2006 }

  %0 Conference Paper %1 info3-inproceedings-2006-233 %A Andersen, Frank-Uwe %A Tutschku, Kurt %A Hoßfeld, Tobias %A Oechsner, Simon %B 11. ITG-Mobilfunktagung, Technologien und Anwendungen, ISBN 3-8007-2942-3 %C Osnabrück, Germany %D 2006 %T Verlässliche Peer-to-Peer Technologie als Steuerungsverfahren für zukünftige mobile Zugangsnetze %X Gegenstand unserer Untersuchung ist der Einsatz von verlässlicher „Peer-to-Peer“ (P2P) Technologie innerhalb Betreiber-eigener Kernnetze mit dem Ziel, eine Dezentralisierung von Steuerungsdiensten zu erreichen. Als Anwendung besonders aussichtsreich erscheint die Unterstützung von Handover-Vorgängen in heterogenen Radio- Zugangsnetzen (z.B. 802.11x und 3G). Während hierfür zwar recht schnell P2P-Lösungen gefunden werden können, die grundsätzlich funktionieren, besteht die Herausforderung darin, die als immanent angenommenen Vorteile von P2P wie Skalierbarkeit, Selbstorganisation und Robustheit den hohen Anforderungen von Betreibern nach „Verlässlichkeit“ gegenüberzustellen, und, wo möglich, die Zuverlässigkeit zu erhöhen. Anhand zweier Beispiele werden solche Optimierungen beschrieben. Als Referenz dienen ein neues Handover-Verfahren für „Beyond 3G“ (B3G) Netze mit heterogenen Funktechniken sowie ein verallgemeinertes, klassisches Netzwerkmanagement in 3G-Netzen.
• Performance of Business-Case Peer-to-Peer Platforms Tran-Gia, Phuoc; Oechsner, Simon (2006, March 31).
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2006-161, address = {Lucent Bell Labs, Holmdel, NJ}, author = {Tran-Gia, Phuoc and Oechsner, Simon}, keywords = {sys:hidden:presentation}, month = 3, title = {Performance of Business-Case Peer-to-Peer Platforms}, year = 2006 }

  %0 Generic %1 info3-talk-2006-161 %A Tran-Gia, Phuoc %A Oechsner, Simon %C Lucent Bell Labs, Holmdel, NJ %D 2006 %T Performance of Business-Case Peer-to-Peer Platforms
• A Carrier Grade P2P Architecture Supporting Vertical Handover Decisions Oechsner, Simon (2006, February 22).
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2006-160, address = {EuroNGI Plenary Neeting 2006, Würzburg}, author = {Oechsner, Simon}, keywords = {sys:hidden:presentation}, month = 2, title = {A Carrier Grade P2P Architecture Supporting Vertical Handover Decisions}, year = 2006 }

  %0 Generic %1 info3-talk-2006-160 %A Oechsner, Simon %C EuroNGI Plenary Neeting 2006, Würzburg %D 2006 %T A Carrier Grade P2P Architecture Supporting Vertical Handover Decisions
• Using Kademlia for the Configuration of B3G Radio Access Nodes Oechsner, Simon (2006, March 17).
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2006-212, address = {Mobile Peer-to-Peer Computing MP2P'06, Pisa, Italy}, author = {Oechsner, Simon}, keywords = {sys:hidden:presentation}, month = 3, title = {Using Kademlia for the Configuration of B3G Radio Access Nodes}, year = 2006 }

  %0 Generic %1 info3-talk-2006-212 %A Oechsner, Simon %C Mobile Peer-to-Peer Computing MP2P'06, Pisa, Italy %D 2006 %T Using Kademlia for the Configuration of B3G Radio Access Nodes

• A P2P Control Architecture Supporting Vertical Handover Decisions Oechsner, Simon (2005, September 29).
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2005-129, address = {ITG Fachgruppe 5.2.4: Mobilität in IP-basierten Netzen, Aachen}, author = {Oechsner, Simon}, keywords = {sys:hidden:presentation}, month = 9, title = {A P2P Control Architecture Supporting Vertical Handover Decisions}, year = 2005 }

  %0 Generic %1 info3-talk-2005-129 %A Oechsner, Simon %C ITG Fachgruppe 5.2.4: Mobilität in IP-basierten Netzen, Aachen %D 2005 %T A P2P Control Architecture Supporting Vertical Handover Decisions
• Supporting Vertical Handover by Using a Pastry Peer-to-Peer Overlay Network Hoßfeld, Tobias; Oechsner, Simon; Tutschku, Kurt; Andersen, Frank-Uwe; Caviglione, Luca (2005).
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @techreport{info3-techreport-2005-185, author = {Hoßfeld, Tobias and Oechsner, Simon and Tutschku, Kurt and Andersen, Frank-Uwe and Caviglione, Luca}, institution = {University of Wuerzburg}, keywords = {sys:hidden:techreport}, month = 9, number = 367, title = {Supporting Vertical Handover by Using a Pastry Peer-to-Peer Overlay Network}, year = 2005 }

  %0 Report %1 info3-techreport-2005-185 %A Hoßfeld, Tobias %A Oechsner, Simon %A Tutschku, Kurt %A Andersen, Frank-Uwe %A Caviglione, Luca %D 2005 %N 367 %T Supporting Vertical Handover by Using a Pastry Peer-to-Peer Overlay Network
• Scheduling Cluster Tools Using Filtered Beam Search and Recipe Comparison Oechsner, Simon; Rose, Oliver in Winter Simulation Conference (2005).
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @inproceedings{info3-inproceedings-2005-202, address = {Orlando, Florida, USA}, author = {Oechsner, Simon and Rose, Oliver}, booktitle = {Winter Simulation Conference}, keywords = {sys:hidden:inproceedings}, month = 12, title = {Scheduling Cluster Tools Using Filtered Beam Search and Recipe Comparison}, year = 2005 }

  %0 Conference Paper %1 info3-inproceedings-2005-202 %A Oechsner, Simon %A Rose, Oliver %B Winter Simulation Conference %C Orlando, Florida, USA %D 2005 %T Scheduling Cluster Tools Using Filtered Beam Search and Recipe Comparison
• A filtered beam search approach to scheduling cluster tools in semiconductor manufacturing Oechsner, Simon; Rose, Oliver in Industrial Engineering Research Conference (2005).
  • [ BibTeX ]
  • [ EndNote ]
  @inproceedings{info3-inproceedings-2005-191, address = {Atlanta, GA}, author = {Oechsner, Simon and Rose, Oliver}, booktitle = {Industrial Engineering Research Conference}, keywords = {sys:hidden:inproceedings}, month = 5, title = {A filtered beam search approach to scheduling cluster tools in semiconductor manufacturing}, year = 2005 }

  %0 Conference Paper %1 info3-inproceedings-2005-191 %A Oechsner, Simon %A Rose, Oliver %B Industrial Engineering Research Conference %C Atlanta, GA %D 2005 %T A filtered beam search approach to scheduling cluster tools in semiconductor manufacturing
• Using Kademlia for the Configuration of B3G Radio Access Nodes Oechsner, Simon; Hoßfeld, Tobias; Tutschku, Kurt; Andersen, Frank-Uwe; Caviglione, Luca (2005).
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @techreport{info3-techreport-2005-187, author = {Oechsner, Simon and Hoßfeld, Tobias and Tutschku, Kurt and Andersen, Frank-Uwe and Caviglione, Luca}, institution = {University of Wuerzburg}, keywords = {sys:hidden:techreport}, month = 10, number = 370, title = {Using Kademlia for the Configuration of B3G Radio Access Nodes}, year = 2005 }

  %0 Report %1 info3-techreport-2005-187 %A Oechsner, Simon %A Hoßfeld, Tobias %A Tutschku, Kurt %A Andersen, Frank-Uwe %A Caviglione, Luca %D 2005 %N 370 %T Using Kademlia for the Configuration of B3G Radio Access Nodes
• Evaluation of a Pastry-based P2P Overlay for Supporting Vertical Handover Hoßfeld, Tobias; Oechsner, Simon; Tutschku, Kurt; Andersen, Frank-Uwe (2005).
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @techreport{info3-techreport-2005-186, author = {Hoßfeld, Tobias and Oechsner, Simon and Tutschku, Kurt and Andersen, Frank-Uwe}, institution = {University of Wuerzburg}, keywords = {sys:hidden:techreport}, month = 10, number = 368, title = {Evaluation of a Pastry-based P2P Overlay for Supporting Vertical Handover}, year = 2005 }

  %0 Report %1 info3-techreport-2005-186 %A Hoßfeld, Tobias %A Oechsner, Simon %A Tutschku, Kurt %A Andersen, Frank-Uwe %D 2005 %N 368 %T Evaluation of a Pastry-based P2P Overlay for Supporting Vertical Handover
• A filtered beam search approach to scheduling cluster tools in semiconductor manufacturing Oechsner, Simon (2005, December 7).
  • [ BibTeX ]
  • [ EndNote ]
  @presentation{info3-talk-2005-178, address = {Winter Simulation Conference 2005, Orlando, FL, USA}, author = {Oechsner, Simon}, keywords = {sys:hidden:presentation}, month = 12, title = {A filtered beam search approach to scheduling cluster tools in semiconductor manufacturing}, year = 2005 }

  %0 Generic %1 info3-talk-2005-178 %A Oechsner, Simon %C Winter Simulation Conference 2005, Orlando, FL, USA %D 2005 %T A filtered beam search approach to scheduling cluster tools in semiconductor manufacturing

• EBAC - A Simple Admission Control Mechanism Milbrandt, Jens; Menth, Michael; Oechsner, Simon (2004, October).
  • [ BibTeX ]
  • [ EndNote ]
  @misc{info3-poster-2004-15, author = {Milbrandt, Jens and Menth, Michael and Oechsner, Simon}, booktitle = {KING}, keywords = {sys:hidden:poster}, month = 10, title = {EBAC - A Simple Admission Control Mechanism}, year = 2004 }

  %0 Generic %1 info3-poster-2004-15 %A Milbrandt, Jens %A Menth, Michael %A Oechsner, Simon %B KING %D 2004 %T EBAC - A Simple Admission Control Mechanism
• EBAC - A Simple Admission Control Mechanism Milbrandt, Jens; Menth, Michael; Oechsner, Simon in ICNP 2004, 12th IEEE International Conference on Network Protocols (2004).
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @inproceedings{info3-inproceedings-2004-155, address = {Berlin, Germany}, author = {Milbrandt, Jens and Menth, Michael and Oechsner, Simon}, booktitle = {ICNP 2004, 12th IEEE International Conference on Network Protocols}, keywords = {sys:hidden:inproceedings}, month = 10, title = {EBAC - A Simple Admission Control Mechanism}, year = 2004 }

  %0 Conference Paper %1 info3-inproceedings-2004-155 %A Milbrandt, Jens %A Menth, Michael %A Oechsner, Simon %B ICNP 2004, 12th IEEE International Conference on Network Protocols %C Berlin, Germany %D 2004 %T EBAC - A Simple Admission Control Mechanism
• Experience Based Admission Control (EBAC) Menth, Michael; Milbrandt, Jens; Oechsner, Simon in The Ninth IEEE Symposium on Computers and Communications (ISCC2004) (2004).
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @inproceedings{info3-inproceedings-2004-143, address = {Alexandria, Egypt}, author = {Menth, Michael and Milbrandt, Jens and Oechsner, Simon}, booktitle = {The Ninth IEEE Symposium on Computers and Communications (ISCC2004)}, keywords = {sys:hidden:inproceedings}, month = 6, title = {Experience Based Admission Control (EBAC)}, year = 2004 }

  %0 Conference Paper %1 info3-inproceedings-2004-143 %A Menth, Michael %A Milbrandt, Jens %A Oechsner, Simon %B The Ninth IEEE Symposium on Computers and Communications (ISCC2004) %C Alexandria, Egypt %D 2004 %T Experience Based Admission Control (EBAC)
• Experience Based Admission Control (EBAC) Menth, Michael; Milbrandt, Jens; Oechsner, Simon (2004).
  • [ BibTeX ]
  • [ EndNote ]
  • [ Download ]
  @techreport{info3-techreport-2004-152, author = {Menth, Michael and Milbrandt, Jens and Oechsner, Simon}, institution = {University of Wuerzburg}, keywords = {sys:hidden:techreport}, month = 2, number = 325, title = {Experience Based Admission Control (EBAC)}, year = 2004 }

  %0 Report %1 info3-techreport-2004-152 %A Menth, Michael %A Milbrandt, Jens %A Oechsner, Simon %D 2004 %N 325 %T Experience Based Admission Control (EBAC)