@inproceedings{2850, author = {{Hamann, Heiko and Markarian, Christine and Meyer auf der Heide, Friedhelm and Wahby, Mostafa}}, booktitle = {{Ninth International Conference on Fun with Algorithms (FUN)}}, title = {{{Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets}}}, doi = {{10.4230/LIPIcs.FUN.2018.22}}, year = {{2018}}, } @inproceedings{2857, author = {{Mohr, Felix and Lettmann, Theodor and Hüllermeier, Eyke and Wever, Marcel Dominik}}, booktitle = {{Proceedings of the 1st ICAPS Workshop on Hierarchical Planning}}, location = {{Delft, Netherlands}}, pages = {{31--39}}, publisher = {{AAAI}}, title = {{{Programmatic Task Network Planning}}}, year = {{2018}}, } @inproceedings{2862, author = {{Blömer, Johannes and Eidens, Fabian and Juhnke, Jakob}}, booktitle = {{Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA} Conference 2018, Proceedings}}, isbn = {{9783319769523}}, issn = {{0302-9743}}, location = {{San Francisco, CA, USA}}, pages = {{470--490}}, publisher = {{Springer International Publishing}}, title = {{{Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems}}}, doi = {{10.1007/978-3-319-76953-0_25}}, year = {{2018}}, } @article{24150, author = {{Ramaswamy, Arunselvan and Bhatnagar, Shalabh}}, journal = {{IEEE Transactions on Automatic Control}}, number = {{6}}, pages = {{2614--2620}}, publisher = {{IEEE}}, title = {{{Stability of stochastic approximations with “controlled markov” noise and temporal difference learning}}}, volume = {{64}}, year = {{2018}}, } @article{24151, author = {{Demirel, Burak and Ramaswamy, Arunselvan and Quevedo, Daniel E and Karl, Holger}}, journal = {{IEEE Control Systems Letters}}, number = {{4}}, pages = {{737--742}}, publisher = {{IEEE}}, title = {{{Deepcas: A deep reinforcement learning algorithm for control-aware scheduling}}}, volume = {{2}}, year = {{2018}}, } @inproceedings{24396, abstract = {{We study the Online Prize-collecting Node-weighted Steiner Forest problem (OPC-NWSF) in which we are given an undirected graph \(G=(V, E)\) with \(|V| = n\) and node-weight function \(w: V \rightarrow \mathcal {R}^+\). A sequence of k pairs of nodes of G, each associated with a penalty, arrives online. OPC-NWSF asks to construct a subgraph H such that each pair \(\{s, t\}\) is either connected (there is a path between s and t in H) or its associated penalty is paid. The goal is to minimize the weight of H and the total penalties paid. The current best result for OPC-NWSF is a randomized \(\mathcal {O}(\log ^4 n)\)-competitive algorithm due to Hajiaghayi et al. (ICALP 2014). We improve this by proposing a randomized \(\mathcal {O}(\log n \log k)\)-competitive algorithm for OPC-NWSF, which is optimal up to constant factor since OPC-NWSF has a randomized lower bound of \(\varOmega (\log ^2 n)\) due to Korman [11]. Moreover, our result also implies an improvement for two special cases of OPC-NWSF, the Online Prize-collecting Node-weighted Steiner Tree problem (OPC-NWST) and the Online Node-weighted Steiner Forest problem (ONWSF). In OPC-NWST, there is a distinguished node which is one of the nodes in each pair. In ONWSF, all penalties are set to infinity. The currently best known results for OPC-NWST and ONWSF are a randomized \(\mathcal {O}(\log ^3 n)\)-competitive algorithm due to Hajiaghayi et al. (ICALP 2014) and a randomized \(\mathcal {O}(\log n \log ^2 k)\)-competitive algorithm due to Hajiaghayi et al. (FOCS 2013), respectively.}}, author = {{Markarian, Christine}}, booktitle = {{International Workshop on Combinatorial Algorithms (IWOCA)}}, issn = {{0302-9743}}, title = {{{An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest}}}, doi = {{10.1007/978-3-319-94667-2_18}}, year = {{2018}}, } @inproceedings{2471, author = {{Mohr, Felix and Wever, Marcel Dominik and Hüllermeier, Eyke}}, booktitle = {{SCC}}, location = {{San Francisco, CA, USA}}, publisher = {{IEEE Computer Society}}, title = {{{On-The-Fly Service Construction with Prototypes}}}, doi = {{10.1109/SCC.2018.00036}}, year = {{2018}}, } @inproceedings{2472, author = {{Auroux, Sébastien and Karl, Holger}}, publisher = {{Proc. of IEEE Wireless Communications and Networking Conference (WCNC)}}, title = {{{Distributed Placement of Virtualized Control Applications in Mobile Backhaul Networks}}}, doi = {{ 10.1109/WCNC.2018.8377335}}, year = {{2018}}, } @inproceedings{26421, author = {{Winkelnkemper, Felix and Keil, Reinhard}}, booktitle = {{Proceedings of EdMedia: World Conference on Educational Media and Technology.}}, editor = {{Bastiaens, T and Van Braak, J and Brown, M}}, pages = {{2397--2406}}, title = {{{MediaThing – A Learning Scenario Targeting on Research Skills}}}, year = {{2018}}, } @inproceedings{26422, author = {{Seng, E.-M and Keil, Reinhard and Oevel, Gudrun}}, editor = {{Seng, E.-M and Keil, Reinhard and Oevel, G}}, pages = {{1--5}}, publisher = {{De Gruyter}}, title = {{{studiolo communis}}}, year = {{2018}}, } @inproceedings{26423, author = {{Keil, Reinhard}}, editor = {{Seng, E.-M and Keil, Reinhard and Oevel, G}}, publisher = {{De Gruyter}}, title = {{{Unterst{\"u}tzung kontingenter Wissensarbeit. Ein Rahmenwerk f{\"u}r die Entwicklung digitaler Arbeitsumgebungen zur Unterst{\"u}tzung des Forschungsdiskurses in den Kulturwissenschaften}}}, year = {{2018}}, } @book{26424, author = {{Seng, E.-M and Keil, Reinhard and Oevel, Gudrun}}, publisher = {{De Gruyter}}, title = {{{STUDIOLO. Kooperative Forschungsumgebungen in den eHumanities}}}, year = {{2018}}, } @inproceedings{26425, author = {{Selke, Harald}}, editor = {{Biehler, R and Budde, L and Frischemeier, D and Heinemann, B and Podworny, S and Schulte, Carsten and Wassong, T}}, pages = {{107--109}}, publisher = {{Universit{\"a}tsbibliothek Paderborn}}, title = {{{Data science in schools from the perspective of contextual informatics}}}, year = {{2018}}, } @article{2685, author = {{Blömer, Johannes and Kohn, Kathlén}}, issn = {{2470-6566}}, journal = {{SIAM Journal on Applied Algebra and Geometry.}}, number = {{2}}, pages = {{314--338}}, title = {{{Voronoi Cells of Lattices with Respect to Arbitrary Norms}}}, doi = {{10.1137/17M1132045}}, volume = {{2}}, year = {{2018}}, } @inproceedings{3217, author = {{Demirel, Burak and Ramaswamy, Arunselvan and Quevedo, Daniel and Karl, Holger}}, title = {{{DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling}}}, doi = {{10.1109/LCSYS.2018.2847721}}, year = {{2018}}, } @inproceedings{3265, abstract = {{We present CLARC (Cryptographic Library for Anonymous Reputation and Credentials), an anonymous credentials system (ACS) combined with an anonymous reputation system. Using 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. Furthermore, 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. To evaluate feasibility of our construction, we present an open-source prototype implementation.}}, 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 Porzenheim, Laurens Alexander and Pukrop, Simon and Schilling, Erik and Schlichtig, Michael and Stienemeier, Marcel}}, booktitle = {{Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES '18}}, isbn = {{978-1-4503-6448-5}}, location = {{Hamburg, Germany}}, publisher = {{ACM}}, title = {{{Fully-Featured Anonymous Credentials with Reputation System}}}, doi = {{10.1145/3230833.3234517}}, year = {{2018}}, } @misc{3320, author = {{Rautenberg, Kai}}, publisher = {{Universität Paderborn}}, title = {{{Korrektheitsbeweise für Muster von Servicekompositionen}}}, year = {{2018}}, } @inproceedings{3345, abstract = {{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. In 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.}}, author = {{Peuster, Manuel and Küttner, Hannes and Karl, Holger}}, booktitle = {{4th IEEE International Conference on Network Softwarization (NetSoft 2018)}}, location = {{Montreal}}, title = {{{ Let the state follow its flows: An SDN-based flow handover protocol to support state migration}}}, doi = {{10.1109/NETSOFT.2018.8460007}}, year = {{2018}}, } @inproceedings{3346, abstract = {{Developing a virtualized network service does not only involve the implementation and configuration of the network functions it is composed of but also its integration and test with management solutions that will control the service in its production environment. These integration tasks require testbeds that offer the needed network function virtualization infrastructure~(NFVI), like OpenStack, introducing a lot of management and maintenance overheads. Such testbed setups become even more complicated when the multi point-of-presence~(PoP) case, with multiple infrastructure installations, is considered. In this demo, we showcase an emulation platform that executes containerized network services in user-defined multi-PoP topologies. The platform does not only allow network service developers to locally test their services but also to connect real-world management and orchestration solutions to the emulated PoPs. During our interactive demonstration we focus on the integration between the emulated infrastructure and state-of-the-art orchestration solutions like SONATA or OSM.}}, author = {{Peuster, Manuel and Kampmeyer, Johannes and Karl, Holger}}, booktitle = {{4th IEEE International Conference on Network Softwarization (NetSoft 2018)}}, location = {{Montreal}}, title = {{{Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains}}}, doi = {{10.1109/NETSOFT.2018.8459905}}, year = {{2018}}, } @inproceedings{3347, abstract = {{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. In 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.}}, author = {{Peuster, Manuel and Marchetti, Michael and Garcia de Blas, Gerado and Karl, Holger}}, booktitle = {{European Conference on Networks and Communications (EuCNC)}}, location = {{Ljubljana}}, title = {{{Emulation-based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments}}}, doi = {{10.1109/EuCNC.2018.8442701}}, year = {{2018}}, }