[{"year":"2018","title":"Emulation-based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments","date_created":"2018-06-25T12:27:59Z","file":[{"creator":"peuster","date_created":"2018-07-05T11:13:29Z","date_updated":"2018-07-05T11:13:29Z","file_name":"main_ris.pdf","access_level":"open_access","file_id":"3430","file_size":713495,"content_type":"application/pdf","relation":"main_file"}],"abstract":[{"text":"Management and orchestration~(MANO) systems are the key components of future large-scale NFV environments. They will manage resources of hundreds or even thousands of NFV infrastructure installations, so called points of presence~(PoP). Such scenarios need to be automatically tested during the development phase of a MANO system. This task becomes very challenging because large-scale NFV testbeds are hard to maintain, too expensive, or simply not available.\r\n\r\nIn this paper, we present a multi-PoP NFV infrastructure emulation platform that enables automated, large-scale testing of MANO stacks. We show that our platform can easily emulate hundreds of PoPs on a single physical machine and reduces the setup time of a test PoP by a factor of 232x compared to a DevStack-based test PoP installation. Further, we present a case study in which we test ETSI's Open Source MANO~(OSM) against our proposed system  to gain insights about OSM's behaviour in large-scale NFV deployments.","lang":"eng"}],"publication":"European Conference on Networks and Communications (EuCNC)","language":[{"iso":"eng"}],"ddc":["000"],"citation":{"ama":"Peuster M, Marchetti M, Garcia de Blas G, Karl H. Emulation-based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments. In: <i>European Conference on Networks and Communications (EuCNC)</i>. Ljubljana. doi:<a href=\"https://doi.org/10.1109/EuCNC.2018.8442701\">10.1109/EuCNC.2018.8442701</a>","chicago":"Peuster, Manuel, Michael Marchetti, Gerado Garcia de Blas, and Holger Karl. “Emulation-Based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments.” In <i>European Conference on Networks and Communications (EuCNC)</i>. Ljubljana, n.d. <a href=\"https://doi.org/10.1109/EuCNC.2018.8442701\">https://doi.org/10.1109/EuCNC.2018.8442701</a>.","ieee":"M. Peuster, M. Marchetti, G. Garcia de Blas, and H. Karl, “Emulation-based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments,” in <i>European Conference on Networks and Communications (EuCNC)</i>, Ljubljana.","apa":"Peuster, M., Marchetti, M., Garcia de Blas, G., &#38; Karl, H. (n.d.). Emulation-based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments. In <i>European Conference on Networks and Communications (EuCNC)</i>. Ljubljana. <a href=\"https://doi.org/10.1109/EuCNC.2018.8442701\">https://doi.org/10.1109/EuCNC.2018.8442701</a>","short":"M. Peuster, M. Marchetti, G. Garcia de Blas, H. Karl, in: European Conference on Networks and Communications (EuCNC), Ljubljana, n.d.","bibtex":"@inproceedings{Peuster_Marchetti_Garcia de Blas_Karl, place={Ljubljana}, title={Emulation-based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments}, DOI={<a href=\"https://doi.org/10.1109/EuCNC.2018.8442701\">10.1109/EuCNC.2018.8442701</a>}, booktitle={European Conference on Networks and Communications (EuCNC)}, author={Peuster, Manuel and Marchetti, Michael and Garcia de Blas, Gerado and Karl, Holger} }","mla":"Peuster, Manuel, et al. “Emulation-Based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments.” <i>European Conference on Networks and Communications (EuCNC)</i>, doi:<a href=\"https://doi.org/10.1109/EuCNC.2018.8442701\">10.1109/EuCNC.2018.8442701</a>."},"place":"Ljubljana","has_accepted_license":"1","publication_status":"accepted","doi":"10.1109/EuCNC.2018.8442701","conference":{"name":"European Conference on Networks and Communications (EuCNC)","location":"Ljubljana"},"main_file_link":[{"url":"https://ieeexplore.ieee.org/document/8442701/"}],"author":[{"first_name":"Manuel","full_name":"Peuster, Manuel","id":"13271","last_name":"Peuster"},{"last_name":"Marchetti","full_name":"Marchetti, Michael","first_name":"Michael"},{"last_name":"Garcia de Blas","full_name":"Garcia de Blas, Gerado","first_name":"Gerado"},{"first_name":"Holger","last_name":"Karl","id":"126","full_name":"Karl, Holger"}],"date_updated":"2022-01-06T06:59:12Z","oa":"1","status":"public","urn":"33477","type":"conference","file_date_updated":"2018-07-05T11:13:29Z","department":[{"_id":"75"}],"user_id":"13271","_id":"3347","project":[{"name":"5G Development and validation platform for global industry-specific network services and Apps","_id":"28","grant_number":"761493"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C4","_id":"16"}]},{"intvolume":"        36","page":"1356-1379","citation":{"chicago":"König, Jürgen, Alexander Mäcker, Friedhelm Meyer auf der Heide, and Sören Riechers. “Scheduling with Interjob Communication on Parallel Processors.” <i>Journal of Combinatorial Optimization</i> 36, no. 4 (2018): 1356–79. <a href=\"https://doi.org/10.1007/s10878-018-0325-3\">https://doi.org/10.1007/s10878-018-0325-3</a>.","ieee":"J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling with interjob communication on parallel processors,” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, pp. 1356–1379, 2018.","ama":"König J, Mäcker A, Meyer auf der Heide F, Riechers S. Scheduling with interjob communication on parallel processors. <i>Journal of Combinatorial Optimization</i>. 2018;36(4):1356-1379. doi:<a href=\"https://doi.org/10.1007/s10878-018-0325-3\">10.1007/s10878-018-0325-3</a>","apa":"König, J., Mäcker, A., Meyer auf der Heide, F., &#38; Riechers, S. (2018). Scheduling with interjob communication on parallel processors. <i>Journal of Combinatorial Optimization</i>, <i>36</i>(4), 1356–1379. <a href=\"https://doi.org/10.1007/s10878-018-0325-3\">https://doi.org/10.1007/s10878-018-0325-3</a>","mla":"König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, 2018, pp. 1356–79, doi:<a href=\"https://doi.org/10.1007/s10878-018-0325-3\">10.1007/s10878-018-0325-3</a>.","bibtex":"@article{König_Mäcker_Meyer auf der Heide_Riechers_2018, title={Scheduling with interjob communication on parallel processors}, volume={36}, DOI={<a href=\"https://doi.org/10.1007/s10878-018-0325-3\">10.1007/s10878-018-0325-3</a>}, number={4}, journal={Journal of Combinatorial Optimization}, author={König, Jürgen and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2018}, pages={1356–1379} }","short":"J. König, A. Mäcker, F. Meyer auf der Heide, S. Riechers, Journal of Combinatorial Optimization 36 (2018) 1356–1379."},"year":"2018","issue":"4","has_accepted_license":"1","doi":"10.1007/s10878-018-0325-3","title":"Scheduling with interjob communication on parallel processors","volume":36,"author":[{"first_name":"Jürgen","full_name":"König, Jürgen","id":"22358","last_name":"König"},{"first_name":"Alexander","last_name":"Mäcker","id":"13536","full_name":"Mäcker, Alexander"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"Sören","last_name":"Riechers","full_name":"Riechers, Sören"}],"date_created":"2018-07-13T09:57:48Z","date_updated":"2022-01-06T06:59:24Z","status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":745708,"access_level":"closed","file_id":"5299","file_name":"SchedulingWithInterjobCommunic.pdf","date_updated":"2018-11-02T15:20:24Z","date_created":"2018-11-02T15:20:24Z","creator":"ups"}],"publication":"Journal of Combinatorial Optimization","type":"journal_article","file_date_updated":"2018-11-02T15:20:24Z","language":[{"iso":"eng"}],"ddc":["000"],"department":[{"_id":"63"}],"user_id":"477","_id":"3551","project":[{"_id":"16","name":"SFB 901 - Subproject C4"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"}]},{"abstract":[{"lang":"eng","text":"To adapt to continuously changing workloads in networks, components of the running network services may need to be replicated (scaling the network service) and allocated to physical resources (placement) dynamically, also necessitating dynamic re-routing of flows between service components. In this paper, we propose JASPER, a fully automated approach to jointly optimizing scaling, placement, and routing for complex network services, consisting of multiple (virtualized) components. JASPER handles multiple network services that share the same substrate network; services can be dynamically added or removed and dynamic workload changes are handled. Our approach lets service designers specify their services on a high level of abstraction using service templates. JASPER automatically makes scaling, placement and routing decisions, 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 and effectiveness of the proposed approach."}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"5302","access_level":"closed","file_name":"08382313.pdf","file_size":1767054,"creator":"ups","date_created":"2018-11-02T15:25:49Z","date_updated":"2018-11-02T15:25:49Z"},{"relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_id":"6950","file_name":"TNSM2846572_RIS.pdf","file_size":2878350,"date_created":"2019-01-21T16:12:36Z","creator":"sevilmeh","date_updated":"2019-01-21T16:12:36Z"}],"publication":"IEEE Transactions on Network and Service Management","ddc":["000"],"language":[{"iso":"eng"}],"year":"2018","title":"JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services","publisher":"IEEE","date_created":"2018-06-11T06:55:05Z","urn":"31522","status":"public","type":"journal_article","article_type":"original","file_date_updated":"2019-01-21T16:12:36Z","project":[{"grant_number":"762057","name":"5G Programmable Infrastructure Converging disaggregated neTwork and compUte Resources","_id":"23"},{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"_id":"3152","user_id":"31764","department":[{"_id":"75"}],"citation":{"ama":"Dräxler S, Karl H, Mann ZA. JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services. <i>IEEE Transactions on Network and Service Management</i>. 2018. doi:<a href=\"https://doi.org/10.1109/TNSM.2018.2846572\">10.1109/TNSM.2018.2846572</a>","chicago":"Dräxler, Sevil, Holger Karl, and Zoltan Adam Mann. “JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services.” <i>IEEE Transactions on Network and Service Management</i>, 2018. <a href=\"https://doi.org/10.1109/TNSM.2018.2846572\">https://doi.org/10.1109/TNSM.2018.2846572</a>.","ieee":"S. Dräxler, H. Karl, and Z. A. Mann, “JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services,” <i>IEEE Transactions on Network and Service Management</i>, 2018.","apa":"Dräxler, S., Karl, H., &#38; Mann, Z. A. (2018). JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services. <i>IEEE Transactions on Network and Service Management</i>. <a href=\"https://doi.org/10.1109/TNSM.2018.2846572\">https://doi.org/10.1109/TNSM.2018.2846572</a>","short":"S. Dräxler, H. Karl, Z.A. Mann, IEEE Transactions on Network and Service Management (2018).","mla":"Dräxler, Sevil, et al. “JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services.” <i>IEEE Transactions on Network and Service Management</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/TNSM.2018.2846572\">10.1109/TNSM.2018.2846572</a>.","bibtex":"@article{Dräxler_Karl_Mann_2018, title={JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services}, DOI={<a href=\"https://doi.org/10.1109/TNSM.2018.2846572\">10.1109/TNSM.2018.2846572</a>}, journal={IEEE Transactions on Network and Service Management}, publisher={IEEE}, author={Dräxler, Sevil and Karl, Holger and Mann, Zoltan Adam}, year={2018} }"},"has_accepted_license":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1711.10839"}],"doi":"10.1109/TNSM.2018.2846572","date_updated":"2022-01-06T06:59:00Z","oa":"1","author":[{"first_name":"Sevil","last_name":"Dräxler","full_name":"Dräxler, Sevil","id":"31764"},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"},{"first_name":"Zoltan Adam","last_name":"Mann","full_name":"Mann, Zoltan Adam"}]},{"type":"journal_article","status":"public","_id":"63","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"63"}],"user_id":"15415","file_date_updated":"2018-03-21T13:16:59Z","has_accepted_license":"1","page":"77-92","intvolume":"        21","citation":{"ama":"Althaus E, Brinkmann A, Kling P, et al. Scheduling Shared Continuous Resources on Many-Cores. <i>Journal of Scheduling</i>. 2018;21(1):77-92. doi:<a href=\"https://doi.org/10.1007/s10951-017-0518-0\">10.1007/s10951-017-0518-0</a>","ieee":"E. Althaus <i>et al.</i>, “Scheduling Shared Continuous Resources on Many-Cores,” <i>Journal of Scheduling</i>, vol. 21, no. 1, pp. 77–92, 2018, doi: <a href=\"https://doi.org/10.1007/s10951-017-0518-0\">10.1007/s10951-017-0518-0</a>.","chicago":"Althaus, Ernst, Andre Brinkmann, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel, Sören Riechers, Jiri Sgall, and Tim Suess. “Scheduling Shared Continuous Resources on Many-Cores.” <i>Journal of Scheduling</i> 21, no. 1 (2018): 77–92. <a href=\"https://doi.org/10.1007/s10951-017-0518-0\">https://doi.org/10.1007/s10951-017-0518-0</a>.","mla":"Althaus, Ernst, et al. “Scheduling Shared Continuous Resources on Many-Cores.” <i>Journal of Scheduling</i>, vol. 21, no. 1, Springer, 2018, pp. 77–92, doi:<a href=\"https://doi.org/10.1007/s10951-017-0518-0\">10.1007/s10951-017-0518-0</a>.","short":"E. Althaus, A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S. Riechers, J. Sgall, T. Suess, Journal of Scheduling 21 (2018) 77–92.","bibtex":"@article{Althaus_Brinkmann_Kling_Meyer auf der Heide_Nagel_Riechers_Sgall_Suess_2018, title={Scheduling Shared Continuous Resources on Many-Cores}, volume={21}, DOI={<a href=\"https://doi.org/10.1007/s10951-017-0518-0\">10.1007/s10951-017-0518-0</a>}, number={1}, journal={Journal of Scheduling}, publisher={Springer}, author={Althaus, Ernst and Brinkmann, Andre and Kling, Peter and Meyer auf der Heide, Friedhelm and Nagel, Lars and Riechers, Sören and Sgall, Jiri and Suess, Tim}, year={2018}, pages={77–92} }","apa":"Althaus, E., Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L., Riechers, S., Sgall, J., &#38; Suess, T. (2018). Scheduling Shared Continuous Resources on Many-Cores. <i>Journal of Scheduling</i>, <i>21</i>(1), 77–92. <a href=\"https://doi.org/10.1007/s10951-017-0518-0\">https://doi.org/10.1007/s10951-017-0518-0</a>"},"date_updated":"2022-01-06T07:03:00Z","volume":21,"author":[{"first_name":"Ernst","full_name":"Althaus, Ernst","last_name":"Althaus"},{"first_name":"Andre","last_name":"Brinkmann","full_name":"Brinkmann, Andre"},{"first_name":"Peter","full_name":"Kling, Peter","last_name":"Kling"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"first_name":"Lars","full_name":"Nagel, Lars","last_name":"Nagel"},{"first_name":"Sören","full_name":"Riechers, Sören","last_name":"Riechers"},{"full_name":"Sgall, Jiri","last_name":"Sgall","first_name":"Jiri"},{"full_name":"Suess, Tim","last_name":"Suess","first_name":"Tim"}],"doi":"10.1007/s10951-017-0518-0","publication":"Journal of Scheduling","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":466808,"file_id":"1577","access_level":"closed","file_name":"63-main_05.pdf","date_updated":"2018-03-21T13:16:59Z","creator":"florida","date_created":"2018-03-21T13:16:59Z"}],"ddc":["040"],"language":[{"iso":"eng"}],"issue":"1","year":"2018","publisher":"Springer","date_created":"2017-10-17T12:41:03Z","title":"Scheduling Shared Continuous Resources on Many-Cores"},{"citation":{"chicago":"Peuster, Manuel, Stefan Balthasar Schneider, Frederic Christ, and Holger Karl. “A Prototyping Platform to Validate and Verify Network Service Header-Based Service Chains.” In <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp</i>. Verona: IEEE, 2018.","ieee":"M. Peuster, S. B. Schneider, F. Christ, and H. Karl, “A Prototyping Platform to Validate and Verify Network Service Header-based Service Chains,” in <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp</i>, Verona, 2018.","ama":"Peuster M, Schneider SB, Christ F, Karl H. A Prototyping Platform to Validate and Verify Network Service Header-based Service Chains. In: <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp</i>. Verona: IEEE; 2018.","apa":"Peuster, M., Schneider, S. B., Christ, F., &#38; Karl, H. (2018). A Prototyping Platform to Validate and Verify Network Service Header-based Service Chains. In <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp</i>. Verona: IEEE.","mla":"Peuster, Manuel, et al. “A Prototyping Platform to Validate and Verify Network Service Header-Based Service Chains.” <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp</i>, IEEE, 2018.","short":"M. Peuster, S.B. Schneider, F. Christ, H. Karl, in: IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp, IEEE, Verona, 2018.","bibtex":"@inproceedings{Peuster_Schneider_Christ_Karl_2018, place={Verona}, title={A Prototyping Platform to Validate and Verify Network Service Header-based Service Chains}, booktitle={IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp}, publisher={IEEE}, author={Peuster, Manuel and Schneider, Stefan Balthasar and Christ, Frederic and Karl, Holger}, year={2018} }"},"year":"2018","place":"Verona","has_accepted_license":"1","conference":{"location":"Verona","end_date":"2018-11-29","start_date":"2018-11-27","name":"IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp"},"title":"A Prototyping Platform to Validate and Verify Network Service Header-based Service Chains","author":[{"first_name":"Manuel","last_name":"Peuster","id":"13271","full_name":"Peuster, Manuel"},{"full_name":"Schneider, Stefan Balthasar","id":"35343","last_name":"Schneider","orcid":"0000-0001-8210-4011","first_name":"Stefan Balthasar"},{"full_name":"Christ, Frederic","last_name":"Christ","first_name":"Frederic"},{"first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger","id":"126"}],"date_created":"2019-01-04T07:47:19Z","publisher":"IEEE","date_updated":"2022-01-06T07:03:07Z","oa":"1","status":"public","file":[{"file_name":"main_for_ris.pdf","file_id":"6484","access_level":"open_access","file_size":541469,"date_created":"2019-01-04T07:46:21Z","creator":"peuster","date_updated":"2019-01-04T07:46:21Z","relation":"main_file","content_type":"application/pdf"}],"publication":"IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp","type":"conference","file_date_updated":"2019-01-04T07:46:21Z","language":[{"iso":"eng"}],"ddc":["000"],"department":[{"_id":"75"}],"user_id":"35343","_id":"6483","project":[{"grant_number":"761493","_id":"28","name":"5G Development and validation platform for global industry-specific network services and Apps"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"}]},{"has_accepted_license":"1","year":"2018","citation":{"ama":"Schneider SB, Dräxler S, Karl H. Trade-offs in Dynamic Resource Allocation in Network Function Virtualization. In: <i>IEEE Global Communications Conference (GLOBECOM 2018)</i>. IEEE; 2018.","chicago":"Schneider, Stefan Balthasar, Sevil Dräxler, and Holger Karl. “Trade-Offs in Dynamic Resource Allocation in Network Function Virtualization.” In <i>IEEE Global Communications Conference (GLOBECOM 2018)</i>. IEEE, 2018.","ieee":"S. B. Schneider, S. Dräxler, and H. Karl, “Trade-offs in Dynamic Resource Allocation in Network Function Virtualization,” in <i>IEEE Global Communications Conference (GLOBECOM 2018)</i>, Abu Dhabi, UAE, 2018.","mla":"Schneider, Stefan Balthasar, et al. “Trade-Offs in Dynamic Resource Allocation in Network Function Virtualization.” <i>IEEE Global Communications Conference (GLOBECOM 2018)</i>, IEEE, 2018.","bibtex":"@inproceedings{Schneider_Dräxler_Karl_2018, title={Trade-offs in Dynamic Resource Allocation in Network Function Virtualization}, booktitle={IEEE Global Communications Conference (GLOBECOM 2018)}, publisher={IEEE}, author={Schneider, Stefan Balthasar and Dräxler, Sevil and Karl, Holger}, year={2018} }","short":"S.B. Schneider, S. Dräxler, H. Karl, in: IEEE Global Communications Conference (GLOBECOM 2018), IEEE, 2018.","apa":"Schneider, S. B., Dräxler, S., &#38; Karl, H. (2018). Trade-offs in Dynamic Resource Allocation in Network Function Virtualization. In <i>IEEE Global Communications Conference (GLOBECOM 2018)</i>. Abu Dhabi, UAE: IEEE."},"oa":"1","date_updated":"2022-01-06T07:03:24Z","publisher":"IEEE","date_created":"2019-01-24T13:53:22Z","author":[{"first_name":"Stefan Balthasar","id":"35343","full_name":"Schneider, Stefan Balthasar","last_name":"Schneider","orcid":"0000-0001-8210-4011"},{"first_name":"Sevil","last_name":"Dräxler","full_name":"Dräxler, Sevil","id":"31764"},{"first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger","id":"126"}],"title":"Trade-offs in Dynamic Resource Allocation in Network Function Virtualization","conference":{"location":"Abu Dhabi, UAE","name":"IEEE Global Communications Conference (GLOBECOM 2018)"},"publication":"IEEE Global Communications Conference (GLOBECOM 2018)","type":"conference","abstract":[{"lang":"eng","text":"Dynamic allocation of resources is a key feature in network function virtualization (NFV), enabling flexible adjustment of slices and contained network services to ever-changing service demands. \r\nConsidering resource allocation across the entire network, many authors have proposed approaches to optimize the placement and chaining of virtual network function (VNF) instances and the allocation of resources to these VNF instances. In doing so, various optimization objectives are conceivable, e.g., minimizing certain required resources or the end-to-end delay of the placed services.\r\n\r\nIn this paper, we investigate the relationship between four typical optimization objectives when coordinating the placement and resource allocation of chained VNF instances. We observe an interesting trade-off between minimizing the overhead of starting/stopping VNF instances and all other objectives when adapting to changed service demands."}],"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","date_created":"2019-01-24T13:53:16Z","creator":"stschn","date_updated":"2019-01-24T13:53:16Z","file_id":"6971","access_level":"open_access","file_name":"preprint_ris.pdf","file_size":422196}],"_id":"6970","project":[{"_id":"28","name":"5G Development and validation platform for global industry-specific network services and Apps","grant_number":"761493"},{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"department":[{"_id":"75"}],"user_id":"35343","ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2019-01-24T13:53:16Z"},{"year":"2018","title":"A Generic Emulation Framework for Reusing and Evaluating VNF Placement Algorithms","publisher":"IEEE","date_created":"2019-01-24T14:10:17Z","abstract":[{"lang":"eng","text":"In recent years, a variety of different approaches\r\nhave been proposed to tackle the problem of scaling and placing\r\nnetwork services, consisting of interconnected virtual network\r\nfunctions (VNFs). This paper presents a placement abstraction\r\nlayer (PAL) that provides a clear and simple northbound interface\r\nfor using such algorithms while hiding their internal\r\nfunctionality and implementation. Through its southbound interface,\r\nPAL can connect to different back ends that evaluate\r\nthe calculated placements, e.g., using simulations, emulations, or\r\ntestbed approaches. As an example for such evaluation back ends,\r\nwe introduce a novel placement emulation framework (PEF)\r\nthat allows executing calculated placements using real, containerbased\r\nVNFs on real-world network topologies. In a case study,\r\nwe show how PAL and PEF facilitate reusing and evaluating\r\nplacement algorithms as well as validating their underlying\r\nmodels and performance claims."}],"file":[{"content_type":"application/pdf","relation":"main_file","date_created":"2019-01-24T14:10:08Z","creator":"stschn","date_updated":"2019-01-24T14:25:23Z","file_name":"preprint_ris.pdf","file_id":"6973","access_level":"open_access","file_size":468396}],"publication":"IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)","ddc":["040"],"language":[{"iso":"eng"}],"citation":{"chicago":"Schneider, Stefan Balthasar, Manuel Peuster, and Holger Karl. “A Generic Emulation Framework for Reusing and Evaluating VNF Placement Algorithms.” In <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725795\">https://doi.org/10.1109/NFV-SDN.2018.8725795</a>.","ieee":"S. B. Schneider, M. Peuster, and H. Karl, “A Generic Emulation Framework for Reusing and Evaluating VNF Placement Algorithms,” in <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>, Verona, Italy, 2018.","ama":"Schneider SB, Peuster M, Karl H. A Generic Emulation Framework for Reusing and Evaluating VNF Placement Algorithms. In: <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725795\">10.1109/NFV-SDN.2018.8725795</a>","apa":"Schneider, S. B., Peuster, M., &#38; Karl, H. (2018). A Generic Emulation Framework for Reusing and Evaluating VNF Placement Algorithms. In <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>. Verona, Italy: IEEE. <a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725795\">https://doi.org/10.1109/NFV-SDN.2018.8725795</a>","bibtex":"@inproceedings{Schneider_Peuster_Karl_2018, title={A Generic Emulation Framework for Reusing and Evaluating VNF Placement Algorithms}, DOI={<a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725795\">10.1109/NFV-SDN.2018.8725795</a>}, booktitle={IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)}, publisher={IEEE}, author={Schneider, Stefan Balthasar and Peuster, Manuel and Karl, Holger}, year={2018} }","short":"S.B. Schneider, M. Peuster, H. Karl, in: IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018), IEEE, 2018.","mla":"Schneider, Stefan Balthasar, et al. “A Generic Emulation Framework for Reusing and Evaluating VNF Placement Algorithms.” <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725795\">10.1109/NFV-SDN.2018.8725795</a>."},"has_accepted_license":"1","doi":"10.1109/NFV-SDN.2018.8725795","conference":{"location":"Verona, Italy","name":"IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)"},"main_file_link":[{"url":"https://ieeexplore.ieee.org/abstract/document/8725795"}],"date_updated":"2022-01-06T07:03:24Z","oa":"1","author":[{"last_name":"Schneider","orcid":"0000-0001-8210-4011","full_name":"Schneider, Stefan Balthasar","id":"35343","first_name":"Stefan Balthasar"},{"first_name":"Manuel","last_name":"Peuster","id":"13271","full_name":"Peuster, Manuel"},{"first_name":"Holger","last_name":"Karl","id":"126","full_name":"Karl, Holger"}],"status":"public","type":"conference","file_date_updated":"2019-01-24T14:25:23Z","_id":"6972","project":[{"name":"5G Development and validation platform for global industry-specific network services and Apps","_id":"28","grant_number":"761493"},{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"department":[{"_id":"75"}],"user_id":"35343"},{"publication":"IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)","abstract":[{"lang":"eng","text":"A key challenge of network function virtualization\r\n(NFV) is the complexity of developing and deploying new\r\nnetwork services. Currently, development requires many manual\r\nsteps that are time-consuming and error-prone (e.g., for creating\r\nservice descriptors). Furthermore, existing management and\r\norchestration (MANO) platforms only offer limited support of\r\nstandardized descriptor models or package formats, limiting the\r\nre-usability of network services.\r\n\r\nTo this end, we introduce a fully integrated, open-source\r\nNFV service development kit (SDK) with multi-MANO platform\r\nsupport. Our SDK simplifies many NFV service development\r\nsteps by offering initial generation of descriptors, advanced\r\nproject management, as well as fully automated packaging and\r\nsubmission for on-boarding. To achieve multi-platform support,\r\nwe present a package format that extends ETSI’s VNF package\r\nformat. In this demonstration, we present the end-to-end workflow\r\nto develop an NFV service that is then packaged for multiple\r\nplatforms, i.e., 5GTANGO and OSM."}],"file":[{"file_size":475022,"file_name":"Pre-print.pdf","access_level":"open_access","file_id":"6975","date_updated":"2019-01-24T14:26:23Z","date_created":"2019-01-24T14:17:29Z","creator":"stschn","relation":"main_file","content_type":"application/pdf"}],"ddc":["040"],"language":[{"iso":"eng"}],"year":"2018","publisher":"IEEE","date_created":"2019-01-24T14:17:58Z","title":"A Fully Integrated Multi-Platform NFV SDK","type":"conference","status":"public","project":[{"grant_number":"761493","name":"5G Development and validation platform for global industry-specific network services and Apps","_id":"28"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"_id":"6974","user_id":"35343","department":[{"_id":"75"}],"file_date_updated":"2019-01-24T14:26:23Z","has_accepted_license":"1","citation":{"ieee":"S. B. Schneider, M. Peuster, W. Tavernier, and H. Karl, “A Fully Integrated Multi-Platform NFV SDK,” in <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>, Verona, Italy, 2018.","chicago":"Schneider, Stefan Balthasar, Manuel Peuster, Wouter Tavernier, and Holger Karl. “A Fully Integrated Multi-Platform NFV SDK.” In <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725794\">https://doi.org/10.1109/NFV-SDN.2018.8725794</a>.","ama":"Schneider SB, Peuster M, Tavernier W, Karl H. A Fully Integrated Multi-Platform NFV SDK. In: <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725794\">10.1109/NFV-SDN.2018.8725794</a>","short":"S.B. Schneider, M. Peuster, W. Tavernier, H. Karl, in: IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018), IEEE, 2018.","mla":"Schneider, Stefan Balthasar, et al. “A Fully Integrated Multi-Platform NFV SDK.” <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725794\">10.1109/NFV-SDN.2018.8725794</a>.","bibtex":"@inproceedings{Schneider_Peuster_Tavernier_Karl_2018, title={A Fully Integrated Multi-Platform NFV SDK}, DOI={<a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725794\">10.1109/NFV-SDN.2018.8725794</a>}, booktitle={IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)}, publisher={IEEE}, author={Schneider, Stefan Balthasar and Peuster, Manuel and Tavernier, Wouter and Karl, Holger}, year={2018} }","apa":"Schneider, S. B., Peuster, M., Tavernier, W., &#38; Karl, H. (2018). A Fully Integrated Multi-Platform NFV SDK. In <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>. Verona, Italy: IEEE. <a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725794\">https://doi.org/10.1109/NFV-SDN.2018.8725794</a>"},"oa":"1","date_updated":"2022-01-06T07:03:25Z","author":[{"first_name":"Stefan Balthasar","last_name":"Schneider","orcid":"0000-0001-8210-4011","full_name":"Schneider, Stefan Balthasar","id":"35343"},{"full_name":"Peuster, Manuel","id":"13271","last_name":"Peuster","first_name":"Manuel"},{"first_name":"Wouter","full_name":"Tavernier, Wouter","last_name":"Tavernier"},{"last_name":"Karl","id":"126","full_name":"Karl, Holger","first_name":"Holger"}],"main_file_link":[{"url":"https://ieeexplore.ieee.org/abstract/document/8725794"}],"doi":"10.1109/NFV-SDN.2018.8725794","conference":{"location":"Verona, Italy","name":"IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)"}},{"title":"Data-Centre Traffic Optimisation using Software-Defined Networks","doi":"10.17619/UNIPB/1-287","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:51:17Z","supervisor":[{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"}],"date_created":"2018-03-13T10:22:51Z","author":[{"first_name":"Arne","last_name":"Schwabe","full_name":"Schwabe, Arne"}],"year":"2018","citation":{"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>.","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} }","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.","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>"},"language":[{"iso":"eng"}],"_id":"1208","project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subproject A2"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"75"}],"user_id":"477","status":"public","type":"dissertation"},{"citation":{"ieee":"M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash equilibria in restricted budget games,” <i>Journal of Combinatorial Optimization</i>, 2018.","chicago":"Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “Pure Nash Equilibria in Restricted Budget Games.” <i>Journal of Combinatorial Optimization</i>, 2018. <a href=\"https://doi.org/10.1007/s10878-018-0269-7\">https://doi.org/10.1007/s10878-018-0269-7</a>.","ama":"Drees M, Feldotto M, Riechers S, Skopalik A. Pure Nash equilibria in restricted budget games. <i>Journal of Combinatorial Optimization</i>. 2018. doi:<a href=\"https://doi.org/10.1007/s10878-018-0269-7\">10.1007/s10878-018-0269-7</a>","apa":"Drees, M., Feldotto, M., Riechers, S., &#38; Skopalik, A. (2018). Pure Nash equilibria in restricted budget games. <i>Journal of Combinatorial Optimization</i>. <a href=\"https://doi.org/10.1007/s10878-018-0269-7\">https://doi.org/10.1007/s10878-018-0269-7</a>","bibtex":"@article{Drees_Feldotto_Riechers_Skopalik_2018, title={Pure Nash equilibria in restricted budget games}, DOI={<a href=\"https://doi.org/10.1007/s10878-018-0269-7\">10.1007/s10878-018-0269-7</a>}, journal={Journal of Combinatorial Optimization}, publisher={Springer Nature}, author={Drees, Maximilian and Feldotto, Matthias and Riechers, Sören and Skopalik, Alexander}, year={2018} }","short":"M. Drees, M. Feldotto, S. Riechers, A. Skopalik, Journal of Combinatorial Optimization (2018).","mla":"Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.” <i>Journal of Combinatorial Optimization</i>, Springer Nature, 2018, doi:<a href=\"https://doi.org/10.1007/s10878-018-0269-7\">10.1007/s10878-018-0269-7</a>."},"publication_status":"epub_ahead","has_accepted_license":"1","publication_identifier":{"issn":["1382-6905","1573-2886"]},"doi":"10.1007/s10878-018-0269-7","author":[{"first_name":"Maximilian","last_name":"Drees","full_name":"Drees, Maximilian"},{"first_name":"Matthias","full_name":"Feldotto, Matthias","id":"14052","last_name":"Feldotto","orcid":"0000-0003-1348-6516"},{"last_name":"Riechers","full_name":"Riechers, Sören","first_name":"Sören"},{"first_name":"Alexander","last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander"}],"date_updated":"2022-01-06T06:51:42Z","status":"public","type":"journal_article","file_date_updated":"2018-10-31T16:56:13Z","user_id":"14052","department":[{"_id":"63"},{"_id":"541"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"_id":"1369","year":"2018","title":"Pure Nash equilibria in restricted budget games","date_created":"2018-03-18T11:12:49Z","publisher":"Springer Nature","file":[{"date_updated":"2018-10-31T16:56:13Z","creator":"feldi","date_created":"2018-10-31T16:56:13Z","file_size":561187,"file_id":"5225","file_name":"Drees2018_Article_PureNashEquilibriaInRestricted.pdf","access_level":"closed","content_type":"application/pdf","relation":"main_file"}],"abstract":[{"text":"In budget games, players compete over resources with finite budgets. For every resource, a player has a specific demand and as a strategy, he chooses a subset of resources. If the total demand on a resource does not exceed its budget, the utility of each player who chose that resource equals his demand. Otherwise, the budget is shared proportionally. In the general case, pure Nash equilibria (NE) do not exist for such games. In this paper, we consider the natural classes of singleton and matroid budget games with additional constraints and show that for each, pure NE can be guaranteed. In addition, we introduce a lexicographical potential function to prove that every matroid budget game has an approximate pure NE which depends on the largest ratio between the different demands of each individual player.","lang":"eng"}],"publication":"Journal of Combinatorial Optimization","language":[{"iso":"eng"}],"ddc":["000"]},{"abstract":[{"text":"The microservice architecture uses independently running microservices as build- ing blocks for applications. These microservices are clearly bounded for each other and expose their functionality through, for instance, RESTful application inter- faces. Particularly the clear boundaries between microservices enable the reuse of microservice throughout different projects. Because of the increasing use of microservices, the composition of multiple microservices in service composition becomes a more important task. A challenging area in developing service compo- sitions is that it involves two distinct layers with few junctions. On the one hand, describes a service composition a business process, which involves multiple com- ponents. On the other hand, involves the implementation of a service composition topics like service discovery and message exchange protocols since the microser- vices involved in a service composition are located within a network environment. In this Bachelor’s Thesis, I describe a descriptions language to abstractly describe the business logic of a service composition. Furthermore, I describe a genera- tion process, which compiles this abstract description to a working microservice realizing the specified service composition. In addition to that, I provide an im- plementation of the generation process, as a proof of concept, and test it within a Kubernetes-based cluster environment.","lang":"eng"}],"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"project":[{"name":"SFB 901 - Subproject C4","_id":"16"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"3291","user_id":"477","department":[{"_id":"75"}],"year":"2017","citation":{"mla":"Schürmann, Andreas. <i>Microservice-Based Execution Environment for Service Compositions</i>. Universität Paderborn, 2017.","short":"A. Schürmann, Microservice-Based Execution Environment for Service Compositions, Universität Paderborn, 2017.","bibtex":"@book{Schürmann_2017, title={Microservice-based Execution Environment for Service Compositions}, publisher={Universität Paderborn}, author={Schürmann, Andreas}, year={2017} }","apa":"Schürmann, A. (2017). <i>Microservice-based Execution Environment for Service Compositions</i>. Universität Paderborn.","ama":"Schürmann A. <i>Microservice-Based Execution Environment for Service Compositions</i>. Universität Paderborn; 2017.","chicago":"Schürmann, Andreas. <i>Microservice-Based Execution Environment for Service Compositions</i>. Universität Paderborn, 2017.","ieee":"A. Schürmann, <i>Microservice-based Execution Environment for Service Compositions</i>. Universität Paderborn, 2017."},"title":"Microservice-based Execution Environment for Service Compositions","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:09Z","author":[{"full_name":"Schürmann, Andreas","last_name":"Schürmann","first_name":"Andreas"}],"supervisor":[{"first_name":"Holger","last_name":"Karl","id":"126","full_name":"Karl, Holger"}],"date_created":"2018-06-21T11:09:30Z"},{"_id":"79","project":[{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"63"}],"series_title":"Lecture Notes in Computer Science","user_id":"477","file_date_updated":"2018-11-02T14:59:22Z","type":"conference","status":"public","date_updated":"2022-01-06T07:03:47Z","volume":10787,"author":[{"first_name":"Alexander","last_name":"Mäcker","full_name":"Mäcker, Alexander","id":"13536"},{"first_name":"Manuel","last_name":"Malatyali","full_name":"Malatyali, Manuel"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"last_name":"Riechers","full_name":"Riechers, Sören","first_name":"Sören"}],"doi":"10.1007/978-3-319-89441-6","has_accepted_license":"1","intvolume":"     10787","page":"207-222","citation":{"ieee":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times,” in <i>Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)</i>, 2017, vol. 10787, pp. 207–222.","chicago":"Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times.” In <i>Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)</i>, 10787:207–22. Lecture Notes in Computer Science. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-89441-6\">https://doi.org/10.1007/978-3-319-89441-6</a>.","ama":"Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times. In: <i>Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)</i>. Vol 10787. Lecture Notes in Computer Science. Springer; 2017:207-222. doi:<a href=\"https://doi.org/10.1007/978-3-319-89441-6\">10.1007/978-3-319-89441-6</a>","apa":"Mäcker, A., Malatyali, M., Meyer auf der Heide, F., &#38; Riechers, S. (2017). Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times. In <i>Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)</i> (Vol. 10787, pp. 207–222). Springer. <a href=\"https://doi.org/10.1007/978-3-319-89441-6\">https://doi.org/10.1007/978-3-319-89441-6</a>","bibtex":"@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2017, series={Lecture Notes in Computer Science}, title={Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times}, volume={10787}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-89441-6\">10.1007/978-3-319-89441-6</a>}, booktitle={Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)}, publisher={Springer}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2017}, pages={207–222}, collection={Lecture Notes in Computer Science} }","short":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2017, pp. 207–222.","mla":"Mäcker, Alexander, et al. “Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times.” <i>Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)</i>, vol. 10787, Springer, 2017, pp. 207–22, doi:<a href=\"https://doi.org/10.1007/978-3-319-89441-6\">10.1007/978-3-319-89441-6</a>."},"ddc":["000"],"language":[{"iso":"eng"}],"publication":"Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)","abstract":[{"text":"Consider a problem in which $n$ jobs that are classified into $k$ types arrive over time at their release times and are to be scheduled on a single machine so as to minimize the maximum flow time.The machine requires a setup taking $s$ time units whenever it switches from processing jobs of one type to jobs of a different type.We consider the problem as an online problem where each job is only known to the scheduler as soon as it arrives and where the processing time of a job only becomes known upon its completion (non-clairvoyance).We are interested in the potential of simple ``greedy-like'' algorithms.We analyze a modification of the FIFO strategy and show its competitiveness to be $\\Theta(\\sqrt{n})$, which is optimal for the considered class of algorithms.For $k=2$ types it achieves a constant competitiveness.Our main insight is obtained by an analysis of the smoothed competitiveness.If processing times $p_j$ are independently perturbed to $\\hat p_j = (1+X_j)p_j$, we obtain a competitiveness of $O(\\sigma^{-2} \\log^2 n)$ when $X_j$ is drawn from a uniform or a (truncated) normal distribution with standard deviation $\\sigma$.The result proves that bad instances are fragile and ``practically'' one might expect a much better performance than given by the $\\Omega(\\sqrt{n})$-bound.","lang":"eng"}],"file":[{"date_updated":"2018-11-02T14:59:22Z","date_created":"2018-11-02T14:59:22Z","creator":"ups","file_size":380629,"file_name":"Non-clairvoyantSchedulingToMin.pdf","file_id":"5289","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"publisher":"Springer","date_created":"2017-10-17T12:41:06Z","title":"Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times","year":"2017"},{"publisher":"Wiley Online Library","date_created":"2017-10-17T12:41:02Z","title":"Specification, Composition, and Placement of Network Services with Flexible Structures","issue":"2","year":"2017","ddc":["040"],"publication":"International Journal of Network Management","abstract":[{"lang":"eng","text":"Network function virtualization and software-defined networking allow services consisting of virtual network functions to be designed and implemented with great flexibility by facilitating automatic deployments, migrations, and reconfigurations for services and their components. For extended flexibility, we go beyond seeing services as a fixed chain of functions. We define the service structure in a flexible way that enables changing the order of functions in case the functionality of the service is not influenced by this, and propose a YANG data model for expressing this flexibility. Flexible structures allow the network orchestration system to choose the optimal composition of service components that for example gives the best results for placement of services in the network. When number of flexible services and number of components in each service increase, combinatorial explosion limits the practical use of this flexibility. In this paper, we describe a selection heuristic that gives a Pareto set of the possible compositions of a service as well as possible combinations of different services, with respect to different optimization objectives. Moreover, we present a heuristic algorithm for placement of a combination of services, which aims at placing service components along shortest paths that have enough capacity for accommodating the services. By applying these solutions, we show that allowing flexibility in the service structure is feasible."}],"file":[{"relation":"hidden","content_type":"application/pdf","file_size":2765738,"access_level":"open_access","file_name":"58-preprint-ijnm.pdf","file_id":"1579","date_updated":"2018-06-13T09:15:42Z","date_created":"2018-03-21T13:18:13Z","creator":"florida"},{"file_name":"58-accepted-ijnm.pdf","file_id":"3197","access_level":"open_access","file_size":2766920,"creator":"sevilmeh","date_created":"2018-06-13T09:22:37Z","date_updated":"2018-06-13T09:22:37Z","relation":"main_file","content_type":"application/pdf"}],"oa":"1","date_updated":"2022-01-06T07:02:42Z","author":[{"last_name":"Dräxler","full_name":"Dräxler, Sevil","id":"31764","first_name":"Sevil"},{"first_name":"Holger","last_name":"Karl","id":"126","full_name":"Karl, Holger"}],"doi":"10.1002/nem.1963","has_accepted_license":"1","citation":{"apa":"Dräxler, S., &#38; Karl, H. (2017). Specification, Composition, and Placement of Network Services with Flexible Structures. <i>International Journal of Network Management</i>, (2), 1--16. <a href=\"https://doi.org/10.1002/nem.1963\">https://doi.org/10.1002/nem.1963</a>","short":"S. Dräxler, H. Karl, International Journal of Network Management (2017) 1--16.","bibtex":"@article{Dräxler_Karl_2017, title={Specification, Composition, and Placement of Network Services with Flexible Structures}, DOI={<a href=\"https://doi.org/10.1002/nem.1963\">10.1002/nem.1963</a>}, number={2}, journal={International Journal of Network Management}, publisher={Wiley Online Library}, author={Dräxler, Sevil and Karl, Holger}, year={2017}, pages={1--16} }","mla":"Dräxler, Sevil, and Holger Karl. “Specification, Composition, and Placement of Network Services with Flexible Structures.” <i>International Journal of Network Management</i>, no. 2, Wiley Online Library, 2017, pp. 1--16, doi:<a href=\"https://doi.org/10.1002/nem.1963\">10.1002/nem.1963</a>.","ama":"Dräxler S, Karl H. Specification, Composition, and Placement of Network Services with Flexible Structures. <i>International Journal of Network Management</i>. 2017;(2):1--16. doi:<a href=\"https://doi.org/10.1002/nem.1963\">10.1002/nem.1963</a>","chicago":"Dräxler, Sevil, and Holger Karl. “Specification, Composition, and Placement of Network Services with Flexible Structures.” <i>International Journal of Network Management</i>, no. 2 (2017): 1--16. <a href=\"https://doi.org/10.1002/nem.1963\">https://doi.org/10.1002/nem.1963</a>.","ieee":"S. Dräxler and H. Karl, “Specification, Composition, and Placement of Network Services with Flexible Structures,” <i>International Journal of Network Management</i>, no. 2, pp. 1--16, 2017."},"page":"1--16","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"name":"SFB 901 - Project Area C","_id":"4"},{"grant_number":"671517","_id":"25","name":"SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks","call_identifier":"5G PPP Phase 1"}],"_id":"58","user_id":"477","department":[{"_id":"75"}],"file_date_updated":"2018-06-13T09:22:37Z","type":"journal_article","urn":"582","status":"public"},{"type":"conference","publication":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","abstract":[{"lang":"eng","text":"We consider a scheduling problem on $m$ identical processors sharing an arbitrarily divisible resource. In addition to assigning jobs to processors, the scheduler must distribute the resource among the processors (e.g., for three processors in shares of 20\\%, 15\\%, and 65\\%) and adjust this distribution over time. Each job $j$ comes with a size $p_j \\in \\mathbb{R}$ and a resource requirement $r_j > 0$. Jobs do not benefit when receiving a share larger than $r_j$ of the resource. But providing them with a fraction of the resource requirement causes a linear decrease in the processing efficiency. We seek a (non-preemptive) job and resource assignment minimizing the makespan.Our main result is an efficient approximation algorithm which achieves an approximation ratio of $2 + 1/(m-2)$. It can be improved to an (asymptotic) ratio of $1 + 1/(m-1)$ if all jobs have unit size. Our algorithms also imply new results for a well-known bin packing problem with splittable items and a restricted number of allowed item parts per bin.Based upon the above solution, we also derive an approximation algorithm with similar guarantees for a setting in which we introduce so-called tasks each containing several jobs and where we are interested in the average completion time of tasks (a task is completed when all its jobs are completed)."}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-21T13:17:33Z","date_created":"2018-03-21T13:17:33Z","creator":"florida","file_size":784867,"file_id":"1578","file_name":"59-progress.pdf","access_level":"closed"}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"59","user_id":"477","department":[{"_id":"63"},{"_id":"541"}],"ddc":["040"],"file_date_updated":"2018-03-21T13:17:33Z","language":[{"iso":"eng"}],"has_accepted_license":"1","year":"2017","citation":{"mla":"Kling, Peter, et al. “Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.” <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2017, pp. 123--132, doi:<a href=\"https://doi.org/10.1145/3087556.3087578\">10.1145/3087556.3087578</a>.","bibtex":"@inproceedings{Kling_Mäcker_Riechers_Skopalik_2017, title={Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource}, DOI={<a href=\"https://doi.org/10.1145/3087556.3087578\">10.1145/3087556.3087578</a>}, booktitle={Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Kling, Peter and Mäcker, Alexander and Riechers, Sören and Skopalik, Alexander}, year={2017}, pages={123--132} }","short":"P. Kling, A. Mäcker, S. Riechers, A. Skopalik, in: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 123--132.","apa":"Kling, P., Mäcker, A., Riechers, S., &#38; Skopalik, A. (2017). Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource. In <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 123--132). <a href=\"https://doi.org/10.1145/3087556.3087578\">https://doi.org/10.1145/3087556.3087578</a>","chicago":"Kling, Peter, Alexander Mäcker, Sören Riechers, and Alexander Skopalik. “Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.” In <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 123--132, 2017. <a href=\"https://doi.org/10.1145/3087556.3087578\">https://doi.org/10.1145/3087556.3087578</a>.","ieee":"P. Kling, A. Mäcker, S. Riechers, and A. Skopalik, “Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource,” in <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2017, pp. 123--132.","ama":"Kling P, Mäcker A, Riechers S, Skopalik A. Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource. In: <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2017:123--132. doi:<a href=\"https://doi.org/10.1145/3087556.3087578\">10.1145/3087556.3087578</a>"},"page":"123--132","date_updated":"2022-01-06T07:02:46Z","author":[{"first_name":"Peter","full_name":"Kling, Peter","last_name":"Kling"},{"first_name":"Alexander","last_name":"Mäcker","id":"13536","full_name":"Mäcker, Alexander"},{"full_name":"Riechers, Sören","last_name":"Riechers","first_name":"Sören"},{"last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384","first_name":"Alexander"}],"date_created":"2017-10-17T12:41:02Z","title":"Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource","doi":"10.1145/3087556.3087578"},{"publication":"IEEE Transactions on Network and Service Management","file":[{"date_created":"2018-03-21T13:15:53Z","creator":"florida","date_updated":"2018-03-21T13:15:53Z","access_level":"closed","file_id":"1576","file_name":"64-07572217.pdf","file_size":1505773,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"text":"A current trend in networking and cloud computing is to provide compute resources at widely distributed sites; this is exemplified by developments such as Network Function Virtualisation. This paves the way for wide-area service deployments with improved service quality: e.g. user-perceived response times can be reduced by offering services at nearby sites. But always assigning users to the nearest site can be a bad decision if this site is already highly utilised. This paper formalises two related decisions of allocating compute resources at different sites and assigning users to them with the goal of minimising the response times while the total number of resources to be allocated is limited – a non-linear capacitated Facility Location Problem with integrated queuing systems. To efficiently handle its non-linearity, we introduce five linear problem linearisations and adapt the currently best heuristic for a similar scenario to our scenario. All six approaches are compared in experiments for solution quality and solving time. Surprisingly, our best optimisation formulation outperforms the heuristic in both time and quality. Additionally, we evaluate the influence of distributions of available compute resources in the network on the response time: The time was halved for some configurations. The presented formulation techniques for our problem linearisations are applicable to a broader optimisation domain.","lang":"eng"}],"ddc":["040"],"issue":"1","year":"2017","date_created":"2017-10-17T12:41:03Z","publisher":"IEEE","title":"Response-Time-Optimised Service Deployment: MILP Formulations of Piece-wise Linear Functions Approximating Non-linear Bivariate Mixed-integer Functions","type":"journal_article","status":"public","department":[{"_id":"75"}],"user_id":"477","_id":"64","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"name":"SFB 901 - Project Area C","_id":"4"}],"file_date_updated":"2018-03-21T13:15:53Z","has_accepted_license":"1","page":"121--135","citation":{"short":"M. Keller, H. Karl, IEEE Transactions on Network and Service Management (2017) 121--135.","bibtex":"@article{Keller_Karl_2017, title={Response-Time-Optimised Service Deployment: MILP Formulations of Piece-wise Linear Functions Approximating Non-linear Bivariate Mixed-integer Functions}, DOI={<a href=\"https://doi.org/10.1109/TNSM.2016.2611590\">10.1109/TNSM.2016.2611590</a>}, number={1}, journal={IEEE Transactions on Network and Service Management}, publisher={IEEE}, author={Keller, Matthias and Karl, Holger}, year={2017}, pages={121--135} }","mla":"Keller, Matthias, and Holger Karl. “Response-Time-Optimised Service Deployment: MILP Formulations of Piece-Wise Linear Functions Approximating Non-Linear Bivariate Mixed-Integer Functions.” <i>IEEE Transactions on Network and Service Management</i>, no. 1, IEEE, 2017, pp. 121--135, doi:<a href=\"https://doi.org/10.1109/TNSM.2016.2611590\">10.1109/TNSM.2016.2611590</a>.","apa":"Keller, M., &#38; Karl, H. (2017). Response-Time-Optimised Service Deployment: MILP Formulations of Piece-wise Linear Functions Approximating Non-linear Bivariate Mixed-integer Functions. <i>IEEE Transactions on Network and Service Management</i>, (1), 121--135. <a href=\"https://doi.org/10.1109/TNSM.2016.2611590\">https://doi.org/10.1109/TNSM.2016.2611590</a>","ieee":"M. Keller and H. Karl, “Response-Time-Optimised Service Deployment: MILP Formulations of Piece-wise Linear Functions Approximating Non-linear Bivariate Mixed-integer Functions,” <i>IEEE Transactions on Network and Service Management</i>, no. 1, pp. 121--135, 2017.","chicago":"Keller, Matthias, and Holger Karl. “Response-Time-Optimised Service Deployment: MILP Formulations of Piece-Wise Linear Functions Approximating Non-Linear Bivariate Mixed-Integer Functions.” <i>IEEE Transactions on Network and Service Management</i>, no. 1 (2017): 121--135. <a href=\"https://doi.org/10.1109/TNSM.2016.2611590\">https://doi.org/10.1109/TNSM.2016.2611590</a>.","ama":"Keller M, Karl H. Response-Time-Optimised Service Deployment: MILP Formulations of Piece-wise Linear Functions Approximating Non-linear Bivariate Mixed-integer Functions. <i>IEEE Transactions on Network and Service Management</i>. 2017;(1):121--135. doi:<a href=\"https://doi.org/10.1109/TNSM.2016.2611590\">10.1109/TNSM.2016.2611590</a>"},"author":[{"full_name":"Keller, Matthias","last_name":"Keller","first_name":"Matthias"},{"first_name":"Holger","last_name":"Karl","id":"126","full_name":"Karl, Holger"}],"date_updated":"2022-01-06T07:03:03Z","doi":"10.1109/TNSM.2016.2611590"},{"doi":"10.17619/UNIPB/1-231","title":"Scheduling with Scarce Resources","supervisor":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"date_created":"2017-11-15T07:51:07Z","author":[{"full_name":"Riechers, Sören","last_name":"Riechers","first_name":"Sören"}],"date_updated":"2022-01-06T07:03:27Z","publisher":"Universität Paderborn","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>.","short":"S. Riechers, Scheduling with Scarce Resources, Universität Paderborn, 2017.","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>","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>","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>.","ieee":"S. Riechers, <i>Scheduling with Scarce Resources</i>. Universität Paderborn, 2017."},"year":"2017","has_accepted_license":"1","file_date_updated":"2018-11-14T15:18:37Z","language":[{"iso":"eng"}],"ddc":["000"],"department":[{"_id":"63"}],"user_id":"14052","_id":"704","project":[{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"name":"SFB 901 - Project Area C","_id":"4"}],"status":"public","file":[{"creator":"feldi","date_created":"2018-11-14T15:18:37Z","date_updated":"2018-11-14T15:18:37Z","file_id":"5673","access_level":"closed","file_name":"thesisStable.pdf","file_size":1491627,"content_type":"application/pdf","relation":"main_file","success":1}],"type":"dissertation"},{"issue":"4","year":"2017","publisher":"Springer","date_created":"2017-11-15T10:21:34Z","title":"Cost-efficient Scheduling on Machines from the Cloud","publication":"Journal of Combinatorial Optimization","file":[{"creator":"florida","date_created":"2018-03-14T12:21:34Z","date_updated":"2018-03-14T12:21:34Z","file_id":"1210","file_name":"706-chp_3A10.1007_2F978-3-319-48749-6_42.pdf","access_level":"closed","file_size":608614,"content_type":"application/pdf","relation":"main_file","success":1}],"ddc":["040"],"language":[{"iso":"eng"}],"has_accepted_license":"1","citation":{"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>","short":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, Journal of Combinatorial Optimization 36 (2017) 1168–1194.","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>.","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>","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.","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>."},"page":"1168-1194","intvolume":"        36","date_updated":"2022-01-06T07:03:27Z","author":[{"last_name":"Mäcker","id":"13536","full_name":"Mäcker, Alexander","first_name":"Alexander"},{"first_name":"Manuel","last_name":"Malatyali","full_name":"Malatyali, Manuel"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Sören","last_name":"Riechers","full_name":"Riechers, Sören"}],"volume":36,"doi":"10.1007/s10878-017-0198-x","type":"journal_article","status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"706","user_id":"15415","department":[{"_id":"63"}],"file_date_updated":"2018-03-14T12:21:34Z"},{"citation":{"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} }","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.","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>.","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.","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>.","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>"},"publication_status":"published","has_accepted_license":"1","publication_identifier":{"isbn":["9781509015252"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/pdf/1605.05850.pdf"}],"doi":"10.1109/iccw.2017.7962785","conference":{"location":"Paris, France","end_date":"2017-05-25","start_date":"2017-05-21","name":"2017 IEEE International Conference on Communications Workshops (ICC Workshops)"},"oa":"1","date_updated":"2022-01-06T07:03:28Z","author":[{"last_name":"Dräxler","id":"31764","full_name":"Dräxler, Sevil","first_name":"Sevil"},{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"},{"last_name":"Peuster","id":"13271","full_name":"Peuster, Manuel","first_name":"Manuel"},{"first_name":"Hadi","last_name":"Razzaghi Kouchaksaraei","id":"60845","full_name":"Razzaghi Kouchaksaraei, Hadi"},{"first_name":"Michael","last_name":"Bredel","full_name":"Bredel, Michael"},{"last_name":"Lessmann","full_name":"Lessmann, Johannes","first_name":"Johannes"},{"first_name":"Thomas","last_name":"Soenen","full_name":"Soenen, Thomas"},{"full_name":"Tavernier, Wouter","last_name":"Tavernier","first_name":"Wouter"},{"first_name":"Sharon","last_name":"Mendel-Brin","full_name":"Mendel-Brin, Sharon"},{"last_name":"Xilouris","full_name":"Xilouris, George","first_name":"George"}],"status":"public","type":"conference","file_date_updated":"2018-11-02T14:22:10Z","project":[{"grant_number":"671517","_id":"25","name":"SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks","call_identifier":"5G PPP Phase 1"},{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"_id":"717","user_id":"31764","department":[{"_id":"75"}],"year":"2017","title":"SONATA: Service programming and orchestration for virtualized software networks","publisher":"IEEE","date_created":"2017-11-22T09:42:59Z","abstract":[{"lang":"eng","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."}],"file":[{"date_updated":"2018-11-02T14:22:10Z","date_created":"2018-11-02T14:22:10Z","creator":"ups","file_size":821211,"file_id":"5270","file_name":"07962785.pdf","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"publication":"2017 IEEE International Conference on Communications Workshops (ICC Workshops)","ddc":["000"],"language":[{"iso":"eng"}]},{"oa":"1","date_updated":"2022-01-06T07:03:59Z","author":[{"last_name":"Dräxler","full_name":"Dräxler, Sevil","id":"31764","first_name":"Sevil"},{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"},{"last_name":"Mann","full_name":"Mann, Zoltan Adam","first_name":"Zoltan Adam"}],"date_created":"2017-10-17T12:41:08Z","title":"Joint Optimization of Scaling and Placement of Virtual Network Services","doi":"10.1109/CCGRID.2017.25","has_accepted_license":"1","year":"2017","citation":{"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} }","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>.","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.","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>","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.","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>."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"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"}],"_id":"87","user_id":"31764","department":[{"_id":"75"}],"ddc":["040"],"file_date_updated":"2018-06-25T08:07:43Z","type":"conference","publication":"Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017)","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"}],"urn":"873","file":[{"date_updated":"2018-06-25T08:07:43Z","date_created":"2018-06-25T08:07:43Z","creator":"sevilmeh","file_size":2229109,"access_level":"open_access","file_id":"3324","file_name":"RIS.pdf","content_type":"application/pdf","relation":"main_file"}],"status":"public"},{"place":"Berlin","citation":{"ama":"Peuster M, Karl H. Profile Your Chains, Not Functions. Automated Network Service Profiling in DevOps Environments. In: <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)</i>. Berlin; 2017. doi:<a href=\"https://doi.org/10.1109/NFV-SDN.2017.8169826\">10.1109/NFV-SDN.2017.8169826</a>","ieee":"M. Peuster and H. Karl, “Profile Your Chains, Not Functions. Automated Network Service Profiling in DevOps Environments,” in <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)</i>, Berlin, 2017.","chicago":"Peuster, Manuel, and Holger Karl. “Profile Your Chains, Not Functions. Automated Network Service Profiling in DevOps Environments.” In <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)</i>. Berlin, 2017. <a href=\"https://doi.org/10.1109/NFV-SDN.2017.8169826\">https://doi.org/10.1109/NFV-SDN.2017.8169826</a>.","apa":"Peuster, M., &#38; Karl, H. (2017). Profile Your Chains, Not Functions. Automated Network Service Profiling in DevOps Environments. In <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)</i>. Berlin. <a href=\"https://doi.org/10.1109/NFV-SDN.2017.8169826\">https://doi.org/10.1109/NFV-SDN.2017.8169826</a>","bibtex":"@inproceedings{Peuster_Karl_2017, place={Berlin}, title={Profile Your Chains, Not Functions. Automated Network Service Profiling in DevOps Environments}, DOI={<a href=\"https://doi.org/10.1109/NFV-SDN.2017.8169826\">10.1109/NFV-SDN.2017.8169826</a>}, booktitle={IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)}, author={Peuster, Manuel and Karl, Holger}, year={2017} }","mla":"Peuster, Manuel, and Holger Karl. “Profile Your Chains, Not Functions. Automated Network Service Profiling in DevOps Environments.” <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)</i>, 2017, doi:<a href=\"https://doi.org/10.1109/NFV-SDN.2017.8169826\">10.1109/NFV-SDN.2017.8169826</a>.","short":"M. Peuster, H. Karl, in: IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN), Berlin, 2017."},"has_accepted_license":"1","publication_status":"published","conference":{"name":"IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)","location":"Berlin"},"doi":"10.1109/NFV-SDN.2017.8169826","oa":"1","date_updated":"2022-01-06T07:04:22Z","author":[{"first_name":"Manuel","id":"13271","full_name":"Peuster, Manuel","last_name":"Peuster"},{"first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger","id":"126"}],"urn":"9810","status":"public","type":"conference","file_date_updated":"2018-07-05T11:14:00Z","_id":"981","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"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"department":[{"_id":"75"}],"user_id":"13271","year":"2017","title":"Profile Your Chains, Not Functions. Automated Network Service Profiling in DevOps Environments","date_created":"2017-11-27T10:22:29Z","abstract":[{"text":"Benchmarking and profiling virtual network functions (VNFs) generates input\r\nknowledge for resource management decisions taken by \r\nmanagement and orchestration systems. \r\nSuch VNFs are usually not executed in isolation but are often deployed as part of a service function chain (SFC) that connects single functions into complex \r\nstructures. To manage such chains, isolated performance\r\nprofiles of single functions have to be combined to get insights into \r\nthe overall behavior of an SFC. This becomes particularly\r\nchallenging in highly agile DevOps environments in which profiling\r\nprocesses need to be fully automated and detailed insights about a chain's\r\ninternal structures are not always available. \r\n\r\nIn this paper, we introduce a\r\nfully automatable, flexible, and platform-agnostic profiling\r\nsystem that allows to profile entire SFCs at once. This obviates \r\nmanual modeling procedures to combine profiling results from single\r\nVNFs to reflect SFC performance. \r\nWe use a case study with different SFC configurations to show that it\r\nis hard to model the resulting SFC performance based on single-VNF measurements and that\r\nperformance interactions between real, non-trivial functions that are deployed in a\r\nchain exist.  ","lang":"eng"}],"file":[{"access_level":"open_access","file_id":"3431","file_name":"main_ris.pdf","file_size":2642306,"creator":"peuster","date_created":"2018-07-05T11:14:00Z","date_updated":"2018-07-05T11:14:00Z","relation":"main_file","content_type":"application/pdf"}],"publication":"IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)","ddc":["004"],"language":[{"iso":"eng"}]}]