@inproceedings{2480, abstract = {{Understanding the behavior of the components of service function chains (SFCs) in different load situations is important for efficient and automatic management and orches- tration of services. For this purpose and for practical research in network function virtualization in general, there is a great need for benchmarks and experimental data. In this paper, we describe our experiments for characterizing the relationship between resource demands of virtual network functions (VNFs) and the expected performance of the SFC, considering the individual performance of the VNFs as well as the interdependencies among VNFs within the SFC. We have designed our experiments focusing on video streaming, an important application in this context. We present examples of models for predicting the interdependence between resource demands and performance characteristics of SFCs using support vector regression and polynomial regression models. We also show practical evidence from our experiments that VNFs need to be benchmarked in their final chain setup, rather than individually, to capture important interdependencies that affect their performance. The data gathered from our experiments is publicly available.}}, author = {{Dräxler, Sevil and Peuster, Manuel and Illian, Marvin and Karl, Holger}}, booktitle = {{4th IEEE International Conference on Network Softwarization (NetSoft 2018)}}, location = {{Montreal}}, pages = {{318----322}}, publisher = {{IEEE}}, title = {{{Generating Resource and Performance Models for Service Function Chains: The Video Streaming Case}}}, doi = {{10.1109/NETSOFT.2018.8460029}}, year = {{2018}}, } @inproceedings{2481, abstract = {{Network function virtualization requires scaling and placement, deciding the number and the location of function instances. Current approaches are limited in flexibility and practical applicability. Specifically, we study dynamic, single-step, joint scaling and placement of network services with bidirectional flows traversing Physical or Virtual Network Functions (VNFs) and returning to their sources. We develop models to support stateful components and legacy network functions with fixed locations in these network services as well as the possibility of reusing VNFs across network services. We formalize the problem of jointly scaling and placing such network services as a mixed- integer linear program (MILP). We show that this problem is NP-complete and also present a heuristic algorithm to find good solutions in short time. In an extensive evaluation with realistic scenarios, we investigate the capabilities of the two approaches.}}, author = {{Dräxler, Sevil and Schneider, Stefan Balthasar and Karl, Holger}}, booktitle = {{4th IEEE International Conference on Network Softwarization (NetSoft 2018)}}, location = {{Montreal}}, pages = {{123----131}}, publisher = {{IEEE}}, title = {{{ Scaling and Placing Bidirectional Services with Stateful Virtual and Physical Network Functions}}}, year = {{2018}}, } @techreport{2483, abstract = {{Understanding the behavior of distributed cloud service components in different load situations is important for efficient and automatic management and orchestration of these services. For this purpose and for practical research in distributed cloud computing in general, there is need for benchmarks and experimental data. In this paper, we describe our experiments for characterizing the relationship between resource demands of application components and the expected performance of applica- tions. We present initial results for predicting the interdependence between resource demands and performance characteristics using support vector regression and polynomial regression models. The data gathered from our experiments is publicly available.}}, author = {{Dräxler, Sevil and Peuster, Manuel and Illian, Marvin and Karl, Holger}}, title = {{{Towards Predicting Resource Demands and Performance of Distributed Cloud Services}}}, year = {{2018}}, } @inproceedings{2484, abstract = {{We study the classic bin packing problem in a fully-dynamic setting, where new items can arrive and old items may depart. We want algorithms with low asymptotic competitive ratio while repacking items sparingly between updates. Formally, each item i has a movement cost c_i >= 0, and we want to use alpha * OPT bins and incur a movement cost gamma * c_i, either in the worst case, or in an amortized sense, for alpha, gamma as small as possible. We call gamma the recourse of the algorithm. This is motivated by cloud storage applications, where fully-dynamic bin packing models the problem of data backup to minimize the number of disks used, as well as communication incurred in moving file backups between disks. Since the set of files changes over time, we could recompute a solution periodically from scratch, but this would give a high number of disk rewrites, incurring a high energy cost and possible wear and tear of the disks. In this work, we present optimal tradeoffs between number of bins used and number of items repacked, as well as natural extensions of the latter measure.}}, author = {{Feldkord, Björn and Feldotto, Matthias and Gupta, Anupam and Guruganesh, Guru and Kumar, Amit and Riechers, Sören and Wajc, David}}, booktitle = {{45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}}, editor = {{Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, Dániel and Sannella, Donald}}, isbn = {{978-3-95977-076-7}}, issn = {{1868-8969}}, location = {{Prag}}, pages = {{51:1--51:24}}, publisher = {{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}}, title = {{{Fully-Dynamic Bin Packing with Little Repacking}}}, doi = {{10.4230/LIPIcs.ICALP.2018.51}}, volume = {{107}}, year = {{2018}}, } @inproceedings{2485, author = {{Feldkord, Björn and Meyer auf der Heide, Friedhelm}}, booktitle = {{Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}}, location = {{Wien}}, pages = {{373 -- 381 }}, publisher = {{ACM}}, title = {{{Online Facility Location with Mobile Facilities}}}, doi = {{10.1145/3210377.3210389}}, year = {{2018}}, } @inproceedings{2490, author = {{Szopinski, Daniel and Kundisch, Dennis}}, booktitle = {{2nd Business Model Conference}}, location = {{Florence, Italy}}, title = {{{Business model idea generation: An exploratory study on changing perspectives}}}, year = {{2018}}, } @inproceedings{2491, author = {{Szopinski, Daniel}}, booktitle = {{2nd Business Model Conference}}, location = {{Florence, Italy}}, title = {{{How to teach business model innovation to 300+ students: An experience report}}}, year = {{2018}}, } @misc{2559, author = {{Arendt, Lukas Sebastian}}, title = {{{Datengetriebene Geschäftsmodelle: Ein Literaturüberblick}}}, year = {{2018}}, } @inproceedings{2831, abstract = {{We consider a market where final products or services are compositions of a number of basic services. Users are asked to evaluate the quality of the composed product after purchase. The quality of the basic service influences the performance of the composed services but cannot be observed directly. The question we pose is whether it is possible to use user evaluations on composed services to assess the quality of basic services. We discuss how to combine aggregation of evaluations across users and disaggregation of information on composed services to derive valuations for the single components. As a solution we propose to use the (weighted) average as aggregation device in connection with the Shapley value as disaggregation method, since this combination fulfills natural requirements in our context. In addition, we address some occurring computational issues: We give an approximate solution concept using only a limited number of evaluations which guarantees nearly optimal results with reduced running time. Lastly, we show that a slightly modified Shapley value and the weighted average are still applicable if the evaluation profiles are incomplete.}}, author = {{Feldotto, Matthias and Haake, Claus-Jochen and Skopalik, Alexander and Stroh-Maraun, Nadja}}, booktitle = {{Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)}}, isbn = {{978-1-4503-5916-0}}, location = {{Irvine, California, USA}}, pages = {{5:1--5:6}}, title = {{{Disaggregating User Evaluations Using the Shapley Value}}}, doi = {{10.1145/3230654.3230659}}, year = {{2018}}, } @article{2848, author = {{Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm}}, journal = {{Algorithmica}}, number = {{5}}, pages = {{1556–1574}}, publisher = {{Springer}}, title = {{{Towards Flexible Demands in Online Leasing Problems. }}}, doi = {{10.1007/s00453-018-0420-y}}, volume = {{80}}, year = {{2018}}, } @article{2849, author = {{Abu-Khzam, Faisal N. and Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert, Michael}}, journal = {{Theory of Computing Systems}}, publisher = {{Springer}}, title = {{{Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks}}}, doi = {{10.1007/s00224-017-9836-z}}, year = {{2018}}, } @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}}, } @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{2564, author = {{Gutt, Dominik}}, booktitle = {{Proceedings of the 25th European Conference on Information Systems (ECIS)}}, location = {{Portsmouth, UK}}, title = {{{In the Eye of the Beholder? – Empirically Decomposing Different Economic Implications of the Online Rating Variance}}}, year = {{2018}}, } @techreport{2565, abstract = {{This note deals with agreeability in nontransferable utility (NTU) differential games. We introduce state feedback Pareto weights to enrich the set of efficient cooperative solutions. The framework is particularly useful if constant weights fail to support agreeability, but cooperation is desired nonetheless. The concept is applied to an adverting differential game.}}, author = {{Hoof, Simon}}, keywords = {{NTU differential games, variable Pareto weights, agreeability}}, publisher = {{CIE Working Paper Series, Paderborn University}}, title = {{{Feedback Pareto weights in cooperative NTU differential games}}}, volume = {{112}}, year = {{2018}}, } @article{2566, abstract = {{We show that the Boston school choice mechanism (BM), the student proposing deferred acceptance algorithm (DA) and the top trading cycles algorithm (TTC) generate the same outcome when the colleges’ priorities are modified according to students’ preferences in a “first preferences first” manner. This outcome coincides with the BM outcome under original priorities. As a result, the DA and TTC mechanism that are non-manipulable under original priorities become vulnerable to strategic behavior.}}, author = {{Haake, Claus-Jochen and Stroh-Maraun, Nadja}}, journal = {{Economics Letters}}, pages = {{39 -- 41}}, publisher = {{Elsevier}}, title = {{{Outcome Equivalence in School Choice with Reciprocal Preferences}}}, doi = {{10.1016/j.econlet.2018.05.033}}, volume = {{170}}, year = {{2018}}, } @inproceedings{2660, author = {{Neumann, Jürgen and Gutt, Dominik and Kundisch, Dennis}}, booktitle = {{Conference Abstracts of the Symposium on Statistical Challenges in Electronic Commerce Research (SCECR)}}, location = {{Rotterdam, Netherland}}, title = {{{The Traveling Reviewer Problem - Exploring the Relationship Between Offline Locations and Online Rating Behavior}}}, year = {{2018}}, }