[{"has_accepted_license":"1","page":"2193-2201","citation":{"short":"M. Benter, F. Neumann, H. Frey, in: Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), 2013, pp. 2193–2201.","bibtex":"@inproceedings{Benter_Neumann_Frey_2013, title={Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks}, DOI={<a href=\"https://doi.org/10.1109/INFCOM.2013.6567022\">10.1109/INFCOM.2013.6567022</a>}, booktitle={Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)}, author={Benter, Markus and Neumann, Florentin and Frey, Hannes}, year={2013}, pages={2193–2201} }","mla":"Benter, Markus, et al. “Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks.” <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>, 2013, pp. 2193–201, doi:<a href=\"https://doi.org/10.1109/INFCOM.2013.6567022\">10.1109/INFCOM.2013.6567022</a>.","apa":"Benter, M., Neumann, F., &#38; Frey, H. (2013). Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks. In <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i> (pp. 2193–2201). <a href=\"https://doi.org/10.1109/INFCOM.2013.6567022\">https://doi.org/10.1109/INFCOM.2013.6567022</a>","ama":"Benter M, Neumann F, Frey H. Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks. In: <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>. ; 2013:2193-2201. doi:<a href=\"https://doi.org/10.1109/INFCOM.2013.6567022\">10.1109/INFCOM.2013.6567022</a>","ieee":"M. Benter, F. Neumann, and H. Frey, “Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks,” in <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>, 2013, pp. 2193–2201.","chicago":"Benter, Markus, Florentin Neumann, and Hannes Frey. “Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks.” In <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>, 2193–2201, 2013. <a href=\"https://doi.org/10.1109/INFCOM.2013.6567022\">https://doi.org/10.1109/INFCOM.2013.6567022</a>."},"year":"2013","date_created":"2017-10-17T12:42:29Z","author":[{"first_name":"Markus","full_name":"Benter, Markus","last_name":"Benter"},{"last_name":"Neumann","full_name":"Neumann, Florentin","first_name":"Florentin"},{"first_name":"Hannes","last_name":"Frey","full_name":"Frey, Hannes"}],"date_updated":"2022-01-06T07:01:31Z","doi":"10.1109/INFCOM.2013.6567022","title":"Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks","publication":"Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)","type":"conference","status":"public","file":[{"file_size":352571,"file_name":"496-reactivePDT-copyright.pdf","access_level":"closed","file_id":"1312","date_updated":"2018-03-15T13:41:34Z","date_created":"2018-03-15T13:41:34Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"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."}],"department":[{"_id":"75"}],"user_id":"15504","_id":"496","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file_date_updated":"2018-03-15T13:41:34Z","ddc":["040"]},{"year":"2013","citation":{"ama":"Biermann T, Scalia L, Choi C, Kellerer W, Karl H. How backhaul networks influence the feasibility of coordinated multipoint in cellular networks. <i>{IEEE} Communications Magazine</i>. 2013;(8). doi:<a href=\"https://doi.org/10.1109/MCOM.2013.6576356\">10.1109/MCOM.2013.6576356</a>","ieee":"T. Biermann, L. Scalia, C. Choi, W. Kellerer, and H. Karl, “How backhaul networks influence the feasibility of coordinated multipoint in cellular networks,” <i>{IEEE} Communications Magazine</i>, no. 8, 2013.","chicago":"Biermann, Thorsten, Luca Scalia, Changsoon Choi, Wolfgang Kellerer, and Holger Karl. “How Backhaul Networks Influence the Feasibility of Coordinated Multipoint in Cellular Networks.” <i>{IEEE} Communications Magazine</i>, no. 8 (2013). <a href=\"https://doi.org/10.1109/MCOM.2013.6576356\">https://doi.org/10.1109/MCOM.2013.6576356</a>.","bibtex":"@article{Biermann_Scalia_Choi_Kellerer_Karl_2013, title={How backhaul networks influence the feasibility of coordinated multipoint in cellular networks}, DOI={<a href=\"https://doi.org/10.1109/MCOM.2013.6576356\">10.1109/MCOM.2013.6576356</a>}, number={8}, journal={{IEEE} Communications Magazine}, author={Biermann, Thorsten and Scalia, Luca and Choi, Changsoon and Kellerer, Wolfgang and Karl, Holger}, year={2013} }","short":"T. Biermann, L. Scalia, C. Choi, W. Kellerer, H. Karl, {IEEE} Communications Magazine (2013).","mla":"Biermann, Thorsten, et al. “How Backhaul Networks Influence the Feasibility of Coordinated Multipoint in Cellular Networks.” <i>{IEEE} Communications Magazine</i>, no. 8, 2013, doi:<a href=\"https://doi.org/10.1109/MCOM.2013.6576356\">10.1109/MCOM.2013.6576356</a>.","apa":"Biermann, T., Scalia, L., Choi, C., Kellerer, W., &#38; Karl, H. (2013). How backhaul networks influence the feasibility of coordinated multipoint in cellular networks. <i>{IEEE} Communications Magazine</i>, (8). <a href=\"https://doi.org/10.1109/MCOM.2013.6576356\">https://doi.org/10.1109/MCOM.2013.6576356</a>"},"issue":"8","title":"How backhaul networks influence the feasibility of coordinated multipoint in cellular networks","doi":"10.1109/MCOM.2013.6576356","date_updated":"2022-01-06T07:03:44Z","author":[{"full_name":"Biermann, Thorsten","last_name":"Biermann","first_name":"Thorsten"},{"full_name":"Scalia, Luca","last_name":"Scalia","first_name":"Luca"},{"first_name":"Changsoon","full_name":"Choi, Changsoon","last_name":"Choi"},{"last_name":"Kellerer","full_name":"Kellerer, Wolfgang","first_name":"Wolfgang"},{"first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger"}],"date_created":"2017-11-27T10:22:26Z","status":"public","publication":"{IEEE} Communications Magazine","type":"journal_article","_id":"769","department":[{"_id":"75"}],"user_id":"15572"},{"date_updated":"2022-01-06T07:01:37Z","date_created":"2017-10-17T12:42:31Z","author":[{"first_name":"Philip","full_name":"Wette, Philip","last_name":"Wette"},{"full_name":"Karl, Holger","id":"126","last_name":"Karl","first_name":"Holger"}],"title":"On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks","doi":"10.1109/LANMAN.2013.6528271","has_accepted_license":"1","year":"2013","page":"1 - 6 ","citation":{"mla":"Wette, Philip, and Holger Karl. “On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks.” <i>Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)</i>, 2013, pp. 1–6, doi:<a href=\"https://doi.org/10.1109/LANMAN.2013.6528271\">10.1109/LANMAN.2013.6528271</a>.","short":"P. Wette, H. Karl, in: Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN), 2013, pp. 1–6.","bibtex":"@inproceedings{Wette_Karl_2013, title={On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks}, DOI={<a href=\"https://doi.org/10.1109/LANMAN.2013.6528271\">10.1109/LANMAN.2013.6528271</a>}, booktitle={Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)}, author={Wette, Philip and Karl, Holger}, year={2013}, pages={1–6} }","apa":"Wette, P., &#38; Karl, H. (2013). On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks. In <i>Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)</i> (pp. 1–6). <a href=\"https://doi.org/10.1109/LANMAN.2013.6528271\">https://doi.org/10.1109/LANMAN.2013.6528271</a>","ieee":"P. Wette and H. Karl, “On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks,” in <i>Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)</i>, 2013, pp. 1–6.","chicago":"Wette, Philip, and Holger Karl. “On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks.” In <i>Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)</i>, 1–6, 2013. <a href=\"https://doi.org/10.1109/LANMAN.2013.6528271\">https://doi.org/10.1109/LANMAN.2013.6528271</a>.","ama":"Wette P, Karl H. On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks. In: <i>Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)</i>. ; 2013:1-6. doi:<a href=\"https://doi.org/10.1109/LANMAN.2013.6528271\">10.1109/LANMAN.2013.6528271</a>"},"_id":"508","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"75"}],"user_id":"15572","ddc":["040"],"file_date_updated":"2018-03-15T10:50:19Z","publication":"Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)","type":"conference","abstract":[{"lang":"eng","text":"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."}],"status":"public","file":[{"date_updated":"2018-03-15T10:50:19Z","date_created":"2018-03-15T10:50:19Z","creator":"florida","file_size":219902,"file_name":"508-06528271.pdf","access_level":"closed","file_id":"1307","content_type":"application/pdf","success":1,"relation":"main_file"}]},{"abstract":[{"text":"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.","lang":"eng"}],"file":[{"date_updated":"2018-03-15T10:46:51Z","creator":"florida","date_created":"2018-03-15T10:46:51Z","file_size":197048,"file_name":"509-06529245.pdf","access_level":"closed","file_id":"1304","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","type":"conference","publication":"Proceedings of the Conference on Networked Systems (NetSys)","ddc":["040"],"file_date_updated":"2018-03-15T10:46:51Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"509","user_id":"15504","department":[{"_id":"75"}],"year":"2013","citation":{"apa":"Autenrieth, M., &#38; Frey, H. (2013). On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings. In <i>Proceedings of the Conference on Networked Systems (NetSys)</i> (pp. 126–131). <a href=\"https://doi.org/10.1109/NetSys.2013.10\">https://doi.org/10.1109/NetSys.2013.10</a>","short":"M. Autenrieth, H. Frey, in: Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 126–131.","bibtex":"@inproceedings{Autenrieth_Frey_2013, title={On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings}, DOI={<a href=\"https://doi.org/10.1109/NetSys.2013.10\">10.1109/NetSys.2013.10</a>}, booktitle={Proceedings of the Conference on Networked Systems (NetSys)}, author={Autenrieth, Marcus and Frey, Hannes}, year={2013}, pages={126–131} }","mla":"Autenrieth, Marcus, and Hannes Frey. “On Greedy Routing in Degree-Bounded Graphs over d-Dimensional Internet Coordinate Embeddings.” <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 2013, pp. 126–31, doi:<a href=\"https://doi.org/10.1109/NetSys.2013.10\">10.1109/NetSys.2013.10</a>.","ieee":"M. Autenrieth and H. Frey, “On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings,” in <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 2013, pp. 126–131.","chicago":"Autenrieth, Marcus, and Hannes Frey. “On Greedy Routing in Degree-Bounded Graphs over d-Dimensional Internet Coordinate Embeddings.” In <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 126–31, 2013. <a href=\"https://doi.org/10.1109/NetSys.2013.10\">https://doi.org/10.1109/NetSys.2013.10</a>.","ama":"Autenrieth M, Frey H. On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings. In: <i>Proceedings of the Conference on Networked Systems (NetSys)</i>. ; 2013:126-131. doi:<a href=\"https://doi.org/10.1109/NetSys.2013.10\">10.1109/NetSys.2013.10</a>"},"page":"126-131","has_accepted_license":"1","title":"On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings","doi":"10.1109/NetSys.2013.10","date_updated":"2022-01-06T07:01:37Z","date_created":"2017-10-17T12:42:31Z","author":[{"last_name":"Autenrieth","full_name":"Autenrieth, Marcus","first_name":"Marcus"},{"first_name":"Hannes","last_name":"Frey","full_name":"Frey, Hannes"}]},{"title":"MapReduce in Software Defined Networks","date_created":"2017-10-17T12:42:32Z","author":[{"first_name":"Malte","last_name":"Splietker","full_name":"Splietker, Malte"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:38Z","citation":{"apa":"Splietker, M. (2013). <i>MapReduce in Software Defined Networks</i>. Universität Paderborn.","bibtex":"@book{Splietker_2013, title={MapReduce in Software Defined Networks}, publisher={Universität Paderborn}, author={Splietker, Malte}, year={2013} }","mla":"Splietker, Malte. <i>MapReduce in Software Defined Networks</i>. Universität Paderborn, 2013.","short":"M. Splietker, MapReduce in Software Defined Networks, Universität Paderborn, 2013.","ama":"Splietker M. <i>MapReduce in Software Defined Networks</i>. Universität Paderborn; 2013.","chicago":"Splietker, Malte. <i>MapReduce in Software Defined Networks</i>. Universität Paderborn, 2013.","ieee":"M. Splietker, <i>MapReduce in Software Defined Networks</i>. Universität Paderborn, 2013."},"year":"2013","user_id":"15504","department":[{"_id":"75"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"511","status":"public","type":"bachelorsthesis"},{"date_updated":"2022-01-06T07:01:43Z","author":[{"last_name":"Wette","full_name":"Wette, Philip","first_name":"Philip"},{"first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger","id":"126"}],"date_created":"2017-10-17T12:42:33Z","title":"Incorporating feedback from application layer into routing and wavelength assignment algorithms","main_file_link":[{"url":"http://ieeexplore.ieee.org/document/6970733/"}],"doi":"10.1109/INFCOMW.2013.6970733","has_accepted_license":"1","year":"2013","citation":{"apa":"Wette, P., &#38; Karl, H. (2013). Incorporating feedback from application layer into routing and wavelength assignment algorithms. In <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i> (pp. 51–52). <a href=\"https://doi.org/10.1109/INFCOMW.2013.6970733\">https://doi.org/10.1109/INFCOMW.2013.6970733</a>","bibtex":"@inproceedings{Wette_Karl_2013, title={Incorporating feedback from application layer into routing and wavelength assignment algorithms}, DOI={<a href=\"https://doi.org/10.1109/INFCOMW.2013.6970733\">10.1109/INFCOMW.2013.6970733</a>}, booktitle={Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)}, author={Wette, Philip and Karl, Holger}, year={2013}, pages={51–52} }","short":"P. Wette, H. Karl, in: Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), 2013, pp. 51–52.","mla":"Wette, Philip, and Holger Karl. “Incorporating Feedback from Application Layer into Routing and Wavelength Assignment Algorithms.” <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>, 2013, pp. 51–52, doi:<a href=\"https://doi.org/10.1109/INFCOMW.2013.6970733\">10.1109/INFCOMW.2013.6970733</a>.","chicago":"Wette, Philip, and Holger Karl. “Incorporating Feedback from Application Layer into Routing and Wavelength Assignment Algorithms.” In <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>, 51–52, 2013. <a href=\"https://doi.org/10.1109/INFCOMW.2013.6970733\">https://doi.org/10.1109/INFCOMW.2013.6970733</a>.","ieee":"P. Wette and H. Karl, “Incorporating feedback from application layer into routing and wavelength assignment algorithms,” in <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>, 2013, pp. 51–52.","ama":"Wette P, Karl H. Incorporating feedback from application layer into routing and wavelength assignment algorithms. In: <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>. ; 2013:51-52. doi:<a href=\"https://doi.org/10.1109/INFCOMW.2013.6970733\">10.1109/INFCOMW.2013.6970733</a>"},"page":"51-52","project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"520","user_id":"15504","department":[{"_id":"75"}],"ddc":["040"],"file_date_updated":"2018-03-15T10:38:04Z","type":"conference","publication":"Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)","abstract":[{"text":"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.","lang":"eng"}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-15T10:38:04Z","creator":"florida","date_created":"2018-03-15T10:38:04Z","file_size":131502,"access_level":"closed","file_id":"1298","file_name":"520-wetteinfocom2013.pdf"}],"status":"public"},{"title":"Haptics - Hadoop performance testing in concurrent job scenarios","date_updated":"2022-01-06T07:01:48Z","publisher":"Universität Paderborn","author":[{"first_name":"Tim","full_name":"Niklas Vinkemeier, Tim","last_name":"Niklas Vinkemeier"}],"date_created":"2017-10-17T12:42:34Z","year":"2013","citation":{"apa":"Niklas Vinkemeier, T. (2013). <i>Haptics - Hadoop performance testing in concurrent job scenarios</i>. Universität Paderborn.","mla":"Niklas Vinkemeier, Tim. <i>Haptics - Hadoop Performance Testing in Concurrent Job Scenarios</i>. Universität Paderborn, 2013.","bibtex":"@book{Niklas Vinkemeier_2013, title={Haptics - Hadoop performance testing in concurrent job scenarios}, publisher={Universität Paderborn}, author={Niklas Vinkemeier, Tim}, year={2013} }","short":"T. Niklas Vinkemeier, Haptics - Hadoop Performance Testing in Concurrent Job Scenarios, Universität Paderborn, 2013.","ieee":"T. Niklas Vinkemeier, <i>Haptics - Hadoop performance testing in concurrent job scenarios</i>. Universität Paderborn, 2013.","chicago":"Niklas Vinkemeier, Tim. <i>Haptics - Hadoop Performance Testing in Concurrent Job Scenarios</i>. Universität Paderborn, 2013.","ama":"Niklas Vinkemeier T. <i>Haptics - Hadoop Performance Testing in Concurrent Job Scenarios</i>. Universität Paderborn; 2013."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"525","user_id":"15504","department":[{"_id":"75"}],"status":"public","type":"bachelorsthesis"},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"534","user_id":"15504","department":[{"_id":"75"}],"type":"mastersthesis","status":"public","date_updated":"2022-01-06T07:01:50Z","publisher":"Universität Paderborn","author":[{"first_name":"Suhas","full_name":"Satya, Suhas","last_name":"Satya"}],"date_created":"2017-10-17T12:42:36Z","title":"Emulating Wavelength Division Multiplexing using Openflow","year":"2013","citation":{"apa":"Satya, S. (2013). <i>Emulating Wavelength Division Multiplexing using Openflow</i>. Universität Paderborn.","short":"S. Satya, Emulating Wavelength Division Multiplexing Using Openflow, Universität Paderborn, 2013.","bibtex":"@book{Satya_2013, title={Emulating Wavelength Division Multiplexing using Openflow}, publisher={Universität Paderborn}, author={Satya, Suhas}, year={2013} }","mla":"Satya, Suhas. <i>Emulating Wavelength Division Multiplexing Using Openflow</i>. Universität Paderborn, 2013.","ieee":"S. Satya, <i>Emulating Wavelength Division Multiplexing using Openflow</i>. Universität Paderborn, 2013.","chicago":"Satya, Suhas. <i>Emulating Wavelength Division Multiplexing Using Openflow</i>. Universität Paderborn, 2013.","ama":"Satya S. <i>Emulating Wavelength Division Multiplexing Using Openflow</i>. Universität Paderborn; 2013."}},{"author":[{"last_name":"Keller","full_name":"Keller, Matthias","first_name":"Matthias"},{"first_name":"Stefan","full_name":"Pawlik, Stefan","last_name":"Pawlik"},{"full_name":"Pietrzyk, Peter","last_name":"Pietrzyk","first_name":"Peter"},{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"}],"date_created":"2017-10-17T12:42:41Z","date_updated":"2022-01-06T07:02:11Z","doi":"10.1109/UCC.2013.85","title":"A Local Heuristic for Latency-Optimized Distributed Cloud Deployment","has_accepted_license":"1","citation":{"ama":"Keller M, Pawlik S, Pietrzyk P, Karl H. A Local Heuristic for Latency-Optimized Distributed Cloud Deployment. In: <i>Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud Computing</i>. ; 2013:429-434. doi:<a href=\"https://doi.org/10.1109/UCC.2013.85\">10.1109/UCC.2013.85</a>","ieee":"M. Keller, S. Pawlik, P. Pietrzyk, and H. Karl, “A Local Heuristic for Latency-Optimized Distributed Cloud Deployment,” in <i>Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing</i>, 2013, pp. 429–434.","chicago":"Keller, Matthias, Stefan Pawlik, Peter Pietrzyk, and Holger Karl. “A Local Heuristic for Latency-Optimized Distributed Cloud Deployment.” In <i>Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud Computing</i>, 429–34, 2013. <a href=\"https://doi.org/10.1109/UCC.2013.85\">https://doi.org/10.1109/UCC.2013.85</a>.","short":"M. Keller, S. Pawlik, P. Pietrzyk, H. Karl, in: Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud Computing, 2013, pp. 429–434.","bibtex":"@inproceedings{Keller_Pawlik_Pietrzyk_Karl_2013, title={A Local Heuristic for Latency-Optimized Distributed Cloud Deployment}, DOI={<a href=\"https://doi.org/10.1109/UCC.2013.85\">10.1109/UCC.2013.85</a>}, booktitle={Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing}, author={Keller, Matthias and Pawlik, Stefan and Pietrzyk, Peter and Karl, Holger}, year={2013}, pages={429–434} }","mla":"Keller, Matthias, et al. “A Local Heuristic for Latency-Optimized Distributed Cloud Deployment.” <i>Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud Computing</i>, 2013, pp. 429–34, doi:<a href=\"https://doi.org/10.1109/UCC.2013.85\">10.1109/UCC.2013.85</a>.","apa":"Keller, M., Pawlik, S., Pietrzyk, P., &#38; Karl, H. (2013). A Local Heuristic for Latency-Optimized Distributed Cloud Deployment. In <i>Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing</i> (pp. 429–434). <a href=\"https://doi.org/10.1109/UCC.2013.85\">https://doi.org/10.1109/UCC.2013.85</a>"},"page":"429-434","year":"2013","user_id":"477","department":[{"_id":"75"},{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"562","file_date_updated":"2018-03-15T10:25:45Z","language":[{"iso":"eng"}],"ddc":["040"],"type":"conference","publication":"Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing","file":[{"date_created":"2018-03-15T10:25:45Z","creator":"florida","date_updated":"2018-03-15T10:25:45Z","file_name":"562-dcc13_paper.pdf","access_level":"closed","file_id":"1279","file_size":347873,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","abstract":[{"text":"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.","lang":"eng"}]},{"year":"2012","citation":{"mla":"Khan, Rana Azeem M., and Holger Karl. <i>Simulating Cooperative Diversity Protocols for Multi-Hop Wireless and Sensor Networks</i>. 2012.","bibtex":"@book{Khan_Karl_2012, title={Simulating Cooperative Diversity Protocols for Multi-hop Wireless and Sensor Networks}, author={Khan, Rana Azeem M. and Karl, Holger}, year={2012} }","short":"R.A.M. Khan, H. Karl, Simulating Cooperative Diversity Protocols for Multi-Hop Wireless and Sensor Networks, 2012.","apa":"Khan, R. A. M., &#38; Karl, H. (2012). <i>Simulating Cooperative Diversity Protocols for Multi-hop Wireless and Sensor Networks</i>.","ieee":"R. A. M. Khan and H. Karl, <i>Simulating Cooperative Diversity Protocols for Multi-hop Wireless and Sensor Networks</i>. 2012.","chicago":"Khan, Rana Azeem M., and Holger Karl. <i>Simulating Cooperative Diversity Protocols for Multi-Hop Wireless and Sensor Networks</i>, 2012.","ama":"Khan RAM, Karl H. <i>Simulating Cooperative Diversity Protocols for Multi-Hop Wireless and Sensor Networks</i>.; 2012."},"date_updated":"2022-01-06T06:56:44Z","date_created":"2018-04-26T10:33:57Z","author":[{"full_name":"Khan, Rana Azeem M.","last_name":"Khan","first_name":"Rana Azeem M."},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"}],"title":"Simulating Cooperative Diversity Protocols for Multi-hop Wireless and Sensor Networks","main_file_link":[{"url":"https://pdfs.semanticscholar.org/d44f/54184aee09de1c22906b7515976de801d473.pdf"}],"type":"report","status":"public","_id":"2504","department":[{"_id":"75"}],"user_id":"15572"},{"ddc":["000"],"file_date_updated":"2018-04-26T10:37:47Z","_id":"2505","user_id":"15572","department":[{"_id":"75"}],"file":[{"date_created":"2018-04-26T10:37:47Z","creator":"tabu","date_updated":"2018-04-26T10:37:47Z","file_id":"2507","access_level":"closed","file_name":"Dannewitz-Report_on_Locality_in_DNS_Requests.pdf","file_size":284669,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","type":"report","title":"Report on Locality in DNS Requests – Evaluation and Impact on Future Internet Architectures","date_updated":"2022-01-06T06:56:44Z","author":[{"last_name":"Dannewitz","full_name":"Dannewitz, Christian","first_name":"Christian"},{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"},{"last_name":"Yadav","full_name":"Yadav, Aditya","first_name":"Aditya"}],"date_created":"2018-04-26T10:38:06Z","year":"2012","citation":{"short":"C. Dannewitz, H. Karl, A. Yadav, Report on Locality in DNS Requests – Evaluation and Impact on Future Internet Architectures, 2012.","mla":"Dannewitz, Christian, et al. <i>Report on Locality in DNS Requests – Evaluation and Impact on Future Internet Architectures</i>. 2012.","bibtex":"@book{Dannewitz_Karl_Yadav_2012, title={Report on Locality in DNS Requests – Evaluation and Impact on Future Internet Architectures}, author={Dannewitz, Christian and Karl, Holger and Yadav, Aditya}, year={2012} }","apa":"Dannewitz, C., Karl, H., &#38; Yadav, A. (2012). <i>Report on Locality in DNS Requests – Evaluation and Impact on Future Internet Architectures</i>.","ama":"Dannewitz C, Karl H, Yadav A. <i>Report on Locality in DNS Requests – Evaluation and Impact on Future Internet Architectures</i>.; 2012.","chicago":"Dannewitz, Christian, Holger Karl, and Aditya Yadav. <i>Report on Locality in DNS Requests – Evaluation and Impact on Future Internet Architectures</i>, 2012.","ieee":"C. Dannewitz, H. Karl, and A. Yadav, <i>Report on Locality in DNS Requests – Evaluation and Impact on Future Internet Architectures</i>. 2012."},"has_accepted_license":"1"},{"publication":"2011 IEEE Global Telecommunications Conference - GLOBECOM 2011","type":"conference","status":"public","department":[{"_id":"75"}],"user_id":"15572","_id":"1805","publication_identifier":{"isbn":["9781424492688","9781424492664","9781424492671"]},"publication_status":"published","citation":{"apa":"Biermann, T., &#38; Scalia, L. (2012). Mobile WDM Backhaul Access Networks with Physical Inter-Base-Station Links for Coordinated Multipoint Transmission/Reception Systems. In <i>2011 IEEE Global Telecommunications Conference - GLOBECOM 2011</i>. IEEE. <a href=\"https://doi.org/10.1109/glocom.2011.6133510\">https://doi.org/10.1109/glocom.2011.6133510</a>","bibtex":"@inproceedings{Biermann_Scalia_2012, title={Mobile WDM Backhaul Access Networks with Physical Inter-Base-Station Links for Coordinated Multipoint Transmission/Reception Systems}, DOI={<a href=\"https://doi.org/10.1109/glocom.2011.6133510\">10.1109/glocom.2011.6133510</a>}, booktitle={2011 IEEE Global Telecommunications Conference - GLOBECOM 2011}, publisher={IEEE}, author={Biermann, T. and Scalia, L.}, year={2012} }","short":"T. Biermann, L. Scalia, in: 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011, IEEE, 2012.","mla":"Biermann, T., and L. Scalia. “Mobile WDM Backhaul Access Networks with Physical Inter-Base-Station Links for Coordinated Multipoint Transmission/Reception Systems.” <i>2011 IEEE Global Telecommunications Conference - GLOBECOM 2011</i>, IEEE, 2012, doi:<a href=\"https://doi.org/10.1109/glocom.2011.6133510\">10.1109/glocom.2011.6133510</a>.","ama":"Biermann T, Scalia L. Mobile WDM Backhaul Access Networks with Physical Inter-Base-Station Links for Coordinated Multipoint Transmission/Reception Systems. In: <i>2011 IEEE Global Telecommunications Conference - GLOBECOM 2011</i>. IEEE; 2012. doi:<a href=\"https://doi.org/10.1109/glocom.2011.6133510\">10.1109/glocom.2011.6133510</a>","ieee":"T. Biermann and L. Scalia, “Mobile WDM Backhaul Access Networks with Physical Inter-Base-Station Links for Coordinated Multipoint Transmission/Reception Systems,” in <i>2011 IEEE Global Telecommunications Conference - GLOBECOM 2011</i>, 2012.","chicago":"Biermann, T., and L. Scalia. “Mobile WDM Backhaul Access Networks with Physical Inter-Base-Station Links for Coordinated Multipoint Transmission/Reception Systems.” In <i>2011 IEEE Global Telecommunications Conference - GLOBECOM 2011</i>. IEEE, 2012. <a href=\"https://doi.org/10.1109/glocom.2011.6133510\">https://doi.org/10.1109/glocom.2011.6133510</a>."},"year":"2012","date_created":"2018-03-27T08:25:28Z","author":[{"first_name":"T.","last_name":"Biermann","full_name":"Biermann, T."},{"full_name":"Scalia, L.","last_name":"Scalia","first_name":"L."}],"publisher":"IEEE","date_updated":"2022-01-06T06:53:25Z","doi":"10.1109/glocom.2011.6133510","title":"Mobile WDM Backhaul Access Networks with Physical Inter-Base-Station Links for Coordinated Multipoint Transmission/Reception Systems"},{"publisher":"IEEE","date_updated":"2022-01-06T06:53:25Z","author":[{"full_name":"Choi, Changsoon","last_name":"Choi","first_name":"Changsoon"},{"full_name":"Scalia, Luca","last_name":"Scalia","first_name":"Luca"},{"first_name":"Thorsten","last_name":"Biermann","full_name":"Biermann, Thorsten"},{"first_name":"Shinj","last_name":"Mizuta","full_name":"Mizuta, Shinj"}],"date_created":"2018-03-27T08:28:08Z","title":"Coordinated multipoint multiuser-MIMO transmissions over backhaul-constrained mobile access networks","doi":"10.1109/pimrc.2011.6139719","publication_identifier":{"isbn":["9781457713484","9781457713460","9781457713477"]},"publication_status":"published","year":"2012","citation":{"ieee":"C. Choi, L. Scalia, T. Biermann, and S. Mizuta, “Coordinated multipoint multiuser-MIMO transmissions over backhaul-constrained mobile access networks,” in <i>2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications</i>, 2012.","chicago":"Choi, Changsoon, Luca Scalia, Thorsten Biermann, and Shinj Mizuta. “Coordinated Multipoint Multiuser-MIMO Transmissions over Backhaul-Constrained Mobile Access Networks.” In <i>2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications</i>. IEEE, 2012. <a href=\"https://doi.org/10.1109/pimrc.2011.6139719\">https://doi.org/10.1109/pimrc.2011.6139719</a>.","ama":"Choi C, Scalia L, Biermann T, Mizuta S. Coordinated multipoint multiuser-MIMO transmissions over backhaul-constrained mobile access networks. In: <i>2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications</i>. IEEE; 2012. doi:<a href=\"https://doi.org/10.1109/pimrc.2011.6139719\">10.1109/pimrc.2011.6139719</a>","apa":"Choi, C., Scalia, L., Biermann, T., &#38; Mizuta, S. (2012). Coordinated multipoint multiuser-MIMO transmissions over backhaul-constrained mobile access networks. In <i>2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications</i>. IEEE. <a href=\"https://doi.org/10.1109/pimrc.2011.6139719\">https://doi.org/10.1109/pimrc.2011.6139719</a>","mla":"Choi, Changsoon, et al. “Coordinated Multipoint Multiuser-MIMO Transmissions over Backhaul-Constrained Mobile Access Networks.” <i>2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications</i>, IEEE, 2012, doi:<a href=\"https://doi.org/10.1109/pimrc.2011.6139719\">10.1109/pimrc.2011.6139719</a>.","bibtex":"@inproceedings{Choi_Scalia_Biermann_Mizuta_2012, title={Coordinated multipoint multiuser-MIMO transmissions over backhaul-constrained mobile access networks}, DOI={<a href=\"https://doi.org/10.1109/pimrc.2011.6139719\">10.1109/pimrc.2011.6139719</a>}, booktitle={2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications}, publisher={IEEE}, author={Choi, Changsoon and Scalia, Luca and Biermann, Thorsten and Mizuta, Shinj}, year={2012} }","short":"C. Choi, L. Scalia, T. Biermann, S. Mizuta, in: 2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications, IEEE, 2012."},"_id":"1806","department":[{"_id":"75"}],"user_id":"15572","publication":"2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications","type":"conference","status":"public"},{"title":"CoMP clustering and backhaul limitations in cooperative cellular mobile access networks","doi":"10.1016/j.pmcj.2012.03.005","date_updated":"2022-01-06T07:03:46Z","author":[{"first_name":"Thorsten","last_name":"Biermann","full_name":"Biermann, Thorsten"},{"full_name":"Scalia, Luca","last_name":"Scalia","first_name":"Luca"},{"full_name":"Choi, Changsoon","last_name":"Choi","first_name":"Changsoon"},{"full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"},{"first_name":"Wolfgang","last_name":"Kellerer","full_name":"Kellerer, Wolfgang"}],"date_created":"2017-11-27T10:22:26Z","year":"2012","citation":{"ieee":"T. Biermann, L. Scalia, C. Choi, H. Karl, and W. Kellerer, “CoMP clustering and backhaul limitations in cooperative cellular mobile access networks,” <i>Pervasive and Mobile Computing</i>, no. 5, pp. 662--681, 2012.","chicago":"Biermann, Thorsten, Luca Scalia, Changsoon Choi, Holger Karl, and Wolfgang Kellerer. “CoMP Clustering and Backhaul Limitations in Cooperative Cellular Mobile Access Networks.” <i>Pervasive and Mobile Computing</i>, no. 5 (2012): 662--681. <a href=\"https://doi.org/10.1016/j.pmcj.2012.03.005\">https://doi.org/10.1016/j.pmcj.2012.03.005</a>.","ama":"Biermann T, Scalia L, Choi C, Karl H, Kellerer W. CoMP clustering and backhaul limitations in cooperative cellular mobile access networks. <i>Pervasive and Mobile Computing</i>. 2012;(5):662--681. doi:<a href=\"https://doi.org/10.1016/j.pmcj.2012.03.005\">10.1016/j.pmcj.2012.03.005</a>","bibtex":"@article{Biermann_Scalia_Choi_Karl_Kellerer_2012, title={CoMP clustering and backhaul limitations in cooperative cellular mobile access networks}, DOI={<a href=\"https://doi.org/10.1016/j.pmcj.2012.03.005\">10.1016/j.pmcj.2012.03.005</a>}, number={5}, journal={Pervasive and Mobile Computing}, author={Biermann, Thorsten and Scalia, Luca and Choi, Changsoon and Karl, Holger and Kellerer, Wolfgang}, year={2012}, pages={662--681} }","mla":"Biermann, Thorsten, et al. “CoMP Clustering and Backhaul Limitations in Cooperative Cellular Mobile Access Networks.” <i>Pervasive and Mobile Computing</i>, no. 5, 2012, pp. 662--681, doi:<a href=\"https://doi.org/10.1016/j.pmcj.2012.03.005\">10.1016/j.pmcj.2012.03.005</a>.","short":"T. Biermann, L. Scalia, C. Choi, H. Karl, W. Kellerer, Pervasive and Mobile Computing (2012) 662--681.","apa":"Biermann, T., Scalia, L., Choi, C., Karl, H., &#38; Kellerer, W. (2012). CoMP clustering and backhaul limitations in cooperative cellular mobile access networks. <i>Pervasive and Mobile Computing</i>, (5), 662--681. <a href=\"https://doi.org/10.1016/j.pmcj.2012.03.005\">https://doi.org/10.1016/j.pmcj.2012.03.005</a>"},"page":"662--681","issue":"5","_id":"782","user_id":"15572","department":[{"_id":"75"}],"status":"public","type":"journal_article","publication":"Pervasive and Mobile Computing"},{"issue":"2","year":"2012","citation":{"ieee":"A. Willig, H. Karl, and D. Kipnis, “Segment-based packet combining: how to schedule a dense relayer cluster?,” <i>Wireless Networks</i>, no. 2, pp. 199--213, 2012.","chicago":"Willig, Andreas, Holger Karl, and Danil Kipnis. “Segment-Based Packet Combining: How to Schedule a Dense Relayer Cluster?” <i>Wireless Networks</i>, no. 2 (2012): 199--213. <a href=\"https://doi.org/10.1007/s11276-011-0395-y\">https://doi.org/10.1007/s11276-011-0395-y</a>.","ama":"Willig A, Karl H, Kipnis D. Segment-based packet combining: how to schedule a dense relayer cluster? <i>Wireless Networks</i>. 2012;(2):199--213. doi:<a href=\"https://doi.org/10.1007/s11276-011-0395-y\">10.1007/s11276-011-0395-y</a>","short":"A. Willig, H. Karl, D. Kipnis, Wireless Networks (2012) 199--213.","bibtex":"@article{Willig_Karl_Kipnis_2012, title={Segment-based packet combining: how to schedule a dense relayer cluster?}, DOI={<a href=\"https://doi.org/10.1007/s11276-011-0395-y\">10.1007/s11276-011-0395-y</a>}, number={2}, journal={Wireless Networks}, author={Willig, Andreas and Karl, Holger and Kipnis, Danil}, year={2012}, pages={199--213} }","mla":"Willig, Andreas, et al. “Segment-Based Packet Combining: How to Schedule a Dense Relayer Cluster?” <i>Wireless Networks</i>, no. 2, 2012, pp. 199--213, doi:<a href=\"https://doi.org/10.1007/s11276-011-0395-y\">10.1007/s11276-011-0395-y</a>.","apa":"Willig, A., Karl, H., &#38; Kipnis, D. (2012). Segment-based packet combining: how to schedule a dense relayer cluster? <i>Wireless Networks</i>, (2), 199--213. <a href=\"https://doi.org/10.1007/s11276-011-0395-y\">https://doi.org/10.1007/s11276-011-0395-y</a>"},"page":"199--213","date_updated":"2022-01-06T07:03:46Z","date_created":"2017-11-27T10:22:26Z","author":[{"full_name":"Willig, Andreas","last_name":"Willig","first_name":"Andreas"},{"full_name":"Karl, Holger","id":"126","last_name":"Karl","first_name":"Holger"},{"first_name":"Danil","last_name":"Kipnis","full_name":"Kipnis, Danil"}],"title":"Segment-based packet combining: how to schedule a dense relayer cluster?","doi":"10.1007/s11276-011-0395-y","type":"journal_article","publication":"Wireless Networks","status":"public","_id":"783","user_id":"15572","department":[{"_id":"75"}]},{"doi":"10.1145/2208828.2208842","title":"Average and competitive analysis of latency and power consumption of a queuing system with a sleep mode","date_created":"2017-11-27T10:22:26Z","author":[{"first_name":"Matthias","full_name":"Herlich, Matthias","last_name":"Herlich"},{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"}],"date_updated":"2022-01-06T07:03:47Z","page":"14","citation":{"chicago":"Herlich, Matthias, and Holger Karl. “Average and Competitive Analysis of Latency and Power Consumption of a Queuing System with a Sleep Mode.” In <i>Proceedings of the 3rd International Conference on Energy-Efficient Computing and Networking, e-Energy’12, Madrid, Spain, May 9-11, 2012</i>, 14, 2012. <a href=\"https://doi.org/10.1145/2208828.2208842\">https://doi.org/10.1145/2208828.2208842</a>.","ieee":"M. Herlich and H. Karl, “Average and competitive analysis of latency and power consumption of a queuing system with a sleep mode,” in <i>Proceedings of the 3rd International Conference on Energy-Efficient Computing and Networking, e-Energy’12, Madrid, Spain, May 9-11, 2012</i>, 2012, p. 14.","ama":"Herlich M, Karl H. Average and competitive analysis of latency and power consumption of a queuing system with a sleep mode. In: <i>Proceedings of the 3rd International Conference on Energy-Efficient Computing and Networking, e-Energy’12, Madrid, Spain, May 9-11, 2012</i>. ; 2012:14. doi:<a href=\"https://doi.org/10.1145/2208828.2208842\">10.1145/2208828.2208842</a>","apa":"Herlich, M., &#38; Karl, H. (2012). Average and competitive analysis of latency and power consumption of a queuing system with a sleep mode. In <i>Proceedings of the 3rd International Conference on Energy-Efficient Computing and Networking, e-Energy’12, Madrid, Spain, May 9-11, 2012</i> (p. 14). <a href=\"https://doi.org/10.1145/2208828.2208842\">https://doi.org/10.1145/2208828.2208842</a>","short":"M. Herlich, H. Karl, in: Proceedings of the 3rd International Conference on Energy-Efficient Computing and Networking, e-Energy’12, Madrid, Spain, May 9-11, 2012, 2012, p. 14.","bibtex":"@inproceedings{Herlich_Karl_2012, title={Average and competitive analysis of latency and power consumption of a queuing system with a sleep mode}, DOI={<a href=\"https://doi.org/10.1145/2208828.2208842\">10.1145/2208828.2208842</a>}, booktitle={Proceedings of the 3rd International Conference on Energy-Efficient Computing and Networking, e-Energy’12, Madrid, Spain, May 9-11, 2012}, author={Herlich, Matthias and Karl, Holger}, year={2012}, pages={14} }","mla":"Herlich, Matthias, and Holger Karl. “Average and Competitive Analysis of Latency and Power Consumption of a Queuing System with a Sleep Mode.” <i>Proceedings of the 3rd International Conference on Energy-Efficient Computing and Networking, e-Energy’12, Madrid, Spain, May 9-11, 2012</i>, 2012, p. 14, doi:<a href=\"https://doi.org/10.1145/2208828.2208842\">10.1145/2208828.2208842</a>."},"year":"2012","ec_funded":"1","department":[{"_id":"75"}],"user_id":"15572","_id":"784","project":[{"name":"Scalable & Adaptive Internet soLutions","_id":"26","grant_number":"257448","call_identifier":"FP7-ICT-2009-5"}],"status":"public","publication":"Proceedings of the 3rd International Conference on Energy-Efficient Computing and Networking, e-Energy'12, Madrid, Spain, May 9-11, 2012","type":"conference"},{"date_created":"2017-11-27T10:22:26Z","author":[{"first_name":"Johannes","last_name":"Blanckenstein","full_name":"Blanckenstein, Johannes"},{"first_name":"Jirka","last_name":"Klaue","full_name":"Klaue, Jirka"},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"}],"date_updated":"2022-01-06T07:03:47Z","title":"Energy Efficient Clustering using a Wake-up Receiver","citation":{"ieee":"J. Blanckenstein, J. Klaue, and H. Karl, “Energy Efficient Clustering using a Wake-up Receiver,” in <i>European Wireless 2012 - 18th European Conference 2012, April 18-20, 2012, Poznan, Poland.</i>, 2012.","chicago":"Blanckenstein, Johannes, Jirka Klaue, and Holger Karl. “Energy Efficient Clustering Using a Wake-up Receiver.” In <i>European Wireless 2012 - 18th European Conference 2012, April 18-20, 2012, Poznan, Poland.</i>, 2012.","ama":"Blanckenstein J, Klaue J, Karl H. Energy Efficient Clustering using a Wake-up Receiver. In: <i>European Wireless 2012 - 18th European Conference 2012, April 18-20, 2012, Poznan, Poland.</i> ; 2012.","apa":"Blanckenstein, J., Klaue, J., &#38; Karl, H. (2012). Energy Efficient Clustering using a Wake-up Receiver. In <i>European Wireless 2012 - 18th European Conference 2012, April 18-20, 2012, Poznan, Poland.</i>","short":"J. Blanckenstein, J. Klaue, H. Karl, in: European Wireless 2012 - 18th European Conference 2012, April 18-20, 2012, Poznan, Poland., 2012.","mla":"Blanckenstein, Johannes, et al. “Energy Efficient Clustering Using a Wake-up Receiver.” <i>European Wireless 2012 - 18th European Conference 2012, April 18-20, 2012, Poznan, Poland.</i>, 2012.","bibtex":"@inproceedings{Blanckenstein_Klaue_Karl_2012, title={Energy Efficient Clustering using a Wake-up Receiver}, booktitle={European Wireless 2012 - 18th European Conference 2012, April 18-20, 2012, Poznan, Poland.}, author={Blanckenstein, Johannes and Klaue, Jirka and Karl, Holger}, year={2012} }"},"year":"2012","user_id":"15572","department":[{"_id":"75"}],"_id":"785","type":"conference","publication":"European Wireless 2012 - 18th European Conference 2012, April 18-20, 2012, Poznan, Poland.","status":"public"},{"type":"conference","publication":"Economics of Grids, Clouds, Systems, and Services - 9th International Conference, GECON 2012, Berlin, Germany, November 27-28, 2012. Proceedings","status":"public","_id":"786","user_id":"15572","department":[{"_id":"75"}],"year":"2012","citation":{"apa":"Künsemöller, J., &#38; Karl, H. (2012). On Local Separation of Processing and Storage in Infrastructure-as-a-Service. In <i>Economics of Grids, Clouds, Systems, and Services - 9th International Conference, GECON 2012, Berlin, Germany, November 27-28, 2012. Proceedings</i> (pp. 125--138). <a href=\"https://doi.org/10.1007/978-3-642-35194-5_10\">https://doi.org/10.1007/978-3-642-35194-5_10</a>","bibtex":"@inproceedings{Künsemöller_Karl_2012, title={On Local Separation of Processing and Storage in Infrastructure-as-a-Service}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-35194-5_10\">10.1007/978-3-642-35194-5_10</a>}, booktitle={Economics of Grids, Clouds, Systems, and Services - 9th International Conference, GECON 2012, Berlin, Germany, November 27-28, 2012. Proceedings}, author={Künsemöller, Jörn and Karl, Holger}, year={2012}, pages={125--138} }","short":"J. Künsemöller, H. Karl, in: Economics of Grids, Clouds, Systems, and Services - 9th International Conference, GECON 2012, Berlin, Germany, November 27-28, 2012. Proceedings, 2012, pp. 125--138.","mla":"Künsemöller, Jörn, and Holger Karl. “On Local Separation of Processing and Storage in Infrastructure-as-a-Service.” <i>Economics of Grids, Clouds, Systems, and Services - 9th International Conference, GECON 2012, Berlin, Germany, November 27-28, 2012. Proceedings</i>, 2012, pp. 125--138, doi:<a href=\"https://doi.org/10.1007/978-3-642-35194-5_10\">10.1007/978-3-642-35194-5_10</a>.","ama":"Künsemöller J, Karl H. On Local Separation of Processing and Storage in Infrastructure-as-a-Service. In: <i>Economics of Grids, Clouds, Systems, and Services - 9th International Conference, GECON 2012, Berlin, Germany, November 27-28, 2012. Proceedings</i>. ; 2012:125--138. doi:<a href=\"https://doi.org/10.1007/978-3-642-35194-5_10\">10.1007/978-3-642-35194-5_10</a>","ieee":"J. Künsemöller and H. Karl, “On Local Separation of Processing and Storage in Infrastructure-as-a-Service,” in <i>Economics of Grids, Clouds, Systems, and Services - 9th International Conference, GECON 2012, Berlin, Germany, November 27-28, 2012. Proceedings</i>, 2012, pp. 125--138.","chicago":"Künsemöller, Jörn, and Holger Karl. “On Local Separation of Processing and Storage in Infrastructure-as-a-Service.” In <i>Economics of Grids, Clouds, Systems, and Services - 9th International Conference, GECON 2012, Berlin, Germany, November 27-28, 2012. Proceedings</i>, 125--138, 2012. <a href=\"https://doi.org/10.1007/978-3-642-35194-5_10\">https://doi.org/10.1007/978-3-642-35194-5_10</a>."},"page":"125--138","date_updated":"2022-01-06T07:03:47Z","date_created":"2017-11-27T10:22:26Z","author":[{"first_name":"Jörn","full_name":"Künsemöller, Jörn","last_name":"Künsemöller"},{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"}],"title":"On Local Separation of Processing and Storage in Infrastructure-as-a-Service","doi":"10.1007/978-3-642-35194-5_10"},{"year":"2012","page":"581--587","citation":{"apa":"Dräxler, M., &#38; Karl, H. (2012). Efficiency of On-Path and Off-Path Caching Strategies in Information Centric Networks. In <i>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</i> (pp. 581--587). <a href=\"https://doi.org/10.1109/GreenCom.2012.82\">https://doi.org/10.1109/GreenCom.2012.82</a>","bibtex":"@inproceedings{Dräxler_Karl_2012, title={Efficiency of On-Path and Off-Path Caching Strategies in Information Centric Networks}, DOI={<a href=\"https://doi.org/10.1109/GreenCom.2012.82\">10.1109/GreenCom.2012.82</a>}, 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}, author={Dräxler, Martin and Karl, Holger}, year={2012}, pages={581--587} }","mla":"Dräxler, Martin, and Holger Karl. “Efficiency of On-Path and Off-Path Caching Strategies in Information Centric Networks.” <i>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</i>, 2012, pp. 581--587, doi:<a href=\"https://doi.org/10.1109/GreenCom.2012.82\">10.1109/GreenCom.2012.82</a>.","short":"M. Dräxler, H. Karl, in: 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, 2012, pp. 581--587.","chicago":"Dräxler, Martin, and Holger Karl. “Efficiency of On-Path and Off-Path Caching Strategies in Information Centric Networks.” In <i>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</i>, 581--587, 2012. <a href=\"https://doi.org/10.1109/GreenCom.2012.82\">https://doi.org/10.1109/GreenCom.2012.82</a>.","ieee":"M. Dräxler and H. Karl, “Efficiency of On-Path and Off-Path Caching Strategies in Information Centric Networks,” in <i>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</i>, 2012, pp. 581--587.","ama":"Dräxler M, Karl H. Efficiency of On-Path and Off-Path Caching Strategies in Information Centric Networks. In: <i>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</i>. ; 2012:581--587. doi:<a href=\"https://doi.org/10.1109/GreenCom.2012.82\">10.1109/GreenCom.2012.82</a>"},"title":"Efficiency of On-Path and Off-Path Caching Strategies in Information Centric Networks","doi":"10.1109/GreenCom.2012.82","date_updated":"2022-01-06T07:03:47Z","date_created":"2017-11-27T10:22:26Z","author":[{"full_name":"Dräxler, Martin","last_name":"Dräxler","first_name":"Martin"},{"first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger","id":"126"}],"status":"public","publication":"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","type":"conference","_id":"787","department":[{"_id":"75"}],"user_id":"15572"},{"publication":"37th Annual IEEE Conference on Local Computer Networks, Workshop Proceedings, Clearwater Beach, FL, USA, October 22-25, 2012","type":"conference","status":"public","department":[{"_id":"75"}],"user_id":"15572","_id":"788","page":"1061--1069","citation":{"ieee":"C. Dannewitz, M. Herlich, and H. Karl, “OpenNetInf - prototyping an information-centric Network Architecture,” in <i>37th Annual IEEE Conference on Local Computer Networks, Workshop Proceedings, Clearwater Beach, FL, USA, October 22-25, 2012</i>, 2012, pp. 1061--1069.","chicago":"Dannewitz, Christian, Matthias Herlich, and Holger Karl. “OpenNetInf - Prototyping an Information-Centric Network Architecture.” In <i>37th Annual IEEE Conference on Local Computer Networks, Workshop Proceedings, Clearwater Beach, FL, USA, October 22-25, 2012</i>, 1061--1069, 2012. <a href=\"https://doi.org/10.1109/LCNW.2012.6424044\">https://doi.org/10.1109/LCNW.2012.6424044</a>.","ama":"Dannewitz C, Herlich M, Karl H. OpenNetInf - prototyping an information-centric Network Architecture. In: <i>37th Annual IEEE Conference on Local Computer Networks, Workshop Proceedings, Clearwater Beach, FL, USA, October 22-25, 2012</i>. ; 2012:1061--1069. doi:<a href=\"https://doi.org/10.1109/LCNW.2012.6424044\">10.1109/LCNW.2012.6424044</a>","short":"C. Dannewitz, M. Herlich, H. Karl, in: 37th Annual IEEE Conference on Local Computer Networks, Workshop Proceedings, Clearwater Beach, FL, USA, October 22-25, 2012, 2012, pp. 1061--1069.","mla":"Dannewitz, Christian, et al. “OpenNetInf - Prototyping an Information-Centric Network Architecture.” <i>37th Annual IEEE Conference on Local Computer Networks, Workshop Proceedings, Clearwater Beach, FL, USA, October 22-25, 2012</i>, 2012, pp. 1061--1069, doi:<a href=\"https://doi.org/10.1109/LCNW.2012.6424044\">10.1109/LCNW.2012.6424044</a>.","bibtex":"@inproceedings{Dannewitz_Herlich_Karl_2012, title={OpenNetInf - prototyping an information-centric Network Architecture}, DOI={<a href=\"https://doi.org/10.1109/LCNW.2012.6424044\">10.1109/LCNW.2012.6424044</a>}, booktitle={37th Annual IEEE Conference on Local Computer Networks, Workshop Proceedings, Clearwater Beach, FL, USA, October 22-25, 2012}, author={Dannewitz, Christian and Herlich, Matthias and Karl, Holger}, year={2012}, pages={1061--1069} }","apa":"Dannewitz, C., Herlich, M., &#38; Karl, H. (2012). OpenNetInf - prototyping an information-centric Network Architecture. In <i>37th Annual IEEE Conference on Local Computer Networks, Workshop Proceedings, Clearwater Beach, FL, USA, October 22-25, 2012</i> (pp. 1061--1069). <a href=\"https://doi.org/10.1109/LCNW.2012.6424044\">https://doi.org/10.1109/LCNW.2012.6424044</a>"},"year":"2012","author":[{"last_name":"Dannewitz","full_name":"Dannewitz, Christian","first_name":"Christian"},{"full_name":"Herlich, Matthias","last_name":"Herlich","first_name":"Matthias"},{"full_name":"Karl, Holger","id":"126","last_name":"Karl","first_name":"Holger"}],"date_created":"2017-11-27T10:22:26Z","date_updated":"2022-01-06T07:03:47Z","doi":"10.1109/LCNW.2012.6424044","title":"OpenNetInf - prototyping an information-centric Network Architecture"}]