[{"publication":"Business & Information Systems Engineering","file":[{"date_updated":"2019-12-12T10:24:47Z","date_created":"2019-12-12T10:24:47Z","creator":"ups","file_size":454532,"file_id":"15311","file_name":"Karl2019_Article_ACaseForANewITEcosystemOn-The-.pdf","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"language":[{"iso":"eng"}],"ddc":["004"],"issue":"6","year":"2020","date_created":"2019-10-10T13:41:06Z","publisher":"Springer","title":"A Case for a New IT Ecosystem: On-The-Fly Computing","type":"journal_article","status":"public","user_id":"477","department":[{"_id":"276"},{"_id":"75"},{"_id":"63"},{"_id":"77"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Project Area T","_id":"82"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"6","name":"SFB 901 - Subproject A2"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"8","name":"SFB 901 - Subproject A4"},{"name":"SFB 901 - Subproject B1","_id":"9"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"name":"SFB 901 - Subproject B3","_id":"11"},{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"SFB 901 - Subproject C1","_id":"13"},{"name":"SFB 901 - Subproject C2","_id":"14"},{"name":"SFB 901 - Subproject C3","_id":"15"},{"name":"SFB 901 - Subproject C4","_id":"16"},{"name":"SFB 901 - Subproject C5","_id":"17"},{"name":"SFB 901 -Subproject T1","_id":"83"},{"name":"SFB 901 -Subproject T2","_id":"84"},{"name":"SFB 901 -Subproject T3","_id":"107"},{"name":"SFB 901 - T4: SFB 901 -Subproject T4","_id":"158"}],"_id":"13770","file_date_updated":"2019-12-12T10:24:47Z","publication_status":"published","has_accepted_license":"1","citation":{"mla":"Karl, Holger, et al. “A Case for a New IT Ecosystem: On-The-Fly Computing.” <i>Business &#38; Information Systems Engineering</i>, vol. 62, no. 6, Springer, 2020, pp. 467–81, doi:<a href=\"https://doi.org/10.1007/s12599-019-00627-x\">10.1007/s12599-019-00627-x</a>.","bibtex":"@article{Karl_Kundisch_Meyer auf der Heide_Wehrheim_2020, title={A Case for a New IT Ecosystem: On-The-Fly Computing}, volume={62}, DOI={<a href=\"https://doi.org/10.1007/s12599-019-00627-x\">10.1007/s12599-019-00627-x</a>}, number={6}, journal={Business &#38; Information Systems Engineering}, publisher={Springer}, author={Karl, Holger and Kundisch, Dennis and Meyer auf der Heide, Friedhelm and Wehrheim, Heike}, year={2020}, pages={467–481} }","short":"H. Karl, D. Kundisch, F. Meyer auf der Heide, H. Wehrheim, Business &#38; Information Systems Engineering 62 (2020) 467–481.","apa":"Karl, H., Kundisch, D., Meyer auf der Heide, F., &#38; Wehrheim, H. (2020). A Case for a New IT Ecosystem: On-The-Fly Computing. <i>Business &#38; Information Systems Engineering</i>, <i>62</i>(6), 467–481. <a href=\"https://doi.org/10.1007/s12599-019-00627-x\">https://doi.org/10.1007/s12599-019-00627-x</a>","ama":"Karl H, Kundisch D, Meyer auf der Heide F, Wehrheim H. A Case for a New IT Ecosystem: On-The-Fly Computing. <i>Business &#38; Information Systems Engineering</i>. 2020;62(6):467-481. doi:<a href=\"https://doi.org/10.1007/s12599-019-00627-x\">10.1007/s12599-019-00627-x</a>","ieee":"H. Karl, D. Kundisch, F. Meyer auf der Heide, and H. Wehrheim, “A Case for a New IT Ecosystem: On-The-Fly Computing,” <i>Business &#38; Information Systems Engineering</i>, vol. 62, no. 6, pp. 467–481, 2020, doi: <a href=\"https://doi.org/10.1007/s12599-019-00627-x\">10.1007/s12599-019-00627-x</a>.","chicago":"Karl, Holger, Dennis Kundisch, Friedhelm Meyer auf der Heide, and Heike Wehrheim. “A Case for a New IT Ecosystem: On-The-Fly Computing.” <i>Business &#38; Information Systems Engineering</i> 62, no. 6 (2020): 467–81. <a href=\"https://doi.org/10.1007/s12599-019-00627-x\">https://doi.org/10.1007/s12599-019-00627-x</a>."},"page":"467-481","intvolume":"        62","author":[{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"},{"first_name":"Dennis","full_name":"Kundisch, Dennis","id":"21117","last_name":"Kundisch"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"}],"volume":62,"date_updated":"2022-12-02T09:27:17Z","doi":"10.1007/s12599-019-00627-x"},{"language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"75"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subproject A2"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"1208","status":"public","type":"dissertation","doi":"10.17619/UNIPB/1-287","title":"Data-Centre Traffic Optimisation using Software-Defined Networks","supervisor":[{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"}],"author":[{"first_name":"Arne","last_name":"Schwabe","full_name":"Schwabe, Arne"}],"date_created":"2018-03-13T10:22:51Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:51:17Z","citation":{"apa":"Schwabe, A. (2018). <i>Data-Centre Traffic Optimisation using Software-Defined Networks</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-287\">https://doi.org/10.17619/UNIPB/1-287</a>","mla":"Schwabe, Arne. <i>Data-Centre Traffic Optimisation Using Software-Defined Networks</i>. Universität Paderborn, 2018, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-287\">10.17619/UNIPB/1-287</a>.","short":"A. Schwabe, Data-Centre Traffic Optimisation Using Software-Defined Networks, Universität Paderborn, 2018.","bibtex":"@book{Schwabe_2018, title={Data-Centre Traffic Optimisation using Software-Defined Networks}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-287\">10.17619/UNIPB/1-287</a>}, publisher={Universität Paderborn}, author={Schwabe, Arne}, year={2018} }","ama":"Schwabe A. <i>Data-Centre Traffic Optimisation Using Software-Defined Networks</i>. Universität Paderborn; 2018. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-287\">10.17619/UNIPB/1-287</a>","ieee":"A. Schwabe, <i>Data-Centre Traffic Optimisation using Software-Defined Networks</i>. Universität Paderborn, 2018.","chicago":"Schwabe, Arne. <i>Data-Centre Traffic Optimisation Using Software-Defined Networks</i>. Universität Paderborn, 2018. <a href=\"https://doi.org/10.17619/UNIPB/1-287\">https://doi.org/10.17619/UNIPB/1-287</a>."},"year":"2018"},{"citation":{"mla":"Keller, Matthias. <i>Application Deployment at Distributed Clouds</i>. Universität Paderborn, 2016.","bibtex":"@book{Keller_2016, title={Application Deployment at Distributed Clouds}, publisher={Universität Paderborn}, author={Keller, Matthias}, year={2016} }","short":"M. Keller, Application Deployment at Distributed Clouds, Universität Paderborn, 2016.","apa":"Keller, M. (2016). <i>Application Deployment at Distributed Clouds</i>. Universität Paderborn.","ama":"Keller M. <i>Application Deployment at Distributed Clouds</i>. Universität Paderborn; 2016.","chicago":"Keller, Matthias. <i>Application Deployment at Distributed Clouds</i>. Universität Paderborn, 2016.","ieee":"M. Keller, <i>Application Deployment at Distributed Clouds</i>. Universität Paderborn, 2016."},"year":"2016","has_accepted_license":"1","title":"Application Deployment at Distributed Clouds","date_created":"2017-10-17T12:41:34Z","supervisor":[{"last_name":"Karl","id":"126","full_name":"Karl, Holger","first_name":"Holger"}],"author":[{"first_name":"Matthias","full_name":"Keller, Matthias","last_name":"Keller"}],"date_updated":"2022-01-06T06:55:22Z","publisher":"Universität Paderborn","status":"public","file":[{"creator":"florida","date_created":"2018-03-21T10:37:11Z","date_updated":"2018-03-21T10:37:11Z","file_name":"220-Keller_PhD-Theses_01.pdf","access_level":"closed","file_id":"1513","file_size":7467820,"content_type":"application/pdf","relation":"main_file","success":1}],"type":"dissertation","file_date_updated":"2018-03-21T10:37:11Z","ddc":["040"],"department":[{"_id":"75"}],"user_id":"477","_id":"220","project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"4","name":"SFB 901 - Project Area C"}]},{"year":"2015","citation":{"apa":"Wette, P., &#38; Karl, H. (2015). HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks. In <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i> (pp. 1--7). <a href=\"https://doi.org/10.1109/EWSDN.2015.57\">https://doi.org/10.1109/EWSDN.2015.57</a>","mla":"Wette, Philip, and Holger Karl. “HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks.” <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i>, 2015, pp. 1--7, doi:<a href=\"https://doi.org/10.1109/EWSDN.2015.57\">10.1109/EWSDN.2015.57</a>.","short":"P. Wette, H. Karl, in: Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015), 2015, pp. 1--7.","bibtex":"@inproceedings{Wette_Karl_2015, title={HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks}, DOI={<a href=\"https://doi.org/10.1109/EWSDN.2015.57\">10.1109/EWSDN.2015.57</a>}, booktitle={Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)}, author={Wette, Philip and Karl, Holger}, year={2015}, pages={1--7} }","ama":"Wette P, Karl H. HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks. In: <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i>. ; 2015:1--7. doi:<a href=\"https://doi.org/10.1109/EWSDN.2015.57\">10.1109/EWSDN.2015.57</a>","ieee":"P. Wette and H. Karl, “HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks,” in <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i>, 2015, pp. 1--7.","chicago":"Wette, Philip, and Holger Karl. “HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks.” In <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i>, 1--7, 2015. <a href=\"https://doi.org/10.1109/EWSDN.2015.57\">https://doi.org/10.1109/EWSDN.2015.57</a>."},"page":"1--7","quality_controlled":"1","has_accepted_license":"1","title":"HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks","doi":"10.1109/EWSDN.2015.57","date_updated":"2022-01-06T06:58:17Z","author":[{"full_name":"Wette, Philip","last_name":"Wette","first_name":"Philip"},{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"}],"date_created":"2017-10-17T12:41:48Z","urn":"2875","abstract":[{"text":"The size of modern data centers is constantly increasing. As it is not economic to interconnect all machines in the data center using a full-bisection-bandwidth network, techniques have to be developed to increase the efficiency of data-center networks. The Software-Defined Network paradigm opened the door for centralized traffic engineering (TE) in such environments. Up to now, there were already a number of TE proposals for SDN-controlled data centers that all work very well. However, these techniques either use a high amount of flow table entries or a high flow installation rate that overwhelms available switching hardware, or they require custom or very expensive end-of-line equipment to be usable in practice. We present HybridTE, a TE technique that uses (uncertain) information about large flows. Using this extra information, our technique has very low hardware requirements while maintaining better performance than existing TE techniques. This enables us to build very low-cost, high performance data-center networks.","lang":"eng"}],"file":[{"date_created":"2018-03-08T09:55:30Z","creator":"florida","date_updated":"2018-03-08T09:59:05Z","access_level":"closed","file_id":"1203","file_name":"287-1503.04317v1.pdf","file_size":1625732,"content_type":"application/pdf","relation":"main_file"}],"status":"public","type":"conference","publication":"Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)","ddc":["040"],"file_date_updated":"2018-03-08T09:59:05Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"287","user_id":"15572","department":[{"_id":"75"}]},{"date_updated":"2022-01-06T06:56:32Z","date_created":"2017-10-17T12:41:40Z","author":[{"first_name":"Arne","last_name":"Schwabe","full_name":"Schwabe, Arne"},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"}],"title":"SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting Statistics","doi":"10.1109/EWSDN.2015.58","has_accepted_license":"1","year":"2015","citation":{"ieee":"A. Schwabe and H. Karl, “SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting Statistics,” in <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i>, 2015, pp. 37–42.","chicago":"Schwabe, Arne, and Holger Karl. “SynRace: Decentralized Load-Adaptive Multi-Path Routing without Collecting Statistics.” In <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i>, 37–42, 2015. <a href=\"https://doi.org/10.1109/EWSDN.2015.58\">https://doi.org/10.1109/EWSDN.2015.58</a>.","ama":"Schwabe A, Karl H. SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting Statistics. In: <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i>. ; 2015:37-42. doi:<a href=\"https://doi.org/10.1109/EWSDN.2015.58\">10.1109/EWSDN.2015.58</a>","apa":"Schwabe, A., &#38; Karl, H. (2015). SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting Statistics. In <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i> (pp. 37–42). <a href=\"https://doi.org/10.1109/EWSDN.2015.58\">https://doi.org/10.1109/EWSDN.2015.58</a>","short":"A. Schwabe, H. Karl, in: Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015), 2015, pp. 37–42.","mla":"Schwabe, Arne, and Holger Karl. “SynRace: Decentralized Load-Adaptive Multi-Path Routing without Collecting Statistics.” <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i>, 2015, pp. 37–42, doi:<a href=\"https://doi.org/10.1109/EWSDN.2015.58\">10.1109/EWSDN.2015.58</a>.","bibtex":"@inproceedings{Schwabe_Karl_2015, title={SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting Statistics}, DOI={<a href=\"https://doi.org/10.1109/EWSDN.2015.58\">10.1109/EWSDN.2015.58</a>}, booktitle={Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)}, author={Schwabe, Arne and Karl, Holger}, year={2015}, pages={37–42} }"},"page":"37-42","project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"247","user_id":"15504","department":[{"_id":"75"}],"ddc":["040"],"file_date_updated":"2018-03-21T09:46:21Z","type":"conference","publication":"Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)","abstract":[{"lang":"eng","text":"Multi-rooted trees are becoming the norm for modern data-center networks. In these networks, scalable flow routing is challenging owing to vast number of flows. Current approaches either employ a central controller that can have scalability issues or a scalable decentralized algorithm only considering local information. In this paper we present a new decentralized approach to least-congested path routing in software-defined data center networks that has neither of these issues: By duplicating the initial (or SYN) packet of a flow and estimating the data rate of multiple flows in parallel, we exploit TCP’s habit to fill buffers to find the least congested path. We show that our algorithm significantly improves flow completion time without the need for a central controller or specialized hardware."}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-21T09:46:21Z","date_updated":"2018-03-21T09:46:21Z","file_name":"247-07313613.pdf","file_id":"1491","access_level":"closed","file_size":277574}],"status":"public"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"264","user_id":"477","department":[{"_id":"75"}],"ddc":["040"],"file_date_updated":"2018-03-21T09:34:36Z","type":"dissertation","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"1481","file_name":"264-Dissertation_-_Wette.pdf","file_size":8031107,"date_created":"2018-03-21T09:34:36Z","creator":"florida","date_updated":"2018-03-21T09:34:36Z"}],"status":"public","date_updated":"2022-01-06T06:57:20Z","publisher":"Universität Paderborn","supervisor":[{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"}],"author":[{"first_name":"Philip","full_name":"Wette, Philip","last_name":"Wette"}],"date_created":"2017-10-17T12:41:43Z","title":"Optimizing Software-Defined Networks using Application-Layer Knowledge","has_accepted_license":"1","year":"2015","citation":{"bibtex":"@book{Wette_2015, title={Optimizing Software-Defined Networks using Application-Layer Knowledge}, publisher={Universität Paderborn}, author={Wette, Philip}, year={2015} }","mla":"Wette, Philip. <i>Optimizing Software-Defined Networks Using Application-Layer Knowledge</i>. Universität Paderborn, 2015.","short":"P. Wette, Optimizing Software-Defined Networks Using Application-Layer Knowledge, Universität Paderborn, 2015.","apa":"Wette, P. (2015). <i>Optimizing Software-Defined Networks using Application-Layer Knowledge</i>. Universität Paderborn.","ama":"Wette P. <i>Optimizing Software-Defined Networks Using Application-Layer Knowledge</i>. Universität Paderborn; 2015.","ieee":"P. Wette, <i>Optimizing Software-Defined Networks using Application-Layer Knowledge</i>. Universität Paderborn, 2015.","chicago":"Wette, Philip. <i>Optimizing Software-Defined Networks Using Application-Layer Knowledge</i>. Universität Paderborn, 2015."}},{"status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-02T14:03:07Z","creator":"ups","date_created":"2018-11-02T14:03:07Z","file_size":3386981,"file_name":"Schwabe07249298.pdf","file_id":"5260","access_level":"closed"}],"publication":"2015 IEEE International Conference on Communications, ICC 2015, London, United Kingdom, June 8-12, 2015","type":"conference","file_date_updated":"2018-11-02T14:03:07Z","language":[{"iso":"eng"}],"ddc":["000"],"department":[{"_id":"75"}],"user_id":"477","_id":"743","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A2","_id":"6"}],"page":"6122--6127","citation":{"ama":"Schwabe A, Karl H. Topology model to generate realistic latency for simulations. In: <i>2015 IEEE International Conference on Communications, ICC 2015, London, United Kingdom, June 8-12, 2015</i>. ; 2015:6122--6127. doi:<a href=\"https://doi.org/10.1109/ICC.2015.7249298\">10.1109/ICC.2015.7249298</a>","ieee":"A. Schwabe and H. Karl, “Topology model to generate realistic latency for simulations,” in <i>2015 IEEE International Conference on Communications, ICC 2015, London, United Kingdom, June 8-12, 2015</i>, 2015, pp. 6122--6127.","chicago":"Schwabe, Arne, and Holger Karl. “Topology Model to Generate Realistic Latency for Simulations.” In <i>2015 IEEE International Conference on Communications, ICC 2015, London, United Kingdom, June 8-12, 2015</i>, 6122--6127, 2015. <a href=\"https://doi.org/10.1109/ICC.2015.7249298\">https://doi.org/10.1109/ICC.2015.7249298</a>.","apa":"Schwabe, A., &#38; Karl, H. (2015). Topology model to generate realistic latency for simulations. In <i>2015 IEEE International Conference on Communications, ICC 2015, London, United Kingdom, June 8-12, 2015</i> (pp. 6122--6127). <a href=\"https://doi.org/10.1109/ICC.2015.7249298\">https://doi.org/10.1109/ICC.2015.7249298</a>","mla":"Schwabe, Arne, and Holger Karl. “Topology Model to Generate Realistic Latency for Simulations.” <i>2015 IEEE International Conference on Communications, ICC 2015, London, United Kingdom, June 8-12, 2015</i>, 2015, pp. 6122--6127, doi:<a href=\"https://doi.org/10.1109/ICC.2015.7249298\">10.1109/ICC.2015.7249298</a>.","bibtex":"@inproceedings{Schwabe_Karl_2015, title={Topology model to generate realistic latency for simulations}, DOI={<a href=\"https://doi.org/10.1109/ICC.2015.7249298\">10.1109/ICC.2015.7249298</a>}, booktitle={2015 IEEE International Conference on Communications, ICC 2015, London, United Kingdom, June 8-12, 2015}, author={Schwabe, Arne and Karl, Holger}, year={2015}, pages={6122--6127} }","short":"A. Schwabe, H. Karl, in: 2015 IEEE International Conference on Communications, ICC 2015, London, United Kingdom, June 8-12, 2015, 2015, pp. 6122--6127."},"year":"2015","has_accepted_license":"1","doi":"10.1109/ICC.2015.7249298","title":"Topology model to generate realistic latency for simulations","date_created":"2017-11-27T10:22:25Z","author":[{"full_name":"Schwabe, Arne","last_name":"Schwabe","first_name":"Arne"},{"first_name":"Holger","last_name":"Karl","id":"126","full_name":"Karl, Holger"}],"date_updated":"2022-01-06T07:03:37Z"},{"has_accepted_license":"1","year":"2014","citation":{"mla":"Wette, Philip, et al. “MaxiNet: Distributed Emulation of Software-Defined Networks.” <i>Proceedings of the 2014 IFIP Networking Conference (Networking 2014)</i>, 2014, pp. 1–9, doi:<a href=\"https://doi.org/10.1109/IFIPNetworking.2014.6857078\">10.1109/IFIPNetworking.2014.6857078</a>.","short":"P. Wette, M. Dräxler, A. Schwabe, F. Wallaschek, M.H. Zahraee, H. Karl, in: Proceedings of the 2014 IFIP Networking Conference (Networking 2014), 2014, pp. 1–9.","bibtex":"@inproceedings{Wette_Dräxler_Schwabe_Wallaschek_Zahraee_Karl_2014, title={MaxiNet: Distributed Emulation of Software-Defined Networks}, DOI={<a href=\"https://doi.org/10.1109/IFIPNetworking.2014.6857078\">10.1109/IFIPNetworking.2014.6857078</a>}, booktitle={Proceedings of the 2014 IFIP Networking Conference (Networking 2014)}, author={Wette, Philip and Dräxler, Martin and Schwabe, Arne and Wallaschek, Felix and Zahraee, Mohammad Hassan and Karl, Holger}, year={2014}, pages={1–9} }","apa":"Wette, P., Dräxler, M., Schwabe, A., Wallaschek, F., Zahraee, M. H., &#38; Karl, H. (2014). MaxiNet: Distributed Emulation of Software-Defined Networks. In <i>Proceedings of the 2014 IFIP Networking Conference (Networking 2014)</i> (pp. 1–9). <a href=\"https://doi.org/10.1109/IFIPNetworking.2014.6857078\">https://doi.org/10.1109/IFIPNetworking.2014.6857078</a>","ama":"Wette P, Dräxler M, Schwabe A, Wallaschek F, Zahraee MH, Karl H. MaxiNet: Distributed Emulation of Software-Defined Networks. In: <i>Proceedings of the 2014 IFIP Networking Conference (Networking 2014)</i>. ; 2014:1-9. doi:<a href=\"https://doi.org/10.1109/IFIPNetworking.2014.6857078\">10.1109/IFIPNetworking.2014.6857078</a>","ieee":"P. Wette, M. Dräxler, A. Schwabe, F. Wallaschek, M. H. Zahraee, and H. Karl, “MaxiNet: Distributed Emulation of Software-Defined Networks,” in <i>Proceedings of the 2014 IFIP Networking Conference (Networking 2014)</i>, 2014, pp. 1–9.","chicago":"Wette, Philip, Martin Dräxler, Arne Schwabe, Felix Wallaschek, Mohammad Hassan Zahraee, and Holger Karl. “MaxiNet: Distributed Emulation of Software-Defined Networks.” In <i>Proceedings of the 2014 IFIP Networking Conference (Networking 2014)</i>, 1–9, 2014. <a href=\"https://doi.org/10.1109/IFIPNetworking.2014.6857078\">https://doi.org/10.1109/IFIPNetworking.2014.6857078</a>."},"page":"1-9","date_updated":"2022-01-06T06:59:09Z","date_created":"2017-10-17T12:41:56Z","author":[{"first_name":"Philip","last_name":"Wette","full_name":"Wette, Philip"},{"first_name":"Martin","full_name":"Dräxler, Martin","last_name":"Dräxler"},{"full_name":"Schwabe, Arne","last_name":"Schwabe","first_name":"Arne"},{"first_name":"Felix","full_name":"Wallaschek, Felix","last_name":"Wallaschek"},{"last_name":"Zahraee","full_name":"Zahraee, Mohammad Hassan","first_name":"Mohammad Hassan"},{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"}],"title":"MaxiNet: Distributed Emulation of Software-Defined Networks","doi":"10.1109/IFIPNetworking.2014.6857078","type":"conference","publication":"Proceedings of the 2014 IFIP Networking Conference (Networking 2014)","abstract":[{"text":"Network emulations are widely used for testing novel network protocols and routing algorithms in realistic scenarios. Up to now, there is no emulation tool that is able to emulate large software-defined data center networks that consist of several thousand nodes. Mininet is the most common tool to emulate Software-Defined Networks of several hundred nodes. We extend Mininet to span an emulated network over several physical machines, making it possible to emulate networks of several thousand nodes on just a handful of physical machines. This enables us to emulate, e.g., large data center networks. To test this approach, we additionally introduce a traffic generator for data center traffic. Since there are no data center traffic traces publicly available we use the results of two recent traffic studies to create synthetic traffic. We show the design and discuss some challenges we had in building our traffic generator. As a showcase for our work we emulated a data center consisting of 3200 hosts on a cluster of only 12 physical machines. We show the resulting workloads and the trade-offs involved.","lang":"eng"}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1425","file_name":"329-maxinet_networking14_01.pdf","access_level":"closed","file_size":786320,"date_created":"2018-03-20T07:30:29Z","creator":"florida","date_updated":"2018-03-20T07:30:29Z"}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"329","user_id":"15572","department":[{"_id":"75"}],"ddc":["040"],"file_date_updated":"2018-03-20T07:30:29Z"},{"title":"Using Application Layer Knowledge in Routing and Wavelength Assignment Algorithms","doi":"10.1109/ICC.2014.6883825","date_updated":"2022-01-06T06:59:14Z","date_created":"2017-10-17T12:41:58Z","author":[{"last_name":"Wette","full_name":"Wette, Philip","first_name":"Philip"},{"full_name":"Karl, Holger","id":"126","last_name":"Karl","first_name":"Holger"}],"year":"2014","citation":{"ama":"Wette P, Karl H. Using Application Layer Knowledge in Routing and Wavelength Assignment Algorithms. In: <i>Proceedings of the IEEE International Conference on Communications 2014</i>. ; 2014:3270-3276. doi:<a href=\"https://doi.org/10.1109/ICC.2014.6883825\">10.1109/ICC.2014.6883825</a>","chicago":"Wette, Philip, and Holger Karl. “Using Application Layer Knowledge in Routing and Wavelength Assignment Algorithms.” In <i>Proceedings of the IEEE International Conference on Communications 2014</i>, 3270–76, 2014. <a href=\"https://doi.org/10.1109/ICC.2014.6883825\">https://doi.org/10.1109/ICC.2014.6883825</a>.","ieee":"P. Wette and H. Karl, “Using Application Layer Knowledge in Routing and Wavelength Assignment Algorithms,” in <i>Proceedings of the IEEE International Conference on Communications 2014</i>, 2014, pp. 3270–3276.","apa":"Wette, P., &#38; Karl, H. (2014). Using Application Layer Knowledge in Routing and Wavelength Assignment Algorithms. In <i>Proceedings of the IEEE International Conference on Communications 2014</i> (pp. 3270–3276). <a href=\"https://doi.org/10.1109/ICC.2014.6883825\">https://doi.org/10.1109/ICC.2014.6883825</a>","short":"P. Wette, H. Karl, in: Proceedings of the IEEE International Conference on Communications 2014, 2014, pp. 3270–3276.","bibtex":"@inproceedings{Wette_Karl_2014, title={Using Application Layer Knowledge in Routing and Wavelength Assignment Algorithms}, DOI={<a href=\"https://doi.org/10.1109/ICC.2014.6883825\">10.1109/ICC.2014.6883825</a>}, booktitle={Proceedings of the IEEE International Conference on Communications 2014}, author={Wette, Philip and Karl, Holger}, year={2014}, pages={3270–3276} }","mla":"Wette, Philip, and Holger Karl. “Using Application Layer Knowledge in Routing and Wavelength Assignment Algorithms.” <i>Proceedings of the IEEE International Conference on Communications 2014</i>, 2014, pp. 3270–76, doi:<a href=\"https://doi.org/10.1109/ICC.2014.6883825\">10.1109/ICC.2014.6883825</a>."},"page":"3270-3276","has_accepted_license":"1","ddc":["040"],"file_date_updated":"2018-03-20T07:29:00Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subproject A2"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"339","user_id":"15504","department":[{"_id":"75"}],"abstract":[{"text":"Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established lightpaths in case notenough resources are available to set up a new lightpath in aWavelength Division Multiplexing (WDM) network. The selectionof lightpaths to be preempted relies on internal decisions of theRWA algorithm. Thus, if dedicated properties of the networktopology are required by the applications running on the network,these requirements have to be known to the RWA algorithm.We present a family of preemptive RWA algorithms for WDMnetworks. 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 andthus 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 configurationsincluding networks consisting of heterogeneous WDM hardware.To this end, we are using the layered graph approach togetherwith a newly developed graph model that is used to determineconflicting lightpaths.","lang":"eng"}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-20T07:29:00Z","date_created":"2018-03-20T07:29:00Z","creator":"florida","file_size":138062,"file_id":"1422","access_level":"closed","file_name":"339-IEEE-WK-14.pdf"}],"status":"public","type":"conference","publication":"Proceedings of the IEEE International Conference on Communications 2014"},{"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:16Z","author":[{"first_name":"Jörn","full_name":"Künsemöller, Jörn","last_name":"Künsemöller"}],"supervisor":[{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"}],"date_created":"2017-10-17T12:41:58Z","title":"Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market","has_accepted_license":"1","year":"2014","citation":{"ama":"Künsemöller J. <i>Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market</i>. Universität Paderborn; 2014.","chicago":"Künsemöller, Jörn. <i>Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market</i>. Universität Paderborn, 2014.","ieee":"J. Künsemöller, <i>Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market</i>. Universität Paderborn, 2014.","bibtex":"@book{Künsemöller_2014, title={Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market}, publisher={Universität Paderborn}, author={Künsemöller, Jörn}, year={2014} }","mla":"Künsemöller, Jörn. <i>Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market</i>. Universität Paderborn, 2014.","short":"J. Künsemöller, Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market, Universität Paderborn, 2014.","apa":"Künsemöller, J. (2014). <i>Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market</i>. Universität Paderborn."},"_id":"343","project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"75"}],"user_id":"477","ddc":["040"],"file_date_updated":"2018-03-20T07:28:26Z","type":"dissertation","status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-20T07:28:26Z","creator":"florida","date_created":"2018-03-20T07:28:26Z","file_size":1378657,"file_id":"1421","access_level":"closed","file_name":"343-2014_Diss_Kuensemoeller.pdf"}]},{"department":[{"_id":"75"}],"user_id":"15572","_id":"354","project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file_date_updated":"2018-03-20T07:23:02Z","ddc":["040"],"publication":"Proceedings of 7th International Conference on Utility and Cloud Computing (UCC)","type":"conference","status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-20T07:23:02Z","creator":"florida","date_created":"2018-03-20T07:23:02Z","file_size":737652,"file_id":"1413","access_level":"closed","file_name":"354-keller_ucc14_preprint_01.pdf"}],"abstract":[{"text":"In distributed cloud computing, application deployment across multiple sites can improve quality of service. Recent research developed algorithms to find optimal locations for virtual machines. However, those algorithms assume to have either single-tier applications or a fixed number of virtual machines – a strong simplification of reality. This paper investigates the placement and scaling of complex application architectures. An application is dynamically scaled to fit both the current demand situation and the currently available infrastructure resources. We compare two approaches: The first one is based on virtual network embedding. The second approach is a novel method called Template Embedding. It is based on a hierarchical 1-allocation hub flow problem and combines applica- tion scaling and embedding in one step. Extensive experiments on 43200 network configurations showed that Template Embedding outperforms virtual network embedding in all cases in three metrics: success rate, solution quality, and runtime. This positive result shows that template embedding is a promising approach for distributed cloud resource allocation.","lang":"eng"}],"author":[{"full_name":"Keller, Matthias","last_name":"Keller","first_name":"Matthias"},{"full_name":"Robbert, Christoph","last_name":"Robbert","first_name":"Christoph"},{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"}],"date_created":"2017-10-17T12:42:01Z","date_updated":"2022-01-06T06:59:22Z","doi":"10.1109/UCC.2014.49","title":"Template Embedding: Using Application Architecture to Allocate Resources in Distributed Clouds","has_accepted_license":"1","page":"387--395","citation":{"ama":"Keller M, Robbert C, Karl H. Template Embedding: Using Application Architecture to Allocate Resources in Distributed Clouds. In: <i>Proceedings of 7th International Conference on Utility and Cloud Computing (UCC)</i>. ; 2014:387--395. doi:<a href=\"https://doi.org/10.1109/UCC.2014.49\">10.1109/UCC.2014.49</a>","ieee":"M. Keller, C. Robbert, and H. Karl, “Template Embedding: Using Application Architecture to Allocate Resources in Distributed Clouds,” in <i>Proceedings of 7th International Conference on Utility and Cloud Computing (UCC)</i>, 2014, pp. 387--395.","chicago":"Keller, Matthias, Christoph Robbert, and Holger Karl. “Template Embedding: Using Application Architecture to Allocate Resources in Distributed Clouds.” In <i>Proceedings of 7th International Conference on Utility and Cloud Computing (UCC)</i>, 387--395, 2014. <a href=\"https://doi.org/10.1109/UCC.2014.49\">https://doi.org/10.1109/UCC.2014.49</a>.","apa":"Keller, M., Robbert, C., &#38; Karl, H. (2014). Template Embedding: Using Application Architecture to Allocate Resources in Distributed Clouds. In <i>Proceedings of 7th International Conference on Utility and Cloud Computing (UCC)</i> (pp. 387--395). <a href=\"https://doi.org/10.1109/UCC.2014.49\">https://doi.org/10.1109/UCC.2014.49</a>","short":"M. Keller, C. Robbert, H. Karl, in: Proceedings of 7th International Conference on Utility and Cloud Computing (UCC), 2014, pp. 387--395.","bibtex":"@inproceedings{Keller_Robbert_Karl_2014, title={Template Embedding: Using Application Architecture to Allocate Resources in Distributed Clouds}, DOI={<a href=\"https://doi.org/10.1109/UCC.2014.49\">10.1109/UCC.2014.49</a>}, booktitle={Proceedings of 7th International Conference on Utility and Cloud Computing (UCC)}, author={Keller, Matthias and Robbert, Christoph and Karl, Holger}, year={2014}, pages={387--395} }","mla":"Keller, Matthias, et al. “Template Embedding: Using Application Architecture to Allocate Resources in Distributed Clouds.” <i>Proceedings of 7th International Conference on Utility and Cloud Computing (UCC)</i>, 2014, pp. 387--395, doi:<a href=\"https://doi.org/10.1109/UCC.2014.49\">10.1109/UCC.2014.49</a>."},"year":"2014"},{"type":"conference","publication":"Proceedings of the 3rd International Conference on Cloud Networking (CloudNet)","abstract":[{"text":"Network appliances perform different functions on network flows and constitute an important part of an operator’s network. Normally, a set of chained network functions process network flows. Following the trend of virtualization of networks, virtualization of the network functions has also become a topic of interest. We define a model for formalizing the chaining of network functions using a context-free language. We process deployment requests and construct virtual network function graphs that can be mapped to the network. We describe the mapping as a Mixed Integer Quadratically Constrained Program (MIQCP) for finding the placement of the network functions and chaining them together considering the limited network resources and requirements of the functions. We have performed a Pareto set analysis to investigate the possible trade-offs between different optimization objectives. ","lang":"eng"}],"urn":"3601","file":[{"creator":"florida","date_created":"2018-03-20T07:21:01Z","date_updated":"2018-06-25T08:08:44Z","file_id":"1409","file_name":"360-Mehr1410_Specifying_preprint_01.pdf","access_level":"open_access","file_size":422019,"content_type":"application/pdf","relation":"main_file"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"360","user_id":"31764","department":[{"_id":"75"}],"ddc":["040"],"file_date_updated":"2018-06-25T08:08:44Z","has_accepted_license":"1","year":"2014","citation":{"ama":"Dräxler S, Keller M, Karl H. Specifying and Placing Chains of Virtual Network Functions. In: <i>Proceedings of the 3rd International Conference on Cloud Networking (CloudNet)</i>. ; 2014:7-13. doi:<a href=\"https://doi.org/10.1109/CloudNet.2014.6968961\">10.1109/CloudNet.2014.6968961</a>","ieee":"S. Dräxler, M. Keller, and H. Karl, “Specifying and Placing Chains of Virtual Network Functions,” in <i>Proceedings of the 3rd International Conference on Cloud Networking (CloudNet)</i>, 2014, pp. 7–13.","chicago":"Dräxler, Sevil, Matthias Keller, and Holger Karl. “Specifying and Placing Chains of Virtual Network Functions.” In <i>Proceedings of the 3rd International Conference on Cloud Networking (CloudNet)</i>, 7–13, 2014. <a href=\"https://doi.org/10.1109/CloudNet.2014.6968961\">https://doi.org/10.1109/CloudNet.2014.6968961</a>.","apa":"Dräxler, S., Keller, M., &#38; Karl, H. (2014). Specifying and Placing Chains of Virtual Network Functions. In <i>Proceedings of the 3rd International Conference on Cloud Networking (CloudNet)</i> (pp. 7–13). <a href=\"https://doi.org/10.1109/CloudNet.2014.6968961\">https://doi.org/10.1109/CloudNet.2014.6968961</a>","bibtex":"@inproceedings{Dräxler_Keller_Karl_2014, title={Specifying and Placing Chains of Virtual Network Functions}, DOI={<a href=\"https://doi.org/10.1109/CloudNet.2014.6968961\">10.1109/CloudNet.2014.6968961</a>}, booktitle={Proceedings of the 3rd International Conference on Cloud Networking (CloudNet)}, author={Dräxler, Sevil and Keller, Matthias and Karl, Holger}, year={2014}, pages={7–13} }","short":"S. Dräxler, M. Keller, H. Karl, in: Proceedings of the 3rd International Conference on Cloud Networking (CloudNet), 2014, pp. 7–13.","mla":"Dräxler, Sevil, et al. “Specifying and Placing Chains of Virtual Network Functions.” <i>Proceedings of the 3rd International Conference on Cloud Networking (CloudNet)</i>, 2014, pp. 7–13, doi:<a href=\"https://doi.org/10.1109/CloudNet.2014.6968961\">10.1109/CloudNet.2014.6968961</a>."},"page":"7-13","oa":"1","date_updated":"2022-01-06T06:59:27Z","author":[{"last_name":"Dräxler","full_name":"Dräxler, Sevil","id":"31764","first_name":"Sevil"},{"last_name":"Keller","full_name":"Keller, Matthias","first_name":"Matthias"},{"first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger","id":"126"}],"date_created":"2017-10-17T12:42:02Z","title":"Specifying and Placing Chains of Virtual Network Functions","doi":"10.1109/CloudNet.2014.6968961"},{"title":"Simulating load-dependent operation of picocells","date_created":"2017-10-17T12:42:02Z","author":[{"first_name":"Daniel","full_name":"Roeske, Daniel","last_name":"Roeske"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:27Z","citation":{"mla":"Roeske, Daniel. <i>Simulating Load-Dependent Operation of Picocells</i>. Universität Paderborn, 2014.","bibtex":"@book{Roeske_2014, title={Simulating load-dependent operation of picocells}, publisher={Universität Paderborn}, author={Roeske, Daniel}, year={2014} }","short":"D. Roeske, Simulating Load-Dependent Operation of Picocells, Universität Paderborn, 2014.","apa":"Roeske, D. (2014). <i>Simulating load-dependent operation of picocells</i>. Universität Paderborn.","ama":"Roeske D. <i>Simulating Load-Dependent Operation of Picocells</i>. Universität Paderborn; 2014.","chicago":"Roeske, Daniel. <i>Simulating Load-Dependent Operation of Picocells</i>. Universität Paderborn, 2014.","ieee":"D. Roeske, <i>Simulating load-dependent operation of picocells</i>. Universität Paderborn, 2014."},"year":"2014","department":[{"_id":"75"}],"user_id":"15504","_id":"361","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","type":"bachelorsthesis"},{"user_id":"477","department":[{"_id":"75"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"372","language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T14:00:54Z","ddc":["000"],"type":"conference","publication":"Proceedings of the SIGCOMM workshop on Distributed cloud computing","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"5259","file_name":"p47-keller.pdf","file_size":804240,"creator":"ups","date_created":"2018-11-02T14:00:54Z","date_updated":"2018-11-02T14:00:54Z"}],"status":"public","abstract":[{"text":"In the near future many more compute resources will be available at different geographical locations. To minimize the response time of requests, application servers closer to the user can hence be used to shorten network round trip times. However, this advantage is neutralized if the used data centre is highly loaded as the processing time of re- quests is important as well. We model the request response time as the network round trip time plus the processing time at a data centre.We present a capacitated facility location problem formal- ization where the processing time is modelled as the sojourn time of a queueing model. We discuss the Pareto trade-off between the number of used data centres and the resulting response time. For example, using fewer data centres could cut expenses but results in high utilization, high response time, and smaller revenues.Previous work presented a non-linear cost function. We prove its convexity and exploit this property in two ways: First, we transform the convex model into a linear model while controlling the maximum approximation error. Sec- ond, we used a convex solver instead of a slower non-linear solver. Numerical results on network topologies exemplify our work.","lang":"eng"}],"author":[{"full_name":"Keller, Matthias","last_name":"Keller","first_name":"Matthias"},{"last_name":"Karl","id":"126","full_name":"Karl, Holger","first_name":"Holger"}],"date_created":"2017-10-17T12:42:04Z","date_updated":"2022-01-06T06:59:31Z","doi":"10.1145/2627566.2627570","title":"Response Time-Optimized Distributed Cloud Resource Allocation","has_accepted_license":"1","citation":{"apa":"Keller, M., &#38; Karl, H. (2014). Response Time-Optimized Distributed Cloud Resource Allocation. In <i>Proceedings of the SIGCOMM workshop on Distributed cloud computing</i> (pp. 47--52). <a href=\"https://doi.org/10.1145/2627566.2627570\">https://doi.org/10.1145/2627566.2627570</a>","short":"M. Keller, H. Karl, in: Proceedings of the SIGCOMM Workshop on Distributed Cloud Computing, 2014, pp. 47--52.","bibtex":"@inproceedings{Keller_Karl_2014, title={Response Time-Optimized Distributed Cloud Resource Allocation}, DOI={<a href=\"https://doi.org/10.1145/2627566.2627570\">10.1145/2627566.2627570</a>}, booktitle={Proceedings of the SIGCOMM workshop on Distributed cloud computing}, author={Keller, Matthias and Karl, Holger}, year={2014}, pages={47--52} }","mla":"Keller, Matthias, and Holger Karl. “Response Time-Optimized Distributed Cloud Resource Allocation.” <i>Proceedings of the SIGCOMM Workshop on Distributed Cloud Computing</i>, 2014, pp. 47--52, doi:<a href=\"https://doi.org/10.1145/2627566.2627570\">10.1145/2627566.2627570</a>.","ama":"Keller M, Karl H. Response Time-Optimized Distributed Cloud Resource Allocation. In: <i>Proceedings of the SIGCOMM Workshop on Distributed Cloud Computing</i>. ; 2014:47--52. doi:<a href=\"https://doi.org/10.1145/2627566.2627570\">10.1145/2627566.2627570</a>","chicago":"Keller, Matthias, and Holger Karl. “Response Time-Optimized Distributed Cloud Resource Allocation.” In <i>Proceedings of the SIGCOMM Workshop on Distributed Cloud Computing</i>, 47--52, 2014. <a href=\"https://doi.org/10.1145/2627566.2627570\">https://doi.org/10.1145/2627566.2627570</a>.","ieee":"M. Keller and H. Karl, “Response Time-Optimized Distributed Cloud Resource Allocation,” in <i>Proceedings of the SIGCOMM workshop on Distributed cloud computing</i>, 2014, pp. 47--52."},"page":"47--52","year":"2014"},{"type":"dissertation","file":[{"file_name":"376-Herlich-Dissertation.pdf","file_id":"1398","access_level":"closed","file_size":1476366,"creator":"florida","date_created":"2018-03-20T07:14:52Z","date_updated":"2018-03-20T07:14:52Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","abstract":[{"text":"Radio access networks (RANs) have become one of the largest energy consumers of communication technology [LLH+13] and their energy consumption is predicted to increase [FFMB11]. To reduce the energy consumption of RANs different techniques have been proposed. One of the most promising techniques is the use of a low-power sleep mode. However, a sleep mode can also reduce the performance. In this dissertation, I quantify how much energy can be conserved with a sleep mode and which negative effects it has on the performance of RANs. Additionally, I analyze how a sleep mode can be enabled more often and how the performance can be kept high. First, I quantify the effect of power-cycle durations on energy consumption and latency in an abstract queuing system. This results in a trade-off between energy consumption and latency for a single base station (BS). Second, I show that considering a network as a whole (instead of each BS individually) allows the energy consumption to be reduced even further. After these analyses, which are not specific for RANs, I study RANs for the rest of the dissertation. RANs need to both detect and execute the requests of users. Because detection and execution of requests have different requirements, I analyze them independently. I quantify how the number of active BSs can be reduced if the detection ranges of BSs are increased by cooperative transmissions. Next, I analyze how more BSs can be deactivated if the remaining active BSs cooperate to transmit data to the users. However, in addition to increasing the range, cooperative transmissions also radiate more power. This results in higher interference for other users which slows their transmissions down and, thus, increases energy consumption. Therefore, I describe how the radiated power of cooperative transmissions can be reduced if instantaneous channel knowledge is available. Because the implementation in real hardware is impractical for demonstration purposes, I show the results of a simulation that incorporates all effects I studied analytically earlier. In conclusion, I show that a sleep mode can reduce the energy consumption of RANs if applied correctly. To apply a sleep mode correctly, it is necessary to consider power-cycle durations, power profiles, and the interaction of BSs. When this knowledge is combined the energy consumption of RANs can be reduced with only a slight loss of performance. Because this results in a trade-off between energy consumption and performance, each RAN operator has to decide which trade-off is preferred.","lang":"eng"}],"user_id":"477","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":"376","file_date_updated":"2018-03-20T07:14:52Z","ddc":["040"],"has_accepted_license":"1","citation":{"ama":"Herlich M. <i>Reducing Energy Consumption of Radio Access Networks</i>. Universität Paderborn; 2014.","chicago":"Herlich, Matthias. <i>Reducing Energy Consumption of Radio Access Networks</i>. Universität Paderborn, 2014.","ieee":"M. Herlich, <i>Reducing Energy Consumption of Radio Access Networks</i>. Universität Paderborn, 2014.","apa":"Herlich, M. (2014). <i>Reducing Energy Consumption of Radio Access Networks</i>. Universität Paderborn.","bibtex":"@book{Herlich_2014, title={Reducing Energy Consumption of Radio Access Networks}, publisher={Universität Paderborn}, author={Herlich, Matthias}, year={2014} }","mla":"Herlich, Matthias. <i>Reducing Energy Consumption of Radio Access Networks</i>. Universität Paderborn, 2014.","short":"M. Herlich, Reducing Energy Consumption of Radio Access Networks, Universität Paderborn, 2014."},"year":"2014","author":[{"first_name":"Matthias","full_name":"Herlich, Matthias","last_name":"Herlich"}],"supervisor":[{"last_name":"Karl","id":"126","full_name":"Karl, Holger","first_name":"Holger"}],"date_created":"2017-10-17T12:42:05Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:35Z","title":"Reducing Energy Consumption of Radio Access Networks"},{"date_updated":"2022-01-06T06:59:37Z","author":[{"first_name":"Jörn","last_name":"Künsemöller","full_name":"Künsemöller, Jörn"},{"first_name":"Sonja","full_name":"Brangewitz, Sonja","last_name":"Brangewitz"},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"},{"first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801"}],"date_created":"2017-10-17T12:42:06Z","title":"Provider Competition in Infrastructure-as-a-Service","doi":"10.1109/SCC.2014.35","has_accepted_license":"1","year":"2014","page":"203-210","citation":{"apa":"Künsemöller, J., Brangewitz, S., Karl, H., &#38; Haake, C.-J. (2014). Provider Competition in Infrastructure-as-a-Service. In <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i> (pp. 203–210). <a href=\"https://doi.org/10.1109/SCC.2014.35\">https://doi.org/10.1109/SCC.2014.35</a>","short":"J. Künsemöller, S. Brangewitz, H. Karl, C.-J. Haake, in: Proceedings of the 2014 IEEE International Conference on Services Computing (SCC), 2014, pp. 203–210.","bibtex":"@inproceedings{Künsemöller_Brangewitz_Karl_Haake_2014, title={Provider Competition in Infrastructure-as-a-Service}, DOI={<a href=\"https://doi.org/10.1109/SCC.2014.35\">10.1109/SCC.2014.35</a>}, booktitle={Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)}, author={Künsemöller, Jörn and Brangewitz, Sonja and Karl, Holger and Haake, Claus-Jochen}, year={2014}, pages={203–210} }","mla":"Künsemöller, Jörn, et al. “Provider Competition in Infrastructure-as-a-Service.” <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i>, 2014, pp. 203–10, doi:<a href=\"https://doi.org/10.1109/SCC.2014.35\">10.1109/SCC.2014.35</a>.","ama":"Künsemöller J, Brangewitz S, Karl H, Haake C-J. Provider Competition in Infrastructure-as-a-Service. In: <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i>. ; 2014:203-210. doi:<a href=\"https://doi.org/10.1109/SCC.2014.35\">10.1109/SCC.2014.35</a>","ieee":"J. Künsemöller, S. Brangewitz, H. Karl, and C.-J. Haake, “Provider Competition in Infrastructure-as-a-Service,” in <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i>, 2014, pp. 203–210.","chicago":"Künsemöller, Jörn, Sonja Brangewitz, Holger Karl, and Claus-Jochen Haake. “Provider Competition in Infrastructure-as-a-Service.” In <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i>, 203–10, 2014. <a href=\"https://doi.org/10.1109/SCC.2014.35\">https://doi.org/10.1109/SCC.2014.35</a>."},"_id":"382","project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"75"},{"_id":"205"}],"user_id":"477","ddc":["004"],"file_date_updated":"2018-11-02T13:34:46Z","language":[{"iso":"eng"}],"publication":"Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)","type":"conference","abstract":[{"text":"This paper explores how cloud provider competition influences instance pricing in an IaaS (Infrastructure-as-a-Service) market. When reserved instance pricing includes an on-demand price component in addition to a reservation fee (two-part tariffs), different providers might offer different price combinations, where the client’s choice depends on its load profile. We investigate a duopoly of providers and analyze stable market prices in two-part tariffs. Further, we study offers that allow a specified amount of included usage (three-part tariffs). Neither two-part nor three-part tariffs produce an equilibrium market outcome other than a service pricing that equals production cost, i.e., complex price structures do not significantly affect the results from ordinary Bertrand competition.","lang":"eng"}],"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-11-02T13:34:46Z","creator":"ups","date_updated":"2018-11-02T13:34:46Z","file_id":"5250","access_level":"closed","file_name":"06930535.pdf","file_size":228172}]},{"date_updated":"2022-01-06T07:01:13Z","publisher":"Universität Paderborn","author":[{"last_name":"Dreimann","full_name":"Dreimann, Philipp","first_name":"Philipp"}],"date_created":"2017-10-17T12:42:21Z","title":"Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic","year":"2014","citation":{"chicago":"Dreimann, Philipp. <i>Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic</i>. Universität Paderborn, 2014.","ieee":"P. Dreimann, <i>Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic</i>. Universität Paderborn, 2014.","ama":"Dreimann P. <i>Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic</i>. Universität Paderborn; 2014.","apa":"Dreimann, P. (2014). <i>Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic</i>. Universität Paderborn.","bibtex":"@book{Dreimann_2014, title={Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic}, publisher={Universität Paderborn}, author={Dreimann, Philipp}, year={2014} }","short":"P. Dreimann, Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic, Universität Paderborn, 2014.","mla":"Dreimann, Philipp. <i>Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic</i>. Universität Paderborn, 2014."},"_id":"458","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","type":"mastersthesis","status":"public"},{"user_id":"477","department":[{"_id":"75"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"461","type":"bachelorsthesis","status":"public","date_created":"2017-10-17T12:42:21Z","author":[{"full_name":"Dräxler, Sevil","id":"31764","last_name":"Dräxler","first_name":"Sevil"}],"date_updated":"2022-01-06T07:01:14Z","publisher":"Universität Paderborn","title":"Adaptive Placement of Programmable Virtual Network Function Chains","citation":{"apa":"Dräxler, S. (2014). <i>Adaptive Placement of Programmable Virtual Network Function Chains</i>. Universität Paderborn.","bibtex":"@book{Dräxler_2014, title={Adaptive Placement of Programmable Virtual Network Function Chains}, publisher={Universität Paderborn}, author={Dräxler, Sevil}, year={2014} }","mla":"Dräxler, Sevil. <i>Adaptive Placement of Programmable Virtual Network Function Chains</i>. Universität Paderborn, 2014.","short":"S. Dräxler, Adaptive Placement of Programmable Virtual Network Function Chains, Universität Paderborn, 2014.","ama":"Dräxler S. <i>Adaptive Placement of Programmable Virtual Network Function Chains</i>. Universität Paderborn; 2014.","chicago":"Dräxler, Sevil. <i>Adaptive Placement of Programmable Virtual Network Function Chains</i>. Universität Paderborn, 2014.","ieee":"S. Dräxler, <i>Adaptive Placement of Programmable Virtual Network Function Chains</i>. Universität Paderborn, 2014."},"year":"2014"},{"year":"2014","date_created":"2017-10-17T12:42:23Z","publisher":"Elsevier","title":"A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service","publication":"Future Generation Computer Systems","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"ups","date_created":"2018-11-02T15:46:17Z","date_updated":"2018-11-02T15:46:17Z","file_id":"5312","access_level":"closed","file_name":"KünsemöllerKarl.pdf","file_size":698992}],"abstract":[{"lang":"eng","text":"Financial benefits are an important factor when cloud infrastructure is considered to meet processing demand. The dynamics of on-demand pricing and service usage are investigated in a two-stage game model for a monopoly Infrastructure-as-a-Service (IaaS) market. The possibility of hybrid clouds (public clouds plus own infrastructure) turns out to be essential in order that not only the provider but also the clients have significant benefits from on-demand services. Even if the client meets all demand in the public cloud, the threat of building a hybrid cloud keeps the instance price low. This is not the case when reserved instances are offered as well. Parameters like load profiles and economies of scale have a huge effect on likely future pricing and on a cost-optimal split-up of client demand between either a client’s own data center and a public cloud service or between reserved and on-demand cloud instances."}],"language":[{"iso":"eng"}],"ddc":["000"],"has_accepted_license":"1","page":"44--52","citation":{"apa":"Künsemöller, J., &#38; Karl, H. (2014). A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service. <i>Future Generation Computer Systems</i>, 44--52. <a href=\"https://doi.org/10.1016/j.future.2014.03.005\">https://doi.org/10.1016/j.future.2014.03.005</a>","short":"J. Künsemöller, H. Karl, Future Generation Computer Systems (2014) 44--52.","mla":"Künsemöller, Jörn, and Holger Karl. “A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service.” <i>Future Generation Computer Systems</i>, Elsevier, 2014, pp. 44--52, doi:<a href=\"https://doi.org/10.1016/j.future.2014.03.005\">10.1016/j.future.2014.03.005</a>.","bibtex":"@article{Künsemöller_Karl_2014, title={A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service}, DOI={<a href=\"https://doi.org/10.1016/j.future.2014.03.005\">10.1016/j.future.2014.03.005</a>}, journal={Future Generation Computer Systems}, publisher={Elsevier}, author={Künsemöller, Jörn and Karl, Holger}, year={2014}, pages={44--52} }","ama":"Künsemöller J, Karl H. A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service. <i>Future Generation Computer Systems</i>. 2014:44--52. doi:<a href=\"https://doi.org/10.1016/j.future.2014.03.005\">10.1016/j.future.2014.03.005</a>","ieee":"J. Künsemöller and H. Karl, “A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service,” <i>Future Generation Computer Systems</i>, pp. 44--52, 2014.","chicago":"Künsemöller, Jörn, and Holger Karl. “A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service.” <i>Future Generation Computer Systems</i>, 2014, 44--52. <a href=\"https://doi.org/10.1016/j.future.2014.03.005\">https://doi.org/10.1016/j.future.2014.03.005</a>."},"author":[{"first_name":"Jörn","last_name":"Künsemöller","full_name":"Künsemöller, Jörn"},{"last_name":"Karl","id":"126","full_name":"Karl, Holger","first_name":"Holger"}],"date_updated":"2022-01-06T07:01:17Z","doi":"10.1016/j.future.2014.03.005","type":"journal_article","status":"public","department":[{"_id":"75"}],"user_id":"477","_id":"467","project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file_date_updated":"2018-11-02T15:46:17Z"},{"title":"Using MAC addresses as efficient routing labels in data centers","doi":"10.1145/2620728.2620730","date_updated":"2022-01-06T07:03:41Z","author":[{"full_name":"Schwabe, Arne","last_name":"Schwabe","first_name":"Arne"},{"full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}],"date_created":"2017-11-27T10:22:25Z","year":"2014","citation":{"ama":"Schwabe A, Karl H. Using MAC addresses as efficient routing labels in data centers. In: <i>Proceedings of the Third Workshop on Hot Topics in Software Defined Networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014</i>. ; 2014:115--120. doi:<a href=\"https://doi.org/10.1145/2620728.2620730\">10.1145/2620728.2620730</a>","ieee":"A. Schwabe and H. Karl, “Using MAC addresses as efficient routing labels in data centers,” in <i>Proceedings of the third workshop on Hot topics in software defined networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014</i>, 2014, pp. 115--120.","chicago":"Schwabe, Arne, and Holger Karl. “Using MAC Addresses as Efficient Routing Labels in Data Centers.” In <i>Proceedings of the Third Workshop on Hot Topics in Software Defined Networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014</i>, 115--120, 2014. <a href=\"https://doi.org/10.1145/2620728.2620730\">https://doi.org/10.1145/2620728.2620730</a>.","mla":"Schwabe, Arne, and Holger Karl. “Using MAC Addresses as Efficient Routing Labels in Data Centers.” <i>Proceedings of the Third Workshop on Hot Topics in Software Defined Networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014</i>, 2014, pp. 115--120, doi:<a href=\"https://doi.org/10.1145/2620728.2620730\">10.1145/2620728.2620730</a>.","short":"A. Schwabe, H. Karl, in: Proceedings of the Third Workshop on Hot Topics in Software Defined Networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014, 2014, pp. 115--120.","bibtex":"@inproceedings{Schwabe_Karl_2014, title={Using MAC addresses as efficient routing labels in data centers}, DOI={<a href=\"https://doi.org/10.1145/2620728.2620730\">10.1145/2620728.2620730</a>}, booktitle={Proceedings of the third workshop on Hot topics in software defined networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014}, author={Schwabe, Arne and Karl, Holger}, year={2014}, pages={115--120} }","apa":"Schwabe, A., &#38; Karl, H. (2014). Using MAC addresses as efficient routing labels in data centers. In <i>Proceedings of the third workshop on Hot topics in software defined networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014</i> (pp. 115--120). <a href=\"https://doi.org/10.1145/2620728.2620730\">https://doi.org/10.1145/2620728.2620730</a>"},"page":"115--120","has_accepted_license":"1","ddc":["004"],"file_date_updated":"2018-11-02T13:32:48Z","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"6","name":"SFB 901 - Subproject A2"}],"_id":"762","user_id":"477","department":[{"_id":"75"}],"file":[{"relation":"main_file","content_type":"application/pdf","file_id":"5249","access_level":"closed","file_name":"p115-schwabe.pdf","file_size":1349578,"date_created":"2018-11-02T13:32:48Z","creator":"ups","date_updated":"2018-11-02T13:32:48Z"}],"status":"public","type":"conference","publication":"Proceedings of the third workshop on Hot topics in software defined networking, HotSDN '14, Chicago, Illinois, USA, August 22, 2014"}]