@article{8795, abstract = {{Softwarized networks are the key enabler for elastic, on-demand service deployments of virtualized network functions. They allow to dynamically steer traffic through the network when new network functions are instantiated, or old ones are terminated. These scenarios become in particular challenging when stateful functions are involved, necessitating state management solutions to migrate state between the functions. 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 virtualized network functions (VNFs), eg, solution-specific state management interfaces. To change this, we introduce the seamless handover protocol (SHarP). An easy-to-use, loss-less, and order-preserving flow rerouting mechanism that is not fixed to a single state management approach. Using SHarP, VNF vendors are empowered to implement or use the state management solution of their choice. SHarP supports these solutions with additional information when flows are migrated. In this paper, we present SHarP's design, its open source prototype implementation, and show how SHarP significantly reduces the buffer usage at a central (SDN) controller, which is a typical bottleneck in state-of-the-art 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}}, issn = {{1055-7148}}, journal = {{International Journal of Network Management}}, title = {{{A flow handover protocol to support state migration in softwarized networks}}}, doi = {{10.1002/nem.2067}}, year = {{2019}}, } @inproceedings{8833, author = {{Jovanovikj, Ivan and Yigitbas, Enes and Gerth, Christian and Sauer, Stefan and Engels, Gregor}}, booktitle = {{Information Systems Engineering in Responsible Information Systems - CAiSE Forum 2019, Rome, Italy, June 3-7, 2019, Proceedings}}, editor = {{ Cappiello, Cinzia and Ruiz, Marcela}}, location = {{Rome}}, pages = {{145--157}}, title = {{{Detection and Resolution of Data-Flow Differences in Business Process Models}}}, volume = {{350}}, year = {{2019}}, } @inproceedings{8835, author = {{Jovanovikj, Ivan and Yigitbas, Enes and Grieger, Marvin and Sauer, Stefan and Engels, Gregor}}, booktitle = {{Proceedings of the 7th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD,}}, isbn = {{978-989-758-358-2}}, location = {{Prague}}, pages = {{536--543}}, publisher = {{SciTePress}}, title = {{{Modular Construction of Context-Specific Test Case Migration Methods}}}, doi = {{10.5220/0007690205360543}}, year = {{2019}}, } @inproceedings{8861, author = {{Anjorin, Anthony and Yigitbas, Enes and Kaindl, Hermann}}, booktitle = {{Proceedings of the 8th International Workshop on Bidirectional Transformations (Bx 2019)}}, location = {{Philadelphia, PA, USA}}, pages = {{61--65}}, publisher = {{CEUR-WS.org}}, title = {{{Consistent Runtime Adaptation of User Interfaces }}}, volume = {{2355}}, year = {{2019}}, } @inproceedings{8866, author = {{Jansen, Klaus and Maack, Marten and Mäcker, Alexander}}, booktitle = {{Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS)}}, pages = {{145 -- 154}}, publisher = {{IEEE}}, title = {{{Scheduling on (Un-)Related Machines with Setup Times}}}, year = {{2019}}, } @inproceedings{8868, author = {{Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke and Hetzer, Alexander}}, location = {{Bayreuth, Germany}}, title = {{{Towards Automated Machine Learning for Multi-Label Classification}}}, year = {{2019}}, } @inproceedings{8871, author = {{Augustine, John and Ghaffari, Mohsen and Gmyr, Robert and Hinnenthal, Kristian and Kuhn, Fabian and Li, Jason and Scheideler, Christian}}, booktitle = {{Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures}}, pages = {{69----79}}, publisher = {{ACM}}, title = {{{Distributed Computation in Node-Capacitated Networks}}}, doi = {{10.1145/3323165.3323195}}, year = {{2019}}, } @article{8880, author = {{Yigitbas, Enes and Jovanovikj, Ivan and Sauer, Stefan and Engels, Gregor}}, journal = {{Softwaretechnik-Trends, Proceedings of the 21st Workshop Software-Reengineering & Evolution (WSRE) & 10th Workshop Design for Future (DFF)}}, number = {{2}}, pages = {{39--40}}, title = {{{Towards Model-based Development of Context-aware Augmented Reality Applications }}}, volume = {{39}}, year = {{2019}}, } @article{9620, author = {{Yigitbas, Enes and Hottung, André and Mansfield Rojas, Sebastian and Anjorin, Anthony and Sauer, Stefan and Engels, Gregor}}, journal = {{Proceedings of the ACM on Human-Computer Interaction}}, pages = {{19:1--19:20}}, title = {{{Context- and Data-driven Satisfaction Analysis of User Interface Adaptations Based on Instant User Feedback}}}, volume = {{3}}, year = {{2019}}, } @article{9823, author = {{Soenen, Thomas and Tavernier, Wouter and Peuster, Manuel and Vicens, Felipe and Xilouris, George and Kolometsos, Stavros and Kourtis, Michail-Alexandros and Colle, Didier}}, issn = {{0163-6804}}, journal = {{IEEE Communications Magazine}}, pages = {{89--95}}, title = {{{Empowering Network Service Developers: Enhanced NFV DevOps and Programmable MANO}}}, doi = {{10.1109/mcom.2019.1800810}}, year = {{2019}}, } @article{9824, author = {{Peuster, Manuel and Schneider, Stefan Balthasar and Zhao, Mengxuan and Xilouris, George and Trakadas, Panagiotis and Vicens, Felipe and Tavernier, Wouter and Soenen, Thomas and Vilalta, Ricard and Andreou, George and Kyriazis, Dimosthenis and Karl, Holger}}, issn = {{0163-6804}}, journal = {{IEEE Communications Magazine}}, pages = {{96--102}}, title = {{{Introducing Automated Verification and Validation for Virtualized Network Functions and Services}}}, doi = {{10.1109/mcom.2019.1800873}}, year = {{2019}}, } @inproceedings{9939, author = {{Yigitbas, Enes and Jovanovikj, Ivan and Josifovska, Klementina and Sauer, Stefan and Engels, Gregor}}, booktitle = {{Proceedings of the 17th IFIP TC.13 International Conference on Human-Computer Interaction (INTERACT 2019)}}, pages = {{563--567}}, publisher = {{Springer, LNCS}}, title = {{{On-the-fly Usability Evaluation of Mobile Adaptive UIs through Instant User Feedback }}}, year = {{2019}}, } @inproceedings{5471, abstract = {{We characterise the set of dominant strategy incentive compatible (DSIC), strongly budget balanced (SBB), and ex-post individually rational (IR) mechanisms for the multi-unit bilateral trade setting. In such a setting there is a single buyer and a single seller who holds a finite number k of identical items. The mechanism has to decide how many units of the item are transferred from the seller to the buyer and how much money is transferred from the buyer to the seller. We consider two classes of valuation functions for the buyer and seller: Valuations that are increasing in the number of units in possession, and the more specific class of valuations that are increasing and submodular. Furthermore, we present some approximation results about the performance of certain such mechanisms, in terms of social welfare: For increasing submodular valuation functions, we show the existence of a deterministic 2-approximation mechanism and a randomised e/(1-e) approximation mechanism, matching the best known bounds for the single-item setting.}}, author = {{Lazos, Philip and Goldberg, Paul and Skopalik, Alexander and Gerstgrasser, Matthias and de Keijzer, Bart}}, booktitle = {{Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)}}, location = {{Honolulu, Hawaii, USA}}, title = {{{ Multi-unit Bilateral Trade}}}, doi = {{10.1609/aaai.v33i01.33011973}}, year = {{2019}}, } @inproceedings{6860, author = {{Afifi, Haitham and Karl, Holger}}, booktitle = {{2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC2019)}}, publisher = {{IEEE}}, title = {{{Power Allocation with a Wireless Multi-cast Aware Routing for Virtual Network Embedding}}}, year = {{2019}}, } @inproceedings{6976, abstract = {{We investigate the maintenance of overlay networks under massive churn, i.e. nodes joining and leaving the network. We assume an adversary that may churn a constant fraction $\alpha n$ of nodes over the course of $\mathcal{O}(\log n)$ rounds. In particular, the adversary has an almost up-to-date information of the network topology as it can observe an only slightly outdated topology that is at least $2$ rounds old. Other than that, we only have the provably minimal restriction that new nodes can only join the network via nodes that have taken part in the network for at least one round. Our contributions are as follows: First, we show that it is impossible to maintain a connected topology if adversary has up-to-date information about the nodes' connections. Further, we show that our restriction concerning the join is also necessary. As our main result present an algorithm that constructs a new overlay- completely independent of all previous overlays - every $2$ rounds. Furthermore, each node sends and receives only $\mathcal{O}(\log^3 n)$ messages each round. As part of our solution we propose the Linearized DeBruijn Swarm (LDS), a highly churn resistant overlay, which will be maintained by the algorithm. However, our approaches can be transferred to a variety of classical P2P Topologies where nodes are mapped into the $[0,1)$-interval.}}, author = {{Götte, Thorsten and Vijayalakshmi, Vipin Ravindran and Scheideler, Christian}}, booktitle = {{Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19)}}, location = {{Rio de Janeiro, Brazil}}, publisher = {{IEEE}}, title = {{{Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary}}}, year = {{2019}}, } @unpublished{16853, abstract = {{State-of-the-art frameworks for generating approximate circuits usually rely on information gained through circuit synthesis and/or verification to explore the search space and to find an optimal solution. Throughout the process, a large number of circuits may be subject to processing, leading to considerable runtimes. In this work, we propose a search which takes error bounds and pre-computed impact factors into account to reduce the number of invoked synthesis and verification processes. In our experimental results, we achieved speed-ups of up to 76x while area savings remain comparable to the reference search method, simulated annealing.}}, author = {{Witschen, Linus Matthias and Ghasemzadeh Mohammadi, Hassan and Artmann, Matthias and Platzner, Marco}}, booktitle = {{Fourth Workshop on Approximate Computing (AxC 2019)}}, keywords = {{Approximate computing, parameter selection, search space exploration, verification, circuit synthesis}}, pages = {{2}}, title = {{{Jump Search: A Fast Technique for the Synthesis of Approximate Circuits}}}, year = {{2019}}, } @inproceedings{10577, abstract = {{State-of-the-art frameworks for generating approximate circuits automatically explore the search space in an iterative process - often greedily. Synthesis and verification processes are invoked in each iteration to evaluate the found solutions and to guide the search algorithm. As a result, a large number of approximate circuits is subjected to analysis - leading to long runtimes - but only a few approximate circuits might form an acceptable solution. In this paper, we present our Jump Search (JS) method which seeks to reduce the runtime of an approximation process by reducing the number of expensive synthesis and verification steps. To reduce the runtime, JS computes impact factors for each approximation candidate in the circuit to create a selection of approximate circuits without invoking synthesis or verification processes. We denote the selection as path from which JS determines the final solution. In our experimental results, JS achieved speed-ups of up to 57x while area savings remain comparable to the reference search method, Simulated Annealing.}}, author = {{Witschen, Linus Matthias and Ghasemzadeh Mohammadi, Hassan and Artmann, Matthias and Platzner, Marco}}, booktitle = {{Proceedings of the 2019 on Great Lakes Symposium on VLSI - GLSVLSI '19}}, isbn = {{9781450362528}}, keywords = {{Approximate computing, design automation, parameter selection, circuit synthesis}}, location = {{Tysons Corner, VA, USA}}, publisher = {{ACM}}, title = {{{Jump Search: A Fast Technique for the Synthesis of Approximate Circuits}}}, doi = {{10.1145/3299874.3317998}}, year = {{2019}}, } @article{10578, author = {{Tagne, V. K. and Fotso, S. and Fono, L. A. and Hüllermeier, Eyke}}, journal = {{New Mathematics and Natural Computation}}, number = {{2}}, pages = {{191--213}}, title = {{{Choice Functions Generated by Mallows and Plackett–Luce Relations}}}, volume = {{15}}, year = {{2019}}, } @inproceedings{10586, abstract = {{We consider the problem of transforming a given graph G_s into a desired graph G_t by applying a minimum number of primitives from a particular set of local graph transformation primitives. These primitives are local in the sense that each node can apply them based on local knowledge and by affecting only its 1-neighborhood. Although the specific set of primitives we consider makes it possible to transform any (weakly) connected graph into any other (weakly) connected graph consisting of the same nodes, they cannot disconnect the graph or introduce new nodes into the graph, making them ideal in the context of supervised overlay network transformations. We prove that computing a minimum sequence of primitive applications (even centralized) for arbitrary G_s and G_t is NP-hard, which we conjecture to hold for any set of local graph transformation primitives satisfying the aforementioned properties. On the other hand, we show that this problem admits a polynomial time algorithm with a constant approximation ratio.}}, author = {{Scheideler, Christian and Setzer, Alexander}}, booktitle = {{Proceedings of the 46th International Colloquium on Automata, Languages, and Programming}}, keywords = {{Graphs transformations, NP-hardness, approximation algorithms}}, location = {{Patras, Greece}}, pages = {{150:1----150:14}}, publisher = {{Dagstuhl Publishing}}, title = {{{On the Complexity of Local Graph Transformations}}}, doi = {{10.4230/LIPICS.ICALP.2019.150}}, volume = {{132}}, year = {{2019}}, } @inproceedings{11709, author = {{Potthast, Martin and Gienapp, Lukas and Euchner, Florian and Heilenkötter, Nick and Weidmann, Nico and Wachsmuth, Henning and Stein, Benno and Hagen, Matthias}}, booktitle = {{42nd International ACM Conference on Research and Development in Information Retrieval (SIGIR 2019)}}, pages = {{1117 -- 1120}}, publisher = {{ACM}}, title = {{{Argument Search: Assessing Argument Relevance}}}, doi = {{10.1145/3331184.3331327}}, year = {{2019}}, }