[{"doi":"10.23919/FPL.2017.8056844","author":[{"first_name":"Tobias","last_name":"Kenter","full_name":"Kenter, Tobias","id":"3145"},{"orcid":"0000-0001-7059-9862","last_name":"Förstner","id":"158","full_name":"Förstner, Jens","first_name":"Jens"},{"first_name":"Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","id":"16153","full_name":"Plessl, Christian"}],"date_updated":"2023-09-26T13:24:38Z","citation":{"apa":"Kenter, T., Förstner, J., &#38; Plessl, C. (2017). Flexible FPGA design for FDTD using OpenCL. <i>Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)</i>. <a href=\"https://doi.org/10.23919/FPL.2017.8056844\">https://doi.org/10.23919/FPL.2017.8056844</a>","short":"T. Kenter, J. Förstner, C. Plessl, in: Proc. Int. Conf. on Field Programmable Logic and Applications (FPL), IEEE, 2017.","mla":"Kenter, Tobias, et al. “Flexible FPGA Design for FDTD Using OpenCL.” <i>Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)</i>, IEEE, 2017, doi:<a href=\"https://doi.org/10.23919/FPL.2017.8056844\">10.23919/FPL.2017.8056844</a>.","bibtex":"@inproceedings{Kenter_Förstner_Plessl_2017, title={Flexible FPGA design for FDTD using OpenCL}, DOI={<a href=\"https://doi.org/10.23919/FPL.2017.8056844\">10.23919/FPL.2017.8056844</a>}, booktitle={Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)}, publisher={IEEE}, author={Kenter, Tobias and Förstner, Jens and Plessl, Christian}, year={2017} }","ama":"Kenter T, Förstner J, Plessl C. Flexible FPGA design for FDTD using OpenCL. In: <i>Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)</i>. IEEE; 2017. doi:<a href=\"https://doi.org/10.23919/FPL.2017.8056844\">10.23919/FPL.2017.8056844</a>","chicago":"Kenter, Tobias, Jens Förstner, and Christian Plessl. “Flexible FPGA Design for FDTD Using OpenCL.” In <i>Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)</i>. IEEE, 2017. <a href=\"https://doi.org/10.23919/FPL.2017.8056844\">https://doi.org/10.23919/FPL.2017.8056844</a>.","ieee":"T. Kenter, J. Förstner, and C. Plessl, “Flexible FPGA design for FDTD using OpenCL,” 2017, doi: <a href=\"https://doi.org/10.23919/FPL.2017.8056844\">10.23919/FPL.2017.8056844</a>."},"has_accepted_license":"1","file_date_updated":"2018-11-02T15:02:28Z","department":[{"_id":"27"},{"_id":"518"},{"_id":"61"}],"user_id":"15278","_id":"1592","project":[{"_id":"1","name":"SFB 901","grant_number":"160364472"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C2","_id":"14","grant_number":"160364472"},{"_id":"33","name":"HighPerMeshes","grant_number":"01|H16005A"},{"grant_number":"PL 595/2-1 / 320898746","name":"Performance and Efficiency in HPC with Custom Computing","_id":"32"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"status":"public","type":"conference","title":"Flexible FPGA design for FDTD using OpenCL","date_created":"2018-03-22T11:10:23Z","publisher":"IEEE","year":"2017","quality_controlled":"1","language":[{"iso":"eng"}],"keyword":["tet_topic_hpc"],"ddc":["000"],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"5291","file_name":"08056844.pdf","file_size":230235,"creator":"ups","date_created":"2018-11-02T15:02:28Z","date_updated":"2018-11-02T15:02:28Z"}],"abstract":[{"lang":"eng","text":"Compared to classical HDL designs, generating FPGA with high-level synthesis from an OpenCL specification promises easier exploration of different design alternatives and, through ready-to-use infrastructure and common abstractions for host and memory interfaces, easier portability between different FPGA families. In this work, we evaluate the extent of this promise. To this end, we present a parameterized FDTD implementation for photonic microcavity simulations. Our design can trade-off different forms of parallelism and works for two independent OpenCL-based FPGA design flows. Hence, we can target FPGAs from different vendors and different FPGA families. We describe how we used pre-processor macros to achieve this flexibility and to work around different shortcomings of the current tools. Choosing the right design configurations, we are able to present two extremely competitive solutions for very different FPGA targets, reaching up to 172 GFLOPS sustained performance. With the portability and flexibility demonstrated, code developers not only avoid vendor lock-in, but can even make best use of real trade-offs between different architectures."}],"publication":"Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)"},{"status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":1024328,"file_id":"5534","access_level":"closed","file_name":"MarketSurvey_Techreport (1).pdf","date_updated":"2018-11-12T19:11:20Z","date_created":"2018-11-12T19:11:20Z","creator":"bahareh"}],"type":"report","ddc":["040"],"file_date_updated":"2018-11-12T19:11:20Z","language":[{"iso":"eng"}],"_id":"198","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C5","_id":"17"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"276"},{"_id":"66"},{"_id":"76"}],"user_id":"477","year":"2016","citation":{"ama":"Jazayeri B, Platenius MC, Engels G, Kundisch D. <i>Features of IT Service Markets: A Systematic Literature Review (Supplementary Material)</i>. Universität Paderborn; 2016.","chicago":"Jazayeri, Bahar, Marie Christin Platenius, Gregor Engels, and Dennis Kundisch. <i>Features of IT Service Markets: A Systematic Literature Review (Supplementary Material)</i>. Universität Paderborn, 2016.","ieee":"B. Jazayeri, M. C. Platenius, G. Engels, and D. Kundisch, <i>Features of IT Service Markets: A Systematic Literature Review (Supplementary Material)</i>. Universität Paderborn, 2016.","bibtex":"@book{Jazayeri_Platenius_Engels_Kundisch_2016, title={Features of IT Service Markets: A Systematic Literature Review (Supplementary Material)}, publisher={Universität Paderborn}, author={Jazayeri, Bahar and Platenius, Marie Christin and Engels, Gregor and Kundisch, Dennis}, year={2016} }","mla":"Jazayeri, Bahar, et al. <i>Features of IT Service Markets: A Systematic Literature Review (Supplementary Material)</i>. Universität Paderborn, 2016.","short":"B. Jazayeri, M.C. Platenius, G. Engels, D. Kundisch, Features of IT Service Markets: A Systematic Literature Review (Supplementary Material), Universität Paderborn, 2016.","apa":"Jazayeri, B., Platenius, M. C., Engels, G., &#38; Kundisch, D. (2016). <i>Features of IT Service Markets: A Systematic Literature Review (Supplementary Material)</i>. Universität Paderborn."},"has_accepted_license":"1","title":"Features of IT Service Markets: A Systematic Literature Review (Supplementary Material)","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:54:13Z","date_created":"2017-10-17T12:41:30Z","author":[{"first_name":"Bahar","id":"36399","full_name":"Jazayeri, Bahar","last_name":"Jazayeri"},{"last_name":"Platenius","full_name":"Platenius, Marie Christin","first_name":"Marie Christin"},{"id":"107","full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor"},{"first_name":"Dennis","id":"21117","full_name":"Kundisch, Dennis","last_name":"Kundisch"}]},{"abstract":[{"text":"The provision of IT solutions over electronic marketplaces became prominent in recent years. We call such marketplaces IT service markets. IT service markets have some core architectural building blocks that impact the quality attributes of these markets. However, these building blocks and their impacts are not well-known. Thus, design choices for IT service markets have been made ad-hoc until now. Furthermore, only single aspects of such markets have been investigated until now, but a comprehensive view is missing.In this paper, we identify common features and their interrelations on the basis of a systematic literature review of 60 publications using grounded theory.This knowledge provides an empirical evidence on the interdisciplinary design choices of IT service markets and it serves as a basis to support market providers and developers to integrate market features. Thereby, we make a first step towards the creation of a reference model for IT service markets that provides a holistic integrated view that can be used to create and maintain successful markets in the future.","lang":"eng"}],"file":[{"creator":"florida","date_created":"2018-03-21T12:15:24Z","date_updated":"2018-03-21T12:15:24Z","file_id":"1526","access_level":"closed","file_name":"199-chp_3A10.1007_2F978-3-319-46295-0_19.pdf","file_size":765410,"content_type":"application/pdf","relation":"main_file","success":1}],"publication":"Proceedings of the 14th International Conference on Service Oriented Computing (ICSOC)","ddc":["040"],"language":[{"iso":"eng"}],"year":"2016","title":"Features of IT Service Markets: A Systematic Literature Review","publisher":"Springer","date_created":"2017-10-17T12:41:30Z","status":"public","type":"conference","file_date_updated":"2018-03-21T12:15:24Z","_id":"199","project":[{"name":"SFB 901","_id":"1"},{"_id":"17","name":"SFB 901 - Subprojekt C5"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"66"},{"_id":"276"},{"_id":"76"}],"user_id":"477","series_title":"Lecture Notes in Computer Science (LNCS)","place":"Banff, Canada","page":"301-316","intvolume":"      9936","citation":{"apa":"Jazayeri, B., Platenius, M., Engels, G., &#38; Kundisch, D. (2016). Features of IT Service Markets: A Systematic Literature Review. In <i>Proceedings of the 14th International Conference on Service Oriented Computing (ICSOC)</i> (Vol. 9936, pp. 301–316). Banff, Canada: Springer. <a href=\"https://doi.org/10.1007/978-3-319-46295-0_19\">https://doi.org/10.1007/978-3-319-46295-0_19</a>","bibtex":"@inproceedings{Jazayeri_Platenius_Engels_Kundisch_2016, place={Banff, Canada}, series={Lecture Notes in Computer Science (LNCS)}, title={Features of IT Service Markets: A Systematic Literature Review}, volume={9936}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-46295-0_19\">10.1007/978-3-319-46295-0_19</a>}, booktitle={Proceedings of the 14th International Conference on Service Oriented Computing (ICSOC)}, publisher={Springer}, author={Jazayeri, Bahar and Platenius, Marie and Engels, Gregor and Kundisch, Dennis}, year={2016}, pages={301–316}, collection={Lecture Notes in Computer Science (LNCS)} }","short":"B. Jazayeri, M. Platenius, G. Engels, D. Kundisch, in: Proceedings of the 14th International Conference on Service Oriented Computing (ICSOC), Springer, Banff, Canada, 2016, pp. 301–316.","mla":"Jazayeri, Bahar, et al. “Features of IT Service Markets: A Systematic Literature Review.” <i>Proceedings of the 14th International Conference on Service Oriented Computing (ICSOC)</i>, vol. 9936, Springer, 2016, pp. 301–16, doi:<a href=\"https://doi.org/10.1007/978-3-319-46295-0_19\">10.1007/978-3-319-46295-0_19</a>.","ama":"Jazayeri B, Platenius M, Engels G, Kundisch D. Features of IT Service Markets: A Systematic Literature Review. In: <i>Proceedings of the 14th International Conference on Service Oriented Computing (ICSOC)</i>. Vol 9936. Lecture Notes in Computer Science (LNCS). Banff, Canada: Springer; 2016:301-316. doi:<a href=\"https://doi.org/10.1007/978-3-319-46295-0_19\">10.1007/978-3-319-46295-0_19</a>","ieee":"B. Jazayeri, M. Platenius, G. Engels, and D. Kundisch, “Features of IT Service Markets: A Systematic Literature Review,” in <i>Proceedings of the 14th International Conference on Service Oriented Computing (ICSOC)</i>, 2016, vol. 9936, pp. 301–316.","chicago":"Jazayeri, Bahar, Marie Platenius, Gregor Engels, and Dennis Kundisch. “Features of IT Service Markets: A Systematic Literature Review.” In <i>Proceedings of the 14th International Conference on Service Oriented Computing (ICSOC)</i>, 9936:301–16. Lecture Notes in Computer Science (LNCS). Banff, Canada: Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-46295-0_19\">https://doi.org/10.1007/978-3-319-46295-0_19</a>."},"has_accepted_license":"1","doi":"10.1007/978-3-319-46295-0_19","date_updated":"2022-01-06T06:54:14Z","volume":9936,"author":[{"full_name":"Jazayeri, Bahar","id":"36399","last_name":"Jazayeri","first_name":"Bahar"},{"last_name":"Platenius","full_name":"Platenius, Marie","first_name":"Marie"},{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor","id":"107"},{"last_name":"Kundisch","full_name":"Kundisch, Dennis","id":"21117","first_name":"Dennis"}]},{"title":"Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes","date_updated":"2022-01-06T06:54:53Z","publisher":"Universität Paderborn","supervisor":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"}],"date_created":"2017-10-17T12:41:33Z","author":[{"first_name":"Laurens","full_name":"Porzenheim, Laurens","last_name":"Porzenheim"}],"year":"2016","citation":{"chicago":"Porzenheim, Laurens. <i>Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes</i>. Universität Paderborn, 2016.","ieee":"L. Porzenheim, <i>Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes</i>. Universität Paderborn, 2016.","ama":"Porzenheim L. <i>Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes</i>. Universität Paderborn; 2016.","apa":"Porzenheim, L. (2016). <i>Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes</i>. Universität Paderborn.","bibtex":"@book{Porzenheim_2016, title={Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes}, publisher={Universität Paderborn}, author={Porzenheim, Laurens}, year={2016} }","short":"L. Porzenheim, Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes, Universität Paderborn, 2016.","mla":"Porzenheim, Laurens. <i>Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes</i>. Universität Paderborn, 2016."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"213","user_id":"477","department":[{"_id":"64"}],"status":"public","type":"bachelorsthesis"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"214","user_id":"477","department":[{"_id":"64"}],"type":"bachelorsthesis","status":"public","date_updated":"2022-01-06T06:54:58Z","publisher":"Universität Paderborn","author":[{"full_name":"Bemmann, Kai Sören","last_name":"Bemmann","first_name":"Kai Sören"}],"date_created":"2017-10-17T12:41:33Z","supervisor":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"}],"title":"Commitment Schemes - Definitions, Variants, and Security","year":"2016","citation":{"ama":"Bemmann KS. <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn; 2016.","ieee":"K. S. Bemmann, <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn, 2016.","chicago":"Bemmann, Kai Sören. <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn, 2016.","bibtex":"@book{Bemmann_2016, title={Commitment Schemes - Definitions, Variants, and Security}, publisher={Universität Paderborn}, author={Bemmann, Kai Sören}, year={2016} }","mla":"Bemmann, Kai Sören. <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn, 2016.","short":"K.S. Bemmann, Commitment Schemes - Definitions, Variants, and Security, Universität Paderborn, 2016.","apa":"Bemmann, K. S. (2016). <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn."}},{"abstract":[{"lang":"eng","text":"We present three robust overlay networks: First, we present a network that organizes the nodes into an expander and is resistant to even massive adversarial churn. Second, we develop a network based on the hypercube that maintains connectivity under adversarial DoS-attacks. For the DoS-attacks we use the notion of a Omega(log log n)-late adversary which only has access to topological information that is at least Omega(log log n) rounds old. Finally, we develop a network that combines both churn- and DoS-resistance. The networks gain their robustness through constant network reconfiguration, i.e., the topology of the networks changes constantly. Our reconguration algorithms are based on node sampling primitives for expanders and hypercubes that allow each node to sample a logarithmic number of nodes uniformly at random in O(log log n) communication rounds. These primitives are specific to overlay networks and their optimal runtime represents an exponential improvement over known techniques. Our results have a wide range of applications, for example in the area of scalable and robust peer-to-peer systems."}],"status":"public","file":[{"date_updated":"2018-03-21T10:41:40Z","date_created":"2018-03-21T10:41:40Z","creator":"florida","file_size":352996,"file_name":"215-SPAA16-Drees_Gmyr_Scheideler.pdf","access_level":"closed","file_id":"1518","content_type":"application/pdf","success":1,"relation":"main_file"}],"publication":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","type":"conference","ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-21T10:41:40Z","_id":"215","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","year":"2016","page":"417--427","citation":{"apa":"Drees, M., Gmyr, R., &#38; Scheideler, C. (2016). Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 417--427). <a href=\"https://doi.org/10.1145/2935764.2935783\">https://doi.org/10.1145/2935764.2935783</a>","short":"M. Drees, R. Gmyr, C. Scheideler, in: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.","bibtex":"@inproceedings{Drees_Gmyr_Scheideler_2016, title={Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration}, DOI={<a href=\"https://doi.org/10.1145/2935764.2935783\">10.1145/2935764.2935783</a>}, booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Drees, Maximilian and Gmyr, Robert and Scheideler, Christian}, year={2016}, pages={417--427} }","mla":"Drees, Maximilian, et al. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.” <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2016, pp. 417--427, doi:<a href=\"https://doi.org/10.1145/2935764.2935783\">10.1145/2935764.2935783</a>.","ieee":"M. Drees, R. Gmyr, and C. Scheideler, “Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration,” in <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2016, pp. 417--427.","chicago":"Drees, Maximilian, Robert Gmyr, and Christian Scheideler. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.” In <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 417--427, 2016. <a href=\"https://doi.org/10.1145/2935764.2935783\">https://doi.org/10.1145/2935764.2935783</a>.","ama":"Drees M, Gmyr R, Scheideler C. Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In: <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2016:417--427. doi:<a href=\"https://doi.org/10.1145/2935764.2935783\">10.1145/2935764.2935783</a>"},"has_accepted_license":"1","title":"Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration","doi":"10.1145/2935764.2935783","date_updated":"2022-01-06T06:55:02Z","date_created":"2017-10-17T12:41:33Z","author":[{"last_name":"Drees","full_name":"Drees, Maximilian","first_name":"Maximilian"},{"full_name":"Gmyr, Robert","last_name":"Gmyr","first_name":"Robert"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}]},{"has_accepted_license":"1","page":"578--592","citation":{"apa":"Mäcker, A., Malatyali, M., Meyer auf der Heide, F., &#38; Riechers, S. (2016). Cost-efficient Scheduling on Machines from the Cloud. In <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i> (pp. 578--592). <a href=\"https://doi.org/10.1007/978-3-319-48749-6_42\">https://doi.org/10.1007/978-3-319-48749-6_42</a>","bibtex":"@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2016, title={Cost-efficient Scheduling on Machines from the Cloud}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-48749-6_42\">10.1007/978-3-319-48749-6_42</a>}, booktitle={Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2016}, pages={578--592} }","mla":"Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.” <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 578--592, doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_42\">10.1007/978-3-319-48749-6_42</a>.","short":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 578--592.","ama":"Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Cost-efficient Scheduling on Machines from the Cloud. In: <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>. ; 2016:578--592. doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_42\">10.1007/978-3-319-48749-6_42</a>","chicago":"Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” In <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 578--592, 2016. <a href=\"https://doi.org/10.1007/978-3-319-48749-6_42\">https://doi.org/10.1007/978-3-319-48749-6_42</a>.","ieee":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient Scheduling on Machines from the Cloud,” in <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 578--592."},"year":"2016","date_created":"2017-10-17T12:41:32Z","author":[{"id":"13536","full_name":"Mäcker, Alexander","last_name":"Mäcker","first_name":"Alexander"},{"full_name":"Malatyali, Manuel","last_name":"Malatyali","first_name":"Manuel"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Sören","full_name":"Riechers, Sören","last_name":"Riechers"}],"date_updated":"2022-01-06T06:54:33Z","doi":"10.1007/978-3-319-48749-6_42","title":"Cost-efficient Scheduling on Machines from the Cloud","publication":"Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","type":"conference","status":"public","file":[{"access_level":"closed","file_name":"Cost-EfficientSchedulingOnMach.pdf","file_id":"5268","file_size":608614,"date_created":"2018-11-02T14:18:51Z","creator":"ups","date_updated":"2018-11-02T14:18:51Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"We consider a scheduling problem where machines need to be rented from the cloud in order to process jobs. There are two types of machines available which can be rented for machine-type dependent prices and for arbitrary durations. However, a machine-type dependent setup time is required before a machine is available for processing. Jobs arrive online over time, have machine-type dependent sizes and have individual deadlines. The objective is to rent machines and schedule jobs so as to meet all deadlines while minimizing the rental cost. Since we observe the slack of jobs to have a fundamental influence on the competitiveness, we study the model when instances are parameterized by their (minimum) slack. An instance is called to have a slack of $\\beta$ if, for all jobs, the difference between the job's release time and the latest point in time at which it needs to be started is at least $\\beta$. While for $\\beta series = {LNCS}"}],"department":[{"_id":"63"}],"user_id":"477","_id":"207","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"4","name":"SFB 901 - Project Area C"}],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T14:18:51Z","ddc":["000"]},{"department":[{"_id":"64"}],"user_id":"477","series_title":"LNCS","_id":"208","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"file_date_updated":"2018-03-21T10:43:36Z","ddc":["040"],"publication":"Proceedings of the CT-RSA 2016","type":"conference","status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-21T10:43:36Z","date_updated":"2018-03-21T10:43:36Z","access_level":"closed","file_id":"1521","file_name":"208-aCCA_P-KEM_final.pdf","file_size":462666}],"abstract":[{"text":"This paper presents a new framework for constructing fully CCA-secure predicate encryption schemes from pair encoding schemes. Our construction is the first in the context of predicate encryption which uses the technique of well-formedness proofs known from public key encryption. The resulting constructions are simpler and more efficient compared to the schemes achieved using known generic transformations from CPA-secure to CCA-secure schemes. The reduction costs of our framework are comparable to the reduction costs of the underlying CPA-secure framework. We achieve this last result by applying the dual system encryption methodology in a novel way.","lang":"eng"}],"date_created":"2017-10-17T12:41:32Z","author":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"},{"full_name":"Liske, Gennadij","last_name":"Liske","first_name":"Gennadij"}],"date_updated":"2022-01-06T06:54:39Z","doi":"10.1007/978-3-319-29485-8_25","title":"Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes","has_accepted_license":"1","page":"431-447","citation":{"mla":"Blömer, Johannes, and Gennadij Liske. “Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes.” <i>Proceedings of the CT-RSA 2016</i>, 2016, pp. 431–47, doi:<a href=\"https://doi.org/10.1007/978-3-319-29485-8_25\">10.1007/978-3-319-29485-8_25</a>.","bibtex":"@inproceedings{Blömer_Liske_2016, series={LNCS}, title={Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-29485-8_25\">10.1007/978-3-319-29485-8_25</a>}, booktitle={Proceedings of the CT-RSA 2016}, author={Blömer, Johannes and Liske, Gennadij}, year={2016}, pages={431–447}, collection={LNCS} }","short":"J. Blömer, G. Liske, in: Proceedings of the CT-RSA 2016, 2016, pp. 431–447.","apa":"Blömer, J., &#38; Liske, G. (2016). Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes. In <i>Proceedings of the CT-RSA 2016</i> (pp. 431–447). <a href=\"https://doi.org/10.1007/978-3-319-29485-8_25\">https://doi.org/10.1007/978-3-319-29485-8_25</a>","ama":"Blömer J, Liske G. Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes. In: <i>Proceedings of the CT-RSA 2016</i>. LNCS. ; 2016:431-447. doi:<a href=\"https://doi.org/10.1007/978-3-319-29485-8_25\">10.1007/978-3-319-29485-8_25</a>","chicago":"Blömer, Johannes, and Gennadij Liske. “Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes.” In <i>Proceedings of the CT-RSA 2016</i>, 431–47. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-29485-8_25\">https://doi.org/10.1007/978-3-319-29485-8_25</a>.","ieee":"J. Blömer and G. Liske, “Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes,” in <i>Proceedings of the CT-RSA 2016</i>, 2016, pp. 431–447."},"year":"2016"},{"abstract":[{"lang":"eng","text":"We consider the problem of aggregation in overlay networks. We use a synchronous time model in which each node has polylogarithmic memory and can send at most a polylogarithmic number of messages per round. We investigate how to quickly compute the result of an aggregate functionf over elements that are distributed among the nodes of the network such that the result is eventually known by a selected root node. We show how to compute distributive aggregate functions such as SUM, MAX, and OR in time $O(\\log n / \\log\\log n)$ using a tree that is created in a pre-processing phase. If only a polylogarithmic number of data items need to be aggregated, we show how to compute the result in time $O(\\sqrt{\\log n / \\log\\log n})$. Furthermore, we show how to compute holistic aggregate functions such as DISTINCT, SMALLEST(k) and MODE(k) in time $O(\\log n / \\log\\log n)$. Finally, we show a lower bound of $\\Omega(\\sqrt{\\log n / \\log\\log n})$ for deterministic algorithms that compute any of the aggregate functions in the scope of the thesis."}],"status":"public","file":[{"file_size":1127144,"file_id":"1510","file_name":"223-MasterarbeitHinnenthal.pdf","access_level":"closed","date_updated":"2018-03-21T10:35:39Z","date_created":"2018-03-21T10:35:39Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"type":"mastersthesis","ddc":["040"],"file_date_updated":"2018-03-21T10:35:39Z","language":[{"iso":"eng"}],"_id":"223","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"79"}],"user_id":"15504","year":"2016","citation":{"apa":"Hinnenthal, K. (2016). <i>Aggregation in Overlay Networks</i>. Universität Paderborn.","bibtex":"@book{Hinnenthal_2016, title={Aggregation in Overlay Networks}, publisher={Universität Paderborn}, author={Hinnenthal, Kristian}, year={2016} }","short":"K. Hinnenthal, Aggregation in Overlay Networks, Universität Paderborn, 2016.","mla":"Hinnenthal, Kristian. <i>Aggregation in Overlay Networks</i>. Universität Paderborn, 2016.","ama":"Hinnenthal K. <i>Aggregation in Overlay Networks</i>. Universität Paderborn; 2016.","chicago":"Hinnenthal, Kristian. <i>Aggregation in Overlay Networks</i>. Universität Paderborn, 2016.","ieee":"K. Hinnenthal, <i>Aggregation in Overlay Networks</i>. Universität Paderborn, 2016."},"has_accepted_license":"1","title":"Aggregation in Overlay Networks","date_updated":"2022-01-06T06:55:30Z","publisher":"Universität Paderborn","supervisor":[{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"author":[{"first_name":"Kristian","id":"32229","full_name":"Hinnenthal, Kristian","last_name":"Hinnenthal"}],"date_created":"2017-10-17T12:41:35Z"},{"year":"2016","title":"Architectural Management of On-The-Fly Computing Markets","publisher":"ACM","date_created":"2017-10-17T12:41:34Z","abstract":[{"text":"Existing software markets like Google Play allow users to search among available Apps and select one based on the description provided for the App or based on its rating. Future software markets facilitate on-the-fly composition of such Apps based on users’ individual wishes. Realizing such On-The-Fly Computing (OTF) markets requires support of sophisticated software features. In addition, suitable orchestration among such features needs to ensure well-alignment of business and IT aspects in case of run-time changes like market dynamics. However, all these introduce new architectural and management complexities, which are specific to such markets. An architecture framework for OTF markets will include design solutions to overcome these complexities. In my PhD, I aim at identifying an architecture framework for OTF markets including main architectural building blocks and a systematic development process. Such an architecture framework enables the development of OTF markets in the future. Furthermore, this knowledge can be used as a basis to improve existing software markets by integrating missing functionalities.","lang":"eng"}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":169229,"file_name":"219-a42-jazayeri.pdf","access_level":"closed","file_id":"1514","date_updated":"2018-03-21T10:38:17Z","date_created":"2018-03-21T10:38:17Z","creator":"florida"}],"publication":"Proceedings of the 10th European Conference on Software Architecture (ECSA Workshops)","ddc":["040"],"language":[{"iso":"eng"}],"place":"Copenhagen, Denmark","page":"42","citation":{"ama":"Jazayeri B. Architectural Management of On-The-Fly Computing Markets. In: <i>Proceedings of the 10th European Conference on Software Architecture (ECSA Workshops)</i>. Copenhagen, Denmark: ACM; 2016:42. doi:<a href=\"https://doi.org/10.1145/2993412.3010821\">10.1145/2993412.3010821</a>","chicago":"Jazayeri, Bahar. “Architectural Management of On-The-Fly Computing Markets.” In <i>Proceedings of the 10th European Conference on Software Architecture (ECSA Workshops)</i>, 42. Copenhagen, Denmark: ACM, 2016. <a href=\"https://doi.org/10.1145/2993412.3010821\">https://doi.org/10.1145/2993412.3010821</a>.","ieee":"B. Jazayeri, “Architectural Management of On-The-Fly Computing Markets,” in <i>Proceedings of the 10th European Conference on Software Architecture (ECSA Workshops)</i>, 2016, p. 42.","apa":"Jazayeri, B. (2016). Architectural Management of On-The-Fly Computing Markets. In <i>Proceedings of the 10th European Conference on Software Architecture (ECSA Workshops)</i> (p. 42). Copenhagen, Denmark: ACM. <a href=\"https://doi.org/10.1145/2993412.3010821\">https://doi.org/10.1145/2993412.3010821</a>","mla":"Jazayeri, Bahar. “Architectural Management of On-The-Fly Computing Markets.” <i>Proceedings of the 10th European Conference on Software Architecture (ECSA Workshops)</i>, ACM, 2016, p. 42, doi:<a href=\"https://doi.org/10.1145/2993412.3010821\">10.1145/2993412.3010821</a>.","bibtex":"@inproceedings{Jazayeri_2016, place={Copenhagen, Denmark}, title={Architectural Management of On-The-Fly Computing Markets}, DOI={<a href=\"https://doi.org/10.1145/2993412.3010821\">10.1145/2993412.3010821</a>}, booktitle={Proceedings of the 10th European Conference on Software Architecture (ECSA Workshops)}, publisher={ACM}, author={Jazayeri, Bahar}, year={2016}, pages={42} }","short":"B. Jazayeri, in: Proceedings of the 10th European Conference on Software Architecture (ECSA Workshops), ACM, Copenhagen, Denmark, 2016, p. 42."},"has_accepted_license":"1","doi":"10.1145/2993412.3010821","date_updated":"2022-01-06T06:55:19Z","author":[{"first_name":"Bahar","id":"36399","full_name":"Jazayeri, Bahar","last_name":"Jazayeri"}],"status":"public","type":"conference","file_date_updated":"2018-03-21T10:38:17Z","_id":"219","project":[{"_id":"1","name":"SFB 901"},{"_id":"17","name":"SFB 901 - Subprojekt C5"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"66"}],"user_id":"36399"},{"type":"dissertation","file":[{"date_created":"2018-03-21T10:37:11Z","creator":"florida","date_updated":"2018-03-21T10:37:11Z","access_level":"closed","file_name":"220-Keller_PhD-Theses_01.pdf","file_id":"1513","file_size":7467820,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"220","user_id":"477","department":[{"_id":"75"}],"ddc":["040"],"file_date_updated":"2018-03-21T10:37:11Z","has_accepted_license":"1","year":"2016","citation":{"chicago":"Keller, Matthias. <i>Application Deployment at Distributed Clouds</i>. Universität Paderborn, 2016.","ieee":"M. Keller, <i>Application Deployment at Distributed Clouds</i>. Universität Paderborn, 2016.","ama":"Keller M. <i>Application Deployment at Distributed Clouds</i>. Universität Paderborn; 2016.","short":"M. Keller, Application Deployment at Distributed Clouds, Universität Paderborn, 2016.","bibtex":"@book{Keller_2016, title={Application Deployment at Distributed Clouds}, publisher={Universität Paderborn}, author={Keller, Matthias}, year={2016} }","mla":"Keller, Matthias. <i>Application Deployment at Distributed Clouds</i>. Universität Paderborn, 2016.","apa":"Keller, M. (2016). <i>Application Deployment at Distributed Clouds</i>. Universität Paderborn."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:55:22Z","date_created":"2017-10-17T12:41:34Z","supervisor":[{"last_name":"Karl","id":"126","full_name":"Karl, Holger","first_name":"Holger"}],"author":[{"first_name":"Matthias","full_name":"Keller, Matthias","last_name":"Keller"}],"title":"Application Deployment at Distributed Clouds"},{"has_accepted_license":"1","year":"2016","citation":{"ieee":"P. Wette and H. Karl, “DCT<sup>2</sup>Gen: A traffic generator for data centers,” <i>Computer Communications</i>, pp. 45--58, 2016.","chicago":"Wette, Philip, and Holger Karl. “DCT<sup>2</sup>Gen: A Traffic Generator for Data Centers.” <i>Computer Communications</i>, 2016, 45--58. <a href=\"https://doi.org/10.1016/j.comcom.2015.12.001\">https://doi.org/10.1016/j.comcom.2015.12.001</a>.","ama":"Wette P, Karl H. DCT<sup>2</sup>Gen: A traffic generator for data centers. <i>Computer Communications</i>. 2016:45--58. doi:<a href=\"https://doi.org/10.1016/j.comcom.2015.12.001\">10.1016/j.comcom.2015.12.001</a>","mla":"Wette, Philip, and Holger Karl. “DCT<sup>2</sup>Gen: A Traffic Generator for Data Centers.” <i>Computer Communications</i>, 2016, pp. 45--58, doi:<a href=\"https://doi.org/10.1016/j.comcom.2015.12.001\">10.1016/j.comcom.2015.12.001</a>.","bibtex":"@article{Wette_Karl_2016, title={DCT<sup>2</sup>Gen: A traffic generator for data centers}, DOI={<a href=\"https://doi.org/10.1016/j.comcom.2015.12.001\">10.1016/j.comcom.2015.12.001</a>}, journal={Computer Communications}, author={Wette, Philip and Karl, Holger}, year={2016}, pages={45--58} }","short":"P. Wette, H. Karl, Computer Communications (2016) 45--58.","apa":"Wette, P., &#38; Karl, H. (2016). DCT<sup>2</sup>Gen: A traffic generator for data centers. <i>Computer Communications</i>, 45--58. <a href=\"https://doi.org/10.1016/j.comcom.2015.12.001\">https://doi.org/10.1016/j.comcom.2015.12.001</a>"},"page":"45--58","date_updated":"2022-01-06T07:03:31Z","author":[{"first_name":"Philip","last_name":"Wette","full_name":"Wette, Philip"},{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"}],"date_created":"2017-11-27T10:22:25Z","title":"DCT²Gen: A traffic generator for data centers","doi":"10.1016/j.comcom.2015.12.001","type":"journal_article","publication":"Computer Communications","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"ups","date_created":"2018-11-02T15:59:29Z","date_updated":"2018-11-02T15:59:29Z","access_level":"closed","file_name":"WetteKarl.pdf","file_id":"5319","file_size":1671431}],"status":"public","project":[{"name":"SFB 901 - Subproject C4","_id":"16"},{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"726","user_id":"477","department":[{"_id":"75"}],"ddc":["000"],"file_date_updated":"2018-11-02T15:59:29Z","language":[{"iso":"eng"}]},{"title":"Understand Your Chains: Towards Performance Profile-Based Network Service Management","date_created":"2017-11-27T10:22:25Z","year":"2016","ddc":["000"],"language":[{"iso":"eng"}],"abstract":[{"text":"Allocating resources to virtualized network functions and services to meet service level agreements is a challenging task for NFV management and orchestration systems. This becomes even more challenging when agile development methodologies, like DevOps, are applied. In such scenarios, management and orchestration systems are continuously facing new versions of functions and services which makes it hard to decide how much resources have to be allocated to them to provide the expected service performance. \r\nOne solution for this problem is to support resource allocation decisions with performance behavior information obtained by profiling techniques applied to such network functions and services.\r\n\r\nIn this position paper, we analyze and discuss the components needed to generate such performance behavior information within the NFV DevOps workflow. We also outline research questions that identify open issues and missing pieces for a fully integrated NFV profiling solution. Further, we introduce a novel profiling mechanism that is able to profile virtualized network functions and entire network service chains under different resource constraints before they are deployed on production infrastructure.","lang":"eng"}],"file":[{"relation":"main_file","content_type":"application/pdf","file_name":"main_ris.pdf","access_level":"open_access","file_id":"3353","file_size":966702,"creator":"peuster","date_created":"2018-06-25T13:10:10Z","date_updated":"2018-06-25T13:16:56Z"}],"publication":"Fifth European Workshop on Software-Defined Networks, EWSDN 2016, Den Haag, The Netherlands, October 10-11, 2016","doi":"10.1109/EWSDN.2016.9","conference":{"name":"Fifth European Workshop on Software-Defined Networks (EWSDN","location":"Den Haag"},"main_file_link":[{"url":"http://ieeexplore.ieee.org/document/7956044/"}],"oa":"1","date_updated":"2022-01-06T07:03:33Z","author":[{"last_name":"Peuster","id":"13271","full_name":"Peuster, Manuel","first_name":"Manuel"},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"}],"page":"7--12","citation":{"mla":"Peuster, Manuel, and Holger Karl. “Understand Your Chains: Towards Performance Profile-Based Network Service Management.” <i>Fifth European Workshop on Software-Defined Networks, EWSDN 2016, Den Haag, The Netherlands, October 10-11, 2016</i>, 2016, pp. 7--12, doi:<a href=\"https://doi.org/10.1109/EWSDN.2016.9\">10.1109/EWSDN.2016.9</a>.","bibtex":"@inproceedings{Peuster_Karl_2016, title={Understand Your Chains: Towards Performance Profile-Based Network Service Management}, DOI={<a href=\"https://doi.org/10.1109/EWSDN.2016.9\">10.1109/EWSDN.2016.9</a>}, booktitle={Fifth European Workshop on Software-Defined Networks, EWSDN 2016, Den Haag, The Netherlands, October 10-11, 2016}, author={Peuster, Manuel and Karl, Holger}, year={2016}, pages={7--12} }","short":"M. Peuster, H. Karl, in: Fifth European Workshop on Software-Defined Networks, EWSDN 2016, Den Haag, The Netherlands, October 10-11, 2016, 2016, pp. 7--12.","apa":"Peuster, M., &#38; Karl, H. (2016). Understand Your Chains: Towards Performance Profile-Based Network Service Management. In <i>Fifth European Workshop on Software-Defined Networks, EWSDN 2016, Den Haag, The Netherlands, October 10-11, 2016</i> (pp. 7--12). Den Haag. <a href=\"https://doi.org/10.1109/EWSDN.2016.9\">https://doi.org/10.1109/EWSDN.2016.9</a>","ama":"Peuster M, Karl H. Understand Your Chains: Towards Performance Profile-Based Network Service Management. In: <i>Fifth European Workshop on Software-Defined Networks, EWSDN 2016, Den Haag, The Netherlands, October 10-11, 2016</i>. ; 2016:7--12. doi:<a href=\"https://doi.org/10.1109/EWSDN.2016.9\">10.1109/EWSDN.2016.9</a>","ieee":"M. Peuster and H. Karl, “Understand Your Chains: Towards Performance Profile-Based Network Service Management,” in <i>Fifth European Workshop on Software-Defined Networks, EWSDN 2016, Den Haag, The Netherlands, October 10-11, 2016</i>, Den Haag, 2016, pp. 7--12.","chicago":"Peuster, Manuel, and Holger Karl. “Understand Your Chains: Towards Performance Profile-Based Network Service Management.” In <i>Fifth European Workshop on Software-Defined Networks, EWSDN 2016, Den Haag, The Netherlands, October 10-11, 2016</i>, 7--12, 2016. <a href=\"https://doi.org/10.1109/EWSDN.2016.9\">https://doi.org/10.1109/EWSDN.2016.9</a>."},"has_accepted_license":"1","publication_status":"published","file_date_updated":"2018-06-25T13:16:56Z","_id":"730","project":[{"call_identifier":"5G PPP Phase 1","grant_number":"671517","_id":"25","name":"SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks"},{"_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":"13271","urn":"7309","status":"public","type":"conference"},{"type":"conference","status":"public","project":[{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"_id":"731","user_id":"477","department":[{"_id":"75"}],"file_date_updated":"2018-11-02T14:11:50Z","publication_status":"published","has_accepted_license":"1","citation":{"mla":"Peuster, Manuel, et al. “Demonstrating On-Demand Cell Switching with a Two-Layer Mobile Network Testbed.” <i>IEEE Conference on Computer Communications Workshops, INFOCOM Workshops 2016, San Francisco, CA, USA, April 10-14, 2016</i>, 2016, pp. 1015--1016, doi:<a href=\"https://doi.org/10.1109/INFCOMW.2016.7562232\">10.1109/INFCOMW.2016.7562232</a>.","short":"M. Peuster, H. Karl, A. Enrico Redondi, A. Capone, in: IEEE Conference on Computer Communications Workshops, INFOCOM Workshops 2016, San Francisco, CA, USA, April 10-14, 2016, 2016, pp. 1015--1016.","bibtex":"@inproceedings{Peuster_Karl_Enrico Redondi_Capone_2016, title={Demonstrating on-demand cell switching with a two-layer mobile network testbed}, DOI={<a href=\"https://doi.org/10.1109/INFCOMW.2016.7562232\">10.1109/INFCOMW.2016.7562232</a>}, booktitle={IEEE Conference on Computer Communications Workshops, INFOCOM Workshops 2016, San Francisco, CA, USA, April 10-14, 2016}, author={Peuster, Manuel and Karl, Holger and Enrico Redondi, Alessandro and Capone, Antonio}, year={2016}, pages={1015--1016} }","apa":"Peuster, M., Karl, H., Enrico Redondi, A., &#38; Capone, A. (2016). Demonstrating on-demand cell switching with a two-layer mobile network testbed. In <i>IEEE Conference on Computer Communications Workshops, INFOCOM Workshops 2016, San Francisco, CA, USA, April 10-14, 2016</i> (pp. 1015--1016). San Francisco. <a href=\"https://doi.org/10.1109/INFCOMW.2016.7562232\">https://doi.org/10.1109/INFCOMW.2016.7562232</a>","chicago":"Peuster, Manuel, Holger Karl, Alessandro Enrico Redondi, and Antonio Capone. “Demonstrating On-Demand Cell Switching with a Two-Layer Mobile Network Testbed.” In <i>IEEE Conference on Computer Communications Workshops, INFOCOM Workshops 2016, San Francisco, CA, USA, April 10-14, 2016</i>, 1015--1016, 2016. <a href=\"https://doi.org/10.1109/INFCOMW.2016.7562232\">https://doi.org/10.1109/INFCOMW.2016.7562232</a>.","ieee":"M. Peuster, H. Karl, A. Enrico Redondi, and A. Capone, “Demonstrating on-demand cell switching with a two-layer mobile network testbed,” in <i>IEEE Conference on Computer Communications Workshops, INFOCOM Workshops 2016, San Francisco, CA, USA, April 10-14, 2016</i>, San Francisco, 2016, pp. 1015--1016.","ama":"Peuster M, Karl H, Enrico Redondi A, Capone A. Demonstrating on-demand cell switching with a two-layer mobile network testbed. In: <i>IEEE Conference on Computer Communications Workshops, INFOCOM Workshops 2016, San Francisco, CA, USA, April 10-14, 2016</i>. ; 2016:1015--1016. doi:<a href=\"https://doi.org/10.1109/INFCOMW.2016.7562232\">10.1109/INFCOMW.2016.7562232</a>"},"page":"1015--1016","date_updated":"2022-01-06T07:03:34Z","author":[{"id":"13271","full_name":"Peuster, Manuel","last_name":"Peuster","first_name":"Manuel"},{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"},{"first_name":"Alessandro","full_name":"Enrico Redondi, Alessandro","last_name":"Enrico Redondi"},{"first_name":"Antonio","full_name":"Capone, Antonio","last_name":"Capone"}],"main_file_link":[{"url":"http://ieeexplore.ieee.org/document/7562232/"}],"conference":{"location":"San Francisco","name":"IEEE Conference on Computer Communications Workshops, INFOCOM"},"doi":"10.1109/INFCOMW.2016.7562232","publication":"IEEE Conference on Computer Communications Workshops, INFOCOM Workshops 2016, San Francisco, CA, USA, April 10-14, 2016","abstract":[{"lang":"eng","text":"Traditional cellular networks are forced to remain active regardless of the actual amount of traffic that is currently produced/requested, with a clear waste of energy. Two-layer mobile networks with separated signalling and data layers have been recently proposed for energy savings in future implementations. These networks are able to switch off unneeded data cells completely while maintaining full coverage with their signalling cells, thus saving energy. In this demonstration, we showcase a testbed that uses Wi-Fi access points to emulate small cells of the data layer and a publicly available cellular connection as the signalling layer. We use off-the-shelf Android smartphones with an ad-hoc networking management module and a MultiPath TCP-enabled kernel to manage the Wi-Fi and cellular interfaces simultaneously.\r\nThe testbed is used to demonstrate the general feasibility of this layered architecture and to facilitate experiments with network-wide resource optimization. "}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-02T14:11:50Z","date_created":"2018-11-02T14:11:50Z","creator":"ups","file_size":2080026,"file_name":"07562232.pdf","access_level":"closed","file_id":"5264"}],"ddc":["000"],"language":[{"iso":"eng"}],"year":"2016","date_created":"2017-11-27T10:22:25Z","title":"Demonstrating on-demand cell switching with a two-layer mobile network testbed"},{"has_accepted_license":"1","publication_status":"published","citation":{"ama":"Peuster M, Karl H, van Rossem S. MeDICINE: Rapid Prototyping of Production-Ready Network Services in Multi-PoP Environments. In: <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)</i>. ; 2016. doi:<a href=\"https://doi.org/10.1109/NFV-SDN.2016.7919490\">10.1109/NFV-SDN.2016.7919490</a>","chicago":"Peuster, Manuel, Holger Karl, and Steven van Rossem. “MeDICINE: Rapid Prototyping of Production-Ready Network Services in Multi-PoP Environments.” In <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)</i>, 2016. <a href=\"https://doi.org/10.1109/NFV-SDN.2016.7919490\">https://doi.org/10.1109/NFV-SDN.2016.7919490</a>.","ieee":"M. Peuster, H. Karl, and S. van Rossem, “MeDICINE: Rapid Prototyping of Production-Ready Network Services in Multi-PoP Environments,” in <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)</i>, Palo Alto, 2016.","apa":"Peuster, M., Karl, H., &#38; van Rossem, S. (2016). MeDICINE: Rapid Prototyping of Production-Ready Network Services in Multi-PoP Environments. In <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)</i>. Palo Alto. <a href=\"https://doi.org/10.1109/NFV-SDN.2016.7919490\">https://doi.org/10.1109/NFV-SDN.2016.7919490</a>","bibtex":"@inproceedings{Peuster_Karl_van Rossem_2016, title={MeDICINE: Rapid Prototyping of Production-Ready Network Services in Multi-PoP Environments}, DOI={<a href=\"https://doi.org/10.1109/NFV-SDN.2016.7919490\">10.1109/NFV-SDN.2016.7919490</a>}, booktitle={IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)}, author={Peuster, Manuel and Karl, Holger and van Rossem, Steven}, year={2016} }","short":"M. Peuster, H. Karl, S. van Rossem, in: IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN), 2016.","mla":"Peuster, Manuel, et al. “MeDICINE: Rapid Prototyping of Production-Ready Network Services in Multi-PoP Environments.” <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)</i>, 2016, doi:<a href=\"https://doi.org/10.1109/NFV-SDN.2016.7919490\">10.1109/NFV-SDN.2016.7919490</a>."},"oa":"1","date_updated":"2022-01-06T07:03:36Z","author":[{"id":"13271","full_name":"Peuster, Manuel","last_name":"Peuster","first_name":"Manuel"},{"full_name":"Karl, Holger","id":"126","last_name":"Karl","first_name":"Holger"},{"full_name":"van Rossem, Steven","last_name":"van Rossem","first_name":"Steven"}],"conference":{"name":"IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)","location":"Palo Alto"},"doi":"10.1109/NFV-SDN.2016.7919490","main_file_link":[{"url":"https://arxiv.org/pdf/1606.05995.pdf"}],"type":"conference","urn":"7384","status":"public","_id":"738","project":[{"_id":"25","name":"SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks","grant_number":"671517","call_identifier":"5G PPP Phase 1"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"department":[{"_id":"75"}],"user_id":"13271","file_date_updated":"2018-06-25T13:17:34Z","year":"2016","date_created":"2017-11-27T10:22:25Z","title":"MeDICINE: Rapid Prototyping of Production-Ready Network Services in Multi-PoP Environments","publication":"IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)","abstract":[{"text":"Virtualized network services consisting of multiple individual network functions are already today deployed across multiple sites, so called multi-PoP (points of presence) environments. This allows to improve service performance by optimizing its placement in the network. But prototyping and testing of these complex distributed software systems becomes extremely challenging. The reason is that not only the network service as such has to be tested but also its integration with management and orchestration systems. Existing solutions, like simulators, basic network emulators, or local cloud testbeds, do not support all aspects of these tasks.\r\n\r\nTo this end, we introduce MeDICINE, a novel NFV prototyping platform that is able to execute production-ready network functions, provided as software containers, in an emulated multi-PoP environment. These network functions can be controlled by any third-party management and orchestration system that connects to our platform through standard interfaces. Based on this, a developer can use our platform to prototype and test complex network services in a realistic environment running on his laptop.\r\n","lang":"eng"}],"file":[{"file_size":848438,"file_name":"main_ris.pdf","file_id":"3349","access_level":"open_access","date_updated":"2018-06-25T13:17:34Z","creator":"peuster","date_created":"2018-06-25T13:06:47Z","relation":"main_file","content_type":"application/pdf"}],"ddc":["000"],"language":[{"iso":"eng"}]},{"title":"Sicherheit von hybriden FPGA-Systemen in der industriellen Automatisierungstechnik -- Anforderungen und Umsetzung","author":[{"full_name":"Tölke, Christian","last_name":"Tölke","first_name":"Christian"}],"supervisor":[{"id":"16153","full_name":"Plessl, Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","first_name":"Christian"}],"date_created":"2018-11-07T16:10:00Z","date_updated":"2022-01-06T07:01:52Z","publisher":"Universität Paderborn","citation":{"bibtex":"@book{Tölke_2016, title={Sicherheit von hybriden FPGA-Systemen in der industriellen Automatisierungstechnik -- Anforderungen und Umsetzung}, publisher={Universität Paderborn}, author={Tölke, Christian}, year={2016} }","short":"C. Tölke, Sicherheit von Hybriden FPGA-Systemen in Der Industriellen Automatisierungstechnik -- Anforderungen Und Umsetzung, Universität Paderborn, 2016.","mla":"Tölke, Christian. <i>Sicherheit von Hybriden FPGA-Systemen in Der Industriellen Automatisierungstechnik -- Anforderungen Und Umsetzung</i>. Universität Paderborn, 2016.","apa":"Tölke, C. (2016). <i>Sicherheit von hybriden FPGA-Systemen in der industriellen Automatisierungstechnik -- Anforderungen und Umsetzung</i>. Universität Paderborn.","ama":"Tölke C. <i>Sicherheit von Hybriden FPGA-Systemen in Der Industriellen Automatisierungstechnik -- Anforderungen Und Umsetzung</i>. Universität Paderborn; 2016.","ieee":"C. Tölke, <i>Sicherheit von hybriden FPGA-Systemen in der industriellen Automatisierungstechnik -- Anforderungen und Umsetzung</i>. Universität Paderborn, 2016.","chicago":"Tölke, Christian. <i>Sicherheit von Hybriden FPGA-Systemen in Der Industriellen Automatisierungstechnik -- Anforderungen Und Umsetzung</i>. Universität Paderborn, 2016."},"year":"2016","language":[{"iso":"eng"}],"department":[{"_id":"27"},{"_id":"518"}],"user_id":"477","_id":"5418","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"14","name":"SFB 901 - Subproject C2"}],"status":"public","type":"mastersthesis"},{"supervisor":[{"last_name":"Plessl","orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian","id":"16153","first_name":"Christian"}],"date_created":"2018-11-07T16:15:51Z","author":[{"last_name":"Wüllrich","full_name":"Wüllrich, Gunnar","first_name":"Gunnar"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:53Z","title":"Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment","citation":{"ama":"Wüllrich G. <i>Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment</i>. Universität Paderborn; 2016.","ieee":"G. Wüllrich, <i>Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment</i>. Universität Paderborn, 2016.","chicago":"Wüllrich, Gunnar. <i>Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment</i>. Universität Paderborn, 2016.","apa":"Wüllrich, G. (2016). <i>Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment</i>. Universität Paderborn.","short":"G. Wüllrich, Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment, Universität Paderborn, 2016.","mla":"Wüllrich, Gunnar. <i>Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment</i>. Universität Paderborn, 2016.","bibtex":"@book{Wüllrich_2016, title={Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment}, publisher={Universität Paderborn}, author={Wüllrich, Gunnar}, year={2016} }"},"year":"2016","department":[{"_id":"27"},{"_id":"518"}],"user_id":"477","_id":"5420","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C2","_id":"14"}],"language":[{"iso":"eng"}],"type":"mastersthesis","status":"public"},{"year":"2016","citation":{"chicago":"Dräxler, Sevil, and Holger Karl. “Placement of Services with Flexible Structures Specified by a YANG Data Model.” In <i>Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)</i>, 184--192, 2016. <a href=\"https://doi.org/10.1109/NETSOFT.2016.7502412\">https://doi.org/10.1109/NETSOFT.2016.7502412</a>.","ieee":"S. Dräxler and H. Karl, “Placement of Services with Flexible Structures Specified by a YANG Data Model,” in <i>Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)</i>, 2016, pp. 184--192.","ama":"Dräxler S, Karl H. Placement of Services with Flexible Structures Specified by a YANG Data Model. In: <i>Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)</i>. ; 2016:184--192. doi:<a href=\"https://doi.org/10.1109/NETSOFT.2016.7502412\">10.1109/NETSOFT.2016.7502412</a>","apa":"Dräxler, S., &#38; Karl, H. (2016). Placement of Services with Flexible Structures Specified by a YANG Data Model. In <i>Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)</i> (pp. 184--192). <a href=\"https://doi.org/10.1109/NETSOFT.2016.7502412\">https://doi.org/10.1109/NETSOFT.2016.7502412</a>","bibtex":"@inproceedings{Dräxler_Karl_2016, title={Placement of Services with Flexible Structures Specified by a YANG Data Model}, DOI={<a href=\"https://doi.org/10.1109/NETSOFT.2016.7502412\">10.1109/NETSOFT.2016.7502412</a>}, booktitle={Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)}, author={Dräxler, Sevil and Karl, Holger}, year={2016}, pages={184--192} }","mla":"Dräxler, Sevil, and Holger Karl. “Placement of Services with Flexible Structures Specified by a YANG Data Model.” <i>Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)</i>, 2016, pp. 184--192, doi:<a href=\"https://doi.org/10.1109/NETSOFT.2016.7502412\">10.1109/NETSOFT.2016.7502412</a>.","short":"S. Dräxler, H. Karl, in: Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft), 2016, pp. 184--192."},"page":"184--192","has_accepted_license":"1","title":"Placement of Services with Flexible Structures Specified by a YANG Data Model","main_file_link":[{"url":"http://ieeexplore.ieee.org/search/searchresult.jsp?newsearch=true&queryText=10.1109%2FNETSOFT.2016.7502412"}],"doi":"10.1109/NETSOFT.2016.7502412","date_updated":"2022-01-06T06:52:53Z","oa":"1","date_created":"2017-10-17T12:41:24Z","author":[{"first_name":"Sevil","id":"31764","full_name":"Dräxler, Sevil","last_name":"Dräxler"},{"first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger","id":"126"}],"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 present a YANG model for describing the service structure in deployment requests in a flexible way that enables changing the order of functions in case the order of traversing them does not affect the functionality of the service. Upon receiving such requests, the network orchestration system can choose the optimal composition of service components that gives the best results for placement of services in the network. This introduces new complexities to the placement problem by greatly increasing the number of possible ways a service can be composed. In this paper, we describe a heuristic solution that selects a Pareto set of the possible compositions of a service as well as possible combinations of different services, with respect to different resource requirements of the services. Our evaluations show that the selected combinations consist of representative samples of possible structures and requirements and therefore, can result in optimal or close-to-optimal placement results."}],"urn":"1665","file":[{"relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_name":"RIS.pdf","file_id":"3322","file_size":1471937,"creator":"sevilmeh","date_created":"2018-06-25T07:53:54Z","date_updated":"2018-06-25T07:53:54Z"}],"status":"public","type":"conference","publication":"Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)","ddc":["040"],"file_date_updated":"2018-06-25T07:53:54Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"_id":"4","name":"SFB 901 - Project Area C"},{"grant_number":"671517","_id":"25","name":"SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks","call_identifier":"5G PPP Phase 1"}],"_id":"166","user_id":"31764","department":[{"_id":"75"}]},{"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:52:54Z","supervisor":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"}],"date_created":"2017-10-17T12:41:24Z","author":[{"full_name":"Günther, Peter","last_name":"Günther","first_name":"Peter"}],"title":"Physical attacks on pairing-based cryptography","main_file_link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-24853"}],"has_accepted_license":"1","year":"2016","citation":{"apa":"Günther, P. (2016). <i>Physical attacks on pairing-based cryptography</i>. Universität Paderborn.","short":"P. Günther, Physical Attacks on Pairing-Based Cryptography, Universität Paderborn, 2016.","mla":"Günther, Peter. <i>Physical Attacks on Pairing-Based Cryptography</i>. Universität Paderborn, 2016.","bibtex":"@book{Günther_2016, title={Physical attacks on pairing-based cryptography}, publisher={Universität Paderborn}, author={Günther, Peter}, year={2016} }","ama":"Günther P. <i>Physical Attacks on Pairing-Based Cryptography</i>. Universität Paderborn; 2016.","chicago":"Günther, Peter. <i>Physical Attacks on Pairing-Based Cryptography</i>. Universität Paderborn, 2016.","ieee":"P. Günther, <i>Physical attacks on pairing-based cryptography</i>. Universität Paderborn, 2016."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"167","user_id":"25078","department":[{"_id":"64"}],"ddc":["040"],"file_date_updated":"2018-03-21T12:43:21Z","type":"dissertation","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":9456552,"file_id":"1542","access_level":"closed","file_name":"167-thesis_peter_guenther.pdf","date_updated":"2018-03-21T12:43:21Z","date_created":"2018-03-21T12:43:21Z","creator":"florida"}],"status":"public"},{"type":"dissertation","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1537","file_name":"172-FStapelDissertation.pdf","access_level":"closed","file_size":9301431,"creator":"florida","date_created":"2018-03-21T12:39:19Z","date_updated":"2018-03-21T12:39:19Z"}],"status":"public","user_id":"477","department":[{"_id":"19"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C3","_id":"15"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"172","file_date_updated":"2018-03-21T12:39:19Z","ddc":["040"],"has_accepted_license":"1","citation":{"mla":"Stapel, Florian. <i>Ontology-Based Representation of Abstract Optimization Models for Model Formulation and System Generation</i>. Universität Paderborn, 2016.","bibtex":"@book{Stapel_2016, title={Ontology-based representation of abstract optimization models for model formulation and system generation}, publisher={Universität Paderborn}, author={Stapel, Florian}, year={2016} }","short":"F. Stapel, Ontology-Based Representation of Abstract Optimization Models for Model Formulation and System Generation, Universität Paderborn, 2016.","apa":"Stapel, F. (2016). <i>Ontology-based representation of abstract optimization models for model formulation and system generation</i>. Universität Paderborn.","ieee":"F. Stapel, <i>Ontology-based representation of abstract optimization models for model formulation and system generation</i>. Universität Paderborn, 2016.","chicago":"Stapel, Florian. <i>Ontology-Based Representation of Abstract Optimization Models for Model Formulation and System Generation</i>. Universität Paderborn, 2016.","ama":"Stapel F. <i>Ontology-Based Representation of Abstract Optimization Models for Model Formulation and System Generation</i>. Universität Paderborn; 2016."},"year":"2016","supervisor":[{"first_name":"Lena","last_name":"Suhl","full_name":"Suhl, Lena"}],"author":[{"full_name":"Stapel, Florian","last_name":"Stapel","first_name":"Florian"}],"date_created":"2017-10-17T12:41:25Z","date_updated":"2022-01-06T06:53:06Z","publisher":"Universität Paderborn","title":"Ontology-based representation of abstract optimization models for model formulation and system generation"}]