TY - JOUR AU - Dräxler, Martin AU - Biermann, Thorsten AU - Karl, Holger ID - 771 IS - 3 JF - International Journal of Wireless Information Networks TI - Improving Cooperative Transmission Feasibility by Network Reconfiguration in Limited Backhaul Networks ER - TY - CONF AU - Hohenberger, Till AU - Herlich, Matthias AU - Karl, Holger ID - 772 T2 - IEEE International Conference on Advanced Networks and Telecommunications Systems, ANTS 2013, Kattankulathur, India, December 15-18, 2013 TI - Trade-off between latency and coverage in cooperative radio access networks ER - TY - CONF AU - M. Facca, Federico AU - Salvadori, Elio AU - Karl, Holger AU - R. Lopez, Diego AU - Arranda Gutierrez, Pedro AU - Kostic, Dejan AU - Riggio, Roberto ID - 773 T2 - Second European Workshop on Software Defined Networks, EWSDN 2013, Berlin, Germany, October 10-11, 2013 TI - NetIDE: First Steps towards an Integrated Development Environment for Portable Network Apps ER - TY - CONF AU - Cicconetti, Claudio AU - Morelli, Arianna AU - Dräxler, Martin AU - Karl, Holger AU - Mancuso, Vincenzo AU - Sciancalepore, Vincenzo AU - Gupta, Rohit AU - de la Oliva, Antonio AU - Isabel Sanchez, M. AU - Serrano, Pablo AU - Roullet, Laurent ID - 774 T2 - 2013 Future Network & Mobile Summit, Lisboa, Portugal, July 3-5, 2013 TI - The playground of Wireless Dense networks of the future ER - TY - CONF AU - Keller, Matthias AU - Peuster, Manuel AU - Robbert, Christoph AU - Karl, Holger ID - 775 T2 - 17th International Conference on Intelligence in Next Generation Networks, {ICIN} 2013, Venice, Italy, October 15-16, 2013 TI - A topology-aware adaptive deployment framework for elastic applications ER - TY - CONF AU - Herlich, Matthias AU - Karl, Holger ID - 776 T2 - ISWCS 2013, The Tenth International Symposium on Wireless Communication Systems, Ilmenau, Germany, August 27-30, 2013 TI - Energy-Efficient Assignment of User Equipment to Cooperative Base Stations ER - TY - CONF AU - Dräxler, Martin AU - Karl, Holger ID - 777 T2 - 2013 9th International Wireless Communications and Mobile Computing Conference, IWCMC 2013, Sardinia, Italy, July 1-5, 2013 TI - Cross-layer scheduling for multi-quality video streaming in cellular wireless networks ER - TY - GEN AU - Dräxler, Martin AU - Blobel, Johannes AU - Dreimann, Philipp AU - Valentin, Stefan AU - Karl, Holger ID - 781 T2 - CoRR TI - Anticipatory Buffer Control and Quality Selection for Wireless Video Streaming ER - TY - CONF AB - In OpenFlow [1], multiple switches share the same control plane which is centralized atwhat is called the OpenFlow controller. A switch only consists of a forwarding plane. Rules for forwarding individual packets (called ow entries in OpenFlow) are pushed from the controller to the switches. In a network with a high arrival rate of new ows, such as in a data center, the control trac between the switch and controller can become very high. As a consequence, routing of new ows will be slow. One way to reduce control trac is to use wildcarded ow entries. Wildcard ow entries can be used to create default routes in the network. However, since switches do not keep track of ows covered by a wildcard ow entry, the controller no longer has knowledge about individual ows. To nd out about these individual ows we propose an extension to the current OpenFlow standard to enable packet sampling of wildcard ow entries. AU - Wette, Philip AU - Karl, Holger ID - 470 T2 - Proceedings of the ACM SIGCOMM '13 TI - Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow ER - TY - GEN AU - Wallaschek, Felix ID - 490 TI - Routing in heterogenen OpenFlow Netzwerken ER - TY - GEN AU - Robbert, Christoph ID - 492 TI - Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained Case ER - TY - CONF AB - Within reactive topology control, a node determines its adjacent edges of a network subgraph without prior knowledge of its neighborhood. The goal is to construct a local view on a topology which provides certain desired properties such as planarity. During algorithm execution, a node, in general, is not allowed to determine all its neighbors of the network graph. There are well-known reactive algorithms for computing planar subgraphs. However, the subgraphs obtained do not have constant Euclidean spanning ratio. This means that routing along these subgraphs may result in potentially long detours. So far, it has been unknown if planar spanners can be constructed reactively. In this work, we show that at least under the unit disk network model, this is indeed possible, by proposing an algorithm for reactive construction of the partial Delaunay triangulation, which recently turned out to be a spanner. Furthermore, we show that our algorithm is message-optimal as a node will only exchange messages with nodes that are also neighbors in the spanner. The algorithm’s presentation is complemented by a rigorous proof of correctness. AU - Benter, Markus AU - Neumann, Florentin AU - Frey, Hannes ID - 496 T2 - Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM) TI - Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks ER - TY - JOUR AU - Biermann, Thorsten AU - Scalia, Luca AU - Choi, Changsoon AU - Kellerer, Wolfgang AU - Karl, Holger ID - 769 IS - 8 JF - {IEEE} Communications Magazine TI - How backhaul networks influence the feasibility of coordinated multipoint in cellular networks ER - TY - CONF AB - The process of planning a virtual topology for a Wavelength Devision Multiplexing (WDM) network is called Virtual Topology Design (VTD). The goal of VTD is to find a virtual topology that supports forwarding the expected traffic without congestion. In networks with fluctuating, high traffic demands, it can happen that no single topology fits all changing traffic demands occurring over a longer time. Thus, during operation, the virtual topology has to be reconfigured. Since modern networks tend to be large, VTD algorithms have to scale well with increasing network size, requiring distributed algorithms. Existing distributed VTD algorithms, however, react too slowly on congestion for the real-time reconfiguration of large networks. We propose Selfish Virtual Topology Reconfiguration (SVTR) as a new algorithm for distributed VTD. It combines reconfiguring the virtual topology and routing through a Software Defined Network (SDN). SVTR is used for online, on-the-fly network reconfiguration. Its integrated routing and WDM reconfiguration keeps connection disruption due to network reconfiguration to a minimum and is able to react very quickly to traffic pattern changes. SVTR works by iteratively adapting the virtual topology to the observed traffic patterns without global traffic information and without future traffic estimations. We evaluated SVTR by simulation and found that it significantly lowers congestion in realistic networks and high load scenarios. AU - Wette, Philip AU - Karl, Holger ID - 508 T2 - Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN) TI - On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks ER - TY - CONF AB - In this paper we will introduce a new d-dimensional graph for constructing geometric application layer overlay net-works. Our approach will use internet coordinates, embedded using the L∞ -metric. After describing the graph structure, we will show how it limits maintenance overhead by bounding each node’s out-degree and how it supports greedy routing using one-hop neighbourhood information in each routing step. We will further show that greedy routing can always compute a path in our graph and we will also prove that in each forwarding step the next hop is closer to the destination than the current node. AU - Autenrieth, Marcus AU - Frey, Hannes ID - 509 T2 - Proceedings of the Conference on Networked Systems (NetSys) TI - On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings ER - TY - GEN AU - Splietker, Malte ID - 511 TI - MapReduce in Software Defined Networks ER - TY - CONF AB - Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established lightpaths in case not enough resources are available to set up a new lightpath in a Wavelength Division Multiplexing (WDM) network. The selection of lightpaths to be preempted relies on internal decisions of the RWA algorithm. Thus, if dedicated properties of the network topology are required by the applications running on the network, these requirements have to be known to the RWA algorithm.Otherwise it might happen that by preempting a particular lightpath these requirements are violated. If, however, these requirements include parametersknown only at the nodes running the application, the RWA algorithm cannot evaluate the requirements. For this reason an RWA algorithm is needed which incorporates feedback from the application layer in the preemption decisions.This work proposes a simple interface along with an algorithm for computing and selecting preemption candidates in case a lightpath cannot be established. We reason about the necessity of using information from the application layer in the RWA and present two example applications which benefit from this idea. AU - Wette, Philip AU - Karl, Holger ID - 520 T2 - Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM) TI - Incorporating feedback from application layer into routing and wavelength assignment algorithms ER - TY - GEN AU - Niklas Vinkemeier, Tim ID - 525 TI - Haptics - Hadoop performance testing in concurrent job scenarios ER - TY - GEN AU - Satya, Suhas ID - 534 TI - Emulating Wavelength Division Multiplexing using Openflow ER - TY - CONF AB - In Distributed Cloud Computing, applications are deployed across many data centres at topologically diverse locations to improved network-related quality of service (QoS). As we focus on interactive applications, we minimize the latency between users and an application by allocating Cloud resources nearby the customers. Allocating resources at all locations will result in the best latency but also in the highest expenses. So we need to find an optimal subset of locations which reduces the latency but also the expenses – the facility location problem (FLP). In addition, we consider resource capacity restrictions, as a resource can only serve a limited amount of users. An FLP can be globally solved. Additionally, we propose a local, distributed heuristic. This heuristic is running within the network and does not depend on a global component. No distributed, local approximations for the capacitated FLP have been proposed so far due to the complexity of the problem. We compared the heuristic with an optimal solution obtained from a mixed integer program for different network topologies. We investigated the influence of different parameters like overall resource utilization or different latency weights. AU - Keller, Matthias AU - Pawlik, Stefan AU - Pietrzyk, Peter AU - Karl, Holger ID - 562 T2 - Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing TI - A Local Heuristic for Latency-Optimized Distributed Cloud Deployment ER -