[{"citation":{"apa":"Dornseifer, V. (2014). <i>Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network</i>. Universität Paderborn.","mla":"Dornseifer, Veit. <i>Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network</i>. Universität Paderborn, 2014.","short":"V. Dornseifer, Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network, Universität Paderborn, 2014.","bibtex":"@book{Dornseifer_2014, title={Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network}, publisher={Universität Paderborn}, author={Dornseifer, Veit}, year={2014} }","ieee":"V. Dornseifer, <i>Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network</i>. Universität Paderborn, 2014.","chicago":"Dornseifer, Veit. <i>Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network</i>. Universität Paderborn, 2014.","ama":"Dornseifer V. <i>Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network</i>. Universität Paderborn; 2014."},"year":"2014","title":"Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network","date_created":"2017-10-17T12:42:15Z","author":[{"full_name":"Dornseifer, Veit","last_name":"Dornseifer","first_name":"Veit"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:00:43Z","status":"public","type":"mastersthesis","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":"426"},{"user_id":"15504","department":[{"_id":"75"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"432","status":"public","type":"mastersthesis","title":"Energy-Efficient Queuing with Delayed Deactivation","author":[{"full_name":"Bredenbals, Nico","last_name":"Bredenbals","first_name":"Nico"}],"date_created":"2017-10-17T12:42:16Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:00:54Z","citation":{"bibtex":"@book{Bredenbals_2014, title={Energy-Efficient Queuing with Delayed Deactivation}, publisher={Universität Paderborn}, author={Bredenbals, Nico}, year={2014} }","short":"N. Bredenbals, Energy-Efficient Queuing with Delayed Deactivation, Universität Paderborn, 2014.","mla":"Bredenbals, Nico. <i>Energy-Efficient Queuing with Delayed Deactivation</i>. Universität Paderborn, 2014.","apa":"Bredenbals, N. (2014). <i>Energy-Efficient Queuing with Delayed Deactivation</i>. Universität Paderborn.","chicago":"Bredenbals, Nico. <i>Energy-Efficient Queuing with Delayed Deactivation</i>. Universität Paderborn, 2014.","ieee":"N. Bredenbals, <i>Energy-Efficient Queuing with Delayed Deactivation</i>. Universität Paderborn, 2014.","ama":"Bredenbals N. <i>Energy-Efficient Queuing with Delayed Deactivation</i>. Universität Paderborn; 2014."},"year":"2014"},{"page":"541-542","citation":{"bibtex":"@inproceedings{Wette_Karl_2013, series={Digital Library}, title={Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow}, DOI={<a href=\"https://doi.org/10.1145/2486001.2491710\">10.1145/2486001.2491710</a>}, booktitle={Proceedings of the ACM SIGCOMM ’13}, author={Wette, Philip and Karl, Holger}, year={2013}, pages={541–542}, collection={Digital Library} }","short":"P. Wette, H. Karl, in: Proceedings of the ACM SIGCOMM ’13, 2013, pp. 541–542.","mla":"Wette, Philip, and Holger Karl. “Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow.” <i>Proceedings of the ACM SIGCOMM ’13</i>, 2013, pp. 541–42, doi:<a href=\"https://doi.org/10.1145/2486001.2491710\">10.1145/2486001.2491710</a>.","apa":"Wette, P., &#38; Karl, H. (2013). Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow. In <i>Proceedings of the ACM SIGCOMM ’13</i> (pp. 541–542). <a href=\"https://doi.org/10.1145/2486001.2491710\">https://doi.org/10.1145/2486001.2491710</a>","ama":"Wette P, Karl H. Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow. In: <i>Proceedings of the ACM SIGCOMM ’13</i>. Digital Library. ; 2013:541-542. doi:<a href=\"https://doi.org/10.1145/2486001.2491710\">10.1145/2486001.2491710</a>","ieee":"P. Wette and H. Karl, “Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow,” in <i>Proceedings of the ACM SIGCOMM ’13</i>, 2013, pp. 541–542.","chicago":"Wette, Philip, and Holger Karl. “Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow.” In <i>Proceedings of the ACM SIGCOMM ’13</i>, 541–42. Digital Library, 2013. <a href=\"https://doi.org/10.1145/2486001.2491710\">https://doi.org/10.1145/2486001.2491710</a>."},"year":"2013","has_accepted_license":"1","doi":"10.1145/2486001.2491710","title":"Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow","date_created":"2017-10-17T12:42:23Z","author":[{"first_name":"Philip","full_name":"Wette, Philip","last_name":"Wette"},{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"}],"date_updated":"2022-01-06T07:01:19Z","status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-16T11:18:01Z","creator":"florida","date_created":"2018-03-16T11:18:01Z","file_size":446835,"access_level":"closed","file_name":"470-p541-wette_01.pdf","file_id":"1331"}],"abstract":[{"lang":"eng","text":"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."}],"publication":"Proceedings of the ACM SIGCOMM '13","type":"conference","file_date_updated":"2018-03-16T11:18:01Z","ddc":["040"],"department":[{"_id":"75"}],"series_title":"Digital Library","user_id":"15572","_id":"470","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}]},{"title":"Routing in heterogenen OpenFlow Netzwerken","date_updated":"2022-01-06T07:01:28Z","publisher":"Universität Paderborn","author":[{"full_name":"Wallaschek, Felix","last_name":"Wallaschek","first_name":"Felix"}],"date_created":"2017-10-17T12:42:27Z","year":"2013","citation":{"apa":"Wallaschek, F. (2013). <i>Routing in heterogenen OpenFlow Netzwerken</i>. Universität Paderborn.","short":"F. Wallaschek, Routing in heterogenen OpenFlow Netzwerken, Universität Paderborn, 2013.","bibtex":"@book{Wallaschek_2013, title={Routing in heterogenen OpenFlow Netzwerken}, publisher={Universität Paderborn}, author={Wallaschek, Felix}, year={2013} }","mla":"Wallaschek, Felix. <i>Routing in heterogenen OpenFlow Netzwerken</i>. Universität Paderborn, 2013.","ama":"Wallaschek F. <i>Routing in heterogenen OpenFlow Netzwerken</i>. Universität Paderborn; 2013.","ieee":"F. Wallaschek, <i>Routing in heterogenen OpenFlow Netzwerken</i>. Universität Paderborn, 2013.","chicago":"Wallaschek, Felix. <i>Routing in heterogenen OpenFlow Netzwerken</i>. Universität Paderborn, 2013."},"language":[{"iso":"ger"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"490","user_id":"477","department":[{"_id":"75"}],"status":"public","type":"bachelorsthesis"},{"citation":{"ama":"Robbert C. <i>Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained Case</i>. Universität Paderborn; 2013.","ieee":"C. Robbert, <i>Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained Case</i>. Universität Paderborn, 2013.","chicago":"Robbert, Christoph. <i>Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained Case</i>. Universität Paderborn, 2013.","bibtex":"@book{Robbert_2013, title={Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained Case}, publisher={Universität Paderborn}, author={Robbert, Christoph}, year={2013} }","short":"C. Robbert, Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained Case, Universität Paderborn, 2013.","mla":"Robbert, Christoph. <i>Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained Case</i>. Universität Paderborn, 2013.","apa":"Robbert, C. (2013). <i>Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained Case</i>. Universität Paderborn."},"year":"2013","date_created":"2017-10-17T12:42:28Z","author":[{"last_name":"Robbert","full_name":"Robbert, Christoph","first_name":"Christoph"}],"date_updated":"2022-01-06T07:01:29Z","publisher":"Universität Paderborn","title":"Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained Case","type":"bachelorsthesis","status":"public","department":[{"_id":"75"}],"user_id":"15504","_id":"492","project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}]},{"date_created":"2017-10-17T12:42:29Z","author":[{"first_name":"Markus","last_name":"Benter","full_name":"Benter, Markus"},{"full_name":"Neumann, Florentin","last_name":"Neumann","first_name":"Florentin"},{"last_name":"Frey","full_name":"Frey, Hannes","first_name":"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","has_accepted_license":"1","page":"2193-2201","citation":{"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} }","short":"M. Benter, F. Neumann, H. Frey, in: Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), 2013, pp. 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>","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>.","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.","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>"},"year":"2013","department":[{"_id":"75"}],"user_id":"15504","_id":"496","project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file_date_updated":"2018-03-15T13:41:34Z","ddc":["040"],"publication":"Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)","type":"conference","status":"public","file":[{"date_updated":"2018-03-15T13:41:34Z","creator":"florida","date_created":"2018-03-15T13:41:34Z","file_size":352571,"access_level":"closed","file_id":"1312","file_name":"496-reactivePDT-copyright.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"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.","lang":"eng"}]},{"has_accepted_license":"1","citation":{"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>","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>.","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>"},"page":"1 - 6 ","year":"2013","date_created":"2017-10-17T12:42:31Z","author":[{"first_name":"Philip","last_name":"Wette","full_name":"Wette, Philip"},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"}],"date_updated":"2022-01-06T07:01:37Z","doi":"10.1109/LANMAN.2013.6528271","title":"On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks","type":"conference","publication":"Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":219902,"file_name":"508-06528271.pdf","access_level":"closed","file_id":"1307","date_updated":"2018-03-15T10:50:19Z","date_created":"2018-03-15T10:50:19Z","creator":"florida"}],"status":"public","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."}],"user_id":"15572","department":[{"_id":"75"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"508","file_date_updated":"2018-03-15T10:50:19Z","ddc":["040"]},{"author":[{"full_name":"Autenrieth, Marcus","last_name":"Autenrieth","first_name":"Marcus"},{"full_name":"Frey, Hannes","last_name":"Frey","first_name":"Hannes"}],"date_created":"2017-10-17T12:42:31Z","date_updated":"2022-01-06T07:01:37Z","doi":"10.1109/NetSys.2013.10","title":"On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings","has_accepted_license":"1","citation":{"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>.","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} }","short":"M. Autenrieth, H. Frey, in: Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 126–131.","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>","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>","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>.","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."},"page":"126-131","year":"2013","user_id":"15504","department":[{"_id":"75"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"509","file_date_updated":"2018-03-15T10:46:51Z","ddc":["040"],"type":"conference","publication":"Proceedings of the Conference on Networked Systems (NetSys)","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-15T10:46:51Z","creator":"florida","date_created":"2018-03-15T10:46:51Z","file_size":197048,"file_id":"1304","access_level":"closed","file_name":"509-06529245.pdf"}],"status":"public","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"}]},{"type":"bachelorsthesis","status":"public","user_id":"15504","department":[{"_id":"75"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"511","citation":{"ama":"Splietker M. <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.","chicago":"Splietker, Malte. <i>MapReduce in Software Defined Networks</i>. Universität Paderborn, 2013.","apa":"Splietker, M. (2013). <i>MapReduce in Software Defined Networks</i>. Universität Paderborn.","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.","bibtex":"@book{Splietker_2013, title={MapReduce in Software Defined Networks}, publisher={Universität Paderborn}, author={Splietker, Malte}, year={2013} }"},"year":"2013","author":[{"first_name":"Malte","full_name":"Splietker, Malte","last_name":"Splietker"}],"date_created":"2017-10-17T12:42:32Z","date_updated":"2022-01-06T07:01:38Z","publisher":"Universität Paderborn","title":"MapReduce in Software Defined Networks"},{"citation":{"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>.","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>","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.","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>.","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","year":"2013","has_accepted_license":"1","main_file_link":[{"url":"http://ieeexplore.ieee.org/document/6970733/"}],"doi":"10.1109/INFCOMW.2013.6970733","title":"Incorporating feedback from application layer into routing and wavelength assignment algorithms","date_created":"2017-10-17T12:42:33Z","author":[{"full_name":"Wette, Philip","last_name":"Wette","first_name":"Philip"},{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"}],"date_updated":"2022-01-06T07:01:43Z","file":[{"file_size":131502,"access_level":"closed","file_name":"520-wetteinfocom2013.pdf","file_id":"1298","date_updated":"2018-03-15T10:38:04Z","creator":"florida","date_created":"2018-03-15T10:38:04Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","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"}],"type":"conference","publication":"Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)","file_date_updated":"2018-03-15T10:38:04Z","ddc":["040"],"user_id":"15504","department":[{"_id":"75"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"520"},{"year":"2013","citation":{"apa":"Niklas Vinkemeier, T. (2013). <i>Haptics - Hadoop performance testing in concurrent job scenarios</i>. Universität Paderborn.","bibtex":"@book{Niklas Vinkemeier_2013, title={Haptics - Hadoop performance testing in concurrent job scenarios}, publisher={Universität Paderborn}, author={Niklas Vinkemeier, Tim}, year={2013} }","mla":"Niklas Vinkemeier, Tim. <i>Haptics - Hadoop Performance Testing in Concurrent Job Scenarios</i>. Universität Paderborn, 2013.","short":"T. Niklas Vinkemeier, Haptics - Hadoop Performance Testing in Concurrent Job Scenarios, Universität Paderborn, 2013.","chicago":"Niklas Vinkemeier, Tim. <i>Haptics - Hadoop Performance Testing in Concurrent Job Scenarios</i>. Universität Paderborn, 2013.","ieee":"T. Niklas Vinkemeier, <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."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:48Z","author":[{"first_name":"Tim","last_name":"Niklas Vinkemeier","full_name":"Niklas Vinkemeier, Tim"}],"date_created":"2017-10-17T12:42:34Z","title":"Haptics - Hadoop performance testing in concurrent job scenarios","type":"bachelorsthesis","status":"public","_id":"525","project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"75"}],"user_id":"15504"},{"title":"Emulating Wavelength Division Multiplexing using Openflow","date_created":"2017-10-17T12:42:36Z","author":[{"first_name":"Suhas","last_name":"Satya","full_name":"Satya, Suhas"}],"date_updated":"2022-01-06T07:01:50Z","publisher":"Universität Paderborn","citation":{"ama":"Satya S. <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.","bibtex":"@book{Satya_2013, title={Emulating Wavelength Division Multiplexing using Openflow}, publisher={Universität Paderborn}, author={Satya, Suhas}, year={2013} }","short":"S. Satya, Emulating Wavelength Division Multiplexing Using Openflow, Universität Paderborn, 2013.","mla":"Satya, Suhas. <i>Emulating Wavelength Division Multiplexing Using Openflow</i>. Universität Paderborn, 2013.","apa":"Satya, S. (2013). <i>Emulating Wavelength Division Multiplexing using Openflow</i>. Universität Paderborn."},"year":"2013","user_id":"15504","department":[{"_id":"75"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"534","status":"public","type":"mastersthesis"},{"file_date_updated":"2018-03-15T10:25:45Z","language":[{"iso":"eng"}],"ddc":["040"],"department":[{"_id":"75"},{"_id":"63"}],"user_id":"477","_id":"562","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"status":"public","file":[{"file_size":347873,"access_level":"closed","file_name":"562-dcc13_paper.pdf","file_id":"1279","date_updated":"2018-03-15T10:25:45Z","date_created":"2018-03-15T10:25:45Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"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"}],"publication":"Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing","type":"conference","doi":"10.1109/UCC.2013.85","title":"A Local Heuristic for Latency-Optimized Distributed Cloud Deployment","author":[{"last_name":"Keller","full_name":"Keller, Matthias","first_name":"Matthias"},{"first_name":"Stefan","last_name":"Pawlik","full_name":"Pawlik, Stefan"},{"first_name":"Peter","full_name":"Pietrzyk, Peter","last_name":"Pietrzyk"},{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}],"date_created":"2017-10-17T12:42:41Z","date_updated":"2022-01-06T07:02:11Z","page":"429-434","citation":{"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>.","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.","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>","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>","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>."},"year":"2013","has_accepted_license":"1"},{"author":[{"last_name":"Hohenberger","full_name":"Hohenberger, Till","first_name":"Till"}],"date_created":"2017-10-17T12:42:46Z","date_updated":"2022-01-06T07:02:43Z","publisher":"Universität Paderborn","title":"Queuing Latency at Cooperative Base Stations","citation":{"apa":"Hohenberger, T. (2012). <i>Queuing Latency at Cooperative Base Stations</i>. Universität Paderborn.","bibtex":"@book{Hohenberger_2012, title={Queuing Latency at Cooperative Base Stations}, publisher={Universität Paderborn}, author={Hohenberger, Till}, year={2012} }","mla":"Hohenberger, Till. <i>Queuing Latency at Cooperative Base Stations</i>. Universität Paderborn, 2012.","short":"T. Hohenberger, Queuing Latency at Cooperative Base Stations, Universität Paderborn, 2012.","ieee":"T. Hohenberger, <i>Queuing Latency at Cooperative Base Stations</i>. Universität Paderborn, 2012.","chicago":"Hohenberger, Till. <i>Queuing Latency at Cooperative Base Stations</i>. Universität Paderborn, 2012.","ama":"Hohenberger T. <i>Queuing Latency at Cooperative Base Stations</i>. Universität Paderborn; 2012."},"year":"2012","department":[{"_id":"75"}],"user_id":"15504","_id":"584","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}],"type":"bachelorsthesis","status":"public"},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"593","user_id":"477","department":[{"_id":"75"}],"language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:47Z","date_created":"2017-10-17T12:42:47Z","author":[{"first_name":"Tobias","last_name":"Rojahn","full_name":"Rojahn, Tobias"}],"title":"Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten","year":"2012","citation":{"chicago":"Rojahn, Tobias. <i>Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten</i>. Universität Paderborn, 2012.","ieee":"T. Rojahn, <i>Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten</i>. Universität Paderborn, 2012.","ama":"Rojahn T. <i>Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten</i>. Universität Paderborn; 2012.","bibtex":"@book{Rojahn_2012, title={Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten}, publisher={Universität Paderborn}, author={Rojahn, Tobias}, year={2012} }","short":"T. Rojahn, Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten, Universität Paderborn, 2012.","mla":"Rojahn, Tobias. <i>Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten</i>. Universität Paderborn, 2012.","apa":"Rojahn, T. (2012). <i>Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten</i>. Universität Paderborn."}},{"title":"Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios","author":[{"full_name":"Wette, Philip","last_name":"Wette","first_name":"Philip"},{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"}],"date_created":"2017-10-17T12:42:49Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:51Z","citation":{"chicago":"Wette, Philip, and Holger Karl. <i>Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios</i>. Universität Paderborn, 2012.","ieee":"P. Wette and H. Karl, <i>Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios</i>. Universität Paderborn, 2012.","ama":"Wette P, Karl H. <i>Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios</i>. Universität Paderborn; 2012.","mla":"Wette, Philip, and Holger Karl. <i>Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios</i>. Universität Paderborn, 2012.","bibtex":"@book{Wette_Karl_2012, title={Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios}, publisher={Universität Paderborn}, author={Wette, Philip and Karl, Holger}, year={2012} }","short":"P. Wette, H. Karl, Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios, Universität Paderborn, 2012.","apa":"Wette, P., &#38; Karl, H. (2012). <i>Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios</i>. Universität Paderborn."},"year":"2012","has_accepted_license":"1","file_date_updated":"2018-03-09T09:57:26Z","ddc":["000"],"user_id":"126","department":[{"_id":"75"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"603","file":[{"file_size":717326,"file_id":"1205","access_level":"closed","file_name":"underlayMod2.pdf","date_updated":"2018-03-09T09:57:26Z","creator":"hkarl","date_created":"2018-03-09T09:57:26Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","abstract":[{"text":"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.","lang":"eng"}],"type":"report"},{"user_id":"15504","department":[{"_id":"75"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"660","status":"public","type":"bachelorsthesis","title":"Defining and Deploying Complex Applicances in Multi-Site Cloud Environments","date_created":"2017-10-17T12:43:00Z","author":[{"first_name":"Manuel","id":"13271","full_name":"Peuster, Manuel","last_name":"Peuster"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:13Z","citation":{"ama":"Peuster M. <i>Defining and Deploying Complex Applicances in Multi-Site Cloud Environments</i>. Universität Paderborn; 2011.","chicago":"Peuster, Manuel. <i>Defining and Deploying Complex Applicances in Multi-Site Cloud Environments</i>. Universität Paderborn, 2011.","ieee":"M. Peuster, <i>Defining and Deploying Complex Applicances in Multi-Site Cloud Environments</i>. Universität Paderborn, 2011.","apa":"Peuster, M. (2011). <i>Defining and Deploying Complex Applicances in Multi-Site Cloud Environments</i>. Universität Paderborn.","mla":"Peuster, Manuel. <i>Defining and Deploying Complex Applicances in Multi-Site Cloud Environments</i>. Universität Paderborn, 2011.","bibtex":"@book{Peuster_2011, title={Defining and Deploying Complex Applicances in Multi-Site Cloud Environments}, publisher={Universität Paderborn}, author={Peuster, Manuel}, year={2011} }","short":"M. Peuster, Defining and Deploying Complex Applicances in Multi-Site Cloud Environments, Universität Paderborn, 2011."},"year":"2011"}]