[{"doi":"10.17619/UNIPB/1-830","title":"Efficient parallel branch-and-bound search on FPGAs using work stealing and instance-specific designs","author":[{"last_name":"Riebler","id":"8961","full_name":"Riebler, Heinrich","first_name":"Heinrich"}],"supervisor":[{"orcid":"0000-0001-5728-9982","last_name":"Plessl","full_name":"Plessl, Christian","id":"16153","first_name":"Christian"}],"date_created":"2022-11-30T14:36:04Z","date_updated":"2022-11-30T14:44:15Z","citation":{"mla":"Riebler, Heinrich. <i>Efficient Parallel Branch-and-Bound Search on FPGAs Using Work Stealing and Instance-Specific Designs</i>. 2019, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-830\">10.17619/UNIPB/1-830</a>.","short":"H. Riebler, Efficient Parallel Branch-and-Bound Search on FPGAs Using Work Stealing and Instance-Specific Designs, 2019.","bibtex":"@book{Riebler_2019, title={Efficient parallel branch-and-bound search on FPGAs using work stealing and instance-specific designs}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-830\">10.17619/UNIPB/1-830</a>}, author={Riebler, Heinrich}, year={2019} }","apa":"Riebler, H. (2019). <i>Efficient parallel branch-and-bound search on FPGAs using work stealing and instance-specific designs</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-830\">https://doi.org/10.17619/UNIPB/1-830</a>","ama":"Riebler H. <i>Efficient Parallel Branch-and-Bound Search on FPGAs Using Work Stealing and Instance-Specific Designs</i>.; 2019. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-830\">10.17619/UNIPB/1-830</a>","ieee":"H. Riebler, <i>Efficient parallel branch-and-bound search on FPGAs using work stealing and instance-specific designs</i>. 2019.","chicago":"Riebler, Heinrich. <i>Efficient Parallel Branch-and-Bound Search on FPGAs Using Work Stealing and Instance-Specific Designs</i>, 2019. <a href=\"https://doi.org/10.17619/UNIPB/1-830\">https://doi.org/10.17619/UNIPB/1-830</a>."},"year":"2019","language":[{"iso":"eng"}],"user_id":"15504","department":[{"_id":"27"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C2: SFB 901 - Subproject C2","_id":"14"}],"_id":"34167","status":"public","type":"dissertation"},{"status":"public","type":"conference","file_date_updated":"2019-10-18T08:07:49Z","_id":"13904","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"department":[{"_id":"7"},{"_id":"64"}],"series_title":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS '19","user_id":"25078","citation":{"apa":"Blömer, J., Bobolz, J., Diemert, D. P., &#38; Eidens, F. (2019). Updatable Anonymous Credentials and Applications to Incentive Systems. <i>Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19</i>. 26th ACM Conference on Computer and Communications Security, London. <a href=\"https://doi.org/10.1145/3319535.3354223\">https://doi.org/10.1145/3319535.3354223</a>","short":"J. Blömer, J. Bobolz, D.P. Diemert, F. Eidens, in: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19, 2019.","bibtex":"@inproceedings{Blömer_Bobolz_Diemert_Eidens_2019, series={Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19}, title={Updatable Anonymous Credentials and Applications to Incentive Systems}, DOI={<a href=\"https://doi.org/10.1145/3319535.3354223\">10.1145/3319535.3354223</a>}, booktitle={Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19}, author={Blömer, Johannes and Bobolz, Jan and Diemert, Denis Pascal and Eidens, Fabian}, year={2019}, collection={Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19} }","mla":"Blömer, Johannes, et al. “Updatable Anonymous Credentials and Applications to Incentive Systems.” <i>Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19</i>, 2019, doi:<a href=\"https://doi.org/10.1145/3319535.3354223\">10.1145/3319535.3354223</a>.","ieee":"J. Blömer, J. Bobolz, D. P. Diemert, and F. Eidens, “Updatable Anonymous Credentials and Applications to Incentive Systems,” presented at the 26th ACM Conference on Computer and Communications Security, London, 2019, doi: <a href=\"https://doi.org/10.1145/3319535.3354223\">10.1145/3319535.3354223</a>.","chicago":"Blömer, Johannes, Jan Bobolz, Denis Pascal Diemert, and Fabian Eidens. “Updatable Anonymous Credentials and Applications to Incentive Systems.” In <i>Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19</i>. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19, 2019. <a href=\"https://doi.org/10.1145/3319535.3354223\">https://doi.org/10.1145/3319535.3354223</a>.","ama":"Blömer J, Bobolz J, Diemert DP, Eidens F. Updatable Anonymous Credentials and Applications to Incentive Systems. In: <i>Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19</i>. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19. ; 2019. doi:<a href=\"https://doi.org/10.1145/3319535.3354223\">10.1145/3319535.3354223</a>"},"has_accepted_license":"1","doi":"10.1145/3319535.3354223","conference":{"location":"London","end_date":"2019-11-15","start_date":"2019-11-11","name":"26th ACM Conference on Computer and Communications Security"},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2019/169.pdf"}],"oa":"1","date_updated":"2023-01-10T10:25:27Z","author":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"},{"last_name":"Bobolz","id":"27207","full_name":"Bobolz, Jan","first_name":"Jan"},{"last_name":"Diemert","id":"44071","full_name":"Diemert, Denis Pascal","first_name":"Denis Pascal"},{"last_name":"Eidens","id":"25078","full_name":"Eidens, Fabian","first_name":"Fabian"}],"abstract":[{"lang":"eng","text":"In this paper, we introduce updatable anonymous credential systems (UACS) and use them to construct a new privacy-preserving incentive system. In a UACS, a user holding a credential certifying some attributes can interact with the corresponding issuer to update his attributes. During this, the issuer knows which update function is run, but does not learn the user's previous attributes. Hence the update process preserves anonymity of the user. One example for a class of update functions are additive updates of integer attributes, where the issuer increments an unknown integer attribute value v by some known value k. This kind of update is motivated by an application of UACS to incentive systems. Users in an incentive system can anonymously accumulate points, e.g. in a shop at checkout, and spend them later, e.g. for a discount."}],"file":[{"relation":"main_file","content_type":"application/pdf","file_size":838949,"file_name":"full_eprinted_v2.pdf","file_id":"13907","access_level":"closed","date_updated":"2019-10-18T08:07:49Z","date_created":"2019-10-18T08:07:49Z","creator":"jbobolz"}],"publication":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS '19","ddc":["006"],"language":[{"iso":"eng"}],"year":"2019","title":"Updatable Anonymous Credentials and Applications to Incentive Systems","date_created":"2019-10-18T08:09:44Z"},{"language":[{"iso":"eng"}],"_id":"45231","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C5: SFB 901 - Subproject C5","_id":"17"}],"department":[{"_id":"66"}],"user_id":"47208","status":"public","type":"bachelorsthesis","title":"Conception of a digital Sales Bonus System based on Blockchain Technology","date_updated":"2023-05-23T13:00:49Z","date_created":"2023-05-23T13:00:40Z","supervisor":[{"first_name":"Thim Frederik","last_name":"Strothmann","id":"11319","full_name":"Strothmann, Thim Frederik"},{"id":"47208","full_name":"Gottschalk, Sebastian","last_name":"Gottschalk","first_name":"Sebastian"}],"author":[{"last_name":"N.","full_name":"N., N.","first_name":"N."}],"year":"2019","citation":{"ieee":"N. N., <i>Conception of a digital Sales Bonus System based on Blockchain Technology</i>. 2019.","chicago":"N., N. <i>Conception of a Digital Sales Bonus System Based on Blockchain Technology</i>, 2019.","ama":"N. N. <i>Conception of a Digital Sales Bonus System Based on Blockchain Technology</i>.; 2019.","apa":"N., N. (2019). <i>Conception of a digital Sales Bonus System based on Blockchain Technology</i>.","short":"N. N., Conception of a Digital Sales Bonus System Based on Blockchain Technology, 2019.","mla":"N., N. <i>Conception of a Digital Sales Bonus System Based on Blockchain Technology</i>. 2019.","bibtex":"@book{N._2019, title={Conception of a digital Sales Bonus System based on Blockchain Technology}, author={N., N.}, year={2019} }"}},{"file_date_updated":"2019-01-24T10:17:00Z","department":[{"_id":"75"}],"user_id":"31764","_id":"2480","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"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"status":"public","type":"conference","doi":"10.1109/NETSOFT.2018.8460029","conference":{"location":"Montreal","end_date":"2018-07-29","start_date":"2018-07-25","name":"4th IEEE International Conference on Network Softwarization (NetSoft 2018)"},"author":[{"first_name":"Sevil","full_name":"Dräxler, Sevil","id":"31764","last_name":"Dräxler"},{"last_name":"Peuster","id":"13271","full_name":"Peuster, Manuel","first_name":"Manuel"},{"full_name":"Illian, Marvin","last_name":"Illian","first_name":"Marvin"},{"first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger","id":"126"}],"oa":"1","date_updated":"2022-01-06T06:56:37Z","page":"318--322","citation":{"ama":"Dräxler S, Peuster M, Illian M, Karl H. Generating Resource and Performance Models for Service Function Chains: The Video Streaming Case. In: <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>. IEEE; 2018:318--322. doi:<a href=\"https://doi.org/10.1109/NETSOFT.2018.8460029\">10.1109/NETSOFT.2018.8460029</a>","chicago":"Dräxler, Sevil, Manuel Peuster, Marvin Illian, and Holger Karl. “Generating Resource and Performance Models for Service Function Chains: The Video Streaming Case.” In <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>, 318--322. IEEE, 2018. <a href=\"https://doi.org/10.1109/NETSOFT.2018.8460029\">https://doi.org/10.1109/NETSOFT.2018.8460029</a>.","ieee":"S. Dräxler, M. Peuster, M. Illian, and H. Karl, “Generating Resource and Performance Models for Service Function Chains: The Video Streaming Case,” in <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>, Montreal, 2018, pp. 318--322.","apa":"Dräxler, S., Peuster, M., Illian, M., &#38; Karl, H. (2018). Generating Resource and Performance Models for Service Function Chains: The Video Streaming Case. In <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i> (pp. 318--322). Montreal: IEEE. <a href=\"https://doi.org/10.1109/NETSOFT.2018.8460029\">https://doi.org/10.1109/NETSOFT.2018.8460029</a>","short":"S. Dräxler, M. Peuster, M. Illian, H. Karl, in: 4th IEEE International Conference on Network Softwarization (NetSoft 2018), IEEE, 2018, pp. 318--322.","bibtex":"@inproceedings{Dräxler_Peuster_Illian_Karl_2018, title={Generating Resource and Performance Models for Service Function Chains: The Video Streaming Case}, DOI={<a href=\"https://doi.org/10.1109/NETSOFT.2018.8460029\">10.1109/NETSOFT.2018.8460029</a>}, booktitle={4th IEEE International Conference on Network Softwarization (NetSoft 2018)}, publisher={IEEE}, author={Dräxler, Sevil and Peuster, Manuel and Illian, Marvin and Karl, Holger}, year={2018}, pages={318--322} }","mla":"Dräxler, Sevil, et al. “Generating Resource and Performance Models for Service Function Chains: The Video Streaming Case.” <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>, IEEE, 2018, pp. 318--322, doi:<a href=\"https://doi.org/10.1109/NETSOFT.2018.8460029\">10.1109/NETSOFT.2018.8460029</a>."},"has_accepted_license":"1","language":[{"iso":"eng"}],"ddc":["004"],"file":[{"creator":"ups","date_created":"2018-12-12T15:18:12Z","date_updated":"2018-12-12T15:18:12Z","access_level":"closed","file_name":"08460029.pdf","file_id":"6195","file_size":2211450,"content_type":"application/pdf","relation":"main_file","success":1},{"content_type":"application/pdf","relation":"main_file","date_updated":"2019-01-24T10:17:00Z","date_created":"2019-01-24T10:17:00Z","creator":"sevilmeh","file_size":3445650,"file_id":"6968","file_name":"NetSoft18_RIS.pdf","access_level":"open_access"}],"abstract":[{"text":"Understanding the behavior of the components of service function chains (SFCs) in different load situations is important for efficient and automatic management and orches- tration of services. For this purpose and for practical research in network function virtualization in general, there is a great need for benchmarks and experimental data. In this paper, we describe our experiments for characterizing the relationship between resource demands of virtual network functions (VNFs) and the expected performance of the SFC, considering the individual performance of the VNFs as well as the interdependencies among VNFs within the SFC. We have designed our experiments focusing on video streaming, an important application in this context. We present examples of models for predicting the interdependence between resource demands and performance characteristics of SFCs using support vector regression and polynomial regression models. We also show practical evidence from our experiments that VNFs need to be benchmarked in their final chain setup, rather than individually, to capture important interdependencies that affect their performance. The data gathered from our experiments is publicly available.","lang":"eng"}],"publication":"4th IEEE International Conference on Network Softwarization (NetSoft 2018)","title":"Generating Resource and Performance Models for Service Function Chains: The Video Streaming Case","date_created":"2018-04-24T12:11:36Z","publisher":"IEEE","year":"2018"},{"_id":"2481","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"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"department":[{"_id":"75"}],"user_id":"477","file_date_updated":"2018-06-25T07:40:57Z","type":"conference","urn":"24814","status":"public","oa":"1","date_updated":"2022-01-06T06:56:38Z","author":[{"first_name":"Sevil","last_name":"Dräxler","full_name":"Dräxler, Sevil","id":"31764"},{"id":"35343","full_name":"Schneider, Stefan Balthasar","orcid":"0000-0001-8210-4011","last_name":"Schneider","first_name":"Stefan Balthasar"},{"full_name":"Karl, Holger","id":"126","last_name":"Karl","first_name":"Holger"}],"conference":{"location":"Montreal","name":"4th IEEE International Conference on Network Softwarization (NetSoft 2018)"},"has_accepted_license":"1","publication_status":"published","page":"123--131","citation":{"bibtex":"@inproceedings{Dräxler_Schneider_Karl_2018, title={ Scaling and Placing Bidirectional Services with Stateful Virtual and Physical Network Functions}, booktitle={4th IEEE International Conference on Network Softwarization (NetSoft 2018)}, publisher={IEEE}, author={Dräxler, Sevil and Schneider, Stefan Balthasar and Karl, Holger}, year={2018}, pages={123--131} }","mla":"Dräxler, Sevil, et al. “ Scaling and Placing Bidirectional Services with Stateful Virtual and Physical Network Functions.” <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>, IEEE, 2018, pp. 123--131.","short":"S. Dräxler, S.B. Schneider, H. Karl, in: 4th IEEE International Conference on Network Softwarization (NetSoft 2018), IEEE, 2018, pp. 123--131.","apa":"Dräxler, S., Schneider, S. B., &#38; Karl, H. (2018).  Scaling and Placing Bidirectional Services with Stateful Virtual and Physical Network Functions. In <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i> (pp. 123--131). Montreal: IEEE.","chicago":"Dräxler, Sevil, Stefan Balthasar Schneider, and Holger Karl. “ Scaling and Placing Bidirectional Services with Stateful Virtual and Physical Network Functions.” In <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>, 123--131. IEEE, 2018.","ieee":"S. Dräxler, S. B. Schneider, and H. Karl, “ Scaling and Placing Bidirectional Services with Stateful Virtual and Physical Network Functions,” in <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>, Montreal, 2018, pp. 123--131.","ama":"Dräxler S, Schneider SB, Karl H.  Scaling and Placing Bidirectional Services with Stateful Virtual and Physical Network Functions. In: <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>. IEEE; 2018:123--131."},"ddc":["040"],"language":[{"iso":"eng"}],"publication":"4th IEEE International Conference on Network Softwarization (NetSoft 2018)","abstract":[{"text":"Network function virtualization requires scaling and placement, deciding the number and the location of function instances. Current approaches are limited in flexibility and practical applicability. Specifically, we study dynamic, single-step, joint scaling and placement of network services with bidirectional flows traversing Physical or Virtual Network Functions (VNFs) and returning to their sources. We develop models to support stateful components and legacy network functions with fixed locations in these network services as well as the possibility of reusing VNFs across network services. We formalize the problem of jointly scaling and placing such network services as a mixed- integer linear program (MILP). We show that this problem is NP-complete and also present a heuristic algorithm to find good solutions in short time. In an extensive evaluation with realistic scenarios, we investigate the capabilities of the two approaches.","lang":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","creator":"sevilmeh","date_created":"2018-06-25T07:40:57Z","date_updated":"2018-06-25T07:40:57Z","file_id":"3319","access_level":"open_access","file_name":"RIS.pdf","file_size":1471937}],"publisher":"IEEE","date_created":"2018-04-24T12:14:00Z","title":" Scaling and Placing Bidirectional Services with Stateful Virtual and Physical Network Functions","year":"2018"},{"related_material":{"link":[{"relation":"confirmation","url":"http://repositum.tuwien.ac.at/obvutwoa/content/titleinfo/2514843"}]},"publication_status":"published","citation":{"ama":"Dräxler S, Peuster M, Illian M, Karl H. <i>Towards Predicting Resource Demands and Performance of Distributed Cloud Services</i>. Wien, Darmstadt; 2018.","ieee":"S. Dräxler, M. Peuster, M. Illian, and H. Karl, <i>Towards Predicting Resource Demands and Performance of Distributed Cloud Services</i>. Wien, Darmstadt, 2018.","chicago":"Dräxler, Sevil, Manuel Peuster, Marvin Illian, and Holger Karl. <i>Towards Predicting Resource Demands and Performance of Distributed Cloud Services</i>. KuVS-Fachgespräch Fog Computing 2018. Wien, Darmstadt, 2018.","apa":"Dräxler, S., Peuster, M., Illian, M., &#38; Karl, H. (2018). <i>Towards Predicting Resource Demands and Performance of Distributed Cloud Services</i>. Wien, Darmstadt.","mla":"Dräxler, Sevil, et al. <i>Towards Predicting Resource Demands and Performance of Distributed Cloud Services</i>. 2018.","bibtex":"@book{Dräxler_Peuster_Illian_Karl_2018, place={Wien, Darmstadt}, series={KuVS-Fachgespräch Fog Computing 2018}, title={Towards Predicting Resource Demands and Performance of Distributed Cloud Services}, author={Dräxler, Sevil and Peuster, Manuel and Illian, Marvin and Karl, Holger}, year={2018}, collection={KuVS-Fachgespräch Fog Computing 2018} }","short":"S. Dräxler, M. Peuster, M. Illian, H. Karl, Towards Predicting Resource Demands and Performance of Distributed Cloud Services, Wien, Darmstadt, 2018."},"year":"2018","place":"Wien, Darmstadt","author":[{"first_name":"Sevil","full_name":"Dräxler, Sevil","id":"31764","last_name":"Dräxler"},{"first_name":"Manuel","last_name":"Peuster","full_name":"Peuster, Manuel","id":"13271"},{"first_name":"Marvin","last_name":"Illian","full_name":"Illian, Marvin"},{"last_name":"Karl","id":"126","full_name":"Karl, Holger","first_name":"Holger"}],"date_created":"2018-04-24T12:22:40Z","date_updated":"2022-01-06T06:56:38Z","oa":"1","main_file_link":[{"url":"http://www.infosys.tuwien.ac.at/docs/proceedings.pdf#page=14","open_access":"1"}],"title":"Towards Predicting Resource Demands and Performance of Distributed Cloud Services","type":"report","status":"public","abstract":[{"lang":"eng","text":"Understanding the behavior of distributed cloud service components in different load situations is important for efficient and automatic management and orchestration of these services. For this purpose and for practical research in distributed cloud computing in general, there is need for benchmarks and experimental data. In this paper, we describe our experiments for characterizing the relationship between resource demands of application components and the expected performance of applica- tions. We present initial results for predicting the interdependence between resource demands and performance characteristics using support vector regression and polynomial regression models. The data gathered from our experiments is publicly available."}],"department":[{"_id":"75"}],"series_title":"KuVS-Fachgespräch Fog Computing 2018","user_id":"31764","_id":"2483","project":[{"grant_number":"762057","name":"5G Programmable Infrastructure Converging disaggregated neTwork and compUte Resources","_id":"23"},{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"language":[{"iso":"eng"}],"ddc":["000"]},{"place":"Dagstuhl, Germany","citation":{"ama":"Feldkord B, Feldotto M, Gupta A, et al. Fully-Dynamic Bin Packing with Little Repacking. In: Chatzigiannakis I, Kaklamanis C, Marx D, Sannella D, eds. <i>45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)</i>. Vol 107. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2018:51:1-51:24. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2018.51\">10.4230/LIPIcs.ICALP.2018.51</a>","chicago":"Feldkord, Björn, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit  Kumar, Sören Riechers, and David Wajc. “Fully-Dynamic Bin Packing with Little Repacking.” In <i>45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)</i>, edited by Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, and Donald Sannella, 107:51:1-51:24. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2018.51\">https://doi.org/10.4230/LIPIcs.ICALP.2018.51</a>.","ieee":"B. Feldkord <i>et al.</i>, “Fully-Dynamic Bin Packing with Little Repacking,” in <i>45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)</i>, Prag, 2018, vol. 107, pp. 51:1-51:24.","mla":"Feldkord, Björn, et al. “Fully-Dynamic Bin Packing with Little Repacking.” <i>45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)</i>, edited by Ioannis Chatzigiannakis et al., vol. 107, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 51:1-51:24, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2018.51\">10.4230/LIPIcs.ICALP.2018.51</a>.","bibtex":"@inproceedings{Feldkord_Feldotto_Gupta_Guruganesh_Kumar_Riechers_Wajc_2018, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Fully-Dynamic Bin Packing with Little Repacking}, volume={107}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2018.51\">10.4230/LIPIcs.ICALP.2018.51</a>}, booktitle={45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, publisher={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, author={Feldkord, Björn and Feldotto, Matthias and Gupta, Anupam and Guruganesh, Guru and Kumar, Amit  and Riechers, Sören and Wajc, David}, editor={Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, Dániel and Sannella, DonaldEditors}, year={2018}, pages={51:1-51:24}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","short":"B. Feldkord, M. Feldotto, A. Gupta, G. Guruganesh, A. Kumar, S. Riechers, D. Wajc, in: I. Chatzigiannakis, C. Kaklamanis, D. Marx, D. Sannella (Eds.), 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, pp. 51:1-51:24.","apa":"Feldkord, B., Feldotto, M., Gupta, A., Guruganesh, G., Kumar, A., Riechers, S., &#38; Wajc, D. (2018). Fully-Dynamic Bin Packing with Little Repacking. In I. Chatzigiannakis, C. Kaklamanis, D. Marx, &#38; D. Sannella (Eds.), <i>45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)</i> (Vol. 107, pp. 51:1-51:24). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2018.51\">https://doi.org/10.4230/LIPIcs.ICALP.2018.51</a>"},"page":"51:1-51:24","intvolume":"       107","publication_status":"published","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-076-7"]},"has_accepted_license":"1","doi":"10.4230/LIPIcs.ICALP.2018.51","conference":{"name":"45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)","start_date":"2018-07-10","end_date":"2018-07-13","location":"Prag"},"date_updated":"2022-01-06T06:56:39Z","author":[{"full_name":"Feldkord, Björn","id":"22704","last_name":"Feldkord","first_name":"Björn"},{"first_name":"Matthias","last_name":"Feldotto","orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","id":"14052"},{"full_name":"Gupta, Anupam","last_name":"Gupta","first_name":"Anupam"},{"full_name":"Guruganesh, Guru","last_name":"Guruganesh","first_name":"Guru"},{"full_name":"Kumar, Amit ","last_name":"Kumar","first_name":"Amit "},{"first_name":"Sören","full_name":"Riechers, Sören","last_name":"Riechers"},{"first_name":"David","full_name":"Wajc, David","last_name":"Wajc"}],"volume":107,"editor":[{"first_name":"Ioannis","last_name":"Chatzigiannakis","full_name":"Chatzigiannakis, Ioannis"},{"first_name":"Christos","full_name":"Kaklamanis, Christos","last_name":"Kaklamanis"},{"first_name":"Dániel","full_name":"Marx, Dániel","last_name":"Marx"},{"first_name":"Donald","last_name":"Sannella","full_name":"Sannella, Donald"}],"status":"public","type":"conference","file_date_updated":"2018-10-31T16:58:18Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"_id":"2484","user_id":"14052","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","department":[{"_id":"541"},{"_id":"63"}],"year":"2018","title":"Fully-Dynamic Bin Packing with Little Repacking","publisher":"Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik","date_created":"2018-04-24T15:21:56Z","abstract":[{"text":"We study the classic bin packing problem in a fully-dynamic setting, where new items can arrive and old items may depart. We want algorithms with low asymptotic competitive ratio while repacking items sparingly between updates. Formally, each item i has a movement cost c_i >= 0, and we want to use alpha * OPT bins and incur a movement cost gamma * c_i, either in the worst case, or in an amortized sense, for alpha, gamma as small as possible. We call gamma the recourse of the algorithm. This is motivated by cloud storage applications, where fully-dynamic bin packing models the problem of data backup to minimize the number of disks used, as well as communication incurred in moving file backups between disks. Since the set of files changes over time, we could recompute a solution periodically from scratch, but this would give a high number of disk rewrites, incurring a high energy cost and possible wear and tear of the disks. In this work, we present optimal tradeoffs between number of bins used and number of items repacked, as well as natural extensions of the latter measure.","lang":"eng"}],"file":[{"date_updated":"2018-10-31T16:58:18Z","creator":"feldi","date_created":"2018-10-31T16:58:18Z","file_size":723824,"file_name":"LIPIcs-ICALP-2018-51.pdf","file_id":"5227","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"publication":"45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)","ddc":["000"],"language":[{"iso":"eng"}],"external_id":{"arxiv":["1711.01231"]}},{"citation":{"ama":"Szopinski D, Kundisch D. Business model idea generation: An exploratory study on changing perspectives. In: <i>2nd Business Model Conference</i>. ; 2018.","ieee":"D. Szopinski and D. Kundisch, “Business model idea generation: An exploratory study on changing perspectives,” in <i>2nd Business Model Conference</i>, Florence, Italy, 2018.","chicago":"Szopinski, Daniel, and Dennis Kundisch. “Business Model Idea Generation: An Exploratory Study on Changing Perspectives.” In <i>2nd Business Model Conference</i>, 2018.","apa":"Szopinski, D., &#38; Kundisch, D. (2018). Business model idea generation: An exploratory study on changing perspectives. In <i>2nd Business Model Conference</i>. Florence, Italy.","bibtex":"@inproceedings{Szopinski_Kundisch_2018, title={Business model idea generation: An exploratory study on changing perspectives}, booktitle={2nd Business Model Conference}, author={Szopinski, Daniel and Kundisch, Dennis}, year={2018} }","short":"D. Szopinski, D. Kundisch, in: 2nd Business Model Conference, 2018.","mla":"Szopinski, Daniel, and Dennis Kundisch. “Business Model Idea Generation: An Exploratory Study on Changing Perspectives.” <i>2nd Business Model Conference</i>, 2018."},"year":"2018","has_accepted_license":"1","conference":{"start_date":"2018-06-06","name":"2nd Business Model Conference","location":"Florence, Italy","end_date":"2018-06-07"},"title":"Business model idea generation: An exploratory study on changing perspectives","author":[{"first_name":"Daniel","last_name":"Szopinski","id":"36372","full_name":"Szopinski, Daniel"},{"first_name":"Dennis","full_name":"Kundisch, Dennis","id":"21117","last_name":"Kundisch"}],"date_created":"2018-04-25T13:03:08Z","date_updated":"2022-01-06T06:56:40Z","status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-12T13:24:21Z","date_created":"2018-11-12T13:24:21Z","creator":"dsz","file_size":589100,"file_id":"5505","file_name":"BuMoCo2018_Standardization.pdf","access_level":"closed"}],"publication":"2nd Business Model Conference","type":"conference_abstract","language":[{"iso":"eng"}],"file_date_updated":"2018-11-12T13:24:21Z","ddc":["040"],"department":[{"_id":"276"}],"user_id":"477","_id":"2490","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C5","_id":"17"}]},{"type":"conference_abstract","publication":"2nd Business Model Conference","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"5506","file_name":"BuMoCo2018_Teaching.pdf","file_size":966252,"date_created":"2018-11-12T13:24:39Z","creator":"dsz","date_updated":"2018-11-12T13:24:39Z"}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"_id":"2491","user_id":"477","department":[{"_id":"276"}],"ddc":["040"],"file_date_updated":"2018-11-12T13:24:39Z","language":[{"iso":"eng"}],"has_accepted_license":"1","year":"2018","citation":{"chicago":"Szopinski, Daniel. “How to Teach Business Model Innovation to 300+ Students: An Experience Report.” In <i>2nd Business Model Conference</i>, 2018.","ieee":"D. Szopinski, “How to teach business model innovation to 300+ students: An experience report,” in <i>2nd Business Model Conference</i>, Florence, Italy, 2018.","ama":"Szopinski D. How to teach business model innovation to 300+ students: An experience report. In: <i>2nd Business Model Conference</i>. ; 2018.","apa":"Szopinski, D. (2018). How to teach business model innovation to 300+ students: An experience report. In <i>2nd Business Model Conference</i>. Florence, Italy.","bibtex":"@inproceedings{Szopinski_2018, title={How to teach business model innovation to 300+ students: An experience report}, booktitle={2nd Business Model Conference}, author={Szopinski, Daniel}, year={2018} }","short":"D. Szopinski, in: 2nd Business Model Conference, 2018.","mla":"Szopinski, Daniel. “How to Teach Business Model Innovation to 300+ Students: An Experience Report.” <i>2nd Business Model Conference</i>, 2018."},"date_updated":"2022-01-06T06:56:41Z","date_created":"2018-04-25T13:22:19Z","author":[{"last_name":"Szopinski","full_name":"Szopinski, Daniel","id":"36372","first_name":"Daniel"}],"title":"How to teach business model innovation to 300+ students: An experience report","conference":{"name":"2nd Business Model Conference","start_date":"2018-06-06","end_date":"2018-06-07","location":"Florence, Italy"}},{"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"user_id":"16205","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C5","_id":"17"}],"_id":"2559","citation":{"bibtex":"@book{Arendt_2018, place={Universität Paderborn}, title={Datengetriebene Geschäftsmodelle: Ein Literaturüberblick}, author={Arendt, Lukas Sebastian}, year={2018} }","mla":"Arendt, Lukas Sebastian. <i>Datengetriebene Geschäftsmodelle: Ein Literaturüberblick</i>. 2018.","short":"L.S. Arendt, Datengetriebene Geschäftsmodelle: Ein Literaturüberblick, Universität Paderborn, 2018.","apa":"Arendt, L. S. (2018). <i>Datengetriebene Geschäftsmodelle: Ein Literaturüberblick</i>. Universität Paderborn.","ama":"Arendt LS. <i>Datengetriebene Geschäftsmodelle: Ein Literaturüberblick</i>. Universität Paderborn; 2018.","ieee":"L. S. Arendt, <i>Datengetriebene Geschäftsmodelle: Ein Literaturüberblick</i>. Universität Paderborn, 2018.","chicago":"Arendt, Lukas Sebastian. <i>Datengetriebene Geschäftsmodelle: Ein Literaturüberblick</i>. Universität Paderborn, 2018."},"year":"2018","place":"Universität Paderborn","title":"Datengetriebene Geschäftsmodelle: Ein Literaturüberblick","date_created":"2018-04-27T08:56:59Z","supervisor":[{"full_name":"Kundisch, Dennis","id":"21117","last_name":"Kundisch","first_name":"Dennis"}],"author":[{"full_name":"Arendt, Lukas Sebastian","last_name":"Arendt","first_name":"Lukas Sebastian"}],"date_updated":"2022-01-06T06:57:07Z"},{"has_accepted_license":"1","issue":"5","year":"2018","citation":{"apa":"Li, S., Markarian, C., &#38; Meyer auf der Heide, F. (2018). Towards Flexible Demands in Online Leasing Problems. . <i>Algorithmica</i>, <i>80</i>(5), 1556–1574. <a href=\"https://doi.org/10.1007/s00453-018-0420-y\">https://doi.org/10.1007/s00453-018-0420-y</a>","mla":"Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems. .” <i>Algorithmica</i>, vol. 80, no. 5, Springer, 2018, pp. 1556–1574, doi:<a href=\"https://doi.org/10.1007/s00453-018-0420-y\">10.1007/s00453-018-0420-y</a>.","short":"S. Li, C. Markarian, F. Meyer auf der Heide, Algorithmica 80 (2018) 1556–1574.","bibtex":"@article{Li_Markarian_Meyer auf der Heide_2018, title={Towards Flexible Demands in Online Leasing Problems. }, volume={80}, DOI={<a href=\"https://doi.org/10.1007/s00453-018-0420-y\">10.1007/s00453-018-0420-y</a>}, number={5}, journal={Algorithmica}, publisher={Springer}, author={Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2018}, pages={1556–1574} }","ieee":"S. Li, C. Markarian, and F. Meyer auf der Heide, “Towards Flexible Demands in Online Leasing Problems. ,” <i>Algorithmica</i>, vol. 80, no. 5, pp. 1556–1574, 2018.","chicago":"Li, Shouwei, Christine Markarian, and Friedhelm Meyer auf der Heide. “Towards Flexible Demands in Online Leasing Problems. .” <i>Algorithmica</i> 80, no. 5 (2018): 1556–1574. <a href=\"https://doi.org/10.1007/s00453-018-0420-y\">https://doi.org/10.1007/s00453-018-0420-y</a>.","ama":"Li S, Markarian C, Meyer auf der Heide F. Towards Flexible Demands in Online Leasing Problems. . <i>Algorithmica</i>. 2018;80(5):1556–1574. doi:<a href=\"https://doi.org/10.1007/s00453-018-0420-y\">10.1007/s00453-018-0420-y</a>"},"intvolume":"        80","page":"1556–1574","publisher":"Springer","date_updated":"2022-01-06T06:58:06Z","date_created":"2018-05-24T08:32:38Z","author":[{"first_name":"Shouwei","last_name":"Li","full_name":"Li, Shouwei"},{"first_name":"Christine","id":"37612","full_name":"Markarian, Christine","last_name":"Markarian"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"volume":80,"title":"Towards Flexible Demands in Online Leasing Problems. ","doi":"10.1007/s00453-018-0420-y","type":"journal_article","publication":"Algorithmica","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-02T15:18:16Z","creator":"ups","date_created":"2018-11-02T15:18:16Z","file_size":600583,"access_level":"closed","file_id":"5298","file_name":"TowardsFlexibleDemandsInOnline.pdf"}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"_id":"2848","user_id":"477","department":[{"_id":"63"}],"ddc":["000"],"file_date_updated":"2018-11-02T15:18:16Z","language":[{"iso":"eng"}]},{"file_date_updated":"2018-11-02T13:45:40Z","department":[{"_id":"7"},{"_id":"64"}],"user_id":"477","_id":"2862","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"status":"public","type":"conference","doi":"10.1007/978-3-319-76953-0_25","conference":{"location":"San Francisco, CA, USA","end_date":"2018-04-20","start_date":"2018-04-16","name":"Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA} Conference 2018"},"main_file_link":[{"url":"https://eprint.iacr.org/2018/029","open_access":"1"}],"author":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"},{"last_name":"Eidens","id":"25078","full_name":"Eidens, Fabian","first_name":"Fabian"},{"last_name":"Juhnke","full_name":"Juhnke, Jakob","id":"48090","first_name":"Jakob"}],"oa":"1","date_updated":"2022-01-06T06:58:12Z","page":"470-490","citation":{"apa":"Blömer, J., Eidens, F., &#38; Juhnke, J. (2018). Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems. In <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i> (pp. 470–490). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">https://doi.org/10.1007/978-3-319-76953-0_25</a>","bibtex":"@inproceedings{Blömer_Eidens_Juhnke_2018, place={Cham}, title={Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">10.1007/978-3-319-76953-0_25</a>}, booktitle={Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings}, publisher={Springer International Publishing}, author={Blömer, Johannes and Eidens, Fabian and Juhnke, Jakob}, year={2018}, pages={470–490} }","short":"J. Blömer, F. Eidens, J. Juhnke, in: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings, Springer International Publishing, Cham, 2018, pp. 470–490.","mla":"Blömer, Johannes, et al. “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems.” <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>, Springer International Publishing, 2018, pp. 470–90, doi:<a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">10.1007/978-3-319-76953-0_25</a>.","chicago":"Blömer, Johannes, Fabian Eidens, and Jakob Juhnke. “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems.” In <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>, 470–90. Cham: Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">https://doi.org/10.1007/978-3-319-76953-0_25</a>.","ieee":"J. Blömer, F. Eidens, and J. Juhnke, “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems,” in <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>, San Francisco, CA, USA, 2018, pp. 470–490.","ama":"Blömer J, Eidens F, Juhnke J. Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems. In: <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>. Cham: Springer International Publishing; 2018:470-490. doi:<a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">10.1007/978-3-319-76953-0_25</a>"},"place":"Cham","has_accepted_license":"1","publication_identifier":{"isbn":["9783319769523","9783319769530"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","language":[{"iso":"eng"}],"ddc":["004"],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"5253","access_level":"closed","file_name":"PracticalAnonymousAndPubliclyL.pdf","file_size":3371773,"date_created":"2018-11-02T13:45:40Z","creator":"ups","date_updated":"2018-11-02T13:45:40Z"}],"publication":"Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA} Conference 2018, Proceedings","title":"Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems","date_created":"2018-05-24T11:14:02Z","publisher":"Springer International Publishing","year":"2018"},{"title":"Distributed Placement of Virtualized Control Applications in Mobile Backhaul Networks","doi":" 10.1109/WCNC.2018.8377335","date_updated":"2022-01-06T06:56:33Z","publisher":"Proc. of IEEE Wireless Communications and Networking Conference (WCNC)","date_created":"2018-04-24T08:04:28Z","author":[{"full_name":"Auroux, Sébastien","last_name":"Auroux","first_name":"Sébastien"},{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"}],"year":"2018","citation":{"ama":"Auroux S, Karl H. Distributed Placement of Virtualized Control Applications in Mobile Backhaul Networks. In: Proc. of IEEE Wireless Communications and Networking Conference (WCNC); 2018. doi:<a href=\"https://doi.org/ 10.1109/WCNC.2018.8377335\"> 10.1109/WCNC.2018.8377335</a>","ieee":"S. Auroux and H. Karl, “Distributed Placement of Virtualized Control Applications in Mobile Backhaul Networks,” 2018.","chicago":"Auroux, Sébastien, and Holger Karl. “Distributed Placement of Virtualized Control Applications in Mobile Backhaul Networks.” Proc. of IEEE Wireless Communications and Networking Conference (WCNC), 2018. <a href=\"https://doi.org/ 10.1109/WCNC.2018.8377335\">https://doi.org/ 10.1109/WCNC.2018.8377335</a>.","apa":"Auroux, S., &#38; Karl, H. (2018). Distributed Placement of Virtualized Control Applications in Mobile Backhaul Networks. Proc. of IEEE Wireless Communications and Networking Conference (WCNC). <a href=\"https://doi.org/ 10.1109/WCNC.2018.8377335\">https://doi.org/ 10.1109/WCNC.2018.8377335</a>","mla":"Auroux, Sébastien, and Holger Karl. <i>Distributed Placement of Virtualized Control Applications in Mobile Backhaul Networks</i>. Proc. of IEEE Wireless Communications and Networking Conference (WCNC), 2018, doi:<a href=\"https://doi.org/ 10.1109/WCNC.2018.8377335\"> 10.1109/WCNC.2018.8377335</a>.","short":"S. Auroux, H. Karl, in: Proc. of IEEE Wireless Communications and Networking Conference (WCNC), 2018.","bibtex":"@inproceedings{Auroux_Karl_2018, title={Distributed Placement of Virtualized Control Applications in Mobile Backhaul Networks}, DOI={<a href=\"https://doi.org/ 10.1109/WCNC.2018.8377335\"> 10.1109/WCNC.2018.8377335</a>}, publisher={Proc. of IEEE Wireless Communications and Networking Conference (WCNC)}, author={Auroux, Sébastien and Karl, Holger}, year={2018} }"},"has_accepted_license":"1","ddc":["000"],"file_date_updated":"2018-04-24T08:04:02Z","_id":"2472","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"department":[{"_id":"75"}],"user_id":"126","status":"public","file":[{"date_created":"2018-04-24T08:04:02Z","creator":"tabu","date_updated":"2018-04-24T08:04:02Z","file_name":"p2262-auroux.pdf","access_level":"closed","file_id":"2473","file_size":371352,"content_type":"application/pdf","relation":"main_file","success":1}],"type":"conference"},{"file":[{"date_updated":"2018-12-03T15:20:56Z","date_created":"2018-12-03T15:20:56Z","creator":"abursig","file_size":278279,"file_id":"5989","access_level":"closed","file_name":"MKWI_113.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","type":"conference","publication":"Tagungsband Multikonferenz Wirtschaftsinformatik 2018 (MKWI)","ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-12-03T15:20:56Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"_id":"2681","user_id":"477","department":[{"_id":"276"}],"year":"2018","place":"Lüneburg","citation":{"apa":"Görzen, T., &#38; Laux, F. (2018). Extracting the Wisdom from the Crowd: A Comparison of Approaches to Aggregating Collective Intelligence. In <i>Tagungsband Multikonferenz Wirtschaftsinformatik 2018 (MKWI)</i>. Lüneburg.","mla":"Görzen, Thomas, and Florian Laux. “Extracting the Wisdom from the Crowd: A Comparison of Approaches to Aggregating Collective Intelligence.” <i>Tagungsband Multikonferenz Wirtschaftsinformatik 2018 (MKWI)</i>, 2018.","bibtex":"@inproceedings{Görzen_Laux_2018, place={Lüneburg}, title={Extracting the Wisdom from the Crowd: A Comparison of Approaches to Aggregating Collective Intelligence}, booktitle={Tagungsband Multikonferenz Wirtschaftsinformatik 2018 (MKWI)}, author={Görzen, Thomas and Laux, Florian}, year={2018} }","short":"T. Görzen, F. Laux, in: Tagungsband Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, 2018.","chicago":"Görzen, Thomas, and Florian Laux. “Extracting the Wisdom from the Crowd: A Comparison of Approaches to Aggregating Collective Intelligence.” In <i>Tagungsband Multikonferenz Wirtschaftsinformatik 2018 (MKWI)</i>. Lüneburg, 2018.","ieee":"T. Görzen and F. Laux, “Extracting the Wisdom from the Crowd: A Comparison of Approaches to Aggregating Collective Intelligence,” in <i>Tagungsband Multikonferenz Wirtschaftsinformatik 2018 (MKWI)</i>, Lüneburg, 2018.","ama":"Görzen T, Laux F. Extracting the Wisdom from the Crowd: A Comparison of Approaches to Aggregating Collective Intelligence. In: <i>Tagungsband Multikonferenz Wirtschaftsinformatik 2018 (MKWI)</i>. Lüneburg; 2018."},"publication_status":"published","has_accepted_license":"1","title":"Extracting the Wisdom from the Crowd: A Comparison of Approaches to Aggregating Collective Intelligence","conference":{"name":"Multikonferenz Wirtschaftsinformatik 2018 (MKWI)","location":"Lüneburg"},"date_updated":"2022-01-06T06:57:28Z","date_created":"2018-05-07T14:48:07Z","author":[{"first_name":"Thomas","last_name":"Görzen","id":"47700","full_name":"Görzen, Thomas"},{"last_name":"Laux","full_name":"Laux, Florian","first_name":"Florian"}]},{"ddc":["000"],"language":[{"iso":"eng"}],"publication":"SIAM Journal on Applied Algebra and Geometry.","file":[{"date_created":"2018-11-02T15:22:55Z","creator":"ups","date_updated":"2018-11-02T15:22:55Z","file_name":"17m1132045.pdf","file_id":"5300","access_level":"closed","file_size":1131048,"content_type":"application/pdf","relation":"main_file","success":1}],"date_created":"2018-05-08T09:18:54Z","title":"Voronoi Cells of Lattices with Respect to Arbitrary Norms","issue":"2","year":"2018","project":[{"name":"SFB 901 - Subproject C1","_id":"13"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"2685","user_id":"477","department":[{"_id":"7"},{"_id":"64"}],"file_date_updated":"2018-11-02T15:22:55Z","type":"journal_article","status":"public","date_updated":"2022-01-06T06:57:29Z","author":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"},{"last_name":"Kohn","full_name":"Kohn, Kathlén","first_name":"Kathlén"}],"volume":2,"doi":"10.1137/17M1132045","publication_status":"epub_ahead","publication_identifier":{"eissn":["2470-6566"]},"has_accepted_license":"1","citation":{"apa":"Blömer, J., &#38; Kohn, K. (2018). Voronoi Cells of Lattices with Respect to Arbitrary Norms. <i>SIAM Journal on Applied Algebra and Geometry.</i>, <i>2</i>(2), 314–338. <a href=\"https://doi.org/10.1137/17M1132045\">https://doi.org/10.1137/17M1132045</a>","short":"J. Blömer, K. Kohn, SIAM Journal on Applied Algebra and Geometry. 2 (2018) 314–338.","bibtex":"@article{Blömer_Kohn_2018, title={Voronoi Cells of Lattices with Respect to Arbitrary Norms}, volume={2}, DOI={<a href=\"https://doi.org/10.1137/17M1132045\">10.1137/17M1132045</a>}, number={2}, journal={SIAM Journal on Applied Algebra and Geometry.}, author={Blömer, Johannes and Kohn, Kathlén}, year={2018}, pages={314–338} }","mla":"Blömer, Johannes, and Kathlén Kohn. “Voronoi Cells of Lattices with Respect to Arbitrary Norms.” <i>SIAM Journal on Applied Algebra and Geometry.</i>, vol. 2, no. 2, 2018, pp. 314–38, doi:<a href=\"https://doi.org/10.1137/17M1132045\">10.1137/17M1132045</a>.","ieee":"J. Blömer and K. Kohn, “Voronoi Cells of Lattices with Respect to Arbitrary Norms,” <i>SIAM Journal on Applied Algebra and Geometry.</i>, vol. 2, no. 2, pp. 314–338, 2018.","chicago":"Blömer, Johannes, and Kathlén Kohn. “Voronoi Cells of Lattices with Respect to Arbitrary Norms.” <i>SIAM Journal on Applied Algebra and Geometry.</i> 2, no. 2 (2018): 314–38. <a href=\"https://doi.org/10.1137/17M1132045\">https://doi.org/10.1137/17M1132045</a>.","ama":"Blömer J, Kohn K. Voronoi Cells of Lattices with Respect to Arbitrary Norms. <i>SIAM Journal on Applied Algebra and Geometry</i>. 2018;2(2):314-338. doi:<a href=\"https://doi.org/10.1137/17M1132045\">10.1137/17M1132045</a>"},"intvolume":"         2","page":"314-338"},{"status":"public","type":"conference","file_date_updated":"2018-11-08T10:17:39Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"},{"_id":"44","name":"KogniHome - die mitdenkende Wohnung"}],"_id":"3265","user_id":"25078","department":[{"_id":"64"}],"place":"New York, NY, USA","citation":{"ama":"Bemmann K, Blömer J, Bobolz J, et al. Fully-Featured Anonymous Credentials with Reputation System. In: <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>. New York, NY, USA: ACM. doi:<a href=\"https://doi.org/10.1145/3230833.3234517\">10.1145/3230833.3234517</a>","chicago":"Bemmann, Kai, Johannes Blömer, Jan Bobolz, Henrik Bröcher, Denis Pascal Diemert, Fabian Eidens, Lukas Eilers, et al. “Fully-Featured Anonymous Credentials with Reputation System.” In <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>. New York, NY, USA: ACM, n.d. <a href=\"https://doi.org/10.1145/3230833.3234517\">https://doi.org/10.1145/3230833.3234517</a>.","ieee":"K. Bemmann <i>et al.</i>, “Fully-Featured Anonymous Credentials with Reputation System,” in <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>, Hamburg, Germany.","bibtex":"@inproceedings{Bemmann_Blömer_Bobolz_Bröcher_Diemert_Eidens_Eilers_Haltermann_Juhnke_Otour_et al., place={New York, NY, USA}, title={Fully-Featured Anonymous Credentials with Reputation System}, DOI={<a href=\"https://doi.org/10.1145/3230833.3234517\">10.1145/3230833.3234517</a>}, booktitle={Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18}, publisher={ACM}, author={Bemmann, Kai and Blömer, Johannes and Bobolz, Jan and Bröcher, Henrik and Diemert, Denis Pascal and Eidens, Fabian and Eilers, Lukas and Haltermann, Jan Frederik and Juhnke, Jakob and Otour, Burhan and et al.} }","mla":"Bemmann, Kai, et al. “Fully-Featured Anonymous Credentials with Reputation System.” <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>, ACM, doi:<a href=\"https://doi.org/10.1145/3230833.3234517\">10.1145/3230833.3234517</a>.","short":"K. Bemmann, J. Blömer, J. Bobolz, H. Bröcher, D.P. Diemert, F. Eidens, L. Eilers, J.F. Haltermann, J. Juhnke, B. Otour, L.A. Porzenheim, S. Pukrop, E. Schilling, M. Schlichtig, M. Stienemeier, in: Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18, ACM, New York, NY, USA, n.d.","apa":"Bemmann, K., Blömer, J., Bobolz, J., Bröcher, H., Diemert, D. P., Eidens, F., … Stienemeier, M. (n.d.). Fully-Featured Anonymous Credentials with Reputation System. In <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>. New York, NY, USA: ACM. <a href=\"https://doi.org/10.1145/3230833.3234517\">https://doi.org/10.1145/3230833.3234517</a>"},"publication_status":"accepted","has_accepted_license":"1","publication_identifier":{"isbn":["978-1-4503-6448-5"]},"related_material":{"link":[{"url":"https://github.com/upbcuk","relation":"software"}]},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2018/835"}],"conference":{"end_date":"2018-08-30","location":"Hamburg, Germany","name":"ARES 2018 - SECPID","start_date":"2018-08-27"},"doi":"10.1145/3230833.3234517","oa":"1","date_updated":"2022-01-06T06:59:07Z","author":[{"last_name":"Bemmann","full_name":"Bemmann, Kai","first_name":"Kai"},{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"},{"first_name":"Jan","full_name":"Bobolz, Jan","id":"27207","last_name":"Bobolz"},{"first_name":"Henrik","full_name":"Bröcher, Henrik","id":"41047","last_name":"Bröcher"},{"first_name":"Denis Pascal","last_name":"Diemert","id":"44071","full_name":"Diemert, Denis Pascal"},{"last_name":"Eidens","full_name":"Eidens, Fabian","id":"25078","first_name":"Fabian"},{"last_name":"Eilers","full_name":"Eilers, Lukas","first_name":"Lukas"},{"full_name":"Haltermann, Jan Frederik","id":"44413","last_name":"Haltermann","first_name":"Jan Frederik"},{"first_name":"Jakob","last_name":"Juhnke","id":"48090","full_name":"Juhnke, Jakob"},{"first_name":"Burhan","last_name":"Otour","full_name":"Otour, Burhan"},{"first_name":"Laurens Alexander","id":"47434","full_name":"Porzenheim, Laurens Alexander","last_name":"Porzenheim"},{"first_name":"Simon","full_name":"Pukrop, Simon","last_name":"Pukrop"},{"first_name":"Erik","last_name":"Schilling","full_name":"Schilling, Erik"},{"first_name":"Michael","id":"32312","full_name":"Schlichtig, Michael","last_name":"Schlichtig"},{"full_name":"Stienemeier, Marcel","last_name":"Stienemeier","first_name":"Marcel"}],"abstract":[{"lang":"eng","text":"We present CLARC (Cryptographic Library for Anonymous Reputation and Credentials), an anonymous credentials system (ACS) combined with an anonymous reputation system.\r\n\r\nUsing CLARC, users can receive attribute-based credentials from issuers. They can efficiently prove that their credentials satisfy complex (access) policies in a privacy-preserving way. This implements anonymous access control with complex policies.\r\n\r\nFurthermore, CLARC is the first ACS that is combined with an anonymous reputation system where users can anonymously rate services. A user who gets access to a service via a credential, also anonymously receives a review token to rate the service. If a user creates more than a single rating, this can be detected by anyone, preventing users from spamming ratings to sway public opinion.\r\n\r\nTo evaluate feasibility of our construction, we present an open-source prototype implementation."}],"file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2018-11-08T10:17:39Z","date_created":"2018-11-08T10:17:39Z","creator":"feidens","file_size":920843,"file_id":"5428","file_name":"react_acs.pdf","access_level":"closed"}],"publication":"Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES '18","ddc":["000"],"language":[{"iso":"eng"}],"year":"2018","quality_controlled":"1","title":"Fully-Featured Anonymous Credentials with Reputation System","publisher":"ACM","date_created":"2018-06-14T11:19:29Z"},{"place":"Montreal","citation":{"short":"M. Peuster, H. Küttner, H. Karl, in: 4th IEEE International Conference on Network Softwarization (NetSoft 2018), Montreal, n.d.","mla":"Peuster, Manuel, et al. “ Let the State Follow Its Flows: An SDN-Based Flow Handover Protocol to Support State Migration.” <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>, doi:<a href=\"https://doi.org/10.1109/NETSOFT.2018.8460007\">10.1109/NETSOFT.2018.8460007</a>.","bibtex":"@inproceedings{Peuster_Küttner_Karl, place={Montreal}, title={ Let the state follow its flows: An SDN-based flow handover protocol to support state migration}, DOI={<a href=\"https://doi.org/10.1109/NETSOFT.2018.8460007\">10.1109/NETSOFT.2018.8460007</a>}, booktitle={4th IEEE International Conference on Network Softwarization (NetSoft 2018)}, author={Peuster, Manuel and Küttner, Hannes and Karl, Holger} }","apa":"Peuster, M., Küttner, H., &#38; Karl, H. (n.d.).  Let the state follow its flows: An SDN-based flow handover protocol to support state migration. In <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>. Montreal. <a href=\"https://doi.org/10.1109/NETSOFT.2018.8460007\">https://doi.org/10.1109/NETSOFT.2018.8460007</a>","chicago":"Peuster, Manuel, Hannes Küttner, and Holger Karl. “ Let the State Follow Its Flows: An SDN-Based Flow Handover Protocol to Support State Migration.” In <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>. Montreal, n.d. <a href=\"https://doi.org/10.1109/NETSOFT.2018.8460007\">https://doi.org/10.1109/NETSOFT.2018.8460007</a>.","ieee":"M. Peuster, H. Küttner, and H. Karl, “ Let the state follow its flows: An SDN-based flow handover protocol to support state migration,” in <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>, Montreal.","ama":"Peuster M, Küttner H, Karl H.  Let the state follow its flows: An SDN-based flow handover protocol to support state migration. In: <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>. Montreal. doi:<a href=\"https://doi.org/10.1109/NETSOFT.2018.8460007\">10.1109/NETSOFT.2018.8460007</a>"},"has_accepted_license":"1","publication_status":"accepted","conference":{"start_date":"2018-06-25","name":"4th IEEE International Conference on Network Softwarization (NetSoft 2018)","location":"Montreal","end_date":"2018-06-29"},"doi":"10.1109/NETSOFT.2018.8460007","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/8460007/"}],"oa":"1","date_updated":"2022-01-06T06:59:11Z","author":[{"last_name":"Peuster","id":"13271","full_name":"Peuster, Manuel","first_name":"Manuel"},{"full_name":"Küttner, Hannes","last_name":"Küttner","first_name":"Hannes"},{"full_name":"Karl, Holger","id":"126","last_name":"Karl","first_name":"Holger"}],"urn":"33458","status":"public","type":"conference","file_date_updated":"2018-07-05T11:12:29Z","_id":"3345","project":[{"_id":"28","name":"5G Development and validation platform for global industry-specific network services and Apps","grant_number":"761493"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"department":[{"_id":"75"}],"user_id":"13271","year":"2018","title":" Let the state follow its flows: An SDN-based flow handover protocol to support state migration","date_created":"2018-06-25T12:21:49Z","abstract":[{"lang":"eng","text":"Dynamically steering flows through virtualized net- work function instances is a key enabler for elastic, on-demand deployments of virtualized network functions. This becomes par- ticular challenging when stateful functions are involved, necessi- tating state management. The problem with existing solutions is that they typically embrace state migration and flow rerouting jointly, imposing a huge set of requirements on the on-boarded VNFs, e.g., solution-specific state management interfaces.\r\nIn this paper, we introduce the seamless handover proto- col (SHarP). It provides an easy-to-use, loss-less, and order- preserving flow rerouting mechanism that is not fixed to a single state management approach. This allows VNF vendors to implement or use the state management solution of their choice. SHarP supports these solutions with additional information when flows are migrated. Further, we show how SHarP significantly reduces the buffer usage at a central (SDN) controller, which is a typical bottleneck in existing solutions. Our experiments show that SHarP uses a constant amount of controller buffer, irrespective of the time taken to migrate the VNF state."}],"file":[{"relation":"main_file","content_type":"application/pdf","file_size":901561,"file_id":"3428","file_name":"main_ris.pdf","access_level":"open_access","date_updated":"2018-07-05T11:12:29Z","creator":"peuster","date_created":"2018-07-05T11:11:37Z"}],"publication":"4th IEEE International Conference on Network Softwarization (NetSoft 2018)","ddc":["000"],"language":[{"iso":"eng"}]},{"file_date_updated":"2018-07-05T11:12:55Z","user_id":"13271","department":[{"_id":"75"}],"project":[{"grant_number":"761493","_id":"28","name":"5G Development and validation platform for global industry-specific network services and Apps"},{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"_id":"3346","status":"public","urn":"33467","type":"conference","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/8459905/"}],"doi":"10.1109/NETSOFT.2018.8459905","conference":{"name":"4th IEEE International Conference on Network Softwarization (NetSoft 2018)","start_date":"2018-06-25","end_date":"2018-06-29","location":"Montreal"},"author":[{"first_name":"Manuel","last_name":"Peuster","id":"13271","full_name":"Peuster, Manuel"},{"first_name":"Johannes ","full_name":"Kampmeyer, Johannes ","last_name":"Kampmeyer"},{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"}],"date_updated":"2022-01-06T06:59:11Z","oa":"1","citation":{"chicago":"Peuster, Manuel, Johannes  Kampmeyer, and Holger Karl. “Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains.” In <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>. Montreal, n.d. <a href=\"https://doi.org/10.1109/NETSOFT.2018.8459905\">https://doi.org/10.1109/NETSOFT.2018.8459905</a>.","ieee":"M. Peuster, J. Kampmeyer, and H. Karl, “Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains,” in <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>, Montreal.","ama":"Peuster M, Kampmeyer J, Karl H. Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains. In: <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>. Montreal. doi:<a href=\"https://doi.org/10.1109/NETSOFT.2018.8459905\">10.1109/NETSOFT.2018.8459905</a>","bibtex":"@inproceedings{Peuster_Kampmeyer_Karl, place={Montreal}, title={Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains}, DOI={<a href=\"https://doi.org/10.1109/NETSOFT.2018.8459905\">10.1109/NETSOFT.2018.8459905</a>}, booktitle={4th IEEE International Conference on Network Softwarization (NetSoft 2018)}, author={Peuster, Manuel and Kampmeyer, Johannes  and Karl, Holger} }","short":"M. Peuster, J. Kampmeyer, H. Karl, in: 4th IEEE International Conference on Network Softwarization (NetSoft 2018), Montreal, n.d.","mla":"Peuster, Manuel, et al. “Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains.” <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>, doi:<a href=\"https://doi.org/10.1109/NETSOFT.2018.8459905\">10.1109/NETSOFT.2018.8459905</a>.","apa":"Peuster, M., Kampmeyer, J., &#38; Karl, H. (n.d.). Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains. In <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>. Montreal. <a href=\"https://doi.org/10.1109/NETSOFT.2018.8459905\">https://doi.org/10.1109/NETSOFT.2018.8459905</a>"},"place":"Montreal","publication_status":"accepted","has_accepted_license":"1","language":[{"iso":"eng"}],"ddc":["000"],"file":[{"relation":"main_file","content_type":"application/pdf","file_size":449513,"file_name":"main_ris.pdf","file_id":"3429","access_level":"open_access","date_updated":"2018-07-05T11:12:55Z","creator":"peuster","date_created":"2018-07-05T11:12:55Z"}],"abstract":[{"lang":"eng","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."}],"publication":"4th IEEE International Conference on Network Softwarization (NetSoft 2018)","title":"Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains","date_created":"2018-06-25T12:24:19Z","year":"2018"},{"author":[{"last_name":"Peuster","id":"13271","full_name":"Peuster, Manuel","first_name":"Manuel"},{"first_name":"Michael","full_name":"Marchetti, Michael","last_name":"Marchetti"},{"first_name":"Gerado","full_name":"Garcia de Blas, Gerado","last_name":"Garcia de Blas"},{"last_name":"Karl","id":"126","full_name":"Karl, Holger","first_name":"Holger"}],"oa":"1","date_updated":"2022-01-06T06:59:12Z","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/8442701/"}],"conference":{"name":"European Conference on Networks and Communications (EuCNC)","location":"Ljubljana"},"doi":"10.1109/EuCNC.2018.8442701","publication_status":"accepted","has_accepted_license":"1","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>","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.","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>.","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>","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>.","short":"M. Peuster, M. Marchetti, G. Garcia de Blas, H. Karl, in: European Conference on Networks and Communications (EuCNC), Ljubljana, n.d."},"place":"Ljubljana","user_id":"13271","department":[{"_id":"75"}],"project":[{"grant_number":"761493","name":"5G Development and validation platform for global industry-specific network services and Apps","_id":"28"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"_id":"3347","file_date_updated":"2018-07-05T11:13:29Z","type":"conference","status":"public","urn":"33477","date_created":"2018-06-25T12:27:59Z","title":"Emulation-based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments","year":"2018","language":[{"iso":"eng"}],"ddc":["000"],"publication":"European Conference on Networks and Communications (EuCNC)","file":[{"relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_name":"main_ris.pdf","file_id":"3430","file_size":713495,"date_created":"2018-07-05T11:13:29Z","creator":"peuster","date_updated":"2018-07-05T11:13:29Z"}],"abstract":[{"lang":"eng","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."}]},{"abstract":[{"lang":"eng","text":"Profiling applications on a heterogeneous compute node is challenging since the way to retrieve data from the resources and interpret them varies between resource types and manufacturers. This holds especially true for measuring the energy consumption. In this paper we present Ampehre, a novel open source measurement framework that allows developers to gather comparable measurements from heterogeneous compute nodes, e.g., nodes comprising CPU, GPU, and FPGA. We explain the architecture of Ampehre and detail the measurement process on the example of energy measurements on CPU and GPU. To characterize the probing effect, we quantitatively analyze the trade-off between the accuracy of measurements and the CPU load imposed by Ampehre. Based on this analysis, we are able to specify reasonable combinations of sampling periods for the different resource types of a compute node."}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":1114026,"access_level":"closed","file_id":"3363","file_name":"loesch2017_arcs.pdf","date_updated":"2018-06-26T13:58:28Z","date_created":"2018-06-26T13:58:28Z","creator":"aloesch"}],"publication":"Proceedings of the International Conference on Architecture of Computing Systems (ARCS)","ddc":["040"],"year":"2018","title":"Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes","publisher":"Springer International Publishing","date_created":"2018-06-26T13:47:52Z","status":"public","type":"conference","file_date_updated":"2018-06-26T13:58:28Z","project":[{"_id":"14","name":"SFB 901 - Subproject C2"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901","_id":"1"}],"_id":"3362","series_title":"Lecture Notes in Computer Science","user_id":"477","department":[{"_id":"78"}],"place":"Cham","citation":{"ieee":"A. Lösch, A. Wiens, and M. Platzner, “Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes,” in <i>Proceedings of the International Conference on Architecture of Computing Systems (ARCS)</i>, 2018, vol. 10793, pp. 73–84.","chicago":"Lösch, Achim, Alex Wiens, and Marco Platzner. “Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes.” In <i>Proceedings of the International Conference on Architecture of Computing Systems (ARCS)</i>, 10793:73–84. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-319-77610-1_6\">https://doi.org/10.1007/978-3-319-77610-1_6</a>.","ama":"Lösch A, Wiens A, Platzner M. Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes. In: <i>Proceedings of the International Conference on Architecture of Computing Systems (ARCS)</i>. Vol 10793. Lecture Notes in Computer Science. Cham: Springer International Publishing; 2018:73-84. doi:<a href=\"https://doi.org/10.1007/978-3-319-77610-1_6\">10.1007/978-3-319-77610-1_6</a>","mla":"Lösch, Achim, et al. “Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes.” <i>Proceedings of the International Conference on Architecture of Computing Systems (ARCS)</i>, vol. 10793, Springer International Publishing, 2018, pp. 73–84, doi:<a href=\"https://doi.org/10.1007/978-3-319-77610-1_6\">10.1007/978-3-319-77610-1_6</a>.","bibtex":"@inproceedings{Lösch_Wiens_Platzner_2018, place={Cham}, series={Lecture Notes in Computer Science}, title={Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes}, volume={10793}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-77610-1_6\">10.1007/978-3-319-77610-1_6</a>}, booktitle={Proceedings of the International Conference on Architecture of Computing Systems (ARCS)}, publisher={Springer International Publishing}, author={Lösch, Achim and Wiens, Alex and Platzner, Marco}, year={2018}, pages={73–84}, collection={Lecture Notes in Computer Science} }","short":"A. Lösch, A. Wiens, M. Platzner, in: Proceedings of the International Conference on Architecture of Computing Systems (ARCS), Springer International Publishing, Cham, 2018, pp. 73–84.","apa":"Lösch, A., Wiens, A., &#38; Platzner, M. (2018). Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes. In <i>Proceedings of the International Conference on Architecture of Computing Systems (ARCS)</i> (Vol. 10793, pp. 73–84). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-77610-1_6\">https://doi.org/10.1007/978-3-319-77610-1_6</a>"},"page":"73-84","intvolume":"     10793","publication_status":"published","publication_identifier":{"isbn":["9783319776095","9783319776101"],"issn":["0302-9743","1611-3349"]},"has_accepted_license":"1","doi":"10.1007/978-3-319-77610-1_6","date_updated":"2022-01-06T06:59:13Z","author":[{"first_name":"Achim","last_name":"Lösch","full_name":"Lösch, Achim","id":"43646"},{"last_name":"Wiens","full_name":"Wiens, Alex","first_name":"Alex"},{"first_name":"Marco","full_name":"Platzner, Marco","id":"398","last_name":"Platzner"}],"volume":10793}]