@inproceedings{6483, author = {{Peuster, Manuel and Schneider, Stefan Balthasar and Christ, Frederic and Karl, Holger}}, booktitle = {{IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp}}, location = {{Verona}}, publisher = {{IEEE}}, title = {{{A Prototyping Platform to Validate and Verify Network Service Header-based Service Chains}}}, year = {{2018}}, } @phdthesis{6597, author = {{Juhnke, Jakob}}, publisher = {{Universität Paderborn}}, title = {{{Models and Constructions for Secure Reputation Systems}}}, doi = {{10.17619/UNIPB/1-570}}, year = {{2018}}, } @inproceedings{6970, abstract = {{Dynamic allocation of resources is a key feature in network function virtualization (NFV), enabling flexible adjustment of slices and contained network services to ever-changing service demands. Considering resource allocation across the entire network, many authors have proposed approaches to optimize the placement and chaining of virtual network function (VNF) instances and the allocation of resources to these VNF instances. In doing so, various optimization objectives are conceivable, e.g., minimizing certain required resources or the end-to-end delay of the placed services. In this paper, we investigate the relationship between four typical optimization objectives when coordinating the placement and resource allocation of chained VNF instances. We observe an interesting trade-off between minimizing the overhead of starting/stopping VNF instances and all other objectives when adapting to changed service demands.}}, author = {{Schneider, Stefan Balthasar and Dräxler, Sevil and Karl, Holger}}, booktitle = {{IEEE Global Communications Conference (GLOBECOM 2018)}}, location = {{Abu Dhabi, UAE}}, publisher = {{IEEE}}, title = {{{Trade-offs in Dynamic Resource Allocation in Network Function Virtualization}}}, year = {{2018}}, } @inproceedings{6972, abstract = {{In recent years, a variety of different approaches have been proposed to tackle the problem of scaling and placing network services, consisting of interconnected virtual network functions (VNFs). This paper presents a placement abstraction layer (PAL) that provides a clear and simple northbound interface for using such algorithms while hiding their internal functionality and implementation. Through its southbound interface, PAL can connect to different back ends that evaluate the calculated placements, e.g., using simulations, emulations, or testbed approaches. As an example for such evaluation back ends, we introduce a novel placement emulation framework (PEF) that allows executing calculated placements using real, containerbased VNFs on real-world network topologies. In a case study, we show how PAL and PEF facilitate reusing and evaluating placement algorithms as well as validating their underlying models and performance claims.}}, author = {{Schneider, Stefan Balthasar and Peuster, Manuel and Karl, Holger}}, booktitle = {{IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)}}, location = {{Verona, Italy}}, publisher = {{IEEE}}, title = {{{A Generic Emulation Framework for Reusing and Evaluating VNF Placement Algorithms}}}, doi = {{10.1109/NFV-SDN.2018.8725795}}, year = {{2018}}, } @inproceedings{6974, abstract = {{A key challenge of network function virtualization (NFV) is the complexity of developing and deploying new network services. Currently, development requires many manual steps that are time-consuming and error-prone (e.g., for creating service descriptors). Furthermore, existing management and orchestration (MANO) platforms only offer limited support of standardized descriptor models or package formats, limiting the re-usability of network services. To this end, we introduce a fully integrated, open-source NFV service development kit (SDK) with multi-MANO platform support. Our SDK simplifies many NFV service development steps by offering initial generation of descriptors, advanced project management, as well as fully automated packaging and submission for on-boarding. To achieve multi-platform support, we present a package format that extends ETSI’s VNF package format. In this demonstration, we present the end-to-end workflow to develop an NFV service that is then packaged for multiple platforms, i.e., 5GTANGO and OSM.}}, author = {{Schneider, Stefan Balthasar and Peuster, Manuel and Tavernier, Wouter and Karl, Holger}}, booktitle = {{IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)}}, location = {{Verona, Italy}}, publisher = {{IEEE}}, title = {{{A Fully Integrated Multi-Platform NFV SDK}}}, doi = {{10.1109/NFV-SDN.2018.8725794}}, year = {{2018}}, } @inproceedings{1046, author = {{John, Thomas and Szopinski, Daniel}}, booktitle = {{Proceedings of the Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, Germany}}, title = {{{Towards explaining the popularity of the Business Model Canvas: A dual coding approach}}}, year = {{2018}}, } @article{1047, author = {{Stummer, Christian and Kundisch, Dennis and Decker, Reinhold}}, journal = {{Business & Information Systems Engineering}}, publisher = {{Springer}}, title = {{{Platform Launch Strategies}}}, year = {{2018}}, } @phdthesis{1208, author = {{Schwabe, Arne}}, publisher = {{Universität Paderborn}}, title = {{{Data-Centre Traffic Optimisation using Software-Defined Networks}}}, doi = {{10.17619/UNIPB/1-287}}, year = {{2018}}, } @article{1369, abstract = {{In budget games, players compete over resources with finite budgets. For every resource, a player has a specific demand and as a strategy, he chooses a subset of resources. If the total demand on a resource does not exceed its budget, the utility of each player who chose that resource equals his demand. Otherwise, the budget is shared proportionally. In the general case, pure Nash equilibria (NE) do not exist for such games. In this paper, we consider the natural classes of singleton and matroid budget games with additional constraints and show that for each, pure NE can be guaranteed. In addition, we introduce a lexicographical potential function to prove that every matroid budget game has an approximate pure NE which depends on the largest ratio between the different demands of each individual player.}}, author = {{Drees, Maximilian and Feldotto, Matthias and Riechers, Sören and Skopalik, Alexander}}, issn = {{1382-6905}}, journal = {{Journal of Combinatorial Optimization}}, publisher = {{Springer Nature}}, title = {{{Pure Nash equilibria in restricted budget games}}}, doi = {{10.1007/s10878-018-0269-7}}, year = {{2018}}, } @misc{5470, author = {{Hoffmeister, Jiajia}}, title = {{{Evaluation von Taxonomien: Ein Literaturüberblick}}}, year = {{2018}}, } @misc{4764, author = {{Valentin, Andreas}}, publisher = {{Universität Paderborn}}, title = {{{Zweiseitige Märkte und Plattformökonomie in der Information Systems-Forschung - Ein klassifizierender Literaturüberblick}}}, year = {{2018}}, } @misc{4997, author = {{Weigang, Jana}}, title = {{{Das Konzept der Kreativität in der Wirtschaftsinformatik: Ein Literaturüberblick}}}, year = {{2018}}, } @misc{5417, abstract = {{Molecular Dynamic (MD) simulations are computationally intensive and accelerating them using specialized hardware is a topic of investigation in many studies. One of the routines in the critical path of MD simulations is the three-dimensional Fast Fourier Transformation (FFT3d). The potential in accelerating FFT3d using hardware is usually bound by bandwidth and memory. Therefore, designing a high throughput solution for an FPGA that overcomes this problem is challenging. In this thesis, the feasibility of offloading FFT3d computations to FPGA implemented using OpenCL is investigated. In order to mask the latency in memory access, an FFT3d that overlaps computation with communication is designed. The implementa- tion of this design is synthesized for the Arria 10 GX 1150 FPGA and evaluated with the FFTW benchmark. Analysis shows a better performance using FPGA over CPU for larger FFT sizes, with the 643 FFT showing a 70% improvement in runtime using FPGAs. This FFT3d design is integrated with CP2K to explore the potential in accelerating molecular dynamic simulations. Evaluation of CP2K simulations using FPGA shows a 41% improvement in runtime in FFT3d computations over CPU for larger FFT3d designs.}}, author = {{Ramaswami, Arjun}}, keywords = {{FFT: FPGA, CP2K, OpenCL}}, publisher = {{Universität Paderborn}}, title = {{{Accelerating Molecular Dynamic Simulations by Offloading Fast Fourier Transformations to FPGA}}}, year = {{2018}}, } @inproceedings{3873, author = {{Blömer, Johannes and Eidens, Fabian and Juhnke, Jakob}}, booktitle = {{The International Conference on Cryptology And Network Security (CANS)}}, isbn = {{978-3-030-00434-7}}, location = {{Naples, Italy}}, pages = {{235--255}}, publisher = {{Springer}}, title = {{{Enhanced Security of Attribute-Based Signatures}}}, doi = {{10.1007/978-3-030-00434-7_12}}, volume = {{11124}}, year = {{2018}}, } @inproceedings{2379, abstract = {{In this paper, we introduce the notion of delegatable attribute-based anonymous credentials (DAAC). Such systems offer fine-grained anonymous access control and they give the credential holder the ability to issue more restricted credentials to other users. In our model, credentials are parameterized with attributes that (1) express what the credential holder himself has been certified and (2) define which attributes he may issue to others. Furthermore, we present a practical construction of DAAC. For this construction, we deviate from the usual approach of embedding a certificate chain in the credential. Instead, we introduce a novel approach for which we identify a new primitive we call dynamically malleable signatures (DMS) as the main ingredient. This primitive may be of independent interest. We also give a first instantiation of DMS with efficient protocols. }}, author = {{Blömer, Johannes and Bobolz, Jan}}, booktitle = {{ACNS 2018 Applied Cryptography & Network security}}, location = {{Leuven, Belgium}}, title = {{{Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures}}}, doi = {{10.1007/978-3-319-93387-0_12}}, year = {{2018}}, } @inproceedings{1588, abstract = {{The exploration of FPGAs as accelerators for scientific simulations has so far mostly been focused on small kernels of methods working on regular data structures, for example in the form of stencil computations for finite difference methods. In computational sciences, often more advanced methods are employed that promise better stability, convergence, locality and scaling. Unstructured meshes are shown to be more effective and more accurate, compared to regular grids, in representing computation domains of various shapes. Using unstructured meshes, the discontinuous Galerkin method preserves the ability to perform explicit local update operations for simulations in the time domain. In this work, we investigate FPGAs as target platform for an implementation of the nodal discontinuous Galerkin method to find time-domain solutions of Maxwell's equations in an unstructured mesh. When maximizing data reuse and fitting constant coefficients into suitably partitioned on-chip memory, high computational intensity allows us to implement and feed wide data paths with hundreds of floating point operators. By decoupling off-chip memory accesses from the computations, high memory bandwidth can be sustained, even for the irregular access pattern required by parts of the application. Using the Intel/Altera OpenCL SDK for FPGAs, we present different implementation variants for different polynomial orders of the method. In different phases of the algorithm, either computational or bandwidth limits of the Arria 10 platform are almost reached, thus outperforming a highly multithreaded CPU implementation by around 2x.}}, author = {{Kenter, Tobias and Mahale, Gopinath and Alhaddad, Samer and Grynko, Yevgen and Schmitt, Christian and Afzal, Ayesha and Hannig, Frank and Förstner, Jens and Plessl, Christian}}, booktitle = {{Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)}}, keywords = {{tet_topic_hpc}}, publisher = {{IEEE}}, title = {{{OpenCL-based FPGA Design to Accelerate the Nodal Discontinuous Galerkin Method for Unstructured Meshes}}}, doi = {{10.1109/FCCM.2018.00037}}, year = {{2018}}, } @inproceedings{1204, author = {{Riebler, Heinrich and Vaz, Gavin Francis and Kenter, Tobias and Plessl, Christian}}, booktitle = {{Proc. ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP)}}, isbn = {{9781450349826}}, keywords = {{htrop}}, publisher = {{ACM}}, title = {{{Automated Code Acceleration Targeting Heterogeneous OpenCL Devices}}}, doi = {{10.1145/3178487.3178534}}, year = {{2018}}, } @misc{3291, abstract = {{The microservice architecture uses independently running microservices as build- ing blocks for applications. These microservices are clearly bounded for each other and expose their functionality through, for instance, RESTful application inter- faces. Particularly the clear boundaries between microservices enable the reuse of microservice throughout different projects. Because of the increasing use of microservices, the composition of multiple microservices in service composition becomes a more important task. A challenging area in developing service compo- sitions is that it involves two distinct layers with few junctions. On the one hand, describes a service composition a business process, which involves multiple com- ponents. On the other hand, involves the implementation of a service composition topics like service discovery and message exchange protocols since the microser- vices involved in a service composition are located within a network environment. In this Bachelor’s Thesis, I describe a descriptions language to abstractly describe the business logic of a service composition. Furthermore, I describe a genera- tion process, which compiles this abstract description to a working microservice realizing the specified service composition. In addition to that, I provide an im- plementation of the generation process, as a proof of concept, and test it within a Kubernetes-based cluster environment.}}, author = {{Schürmann, Andreas}}, publisher = {{Universität Paderborn}}, title = {{{Microservice-based Execution Environment for Service Compositions}}}, year = {{2017}}, } @inproceedings{2967, author = {{Blömer, Johannes and Liske, Gennadij}}, booktitle = {{Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)}}, isbn = {{9783319724522}}, issn = {{0302-9743}}, pages = {{438--453}}, publisher = {{Springer International Publishing}}, title = {{{Subtleties in Security Definitions for Predicate Encryption with Public Index}}}, doi = {{10.1007/978-3-319-72453-9_35}}, volume = {{10693}}, year = {{2017}}, } @phdthesis{116, author = {{Liske, Gennadij}}, publisher = {{Universität Paderborn}}, title = {{{CCA-Security for Predicate Encryption Schemes}}}, doi = {{10.17619/UNIPB/1-220}}, year = {{2017}}, }