[{"date_updated":"2022-01-06T07:03:25Z","author":[{"id":"38705","first_name":"Jannik","last_name":"Sundermeier","full_name":"Sundermeier, Jannik"}],"status":"public","year":"2017","title":"Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions","user_id":"38705","language":[{"iso":"eng"}],"_id":"699","publisher":"Universität Paderborn","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"citation":{"mla":"Sundermeier, Jannik. <i>Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn, 2017.","ama":"Sundermeier J. <i>Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn; 2017.","bibtex":"@book{Sundermeier_2017, title={Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions}, publisher={Universität Paderborn}, author={Sundermeier, Jannik}, year={2017} }","apa":"Sundermeier, J. (2017). <i>Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn.","ieee":"J. Sundermeier, <i>Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn, 2017.","short":"J. Sundermeier, Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions, Universität Paderborn, 2017.","chicago":"Sundermeier, Jannik. <i>Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn, 2017."},"department":[{"_id":"79"}],"type":"mastersthesis","date_created":"2017-11-14T08:03:45Z"},{"date_created":"2017-10-17T12:41:05Z","file":[{"relation":"main_file","date_updated":"2018-11-02T15:06:13Z","file_name":"PriceFluctuationInOnlineLeasin.pdf","access_level":"closed","file_size":287315,"file_id":"5293","success":1,"content_type":"application/pdf","creator":"ups","date_created":"2018-11-02T15:06:13Z"}],"department":[{"_id":"63"}],"type":"conference","citation":{"mla":"Feldkord, Björn, et al. “Price Fluctuations in Online Leasing.” <i>Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2017, pp. 17–31, doi:<a href=\"https://doi.org/10.1007/978-3-319-71147-8_2\">10.1007/978-3-319-71147-8_2</a>.","bibtex":"@inproceedings{Feldkord_Markarian_Meyer auf der Heide_2017, title={Price Fluctuations in Online Leasing}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-71147-8_2\">10.1007/978-3-319-71147-8_2</a>}, booktitle={Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Feldkord, Björn and Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2017}, pages={17–31} }","ama":"Feldkord B, Markarian C, Meyer auf der Heide F. Price Fluctuations in Online Leasing. In: <i>Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>. ; 2017:17-31. doi:<a href=\"https://doi.org/10.1007/978-3-319-71147-8_2\">10.1007/978-3-319-71147-8_2</a>","ieee":"B. Feldkord, C. Markarian, and F. Meyer auf der Heide, “Price Fluctuations in Online Leasing,” in <i>Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2017, pp. 17–31.","apa":"Feldkord, B., Markarian, C., &#38; Meyer auf der Heide, F. (2017). Price Fluctuations in Online Leasing. In <i>Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i> (pp. 17–31). <a href=\"https://doi.org/10.1007/978-3-319-71147-8_2\">https://doi.org/10.1007/978-3-319-71147-8_2</a>","chicago":"Feldkord, Björn, Christine Markarian, and Friedhelm Meyer auf der Heide. “Price Fluctuations in Online Leasing.” In <i>Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 17–31, 2017. <a href=\"https://doi.org/10.1007/978-3-319-71147-8_2\">https://doi.org/10.1007/978-3-319-71147-8_2</a>.","short":"B. Feldkord, C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2017, pp. 17–31."},"file_date_updated":"2018-11-02T15:06:13Z","publication":"Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"language":[{"iso":"eng"}],"_id":"70","page":"17 - 31","user_id":"477","ddc":["000"],"doi":"10.1007/978-3-319-71147-8_2","author":[{"full_name":"Feldkord, Björn","first_name":"Björn","last_name":"Feldkord","id":"22704"},{"first_name":"Christine","last_name":"Markarian","full_name":"Markarian, Christine","id":"37612"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"title":"Price Fluctuations in Online Leasing","status":"public","year":"2017","has_accepted_license":"1","date_updated":"2022-01-06T07:03:26Z"},{"department":[{"_id":"79"}],"type":"mastersthesis","date_created":"2017-11-14T08:04:35Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"bibtex":"@book{Knollmann_2017, title={A Self-Stabilizing Protocol for Graphs of Diameter Two}, publisher={Universität Paderborn}, author={Knollmann, Till}, year={2017} }","chicago":"Knollmann, Till. <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>. Universität Paderborn, 2017.","short":"T. Knollmann, A Self-Stabilizing Protocol for Graphs of Diameter Two, Universität Paderborn, 2017.","ama":"Knollmann T. <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>. Universität Paderborn; 2017.","ieee":"T. Knollmann, <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>. Universität Paderborn, 2017.","mla":"Knollmann, Till. <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>. Universität Paderborn, 2017.","apa":"Knollmann, T. (2017). <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>. Universität Paderborn."},"supervisor":[{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"}],"user_id":"477","language":[{"iso":"eng"}],"_id":"700","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:26Z","author":[{"first_name":"Till","last_name":"Knollmann","full_name":"Knollmann, Till"}],"year":"2017","status":"public","title":"A Self-Stabilizing Protocol for Graphs of Diameter Two"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"supervisor":[{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"citation":{"ama":"Götte T. <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn; 2017.","short":"T. Götte, Self-Stabilizing Spanners for Tree Metrics, Universität Paderborn, 2017.","chicago":"Götte, Thorsten. <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn, 2017.","bibtex":"@book{Götte_2017, title={Self-Stabilizing Spanners for Tree Metrics}, publisher={Universität Paderborn}, author={Götte, Thorsten}, year={2017} }","mla":"Götte, Thorsten. <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn, 2017.","apa":"Götte, T. (2017). <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn.","ieee":"T. Götte, <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn, 2017."},"type":"mastersthesis","department":[{"_id":"79"}],"date_created":"2017-11-14T09:32:39Z","date_updated":"2022-01-06T07:03:26Z","status":"public","title":"Self-Stabilizing Spanners for Tree Metrics","year":"2017","author":[{"id":"34727","first_name":"Thorsten","last_name":"Götte","full_name":"Götte, Thorsten"}],"user_id":"477","_id":"701","language":[{"iso":"eng"}],"publisher":"Universität Paderborn"},{"year":"2017","status":"public","title":"Deep Learning Assisted Heuristic Tree Search for the Container Pre-marshalling Problem","author":[{"last_name":"Hottung","first_name":"André","full_name":"Hottung, André"},{"last_name":"Tanaka","first_name":"Shunji","full_name":"Tanaka, Shunji"},{"last_name":"Tierney","first_name":"Kevin","full_name":"Tierney, Kevin"}],"date_updated":"2022-01-06T07:03:26Z","language":[{"iso":"eng"}],"_id":"7011","user_id":"52534","publication":"CoRR abs/1709.09972","citation":{"ieee":"A. Hottung, S. Tanaka, and K. Tierney, “Deep Learning Assisted Heuristic Tree Search for the Container Pre-marshalling Problem,” <i>CoRR abs/1709.09972</i>, 2017.","mla":"Hottung, André, et al. “Deep Learning Assisted Heuristic Tree Search for the Container Pre-Marshalling Problem.” <i>CoRR Abs/1709.09972</i>, 2017.","apa":"Hottung, A., Tanaka, S., &#38; Tierney, K. (2017). Deep Learning Assisted Heuristic Tree Search for the Container Pre-marshalling Problem. <i>CoRR Abs/1709.09972</i>.","bibtex":"@article{Hottung_Tanaka_Tierney_2017, title={Deep Learning Assisted Heuristic Tree Search for the Container Pre-marshalling Problem}, journal={CoRR abs/1709.09972}, author={Hottung, André and Tanaka, Shunji and Tierney, Kevin}, year={2017} }","short":"A. Hottung, S. Tanaka, K. Tierney, CoRR Abs/1709.09972 (2017).","ama":"Hottung A, Tanaka S, Tierney K. Deep Learning Assisted Heuristic Tree Search for the Container Pre-marshalling Problem. <i>CoRR abs/170909972</i>. 2017.","chicago":"Hottung, André, Shunji Tanaka, and Kevin Tierney. “Deep Learning Assisted Heuristic Tree Search for the Container Pre-Marshalling Problem.” <i>CoRR Abs/1709.09972</i>, 2017."},"date_created":"2019-01-28T08:25:16Z","type":"journal_article","department":[{"_id":"66"}]},{"page":"18-21","_id":"7012","language":[{"iso":"eng"}],"user_id":"52534","title":"Towards DevOps in Multi-provider Projects","year":"2017","status":"public","author":[{"first_name":"Masud","last_name":"Fazal-Baqaie","full_name":"Fazal-Baqaie, Masud"},{"full_name":"Güldali, Baris","first_name":"Baris","last_name":"Güldali"},{"first_name":"Simon","last_name":"Oberthür","full_name":"Oberthür, Simon","id":"383"}],"date_updated":"2022-01-06T07:03:26Z","date_created":"2019-01-28T08:28:26Z","type":"journal_article","department":[{"_id":"66"}],"publication":"CSE@SE 2017","citation":{"mla":"Fazal-Baqaie, Masud, et al. “Towards DevOps in Multi-Provider Projects.” <i>CSE@SE 2017</i>, 2017, pp. 18–21.","bibtex":"@article{Fazal-Baqaie_Güldali_Oberthür_2017, title={Towards DevOps in Multi-provider Projects}, journal={CSE@SE 2017}, author={Fazal-Baqaie, Masud and Güldali, Baris and Oberthür, Simon}, year={2017}, pages={18–21} }","ama":"Fazal-Baqaie M, Güldali B, Oberthür S. Towards DevOps in Multi-provider Projects. <i>CSE@SE 2017</i>. 2017:18-21.","ieee":"M. Fazal-Baqaie, B. Güldali, and S. Oberthür, “Towards DevOps in Multi-provider Projects,” <i>CSE@SE 2017</i>, pp. 18–21, 2017.","apa":"Fazal-Baqaie, M., Güldali, B., &#38; Oberthür, S. (2017). Towards DevOps in Multi-provider Projects. <i>CSE@SE 2017</i>, 18–21.","chicago":"Fazal-Baqaie, Masud, Baris Güldali, and Simon Oberthür. “Towards DevOps in Multi-Provider Projects.” <i>CSE@SE 2017</i>, 2017, 18–21.","short":"M. Fazal-Baqaie, B. Güldali, S. Oberthür, CSE@SE 2017 (2017) 18–21."}},{"author":[{"first_name":"Pavel","last_name":"Podlipyan","full_name":"Podlipyan, Pavel"}],"title":"Local Algorithms for the Continuous Gathering Problem","status":"public","year":"2017","date_updated":"2022-01-06T07:03:26Z","_id":"703","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"doi":"10.17619/UNIPB/1-230","user_id":"15415","supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"citation":{"mla":"Podlipyan, Pavel. <i>Local Algorithms for the Continuous Gathering Problem</i>. Universität Paderborn, 2017, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-230\">10.17619/UNIPB/1-230</a>.","bibtex":"@book{Podlipyan_2017, title={Local Algorithms for the Continuous Gathering Problem}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-230\">10.17619/UNIPB/1-230</a>}, publisher={Universität Paderborn}, author={Podlipyan, Pavel}, year={2017} }","ama":"Podlipyan P. <i>Local Algorithms for the Continuous Gathering Problem</i>. Universität Paderborn; 2017. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-230\">10.17619/UNIPB/1-230</a>","ieee":"P. Podlipyan, <i>Local Algorithms for the Continuous Gathering Problem</i>. Universität Paderborn, 2017.","apa":"Podlipyan, P. (2017). <i>Local Algorithms for the Continuous Gathering Problem</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-230\">https://doi.org/10.17619/UNIPB/1-230</a>","chicago":"Podlipyan, Pavel. <i>Local Algorithms for the Continuous Gathering Problem</i>. Universität Paderborn, 2017. <a href=\"https://doi.org/10.17619/UNIPB/1-230\">https://doi.org/10.17619/UNIPB/1-230</a>.","short":"P. Podlipyan, Local Algorithms for the Continuous Gathering Problem, Universität Paderborn, 2017."},"related_material":{"link":[{"relation":"confirmation","url":"https://doi.org/10.17619/UNIPB/1-230"}]},"date_created":"2017-11-14T14:13:21Z","department":[{"_id":"63"}],"type":"dissertation"},{"has_accepted_license":"1","date_updated":"2022-01-06T07:03:27Z","author":[{"first_name":"Sören","last_name":"Riechers","full_name":"Riechers, Sören"}],"title":"Scheduling with Scarce Resources","year":"2017","status":"public","user_id":"14052","doi":"10.17619/UNIPB/1-231","ddc":["000"],"language":[{"iso":"eng"}],"_id":"704","publisher":"Universität Paderborn","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"name":"SFB 901 - Project Area C","_id":"4"}],"citation":{"mla":"Riechers, Sören. <i>Scheduling with Scarce Resources</i>. Universität Paderborn, 2017, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-231\">10.17619/UNIPB/1-231</a>.","ama":"Riechers S. <i>Scheduling with Scarce Resources</i>. Universität Paderborn; 2017. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-231\">10.17619/UNIPB/1-231</a>","bibtex":"@book{Riechers_2017, title={Scheduling with Scarce Resources}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-231\">10.17619/UNIPB/1-231</a>}, publisher={Universität Paderborn}, author={Riechers, Sören}, year={2017} }","apa":"Riechers, S. (2017). <i>Scheduling with Scarce Resources</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-231\">https://doi.org/10.17619/UNIPB/1-231</a>","ieee":"S. Riechers, <i>Scheduling with Scarce Resources</i>. Universität Paderborn, 2017.","short":"S. Riechers, Scheduling with Scarce Resources, Universität Paderborn, 2017.","chicago":"Riechers, Sören. <i>Scheduling with Scarce Resources</i>. Universität Paderborn, 2017. <a href=\"https://doi.org/10.17619/UNIPB/1-231\">https://doi.org/10.17619/UNIPB/1-231</a>."},"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"file_date_updated":"2018-11-14T15:18:37Z","department":[{"_id":"63"}],"type":"dissertation","date_created":"2017-11-15T07:51:07Z","file":[{"date_created":"2018-11-14T15:18:37Z","creator":"feldi","file_id":"5673","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-14T15:18:37Z","file_name":"thesisStable.pdf","file_size":1491627,"access_level":"closed"}]},{"citation":{"short":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, Journal of Combinatorial Optimization 36 (2017) 1168–1194.","chicago":"Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” <i>Journal of Combinatorial Optimization</i> 36, no. 4 (2017): 1168–94. <a href=\"https://doi.org/10.1007/s10878-017-0198-x\">https://doi.org/10.1007/s10878-017-0198-x</a>.","apa":"Mäcker, A., Malatyali, M., Meyer auf der Heide, F., &#38; Riechers, S. (2017). Cost-efficient Scheduling on Machines from the Cloud. <i>Journal of Combinatorial Optimization</i>, <i>36</i>(4), 1168–1194. <a href=\"https://doi.org/10.1007/s10878-017-0198-x\">https://doi.org/10.1007/s10878-017-0198-x</a>","ieee":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient Scheduling on Machines from the Cloud,” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, pp. 1168–1194, 2017.","ama":"Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Cost-efficient Scheduling on Machines from the Cloud. <i>Journal of Combinatorial Optimization</i>. 2017;36(4):1168-1194. doi:<a href=\"https://doi.org/10.1007/s10878-017-0198-x\">10.1007/s10878-017-0198-x</a>","bibtex":"@article{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2017, title={Cost-efficient Scheduling on Machines from the Cloud}, volume={36}, DOI={<a href=\"https://doi.org/10.1007/s10878-017-0198-x\">10.1007/s10878-017-0198-x</a>}, number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2017}, pages={1168–1194} }","mla":"Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, Springer, 2017, pp. 1168–94, doi:<a href=\"https://doi.org/10.1007/s10878-017-0198-x\">10.1007/s10878-017-0198-x</a>."},"file_date_updated":"2018-03-14T12:21:34Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"4","name":"SFB 901 - Project Area C"}],"status":"public","has_accepted_license":"1","_id":"706","publisher":"Springer","page":"1168-1194","volume":36,"user_id":"15415","ddc":["040"],"issue":"4","publication":"Journal of Combinatorial Optimization","date_created":"2017-11-15T10:21:34Z","file":[{"date_updated":"2018-03-14T12:21:34Z","relation":"main_file","access_level":"closed","file_size":608614,"file_name":"706-chp_3A10.1007_2F978-3-319-48749-6_42.pdf","success":1,"content_type":"application/pdf","file_id":"1210","creator":"florida","date_created":"2018-03-14T12:21:34Z"}],"department":[{"_id":"63"}],"type":"journal_article","author":[{"id":"13536","last_name":"Mäcker","first_name":"Alexander","full_name":"Mäcker, Alexander"},{"first_name":"Manuel","last_name":"Malatyali","full_name":"Malatyali, Manuel"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"full_name":"Riechers, Sören","first_name":"Sören","last_name":"Riechers"}],"year":"2017","title":"Cost-efficient Scheduling on Machines from the Cloud","intvolume":"        36","date_updated":"2022-01-06T07:03:27Z","language":[{"iso":"eng"}],"doi":"10.1007/s10878-017-0198-x"},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"name":"SFB 901 - Project Area B","_id":"3"}],"supervisor":[{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"}],"citation":{"chicago":"Walther, Sven. <i>Knowledge-Based Verification of Service Compositions</i>. Universität Paderborn, 2017. <a href=\"https://doi.org/10.17619/UNIPB/1-307\">https://doi.org/10.17619/UNIPB/1-307</a>.","short":"S. Walther, Knowledge-Based Verification of Service Compositions, Universität Paderborn, 2017.","ieee":"S. Walther, <i>Knowledge-based Verification of Service Compositions</i>. Universität Paderborn, 2017.","apa":"Walther, S. (2017). <i>Knowledge-based Verification of Service Compositions</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-307\">https://doi.org/10.17619/UNIPB/1-307</a>","bibtex":"@book{Walther_2017, title={Knowledge-based Verification of Service Compositions}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-307\">10.17619/UNIPB/1-307</a>}, publisher={Universität Paderborn}, author={Walther, Sven}, year={2017} }","ama":"Walther S. <i>Knowledge-Based Verification of Service Compositions</i>. Universität Paderborn; 2017. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-307\">10.17619/UNIPB/1-307</a>","mla":"Walther, Sven. <i>Knowledge-Based Verification of Service Compositions</i>. Universität Paderborn, 2017, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-307\">10.17619/UNIPB/1-307</a>."},"department":[{"_id":"77"}],"type":"dissertation","date_created":"2017-11-20T07:59:31Z","date_updated":"2022-01-06T07:03:27Z","author":[{"last_name":"Walther","first_name":"Sven","full_name":"Walther, Sven"}],"title":"Knowledge-based Verification of Service Compositions","year":"2017","status":"public","doi":"10.17619/UNIPB/1-307","user_id":"477","_id":"707","language":[{"iso":"eng"}],"publisher":"Universität Paderborn"},{"_id":"708","page":"1--5","user_id":"15572","doi":"10.1109/NETSOFT.2017.8004209","author":[{"full_name":"Schwabe, Arne","last_name":"Schwabe","first_name":"Arne"},{"full_name":"Rojas, Elisa","first_name":"Elisa","last_name":"Rojas"},{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}],"conference":{"location":"Bologna"},"status":"public","title":"Minimizing downtimes: Using dynamic reconfiguration and state management in SDN","year":"2017","date_updated":"2022-01-06T07:03:27Z","date_created":"2017-11-20T08:29:25Z","department":[{"_id":"75"}],"type":"conference","citation":{"bibtex":"@inproceedings{Schwabe_Rojas_Karl_2017, title={Minimizing downtimes: Using dynamic reconfiguration and state management in SDN}, DOI={<a href=\"https://doi.org/10.1109/NETSOFT.2017.8004209\">10.1109/NETSOFT.2017.8004209</a>}, booktitle={2017 {IEEE} Conference on Network Softwarization, NetSoft 2017, Bologna, Italy, July 3-7, 2017}, author={Schwabe, Arne and Rojas, Elisa and Karl, Holger}, year={2017}, pages={1--5} }","ama":"Schwabe A, Rojas E, Karl H. Minimizing downtimes: Using dynamic reconfiguration and state management in SDN. In: <i>2017 {IEEE} Conference on Network Softwarization, NetSoft 2017, Bologna, Italy, July 3-7, 2017</i>. ; 2017:1--5. doi:<a href=\"https://doi.org/10.1109/NETSOFT.2017.8004209\">10.1109/NETSOFT.2017.8004209</a>","mla":"Schwabe, Arne, et al. “Minimizing Downtimes: Using Dynamic Reconfiguration and State Management in SDN.” <i>2017 {IEEE} Conference on Network Softwarization, NetSoft 2017, Bologna, Italy, July 3-7, 2017</i>, 2017, pp. 1--5, doi:<a href=\"https://doi.org/10.1109/NETSOFT.2017.8004209\">10.1109/NETSOFT.2017.8004209</a>.","short":"A. Schwabe, E. Rojas, H. Karl, in: 2017 {IEEE} Conference on Network Softwarization, NetSoft 2017, Bologna, Italy, July 3-7, 2017, 2017, pp. 1--5.","chicago":"Schwabe, Arne, Elisa Rojas, and Holger Karl. “Minimizing Downtimes: Using Dynamic Reconfiguration and State Management in SDN.” In <i>2017 {IEEE} Conference on Network Softwarization, NetSoft 2017, Bologna, Italy, July 3-7, 2017</i>, 1--5, 2017. <a href=\"https://doi.org/10.1109/NETSOFT.2017.8004209\">https://doi.org/10.1109/NETSOFT.2017.8004209</a>.","ieee":"A. Schwabe, E. Rojas, and H. Karl, “Minimizing downtimes: Using dynamic reconfiguration and state management in SDN,” in <i>2017 {IEEE} Conference on Network Softwarization, NetSoft 2017, Bologna, Italy, July 3-7, 2017</i>, Bologna, 2017, pp. 1--5.","apa":"Schwabe, A., Rojas, E., &#38; Karl, H. (2017). Minimizing downtimes: Using dynamic reconfiguration and state management in SDN. In <i>2017 {IEEE} Conference on Network Softwarization, NetSoft 2017, Bologna, Italy, July 3-7, 2017</i> (pp. 1--5). Bologna. <a href=\"https://doi.org/10.1109/NETSOFT.2017.8004209\">https://doi.org/10.1109/NETSOFT.2017.8004209</a>"},"publication":"2017 {IEEE} Conference on Network Softwarization, NetSoft 2017, Bologna, Italy, July 3-7, 2017","quality_controlled":"1"},{"author":[{"full_name":"Czech, Mike","last_name":"Czech","first_name":"Mike"},{"id":"48129","full_name":"Hüllermeier, Eyke","first_name":"Eyke","last_name":"Hüllermeier"},{"last_name":"Jakobs","first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine"},{"id":"573","first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike"}],"title":"Predicting Rankings of Software Verification Tools","year":"2017","date_updated":"2022-01-06T07:03:28Z","series_title":"SWAN'17","language":[{"iso":"eng"}],"doi":"10.1145/3121257.3121262","publication":"Proceedings of the 3rd International Workshop on Software Analytics","abstract":[{"lang":"eng","text":"Today, software verification tools have reached the maturity to be used for large scale programs. Different tools perform differently well on varying code. A software developer is hence faced with the problem of choosing a tool appropriate for her program at hand. A ranking of tools on programs could facilitate the choice. Such rankings can, however, so far only be obtained by running all considered tools on the program.In this paper, we present a machine learning approach to predicting rankings of tools on programs. The method builds upon so-called label ranking algorithms, which we complement with appropriate kernels providing a similarity measure for programs. Our kernels employ a graph representation for software source code that mixes elements of control flow and program dependence graphs with abstract syntax trees. Using data sets from the software verification competition SV-COMP, we demonstrate our rank prediction technique to generalize well and achieve a rather high predictive accuracy (rank correlation > 0.6)."}],"date_created":"2017-10-17T12:41:05Z","file":[{"creator":"ups","date_created":"2018-11-02T14:24:29Z","date_updated":"2018-11-02T14:24:29Z","relation":"main_file","access_level":"closed","file_size":822383,"file_name":"fsews17swan-swanmain1.pdf","content_type":"application/pdf","success":1,"file_id":"5271"}],"department":[{"_id":"355"},{"_id":"77"}],"type":"conference","status":"public","has_accepted_license":"1","_id":"71","page":"23-26","user_id":"15504","ddc":["000"],"citation":{"bibtex":"@inproceedings{Czech_Hüllermeier_Jakobs_Wehrheim_2017, series={SWAN’17}, title={Predicting Rankings of Software Verification Tools}, DOI={<a href=\"https://doi.org/10.1145/3121257.3121262\">10.1145/3121257.3121262</a>}, booktitle={Proceedings of the 3rd International Workshop on Software Analytics}, author={Czech, Mike and Hüllermeier, Eyke and Jakobs, Marie-Christine and Wehrheim, Heike}, year={2017}, pages={23–26}, collection={SWAN’17} }","ama":"Czech M, Hüllermeier E, Jakobs M-C, Wehrheim H. Predicting Rankings of Software Verification Tools. In: <i>Proceedings of the 3rd International Workshop on Software Analytics</i>. SWAN’17. ; 2017:23-26. doi:<a href=\"https://doi.org/10.1145/3121257.3121262\">10.1145/3121257.3121262</a>","short":"M. Czech, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, in: Proceedings of the 3rd International Workshop on Software Analytics, 2017, pp. 23–26.","chicago":"Czech, Mike, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim. “Predicting Rankings of Software Verification Tools.” In <i>Proceedings of the 3rd International Workshop on Software Analytics</i>, 23–26. SWAN’17, 2017. <a href=\"https://doi.org/10.1145/3121257.3121262\">https://doi.org/10.1145/3121257.3121262</a>.","ieee":"M. Czech, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, “Predicting Rankings of Software Verification Tools,” in <i>Proceedings of the 3rd International Workshop on Software Analytics</i>, 2017, pp. 23–26.","mla":"Czech, Mike, et al. “Predicting Rankings of Software Verification Tools.” <i>Proceedings of the 3rd International Workshop on Software Analytics</i>, 2017, pp. 23–26, doi:<a href=\"https://doi.org/10.1145/3121257.3121262\">10.1145/3121257.3121262</a>.","apa":"Czech, M., Hüllermeier, E., Jakobs, M.-C., &#38; Wehrheim, H. (2017). Predicting Rankings of Software Verification Tools. In <i>Proceedings of the 3rd International Workshop on Software Analytics</i> (pp. 23–26). <a href=\"https://doi.org/10.1145/3121257.3121262\">https://doi.org/10.1145/3121257.3121262</a>"},"file_date_updated":"2018-11-02T14:24:29Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B3","_id":"11"}]},{"abstract":[{"text":"In conventional large-scale networks, creation and management of network services are costly and complex tasks that often consume a lot of resources, including time and manpower. Network softwarization and network function virtualization have been introduced to tackle these problems, aiming at decreasing costs and complexity of implementing new services, maintaining the implemented services, and managing available resources in service provisioning platforms and underlying infrastructures. To experience the full potential of these approaches, innovative development support tools and service provisioning environments are needed. To answer these needs, we introduce the architecture of the open-source SONATA system, a service programming, orchestration, and management framework. We present a development toolchain for virtualized network services, fully integrated with a service platform and orchestration system. We introduce the modular and flexible architecture of our system and discuss its main components and features, such as function- and service-specific managers that allow fine-grained service management, slicing support to facilitate multi-tenancy, recursiveness for improved scalability, and full-featured DevOps support.","lang":"eng"}],"publication":"2017 IEEE International Conference on Communications Workshops (ICC Workshops)","type":"conference","department":[{"_id":"75"}],"file":[{"date_created":"2018-11-02T14:22:10Z","creator":"ups","content_type":"application/pdf","success":1,"file_id":"5270","date_updated":"2018-11-02T14:22:10Z","relation":"main_file","access_level":"closed","file_size":821211,"file_name":"07962785.pdf"}],"date_created":"2017-11-22T09:42:59Z","date_updated":"2022-01-06T07:03:28Z","publication_status":"published","title":"SONATA: Service programming and orchestration for virtualized software networks","year":"2017","author":[{"id":"31764","full_name":"Dräxler, Sevil","first_name":"Sevil","last_name":"Dräxler"},{"full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger","id":"126"},{"id":"13271","full_name":"Peuster, Manuel","first_name":"Manuel","last_name":"Peuster"},{"last_name":"Razzaghi Kouchaksaraei","first_name":"Hadi","full_name":"Razzaghi Kouchaksaraei, Hadi","id":"60845"},{"first_name":"Michael","last_name":"Bredel","full_name":"Bredel, Michael"},{"full_name":"Lessmann, Johannes","last_name":"Lessmann","first_name":"Johannes"},{"first_name":"Thomas","last_name":"Soenen","full_name":"Soenen, Thomas"},{"first_name":"Wouter","last_name":"Tavernier","full_name":"Tavernier, Wouter"},{"first_name":"Sharon","last_name":"Mendel-Brin","full_name":"Mendel-Brin, Sharon"},{"last_name":"Xilouris","first_name":"George","full_name":"Xilouris, George"}],"publication_identifier":{"isbn":["9781509015252"]},"doi":"10.1109/iccw.2017.7962785","main_file_link":[{"url":"https://arxiv.org/pdf/1605.05850.pdf","open_access":"1"}],"language":[{"iso":"eng"}],"project":[{"call_identifier":"5G PPP Phase 1","name":"SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks","_id":"25","grant_number":"671517"},{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"file_date_updated":"2018-11-02T14:22:10Z","citation":{"apa":"Dräxler, S., Karl, H., Peuster, M., Razzaghi Kouchaksaraei, H., Bredel, M., Lessmann, J., … Xilouris, G. (2017). SONATA: Service programming and orchestration for virtualized software networks. In <i>2017 IEEE International Conference on Communications Workshops (ICC Workshops)</i>. Paris, France: IEEE. <a href=\"https://doi.org/10.1109/iccw.2017.7962785\">https://doi.org/10.1109/iccw.2017.7962785</a>","ieee":"S. Dräxler <i>et al.</i>, “SONATA: Service programming and orchestration for virtualized software networks,” in <i>2017 IEEE International Conference on Communications Workshops (ICC Workshops)</i>, Paris, France, 2017.","short":"S. Dräxler, H. Karl, M. Peuster, H. Razzaghi Kouchaksaraei, M. Bredel, J. Lessmann, T. Soenen, W. Tavernier, S. Mendel-Brin, G. Xilouris, in: 2017 IEEE International Conference on Communications Workshops (ICC Workshops), IEEE, 2017.","chicago":"Dräxler, Sevil, Holger Karl, Manuel Peuster, Hadi Razzaghi Kouchaksaraei, Michael Bredel, Johannes Lessmann, Thomas Soenen, Wouter Tavernier, Sharon Mendel-Brin, and George Xilouris. “SONATA: Service Programming and Orchestration for Virtualized Software Networks.” In <i>2017 IEEE International Conference on Communications Workshops (ICC Workshops)</i>. IEEE, 2017. <a href=\"https://doi.org/10.1109/iccw.2017.7962785\">https://doi.org/10.1109/iccw.2017.7962785</a>.","mla":"Dräxler, Sevil, et al. “SONATA: Service Programming and Orchestration for Virtualized Software Networks.” <i>2017 IEEE International Conference on Communications Workshops (ICC Workshops)</i>, IEEE, 2017, doi:<a href=\"https://doi.org/10.1109/iccw.2017.7962785\">10.1109/iccw.2017.7962785</a>.","ama":"Dräxler S, Karl H, Peuster M, et al. SONATA: Service programming and orchestration for virtualized software networks. In: <i>2017 IEEE International Conference on Communications Workshops (ICC Workshops)</i>. IEEE; 2017. doi:<a href=\"https://doi.org/10.1109/iccw.2017.7962785\">10.1109/iccw.2017.7962785</a>","bibtex":"@inproceedings{Dräxler_Karl_Peuster_Razzaghi Kouchaksaraei_Bredel_Lessmann_Soenen_Tavernier_Mendel-Brin_Xilouris_2017, title={SONATA: Service programming and orchestration for virtualized software networks}, DOI={<a href=\"https://doi.org/10.1109/iccw.2017.7962785\">10.1109/iccw.2017.7962785</a>}, booktitle={2017 IEEE International Conference on Communications Workshops (ICC Workshops)}, publisher={IEEE}, author={Dräxler, Sevil and Karl, Holger and Peuster, Manuel and Razzaghi Kouchaksaraei, Hadi and Bredel, Michael and Lessmann, Johannes and Soenen, Thomas and Tavernier, Wouter and Mendel-Brin, Sharon and Xilouris, George}, year={2017} }"},"oa":"1","has_accepted_license":"1","status":"public","conference":{"end_date":"2017-05-25","location":"Paris, France","start_date":"2017-05-21","name":"2017 IEEE International Conference on Communications Workshops (ICC Workshops)"},"ddc":["000"],"user_id":"31764","publisher":"IEEE","_id":"717"},{"_id":"72","language":[{"iso":"eng"}],"user_id":"15504","ddc":["000"],"author":[{"full_name":"Czech, Mike","last_name":"Czech","first_name":"Mike"},{"last_name":"Hüllermeier","first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129"},{"full_name":"Jakobs, Marie-Christine","last_name":"Jakobs","first_name":"Marie-Christine"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike","id":"573"}],"status":"public","title":"Predicting Rankings of Software Verification Competitions","year":"2017","has_accepted_license":"1","date_updated":"2022-01-06T07:03:29Z","date_created":"2017-10-17T12:41:05Z","file":[{"file_id":"5782","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-21T10:50:11Z","file_name":"Predicting Rankings of Soware Verification Competitions.pdf","file_size":869984,"access_level":"closed","date_created":"2018-11-21T10:50:11Z","creator":"florida"}],"department":[{"_id":"77"},{"_id":"355"}],"type":"report","citation":{"chicago":"Czech, Mike, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim. <i>Predicting Rankings of Software Verification Competitions</i>, 2017.","short":"M. Czech, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, Predicting Rankings of Software Verification Competitions, 2017.","apa":"Czech, M., Hüllermeier, E., Jakobs, M.-C., &#38; Wehrheim, H. (2017). <i>Predicting Rankings of Software Verification Competitions</i>.","ieee":"M. Czech, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, <i>Predicting Rankings of Software Verification Competitions</i>. 2017.","ama":"Czech M, Hüllermeier E, Jakobs M-C, Wehrheim H. <i>Predicting Rankings of Software Verification Competitions</i>.; 2017.","bibtex":"@book{Czech_Hüllermeier_Jakobs_Wehrheim_2017, title={Predicting Rankings of Software Verification Competitions}, author={Czech, Mike and Hüllermeier, Eyke and Jakobs, Marie-Christine and Wehrheim, Heike}, year={2017} }","mla":"Czech, Mike, et al. <i>Predicting Rankings of Software Verification Competitions</i>. 2017."},"file_date_updated":"2018-11-21T10:50:11Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"}],"abstract":[{"lang":"eng","text":"Software verification competitions, such as the annual SV-COMP, evaluate software verification tools with respect to their effectivity and efficiency. Typically, the outcome of a competition is a (possibly category-specific) ranking of the tools. For many applications, such as building portfolio solvers, it would be desirable to have an idea of the (relative) performance of verification tools on a given verification task beforehand, i.e., prior to actually running all tools on the task.In this paper, we present a machine learning approach to predicting rankings of tools on verification tasks. The method builds upon so-called label ranking algorithms, which we complement with appropriate kernels providing a similarity measure for verification tasks. Our kernels employ a graph representation for software source code that mixes elements of control flow and program dependence graphs with abstract syntax trees. Using data sets from SV-COMP, we demonstrate our rank prediction technique to generalize well and achieve a rather high predictive accuracy. In particular, our method outperforms a recently proposed feature-based approach of Demyanova et al. (when applied to rank predictions). "}]},{"has_accepted_license":"1","status":"public","conference":{"location":"Bologna","name":"IEEE Conference on Network Softwarization"},"user_id":"13271","ddc":["000"],"page":"1--3","_id":"723","urn":"7236","project":[{"call_identifier":"5G PPP Phase 1","name":"SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks","_id":"25","grant_number":"671517"}],"file_date_updated":"2018-07-05T11:14:37Z","citation":{"mla":"Peuster, Manuel, et al. “A Flexible Multi-Pop Infrastructure Emulator for Carrier-Grade MANO Systems.” <i>IEEE Conference on Network Softwarization, NetSoft 2017, Bologna, Italy, July 3-7, 2017</i>, 2017, pp. 1--3, doi:<a href=\"https://doi.org/10.1109/NETSOFT.2017.8004250\">10.1109/NETSOFT.2017.8004250</a>.","ama":"Peuster M, Dräxler S, Razzaghi Kouchaksaraei H, van Rossem S, Tavernier W, Karl H. A flexible multi-pop infrastructure emulator for carrier-grade MANO systems. In: <i>IEEE Conference on Network Softwarization, NetSoft 2017, Bologna, Italy, July 3-7, 2017</i>. ; 2017:1--3. doi:<a href=\"https://doi.org/10.1109/NETSOFT.2017.8004250\">10.1109/NETSOFT.2017.8004250</a>","bibtex":"@inproceedings{Peuster_Dräxler_Razzaghi Kouchaksaraei_van Rossem_Tavernier_Karl_2017, title={A flexible multi-pop infrastructure emulator for carrier-grade MANO systems}, DOI={<a href=\"https://doi.org/10.1109/NETSOFT.2017.8004250\">10.1109/NETSOFT.2017.8004250</a>}, booktitle={IEEE Conference on Network Softwarization, NetSoft 2017, Bologna, Italy, July 3-7, 2017}, author={Peuster, Manuel and Dräxler, Sevil and Razzaghi Kouchaksaraei, Hadi and van Rossem, Steven and Tavernier, Wouter and Karl, Holger}, year={2017}, pages={1--3} }","apa":"Peuster, M., Dräxler, S., Razzaghi Kouchaksaraei, H., van Rossem, S., Tavernier, W., &#38; Karl, H. (2017). A flexible multi-pop infrastructure emulator for carrier-grade MANO systems. In <i>IEEE Conference on Network Softwarization, NetSoft 2017, Bologna, Italy, July 3-7, 2017</i> (pp. 1--3). Bologna. <a href=\"https://doi.org/10.1109/NETSOFT.2017.8004250\">https://doi.org/10.1109/NETSOFT.2017.8004250</a>","ieee":"M. Peuster, S. Dräxler, H. Razzaghi Kouchaksaraei, S. van Rossem, W. Tavernier, and H. Karl, “A flexible multi-pop infrastructure emulator for carrier-grade MANO systems,” in <i>IEEE Conference on Network Softwarization, NetSoft 2017, Bologna, Italy, July 3-7, 2017</i>, Bologna, 2017, pp. 1--3.","chicago":"Peuster, Manuel, Sevil Dräxler, Hadi Razzaghi Kouchaksaraei, Steven van Rossem, Wouter Tavernier, and Holger Karl. “A Flexible Multi-Pop Infrastructure Emulator for Carrier-Grade MANO Systems.” In <i>IEEE Conference on Network Softwarization, NetSoft 2017, Bologna, Italy, July 3-7, 2017</i>, 1--3, 2017. <a href=\"https://doi.org/10.1109/NETSOFT.2017.8004250\">https://doi.org/10.1109/NETSOFT.2017.8004250</a>.","short":"M. Peuster, S. Dräxler, H. Razzaghi Kouchaksaraei, S. van Rossem, W. Tavernier, H. Karl, in: IEEE Conference on Network Softwarization, NetSoft 2017, Bologna, Italy, July 3-7, 2017, 2017, pp. 1--3."},"oa":"1","publication_status":"published","date_updated":"2022-01-06T07:03:30Z","year":"2017","title":"A flexible multi-pop infrastructure emulator for carrier-grade MANO systems","author":[{"last_name":"Peuster","first_name":"Manuel","full_name":"Peuster, Manuel","id":"13271"},{"full_name":"Dräxler, Sevil","last_name":"Dräxler","first_name":"Sevil","id":"31764"},{"id":"60845","last_name":"Razzaghi Kouchaksaraei","first_name":"Hadi","full_name":"Razzaghi Kouchaksaraei, Hadi"},{"first_name":"Steven","last_name":"van Rossem","full_name":"van Rossem, Steven"},{"full_name":"Tavernier, Wouter","first_name":"Wouter","last_name":"Tavernier"},{"id":"126","full_name":"Karl, Holger","first_name":"Holger","last_name":"Karl"}],"doi":"10.1109/NETSOFT.2017.8004250","language":[{"iso":"eng"}],"abstract":[{"text":"Developing a virtualized network service does not only involve the\r\n  implementation and configuration of the network functions it is\r\n  composed of but also its integration and test with management\r\n  solutions that will control the service in its production\r\n  environment. These integration tasks require testbeds that offer the\r\n  needed network function virtualization infrastructure~(NFVI), like OpenStack, introducing a\r\n  lot of management and maintenance overheads. Such testbed setups\r\n  become even more complicated when the multi\r\n  point-of-presence~(PoP) case, with multiple infrastructure\r\n  installations, is considered.\r\n\r\n  In this demo, we showcase an emulation platform that executes\r\n  containerized network services in user-defined multi-PoP\r\n  topologies. The platform does not only allow network service developers to\r\n  locally test their services but also to connect real-world\r\n  management and orchestration solutions to the emulated PoPs. During our\r\n  interactive demonstration we focus on the integration between\r\n  the emulated infrastructure and state-of-the-art orchestration\r\n  solutions like SONATA or OSM.","lang":"eng"}],"publication":"IEEE Conference on Network Softwarization, NetSoft 2017, Bologna, Italy, July 3-7, 2017","type":"conference","department":[{"_id":"75"}],"file":[{"creator":"peuster","date_created":"2018-07-05T11:14:37Z","file_name":"main_ris.pdf","file_size":963155,"access_level":"open_access","relation":"main_file","date_updated":"2018-07-05T11:14:37Z","file_id":"3432","content_type":"application/pdf"}],"date_created":"2017-11-27T10:22:25Z"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"}],"supervisor":[{"last_name":"Lösch","first_name":"Achim","full_name":"Lösch, Achim","id":"43646"},{"first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco","id":"398"}],"citation":{"apa":"Knorr, C. (2017). <i>OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten</i>. Universität Paderborn.","ieee":"C. Knorr, <i>OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten</i>. Universität Paderborn, 2017.","short":"C. Knorr, OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten, Universität Paderborn, 2017.","chicago":"Knorr, Christoph. <i>OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten</i>. Universität Paderborn, 2017.","mla":"Knorr, Christoph. <i>OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten</i>. Universität Paderborn, 2017.","ama":"Knorr C. <i>OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten</i>. Universität Paderborn; 2017.","bibtex":"@book{Knorr_2017, title={OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten}, publisher={Universität Paderborn}, author={Knorr, Christoph}, year={2017} }"},"type":"mastersthesis","department":[{"_id":"78"}],"date_created":"2017-10-17T12:41:05Z","date_updated":"2022-01-06T07:03:36Z","year":"2017","title":"OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten","status":"public","author":[{"first_name":"Christoph","last_name":"Knorr","full_name":"Knorr, Christoph"}],"user_id":"477","language":[{"iso":"ger"}],"_id":"74","publisher":"Universität Paderborn"},{"abstract":[{"text":"Management of complex network services requires flexible and efficient service provisioning as well as optimized handling of continuous changes in the workload of the service.To adapt to changes in the demand, service components need to be replicated (scaling) and allocated to physical resources (placement) dynamically. In this paper, we propose a fullyautomated approach to the joint optimization problem of scaling and placement, enabling quick reaction to changes. We formalize the problem, analyze its complexity, and develop two algorithms to solve it. Extensive empirical results show the applicability andeffectiveness of the proposed approach.","lang":"eng"}],"publication":"Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017)","type":"conference","department":[{"_id":"75"}],"file":[{"file_id":"3324","content_type":"application/pdf","relation":"main_file","date_updated":"2018-06-25T08:07:43Z","file_name":"RIS.pdf","access_level":"open_access","file_size":2229109,"date_created":"2018-06-25T08:07:43Z","creator":"sevilmeh"}],"date_created":"2017-10-17T12:41:08Z","date_updated":"2022-01-06T07:03:59Z","title":"Joint Optimization of Scaling and Placement of Virtual Network Services","year":"2017","author":[{"id":"31764","full_name":"Dräxler, Sevil","last_name":"Dräxler","first_name":"Sevil"},{"id":"126","first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger"},{"full_name":"Mann, Zoltan Adam","first_name":"Zoltan Adam","last_name":"Mann"}],"doi":"10.1109/CCGRID.2017.25","project":[{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks","_id":"25","grant_number":"671517","call_identifier":"5G PPP Phase 1"}],"file_date_updated":"2018-06-25T08:07:43Z","citation":{"mla":"Dräxler, Sevil, et al. “Joint Optimization of Scaling and Placement of Virtual Network Services.” <i>Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017)</i>, 2017, doi:<a href=\"https://doi.org/10.1109/CCGRID.2017.25\">10.1109/CCGRID.2017.25</a>.","bibtex":"@inproceedings{Dräxler_Karl_Mann_2017, title={Joint Optimization of Scaling and Placement of Virtual Network Services}, DOI={<a href=\"https://doi.org/10.1109/CCGRID.2017.25\">10.1109/CCGRID.2017.25</a>}, booktitle={Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017)}, author={Dräxler, Sevil and Karl, Holger and Mann, Zoltan Adam}, year={2017} }","ama":"Dräxler S, Karl H, Mann ZA. Joint Optimization of Scaling and Placement of Virtual Network Services. In: <i>Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017)</i>. ; 2017. doi:<a href=\"https://doi.org/10.1109/CCGRID.2017.25\">10.1109/CCGRID.2017.25</a>","ieee":"S. Dräxler, H. Karl, and Z. A. Mann, “Joint Optimization of Scaling and Placement of Virtual Network Services,” in <i>Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017)</i>, 2017.","apa":"Dräxler, S., Karl, H., &#38; Mann, Z. A. (2017). Joint Optimization of Scaling and Placement of Virtual Network Services. In <i>Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017)</i>. <a href=\"https://doi.org/10.1109/CCGRID.2017.25\">https://doi.org/10.1109/CCGRID.2017.25</a>","chicago":"Dräxler, Sevil, Holger Karl, and Zoltan Adam Mann. “Joint Optimization of Scaling and Placement of Virtual Network Services.” In <i>Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017)</i>, 2017. <a href=\"https://doi.org/10.1109/CCGRID.2017.25\">https://doi.org/10.1109/CCGRID.2017.25</a>.","short":"S. Dräxler, H. Karl, Z.A. Mann, in: Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017), 2017."},"oa":"1","has_accepted_license":"1","status":"public","ddc":["040"],"user_id":"31764","urn":"873","_id":"87"},{"type":"bachelorsthesis","department":[{"_id":"64"}],"date_created":"2017-10-17T12:41:08Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"citation":{"apa":"Ganesh Athreya, A. (2017). <i>Instantiating a Predicate Encryption Scheme via Pair Encodings</i>. Universität Paderborn.","ieee":"A. Ganesh Athreya, <i>Instantiating a Predicate Encryption Scheme via Pair Encodings</i>. Universität Paderborn, 2017.","chicago":"Ganesh Athreya, Advait. <i>Instantiating a Predicate Encryption Scheme via Pair Encodings</i>. Universität Paderborn, 2017.","short":"A. Ganesh Athreya, Instantiating a Predicate Encryption Scheme via Pair Encodings, Universität Paderborn, 2017.","mla":"Ganesh Athreya, Advait. <i>Instantiating a Predicate Encryption Scheme via Pair Encodings</i>. Universität Paderborn, 2017.","ama":"Ganesh Athreya A. <i>Instantiating a Predicate Encryption Scheme via Pair Encodings</i>. Universität Paderborn; 2017.","bibtex":"@book{Ganesh Athreya_2017, title={Instantiating a Predicate Encryption Scheme via Pair Encodings}, publisher={Universität Paderborn}, author={Ganesh Athreya, Advait}, year={2017} }"},"supervisor":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"}],"user_id":"477","_id":"88","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:04:02Z","status":"public","year":"2017","title":"Instantiating a Predicate Encryption Scheme via Pair Encodings","author":[{"first_name":"Advait","last_name":"Ganesh Athreya","full_name":"Ganesh Athreya, Advait"}]},{"date_updated":"2022-01-06T07:04:03Z","title":"Presentation: Framework for Constructing Context-Specific Migration Methods for Test Cases","year":"2017","status":"public","author":[{"full_name":"Jovanovikj, Ivan","first_name":"Ivan","last_name":"Jovanovikj","orcid":"https://orcid.org/0000-0002-1838-794X","id":"39187"}],"user_id":"39187","alternative_title":["User Conference on Advanced Automated Testing (UCAAT 2017)"],"_id":"8843","language":[{"iso":"eng"}],"citation":{"apa":"Jovanovikj, I. (2017). <i>Presentation: Framework for Constructing Context-Specific Migration Methods for Test Cases</i>. Berlin.","ieee":"I. Jovanovikj, <i>Presentation: Framework for Constructing Context-Specific Migration Methods for Test Cases</i>. Berlin, 2017.","chicago":"Jovanovikj, Ivan. <i>Presentation: Framework for Constructing Context-Specific Migration Methods for Test Cases</i>. Berlin, 2017.","short":"I. Jovanovikj, Presentation: Framework for Constructing Context-Specific Migration Methods for Test Cases, Berlin, 2017.","mla":"Jovanovikj, Ivan. <i>Presentation: Framework for Constructing Context-Specific Migration Methods for Test Cases</i>. 2017.","ama":"Jovanovikj I. <i>Presentation: Framework for Constructing Context-Specific Migration Methods for Test Cases</i>. Berlin; 2017.","bibtex":"@book{Jovanovikj_2017, place={Berlin}, title={Presentation: Framework for Constructing Context-Specific Migration Methods for Test Cases}, author={Jovanovikj, Ivan}, year={2017} }"},"type":"misc","department":[{"_id":"66"}],"date_created":"2019-04-08T07:39:45Z","place":"Berlin"},{"title":"Optimal Security Proofs for Full Domain Hash, Revisited","status":"public","year":"2017","publication_identifier":{"issn":["0933-2790","1432-1378"]},"author":[{"full_name":"Kakvi, Saqib","first_name":"Saqib","last_name":"Kakvi","id":"66268"},{"last_name":"Kiltz","first_name":"Eike","full_name":"Kiltz, Eike"}],"date_updated":"2022-01-06T07:04:16Z","publication_status":"published","main_file_link":[{"url":"https://link.springer.com/article/10.1007%2Fs00145-017-9257-9"}],"page":"276-306","language":[{"iso":"eng"}],"_id":"9607","doi":"10.1007/s00145-017-9257-9","user_id":"66268","publication":"Journal of Cryptology","citation":{"ieee":"S. Kakvi and E. Kiltz, “Optimal Security Proofs for Full Domain Hash, Revisited,” <i>Journal of Cryptology</i>, pp. 276–306, 2017.","mla":"Kakvi, Saqib, and Eike Kiltz. “Optimal Security Proofs for Full Domain Hash, Revisited.” <i>Journal of Cryptology</i>, 2017, pp. 276–306, doi:<a href=\"https://doi.org/10.1007/s00145-017-9257-9\">10.1007/s00145-017-9257-9</a>.","apa":"Kakvi, S., &#38; Kiltz, E. (2017). Optimal Security Proofs for Full Domain Hash, Revisited. <i>Journal of Cryptology</i>, 276–306. <a href=\"https://doi.org/10.1007/s00145-017-9257-9\">https://doi.org/10.1007/s00145-017-9257-9</a>","bibtex":"@article{Kakvi_Kiltz_2017, title={Optimal Security Proofs for Full Domain Hash, Revisited}, DOI={<a href=\"https://doi.org/10.1007/s00145-017-9257-9\">10.1007/s00145-017-9257-9</a>}, journal={Journal of Cryptology}, author={Kakvi, Saqib and Kiltz, Eike}, year={2017}, pages={276–306} }","short":"S. Kakvi, E. Kiltz, Journal of Cryptology (2017) 276–306.","ama":"Kakvi S, Kiltz E. Optimal Security Proofs for Full Domain Hash, Revisited. <i>Journal of Cryptology</i>. 2017:276-306. doi:<a href=\"https://doi.org/10.1007/s00145-017-9257-9\">10.1007/s00145-017-9257-9</a>","chicago":"Kakvi, Saqib, and Eike Kiltz. “Optimal Security Proofs for Full Domain Hash, Revisited.” <i>Journal of Cryptology</i>, 2017, 276–306. <a href=\"https://doi.org/10.1007/s00145-017-9257-9\">https://doi.org/10.1007/s00145-017-9257-9</a>."},"date_created":"2019-05-03T12:44:03Z","type":"journal_article","department":[{"_id":"558"}]}]