@inproceedings{1654, author = {{Herlich, Matthias and Karl, Holger}}, booktitle = {{12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt) 2014}}, isbn = {{9783901882630}}, publisher = {{IEEE}}, title = {{{Analytic quantification of outage probability and radiated power of cooperative base stations}}}, doi = {{10.1109/wiopt.2014.6850365}}, year = {{2014}}, } @article{1375, author = {{Beister, Frederic and Dräxler, Martin and Aelken, Jörg and Karl, Holger}}, issn = {{0140-3664}}, journal = {{Computer Communications}}, pages = {{77--85}}, publisher = {{Elsevier BV}}, title = {{{Power model design for ICT systems – A generic approach}}}, doi = {{10.1016/j.comcom.2014.02.007}}, volume = {{50}}, year = {{2014}}, } @inproceedings{1798, author = {{Keller, Matthias and Robbert, Christoph and Peuster, Manuel}}, booktitle = {{Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM }}, title = {{{An evaluation testbed for adaptive, topology-aware deployment of elastic applications}}}, year = {{2013}}, } @inproceedings{1799, author = {{Ali-Ahmad, Hassan and Cicconetti, Claudio and de la Oliva, Antonio and Draxler, Martin and Gupta, Rohit and Mancuso, Vincenzo and Roullet, Laurent and Sciancalepore, Vincenzo}}, booktitle = {{2013 Second European Workshop on Software Defined Networks}}, isbn = {{9781479924332}}, publisher = {{IEEE}}, title = {{{CROWD: An SDN Approach for DenseNets}}}, doi = {{10.1109/ewsdn.2013.11}}, year = {{2013}}, } @inbook{1800, author = {{Blanckenstein, Johannes and Garcia-Jimenez, Javier and Klaue, Jirka and Karl, Holger}}, booktitle = {{Lecture Notes in Electrical Engineering}}, isbn = {{9783319030708}}, issn = {{1876-1100}}, pages = {{165--177}}, publisher = {{Springer International Publishing}}, title = {{{A Scalable Redundant TDMA Protocol for High-Density WSNs Inside an Aircraft}}}, doi = {{10.1007/978-3-319-03071-5_18}}, year = {{2013}}, } @inproceedings{1802, author = {{Wette, P. and Graffi, K.}}, booktitle = {{2013 Conference on Networked Systems}}, isbn = {{9781467356459}}, publisher = {{IEEE}}, title = {{{Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables}}}, doi = {{10.1109/netsys.2013.9}}, year = {{2013}}, } @inproceedings{1803, author = {{Dannewitz, Christian and Herlich, Matthias and Karl, Holger}}, booktitle = {{37th Annual IEEE Conference on Local Computer Networks -- Workshops}}, isbn = {{9781467321297}}, publisher = {{IEEE}}, title = {{{OpenNetInf - prototyping an information-centric Network Architecture}}}, doi = {{10.1109/lcnw.2012.6424044}}, year = {{2013}}, } @inbook{1804, author = {{de la Oliva, Antonio and Morelli, Arianna and Mancuso, Vincenzo and Draexler, Martin and Hentschel, Tim and Melia, Telemaco and Seite, Pierrick and Cicconetti, Claudio}}, booktitle = {{Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering}}, isbn = {{9783642379345}}, issn = {{1867-8211}}, pages = {{28--41}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Denser Networks for the Future Internet, the CROWD Approach}}}, doi = {{10.1007/978-3-642-37935-2_3}}, year = {{2013}}, } @article{770, author = {{Dannewitz, Christian and Kutscher, Dirk and Ohlman, B and Farrell, Stephen and Ahlgren, Bengt and Karl, Holger}}, journal = {{Computer Communications}}, number = {{7}}, pages = {{721----735}}, title = {{{Network of Information (NetInf) - An information-centric networking architecture}}}, doi = {{10.1016/j.comcom.2013.01.009}}, year = {{2013}}, } @article{771, author = {{Dräxler, Martin and Biermann, Thorsten and Karl, Holger}}, journal = {{International Journal of Wireless Information Networks}}, number = {{3}}, pages = {{183----194}}, title = {{{Improving Cooperative Transmission Feasibility by Network Reconfiguration in Limited Backhaul Networks}}}, doi = {{10.1007/s10776-013-0207-7}}, year = {{2013}}, } @inproceedings{772, author = {{Hohenberger, Till and Herlich, Matthias and Karl, Holger}}, booktitle = {{IEEE International Conference on Advanced Networks and Telecommunications Systems, ANTS 2013, Kattankulathur, India, December 15-18, 2013}}, pages = {{1----6}}, title = {{{Trade-off between latency and coverage in cooperative radio access networks}}}, doi = {{10.1109/ANTS.2013.6802869}}, year = {{2013}}, } @inproceedings{773, author = {{M. Facca, Federico and Salvadori, Elio and Karl, Holger and R. Lopez, Diego and Arranda Gutierrez, Pedro and Kostic, Dejan and Riggio, Roberto}}, booktitle = {{Second European Workshop on Software Defined Networks, EWSDN 2013, Berlin, Germany, October 10-11, 2013}}, pages = {{105----110}}, title = {{{NetIDE: First Steps towards an Integrated Development Environment for Portable Network Apps}}}, doi = {{10.1109/EWSDN.2013.24}}, year = {{2013}}, } @inproceedings{774, author = {{Cicconetti, Claudio and Morelli, Arianna and Dräxler, Martin and Karl, Holger and Mancuso, Vincenzo and Sciancalepore, Vincenzo and Gupta, Rohit and de la Oliva, Antonio and Isabel Sanchez, M. and Serrano, Pablo and Roullet, Laurent}}, booktitle = {{2013 Future Network & Mobile Summit, Lisboa, Portugal, July 3-5, 2013}}, pages = {{1----4}}, title = {{{The playground of Wireless Dense networks of the future}}}, year = {{2013}}, } @inproceedings{775, author = {{Keller, Matthias and Peuster, Manuel and Robbert, Christoph and Karl, Holger}}, booktitle = {{17th International Conference on Intelligence in Next Generation Networks, {ICIN} 2013, Venice, Italy, October 15-16, 2013}}, pages = {{61----69}}, title = {{{A topology-aware adaptive deployment framework for elastic applications}}}, doi = {{10.1109/ICIN.2013.6670895}}, year = {{2013}}, } @inproceedings{776, author = {{Herlich, Matthias and Karl, Holger}}, booktitle = {{ISWCS 2013, The Tenth International Symposium on Wireless Communication Systems, Ilmenau, Germany, August 27-30, 2013}}, pages = {{1----5}}, title = {{{Energy-Efficient Assignment of User Equipment to Cooperative Base Stations}}}, year = {{2013}}, } @inproceedings{777, author = {{Dräxler, Martin and Karl, Holger}}, booktitle = {{2013 9th International Wireless Communications and Mobile Computing Conference, IWCMC 2013, Sardinia, Italy, July 1-5, 2013}}, pages = {{1181----1186}}, title = {{{Cross-layer scheduling for multi-quality video streaming in cellular wireless networks}}}, doi = {{10.1109/IWCMC.2013.6583724}}, year = {{2013}}, } @unpublished{781, author = {{Dräxler, Martin and Blobel, Johannes and Dreimann, Philipp and Valentin, Stefan and Karl, Holger}}, booktitle = {{CoRR}}, title = {{{Anticipatory Buffer Control and Quality Selection for Wireless Video Streaming}}}, year = {{2013}}, } @inproceedings{470, abstract = {{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.}}, author = {{Wette, Philip and Karl, Holger}}, booktitle = {{Proceedings of the ACM SIGCOMM '13}}, pages = {{541--542}}, title = {{{Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow}}}, doi = {{10.1145/2486001.2491710}}, year = {{2013}}, } @misc{490, author = {{Wallaschek, Felix}}, publisher = {{Universität Paderborn}}, title = {{{Routing in heterogenen OpenFlow Netzwerken}}}, year = {{2013}}, } @misc{492, author = {{Robbert, Christoph}}, publisher = {{Universität Paderborn}}, title = {{{Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained Case}}}, year = {{2013}}, } @inproceedings{496, abstract = {{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.}}, author = {{Benter, Markus and Neumann, Florentin and Frey, Hannes}}, booktitle = {{Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)}}, pages = {{2193--2201}}, title = {{{Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks}}}, doi = {{10.1109/INFCOM.2013.6567022}}, year = {{2013}}, } @article{769, author = {{Biermann, Thorsten and Scalia, Luca and Choi, Changsoon and Kellerer, Wolfgang and Karl, Holger}}, journal = {{{IEEE} Communications Magazine}}, number = {{8}}, title = {{{How backhaul networks influence the feasibility of coordinated multipoint in cellular networks}}}, doi = {{10.1109/MCOM.2013.6576356}}, year = {{2013}}, } @inproceedings{508, abstract = {{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.}}, author = {{Wette, Philip and Karl, Holger}}, booktitle = {{Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)}}, pages = {{1 -- 6 }}, title = {{{On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks}}}, doi = {{10.1109/LANMAN.2013.6528271}}, year = {{2013}}, } @inproceedings{509, abstract = {{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.}}, author = {{Autenrieth, Marcus and Frey, Hannes}}, booktitle = {{Proceedings of the Conference on Networked Systems (NetSys)}}, pages = {{126--131}}, title = {{{On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings}}}, doi = {{10.1109/NetSys.2013.10}}, year = {{2013}}, } @misc{511, author = {{Splietker, Malte}}, publisher = {{Universität Paderborn}}, title = {{{MapReduce in Software Defined Networks}}}, year = {{2013}}, } @inproceedings{520, abstract = {{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.}}, author = {{Wette, Philip and Karl, Holger}}, booktitle = {{Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)}}, pages = {{51--52}}, title = {{{Incorporating feedback from application layer into routing and wavelength assignment algorithms}}}, doi = {{10.1109/INFCOMW.2013.6970733}}, year = {{2013}}, } @misc{525, author = {{Niklas Vinkemeier, Tim}}, publisher = {{Universität Paderborn}}, title = {{{Haptics - Hadoop performance testing in concurrent job scenarios}}}, year = {{2013}}, } @misc{534, author = {{Satya, Suhas}}, publisher = {{Universität Paderborn}}, title = {{{Emulating Wavelength Division Multiplexing using Openflow}}}, year = {{2013}}, } @inproceedings{562, abstract = {{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.}}, author = {{Keller, Matthias and Pawlik, Stefan and Pietrzyk, Peter and Karl, Holger}}, booktitle = {{Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing}}, pages = {{429--434}}, title = {{{A Local Heuristic for Latency-Optimized Distributed Cloud Deployment}}}, doi = {{10.1109/UCC.2013.85}}, year = {{2013}}, } @techreport{2504, author = {{Khan, Rana Azeem M. and Karl, Holger}}, title = {{{Simulating Cooperative Diversity Protocols for Multi-hop Wireless and Sensor Networks}}}, year = {{2012}}, } @techreport{2505, author = {{Dannewitz, Christian and Karl, Holger and Yadav, Aditya}}, title = {{{Report on Locality in DNS Requests – Evaluation and Impact on Future Internet Architectures}}}, year = {{2012}}, } @inproceedings{1805, author = {{Biermann, T. and Scalia, L.}}, booktitle = {{2011 IEEE Global Telecommunications Conference - GLOBECOM 2011}}, isbn = {{9781424492688}}, publisher = {{IEEE}}, title = {{{Mobile WDM Backhaul Access Networks with Physical Inter-Base-Station Links for Coordinated Multipoint Transmission/Reception Systems}}}, doi = {{10.1109/glocom.2011.6133510}}, year = {{2012}}, } @inproceedings{1806, author = {{Choi, Changsoon and Scalia, Luca and Biermann, Thorsten and Mizuta, Shinj}}, booktitle = {{2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications}}, isbn = {{9781457713484}}, publisher = {{IEEE}}, title = {{{Coordinated multipoint multiuser-MIMO transmissions over backhaul-constrained mobile access networks}}}, doi = {{10.1109/pimrc.2011.6139719}}, year = {{2012}}, } @article{782, author = {{Biermann, Thorsten and Scalia, Luca and Choi, Changsoon and Karl, Holger and Kellerer, Wolfgang}}, journal = {{Pervasive and Mobile Computing}}, number = {{5}}, pages = {{662----681}}, title = {{{CoMP clustering and backhaul limitations in cooperative cellular mobile access networks}}}, doi = {{10.1016/j.pmcj.2012.03.005}}, year = {{2012}}, } @article{783, author = {{Willig, Andreas and Karl, Holger and Kipnis, Danil}}, journal = {{Wireless Networks}}, number = {{2}}, pages = {{199----213}}, title = {{{Segment-based packet combining: how to schedule a dense relayer cluster?}}}, doi = {{10.1007/s11276-011-0395-y}}, year = {{2012}}, } @inproceedings{784, author = {{Herlich, Matthias and Karl, Holger}}, booktitle = {{Proceedings of the 3rd International Conference on Energy-Efficient Computing and Networking, e-Energy'12, Madrid, Spain, May 9-11, 2012}}, pages = {{14}}, title = {{{Average and competitive analysis of latency and power consumption of a queuing system with a sleep mode}}}, doi = {{10.1145/2208828.2208842}}, year = {{2012}}, } @inproceedings{785, author = {{Blanckenstein, Johannes and Klaue, Jirka and Karl, Holger}}, booktitle = {{European Wireless 2012 - 18th European Conference 2012, April 18-20, 2012, Poznan, Poland.}}, title = {{{Energy Efficient Clustering using a Wake-up Receiver}}}, year = {{2012}}, } @inproceedings{786, author = {{Künsemöller, Jörn and Karl, Holger}}, booktitle = {{Economics of Grids, Clouds, Systems, and Services - 9th International Conference, GECON 2012, Berlin, Germany, November 27-28, 2012. Proceedings}}, pages = {{125----138}}, title = {{{On Local Separation of Processing and Storage in Infrastructure-as-a-Service}}}, doi = {{10.1007/978-3-642-35194-5_10}}, year = {{2012}}, } @inproceedings{787, author = {{Dräxler, Martin and Karl, Holger}}, booktitle = {{2012 IEEE International Conference on Green Computing and Communications, Conference on Internet of Things, and Conference on Cyber, Physical and Social Computing, GreenCom/iThings/CPSCom 2012, Besancon, France, November 20-23, 2012}}, pages = {{581----587}}, title = {{{Efficiency of On-Path and Off-Path Caching Strategies in Information Centric Networks}}}, doi = {{10.1109/GreenCom.2012.82}}, year = {{2012}}, } @inproceedings{788, author = {{Dannewitz, Christian and Herlich, Matthias and Karl, Holger}}, booktitle = {{37th Annual IEEE Conference on Local Computer Networks, Workshop Proceedings, Clearwater Beach, FL, USA, October 22-25, 2012}}, pages = {{1061----1069}}, title = {{{OpenNetInf - prototyping an information-centric Network Architecture}}}, doi = {{10.1109/LCNW.2012.6424044}}, year = {{2012}}, } @inproceedings{789, author = {{Dräxler, Martin and Biermann, Thorsten and Karl, Holger and Kellerer, Wolfgang}}, booktitle = {{23rd IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2012, Sydney, Australia, September 9-12, 2012}}, pages = {{1383----1389}}, title = {{{Cooperating base station set selection and network reconfiguration in limited backhaul networks}}}, doi = {{10.1109/PIMRC.2012.6362563}}, year = {{2012}}, } @inproceedings{790, author = {{Dräxler, Martin and Beister, Frederic and Kruska, Stephan and Aelken, J. and Karl, Holger}}, booktitle = {{International ICST Conference on Simulation Tools and Techniques, SIMUTOOLS '12, Sirmione-Desenzano, Italy, March 19-23, 2012}}, pages = {{157----165}}, title = {{{Using OMNeT++ for energy optimization simulations in mobile core networks}}}, doi = {{10.4108/icst.simutools.2012.247676}}, year = {{2012}}, } @inproceedings{791, author = {{Volkhausen, Tobias and Schinköthe, Kai and Karl, Holger}}, booktitle = {{2012 IEEE Wireless Communications and Networking Conference, WCNC 2012, Paris, France, April 1-4, 2012}}, pages = {{575----580}}, title = {{{Quantization techniques for accurate soft message combining}}}, doi = {{10.1109/WCNC.2012.6214434}}, year = {{2012}}, } @inproceedings{792, author = {{Volkhausen, Tobias and Dridger, Kornelius and S. Lichte, Hermann and Karl, Holger}}, booktitle = {{10th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), Paderborn, Germany, May 14-18, 2012}}, pages = {{299----304}}, title = {{{Efficient cooperative relaying in wireless multi-hop networks with commodity WiFi hardware}}}, year = {{2012}}, } @misc{584, author = {{Hohenberger, Till}}, publisher = {{Universität Paderborn}}, title = {{{Queuing Latency at Cooperative Base Stations}}}, year = {{2012}}, } @misc{593, author = {{Rojahn, Tobias}}, publisher = {{Universität Paderborn}}, title = {{{Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten}}}, year = {{2012}}, } @techreport{603, abstract = {{Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established lightpaths in case not enough resources are available to setup 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 by the RWA algorithm. Otherwise it might happen that by preempting a particular lightpath these requirements are violated. If, however, these requirements include parameters only known at the nodes running the application, the RWA algorithm cannot evaluate the requirements. For this reason a RWA algorithm is needed which involves its users in the preemption decisions. We present a family of preemptive RWA algorithms for WDM networks. These algorithms have two distinguishing features: a) they can handle dynamic traffic by on-the-fly reconfiguration, and b) users can give feedback for reconfiguration decisions and thus influence the preemption decision of the RWA algorithm, leading to networks which adapt directly to application needs. This is different from traffic engineering where the network is (slowly) adapted to observed traffic patterns. Our algorithms handle various WDM network configurations including networks consisting of heterogeneous WDM hardware. To this end, we are using the layered graph approach together with a newly developed graph model that is used to determine conflicting lightpaths.}}, author = {{Wette, Philip and Karl, Holger}}, publisher = {{Universität Paderborn}}, title = {{{Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios}}}, year = {{2012}}, } @inbook{2662, author = {{Dannewitz, Christian and al, et}}, booktitle = {{Architecture and Design for the Future Internet}}, title = {{{How to manage and Search/Retrieve Information Objects}}}, year = {{2011}}, } @inbook{2663, author = {{Dannewitz, Christian and al, et}}, booktitle = {{Architecture and Design for the Future Internet}}, title = {{{Integrating Generic Paths and NetInf}}}, year = {{2011}}, } @inproceedings{1807, author = {{Scalia, Luca and Biermann, Thorsten and Choi, Changsoon and Kozu, Kazuyuki and Kellerer, Wolfgang}}, booktitle = {{2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)}}, isbn = {{9781457702495}}, publisher = {{IEEE}}, title = {{{Power-efficient mobile backhaul design for CoMP support in future wireless access systems}}}, doi = {{10.1109/infcomw.2011.5928819}}, year = {{2011}}, }