[{"date_updated":"2022-01-06T06:59:14Z","author":[{"first_name":"Philip","full_name":"Wette, Philip","last_name":"Wette"},{"full_name":"Karl, Holger","id":"126","last_name":"Karl","first_name":"Holger"}],"date_created":"2017-10-17T12:41:58Z","title":"Using Application Layer Knowledge in Routing and Wavelength Assignment Algorithms","doi":"10.1109/ICC.2014.6883825","has_accepted_license":"1","year":"2014","page":"3270-3276","citation":{"mla":"Wette, Philip, and Holger Karl. “Using Application Layer Knowledge in Routing and Wavelength Assignment Algorithms.” <i>Proceedings of the IEEE International Conference on Communications 2014</i>, 2014, pp. 3270–76, doi:<a href=\"https://doi.org/10.1109/ICC.2014.6883825\">10.1109/ICC.2014.6883825</a>.","short":"P. Wette, H. Karl, in: Proceedings of the IEEE International Conference on Communications 2014, 2014, pp. 3270–3276.","bibtex":"@inproceedings{Wette_Karl_2014, title={Using Application Layer Knowledge in Routing and Wavelength Assignment Algorithms}, DOI={<a href=\"https://doi.org/10.1109/ICC.2014.6883825\">10.1109/ICC.2014.6883825</a>}, booktitle={Proceedings of the IEEE International Conference on Communications 2014}, author={Wette, Philip and Karl, Holger}, year={2014}, pages={3270–3276} }","apa":"Wette, P., &#38; Karl, H. (2014). Using Application Layer Knowledge in Routing and Wavelength Assignment Algorithms. In <i>Proceedings of the IEEE International Conference on Communications 2014</i> (pp. 3270–3276). <a href=\"https://doi.org/10.1109/ICC.2014.6883825\">https://doi.org/10.1109/ICC.2014.6883825</a>","chicago":"Wette, Philip, and Holger Karl. “Using Application Layer Knowledge in Routing and Wavelength Assignment Algorithms.” In <i>Proceedings of the IEEE International Conference on Communications 2014</i>, 3270–76, 2014. <a href=\"https://doi.org/10.1109/ICC.2014.6883825\">https://doi.org/10.1109/ICC.2014.6883825</a>.","ieee":"P. Wette and H. Karl, “Using Application Layer Knowledge in Routing and Wavelength Assignment Algorithms,” in <i>Proceedings of the IEEE International Conference on Communications 2014</i>, 2014, pp. 3270–3276.","ama":"Wette P, Karl H. Using Application Layer Knowledge in Routing and Wavelength Assignment Algorithms. In: <i>Proceedings of the IEEE International Conference on Communications 2014</i>. ; 2014:3270-3276. doi:<a href=\"https://doi.org/10.1109/ICC.2014.6883825\">10.1109/ICC.2014.6883825</a>"},"_id":"339","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"75"}],"user_id":"15504","ddc":["040"],"file_date_updated":"2018-03-20T07:29:00Z","publication":"Proceedings of the IEEE International Conference on Communications 2014","type":"conference","abstract":[{"text":"Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established lightpaths in case notenough resources are available to set up a new lightpath in aWavelength Division Multiplexing (WDM) network. The selectionof lightpaths to be preempted relies on internal decisions of theRWA algorithm. Thus, if dedicated properties of the networktopology are required by the applications running on the network,these requirements have to be known to the RWA algorithm.We present a family of preemptive RWA algorithms for WDMnetworks. These algorithms have two distinguishing features: a)they can handle dynamic traffic by on-the-fly reconfiguration,and b) users can give feedback for reconfiguration decisions andthus influence the preemption decision of the RWA algorithm,leading to networks which adapt directly to application needs.This is different from traffic engineering where the network is(slowly) adapted to observed traffic patterns.Our algorithms handle various WDM network configurationsincluding networks consisting of heterogeneous WDM hardware.To this end, we are using the layered graph approach togetherwith a newly developed graph model that is used to determineconflicting lightpaths.","lang":"eng"}],"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-20T07:29:00Z","creator":"florida","date_updated":"2018-03-20T07:29:00Z","access_level":"closed","file_id":"1422","file_name":"339-IEEE-WK-14.pdf","file_size":138062}]},{"title":"Two-Sided Market and Game Console Vendors","user_id":"477","author":[{"full_name":"Fang Cheng, Terry","last_name":"Fang Cheng","first_name":"Terry"}],"date_created":"2017-10-17T12:41:58Z","_id":"341","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:14Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","citation":{"ama":"Fang Cheng T. <i>Two-Sided Market and Game Console Vendors</i>. Universität Paderborn; 2014.","ieee":"T. Fang Cheng, <i>Two-Sided Market and Game Console Vendors</i>. Universität Paderborn, 2014.","chicago":"Fang Cheng, Terry. <i>Two-Sided Market and Game Console Vendors</i>. Universität Paderborn, 2014.","apa":"Fang Cheng, T. (2014). <i>Two-Sided Market and Game Console Vendors</i>. Universität Paderborn.","short":"T. Fang Cheng, Two-Sided Market and Game Console Vendors, Universität Paderborn, 2014.","bibtex":"@book{Fang Cheng_2014, title={Two-Sided Market and Game Console Vendors}, publisher={Universität Paderborn}, author={Fang Cheng, Terry}, year={2014} }","mla":"Fang Cheng, Terry. <i>Two-Sided Market and Game Console Vendors</i>. Universität Paderborn, 2014."},"year":"2014","type":"bachelorsthesis"},{"date_created":"2017-10-17T12:41:58Z","author":[{"full_name":"Künsemöller, Jörn","last_name":"Künsemöller","first_name":"Jörn"}],"supervisor":[{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:16Z","title":"Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market","has_accepted_license":"1","citation":{"bibtex":"@book{Künsemöller_2014, title={Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market}, publisher={Universität Paderborn}, author={Künsemöller, Jörn}, year={2014} }","mla":"Künsemöller, Jörn. <i>Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market</i>. Universität Paderborn, 2014.","short":"J. Künsemöller, Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market, Universität Paderborn, 2014.","apa":"Künsemöller, J. (2014). <i>Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market</i>. Universität Paderborn.","chicago":"Künsemöller, Jörn. <i>Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market</i>. Universität Paderborn, 2014.","ieee":"J. Künsemöller, <i>Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market</i>. Universität Paderborn, 2014.","ama":"Künsemöller J. <i>Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market</i>. Universität Paderborn; 2014."},"year":"2014","user_id":"477","department":[{"_id":"75"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"343","file_date_updated":"2018-03-20T07:28:26Z","ddc":["040"],"type":"dissertation","file":[{"file_name":"343-2014_Diss_Kuensemoeller.pdf","file_id":"1421","access_level":"closed","file_size":1378657,"date_created":"2018-03-20T07:28:26Z","creator":"florida","date_updated":"2018-03-20T07:28:26Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public"},{"author":[{"first_name":"Sonja","full_name":"Brangewitz, Sonja","last_name":"Brangewitz"},{"first_name":"Alexander","last_name":"Jungmann","full_name":"Jungmann, Alexander"},{"first_name":"Ronald","full_name":"Petrlic, Ronald","last_name":"Petrlic"},{"first_name":"Marie Christin","full_name":"Platenius, Marie Christin","last_name":"Platenius"}],"date_created":"2017-10-17T12:41:59Z","date_updated":"2022-01-06T06:59:18Z","title":"Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services","has_accepted_license":"1","page":"49-57","citation":{"short":"S. Brangewitz, A. Jungmann, R. Petrlic, M.C. Platenius, in: Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION), 2014, pp. 49–57.","mla":"Brangewitz, Sonja, et al. “Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services.” <i>Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, 2014, pp. 49–57.","bibtex":"@inproceedings{Brangewitz_Jungmann_Petrlic_Platenius_2014, title={Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services}, booktitle={Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)}, author={Brangewitz, Sonja and Jungmann, Alexander and Petrlic, Ronald and Platenius, Marie Christin}, year={2014}, pages={49–57} }","apa":"Brangewitz, S., Jungmann, A., Petrlic, R., &#38; Platenius, M. C. (2014). Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services. In <i>Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i> (pp. 49–57).","ieee":"S. Brangewitz, A. Jungmann, R. Petrlic, and M. C. Platenius, “Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services,” in <i>Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, 2014, pp. 49–57.","chicago":"Brangewitz, Sonja, Alexander Jungmann, Ronald Petrlic, and Marie Christin Platenius. “Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services.” In <i>Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, 49–57, 2014.","ama":"Brangewitz S, Jungmann A, Petrlic R, Platenius MC. Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services. In: <i>Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>. ; 2014:49-57."},"year":"2014","department":[{"_id":"205"},{"_id":"76"}],"user_id":"477","_id":"346","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Project Area C","_id":"4"}],"file_date_updated":"2018-03-20T07:26:49Z","language":[{"iso":"eng"}],"ddc":["040"],"publication":"Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)","type":"conference","status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1418","access_level":"closed","file_name":"346-service_computation_2014_3_10_10005.pdf","file_size":334101,"creator":"florida","date_created":"2018-03-20T07:26:49Z","date_updated":"2018-03-20T07:26:49Z"}],"abstract":[{"lang":"eng","text":"One future goal of service-oriented computing is to realize global markets of composed services. On such markets, service providers offer services that can be flexibly combined with each other. However, most often, market participants are not able to individually estimate the quality of traded services in advance. As a consequence, even potentially profitable transactions between customers and providers might not take place. In the worst case, this can induce a market failure. To overcome this problem, we propose the incorporation of reputation information as an indicator for expected service quality. We address On-The-Fly Computing as a representative environment of markets of composed services. In this environment, customers provide feedback on transactions. We present a conceptual design of a reputation system which collects and processes user feedback, and provides it to participants in the market. Our contribution includes the identification of requirements for such a reputation system from a technical and an economic perspective. Based on these requirements, we propose a flexible solution that facilitates the incorporation of reputation information into markets of composed services while simultaneously preserving privacy of customers who provide feedback. The requirements we formulate in this paper have just been partially met in literature. An integrated approach, however, has not been addressed yet."}]},{"title":"The Interaction of Signals: A Fuzzy set Analysis of the Video Game Industry","date_created":"2017-10-17T12:42:00Z","author":[{"first_name":"Daniel","last_name":"Kaimann","id":"18949","full_name":"Kaimann, Daniel"},{"full_name":"Cox, Joe","last_name":"Cox","first_name":"Joe"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:20Z","citation":{"mla":"Kaimann, Daniel, and Joe Cox. <i>The Interaction of Signals: A Fuzzy Set Analysis of the Video Game Industry</i>. Universität Paderborn, 2014.","short":"D. Kaimann, J. Cox, The Interaction of Signals: A Fuzzy Set Analysis of the Video Game Industry, Universität Paderborn, 2014.","bibtex":"@book{Kaimann_Cox_2014, title={The Interaction of Signals: A Fuzzy set Analysis of the Video Game Industry}, publisher={Universität Paderborn}, author={Kaimann, Daniel and Cox, Joe}, year={2014} }","apa":"Kaimann, D., &#38; Cox, J. (2014). <i>The Interaction of Signals: A Fuzzy set Analysis of the Video Game Industry</i>. Universität Paderborn.","chicago":"Kaimann, Daniel, and Joe Cox. <i>The Interaction of Signals: A Fuzzy Set Analysis of the Video Game Industry</i>. Universität Paderborn, 2014.","ieee":"D. Kaimann and J. Cox, <i>The Interaction of Signals: A Fuzzy set Analysis of the Video Game Industry</i>. Universität Paderborn, 2014.","ama":"Kaimann D, Cox J. <i>The Interaction of Signals: A Fuzzy Set Analysis of the Video Game Industry</i>. Universität Paderborn; 2014."},"year":"2014","has_accepted_license":"1","language":[{"iso":"eng"}],"file_date_updated":"2018-03-20T07:24:40Z","ddc":["040"],"user_id":"477","department":[{"_id":"183"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"350","file":[{"file_size":739169,"file_id":"1416","access_level":"closed","file_name":"350-SSRN-id2456991.pdf","date_updated":"2018-03-20T07:24:40Z","creator":"florida","date_created":"2018-03-20T07:24:40Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","abstract":[{"lang":"eng","text":"Customers continuously evaluate the credibility and reliability of a range of signals both separately and jointly. However, existing econometric studies pay insufficient attention to the interactions and complex combinations of these signals, and are typically limited as a result of difficulties controlling for multicollinearity and endogeneity in their data. We develop a novel theoretical approach to address these issues and study different signaling effects (i.e., word-of-mouth, brand reputation, and distribution strategy) on customer perceptions. Using data on the US video games market, we apply a fuzzy set qualitative comparative analysis (fsQCA) to account for cause-effect relationships. The results of our study address a number of key issues in the economics and management literature. First, our results support the contention that reviews from professional critics act as a signal of product quality and therefore positively influence unit sales, as do the discriminatory effects of prices and restricted age ratings. Second, we find evidence to support the use of brand extension strategies as marketing tools that create spillover effects and support the launch of new products."}],"type":"report"},{"citation":{"short":"L. Holzweißig, The Impact of Customer Reviews and Reputation on Hotel Prices, Universität Paderborn, 2014.","mla":"Holzweißig, Lena. <i>The Impact of Customer Reviews and Reputation on Hotel Prices</i>. Universität Paderborn, 2014.","bibtex":"@book{Holzweißig_2014, title={The Impact of Customer Reviews and Reputation on Hotel Prices}, publisher={Universität Paderborn}, author={Holzweißig, Lena}, year={2014} }","apa":"Holzweißig, L. (2014). <i>The Impact of Customer Reviews and Reputation on Hotel Prices</i>. Universität Paderborn.","ama":"Holzweißig L. <i>The Impact of Customer Reviews and Reputation on Hotel Prices</i>. Universität Paderborn; 2014.","chicago":"Holzweißig, Lena. <i>The Impact of Customer Reviews and Reputation on Hotel Prices</i>. Universität Paderborn, 2014.","ieee":"L. Holzweißig, <i>The Impact of Customer Reviews and Reputation on Hotel Prices</i>. Universität Paderborn, 2014."},"year":"2014","title":"The Impact of Customer Reviews and Reputation on Hotel Prices","author":[{"first_name":"Lena","last_name":"Holzweißig","full_name":"Holzweißig, Lena"}],"date_created":"2017-10-17T12:42:00Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:20Z","status":"public","type":"mastersthesis","user_id":"477","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"351"},{"ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-20T07:24:10Z","_id":"352","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"19"},{"_id":"183"}],"user_id":"477","status":"public","file":[{"date_updated":"2018-03-20T07:24:10Z","date_created":"2018-03-20T07:24:10Z","creator":"florida","file_size":1609436,"file_id":"1415","access_level":"closed","file_name":"352-Diss_Veröffentlichung_Friedrich_Scheel.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"type":"dissertation","title":"The Economics of Individual Behavior in Competitive Environments: Empirical Evidence from Real-Life Tournaments","date_updated":"2022-01-06T06:59:21Z","publisher":"Universität Paderborn","author":[{"first_name":"Friedrich","full_name":"Scheel, Friedrich","last_name":"Scheel"}],"supervisor":[{"last_name":"Frick","full_name":"Frick, Bernd","first_name":"Bernd"}],"date_created":"2017-10-17T12:42:00Z","year":"2014","citation":{"chicago":"Scheel, Friedrich. <i>The Economics of Individual Behavior in Competitive Environments: Empirical Evidence from Real-Life Tournaments</i>. Universität Paderborn, 2014.","ieee":"F. Scheel, <i>The Economics of Individual Behavior in Competitive Environments: Empirical Evidence from Real-Life Tournaments</i>. Universität Paderborn, 2014.","ama":"Scheel F. <i>The Economics of Individual Behavior in Competitive Environments: Empirical Evidence from Real-Life Tournaments</i>. Universität Paderborn; 2014.","apa":"Scheel, F. (2014). <i>The Economics of Individual Behavior in Competitive Environments: Empirical Evidence from Real-Life Tournaments</i>. Universität Paderborn.","short":"F. Scheel, The Economics of Individual Behavior in Competitive Environments: Empirical Evidence from Real-Life Tournaments, Universität Paderborn, 2014.","mla":"Scheel, Friedrich. <i>The Economics of Individual Behavior in Competitive Environments: Empirical Evidence from Real-Life Tournaments</i>. Universität Paderborn, 2014.","bibtex":"@book{Scheel_2014, title={The Economics of Individual Behavior in Competitive Environments: Empirical Evidence from Real-Life Tournaments}, publisher={Universität Paderborn}, author={Scheel, Friedrich}, year={2014} }"},"has_accepted_license":"1"},{"has_accepted_license":"1","citation":{"short":"M. Keller, C. Robbert, H. Karl, in: Proceedings of 7th International Conference on Utility and Cloud Computing (UCC), 2014, pp. 387--395.","bibtex":"@inproceedings{Keller_Robbert_Karl_2014, title={Template Embedding: Using Application Architecture to Allocate Resources in Distributed Clouds}, DOI={<a href=\"https://doi.org/10.1109/UCC.2014.49\">10.1109/UCC.2014.49</a>}, booktitle={Proceedings of 7th International Conference on Utility and Cloud Computing (UCC)}, author={Keller, Matthias and Robbert, Christoph and Karl, Holger}, year={2014}, pages={387--395} }","mla":"Keller, Matthias, et al. “Template Embedding: Using Application Architecture to Allocate Resources in Distributed Clouds.” <i>Proceedings of 7th International Conference on Utility and Cloud Computing (UCC)</i>, 2014, pp. 387--395, doi:<a href=\"https://doi.org/10.1109/UCC.2014.49\">10.1109/UCC.2014.49</a>.","apa":"Keller, M., Robbert, C., &#38; Karl, H. (2014). Template Embedding: Using Application Architecture to Allocate Resources in Distributed Clouds. In <i>Proceedings of 7th International Conference on Utility and Cloud Computing (UCC)</i> (pp. 387--395). <a href=\"https://doi.org/10.1109/UCC.2014.49\">https://doi.org/10.1109/UCC.2014.49</a>","chicago":"Keller, Matthias, Christoph Robbert, and Holger Karl. “Template Embedding: Using Application Architecture to Allocate Resources in Distributed Clouds.” In <i>Proceedings of 7th International Conference on Utility and Cloud Computing (UCC)</i>, 387--395, 2014. <a href=\"https://doi.org/10.1109/UCC.2014.49\">https://doi.org/10.1109/UCC.2014.49</a>.","ieee":"M. Keller, C. Robbert, and H. Karl, “Template Embedding: Using Application Architecture to Allocate Resources in Distributed Clouds,” in <i>Proceedings of 7th International Conference on Utility and Cloud Computing (UCC)</i>, 2014, pp. 387--395.","ama":"Keller M, Robbert C, Karl H. Template Embedding: Using Application Architecture to Allocate Resources in Distributed Clouds. In: <i>Proceedings of 7th International Conference on Utility and Cloud Computing (UCC)</i>. ; 2014:387--395. doi:<a href=\"https://doi.org/10.1109/UCC.2014.49\">10.1109/UCC.2014.49</a>"},"page":"387--395","year":"2014","date_created":"2017-10-17T12:42:01Z","author":[{"first_name":"Matthias","full_name":"Keller, Matthias","last_name":"Keller"},{"first_name":"Christoph","full_name":"Robbert, Christoph","last_name":"Robbert"},{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"}],"date_updated":"2022-01-06T06:59:22Z","doi":"10.1109/UCC.2014.49","title":"Template Embedding: Using Application Architecture to Allocate Resources in Distributed Clouds","type":"conference","publication":"Proceedings of 7th International Conference on Utility and Cloud Computing (UCC)","file":[{"date_updated":"2018-03-20T07:23:02Z","date_created":"2018-03-20T07:23:02Z","creator":"florida","file_size":737652,"file_name":"354-keller_ucc14_preprint_01.pdf","access_level":"closed","file_id":"1413","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","abstract":[{"lang":"eng","text":"In distributed cloud computing, application deployment across multiple sites can improve quality of service. Recent research developed algorithms to find optimal locations for virtual machines. However, those algorithms assume to have either single-tier applications or a fixed number of virtual machines – a strong simplification of reality. This paper investigates the placement and scaling of complex application architectures. An application is dynamically scaled to fit both the current demand situation and the currently available infrastructure resources. We compare two approaches: The first one is based on virtual network embedding. The second approach is a novel method called Template Embedding. It is based on a hierarchical 1-allocation hub flow problem and combines applica- tion scaling and embedding in one step. Extensive experiments on 43200 network configurations showed that Template Embedding outperforms virtual network embedding in all cases in three metrics: success rate, solution quality, and runtime. This positive result shows that template embedding is a promising approach for distributed cloud resource allocation."}],"user_id":"15572","department":[{"_id":"75"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"354","file_date_updated":"2018-03-20T07:23:02Z","ddc":["040"]},{"doi":"10.20965/jaciii.2014.p0315","title":"Surrounding robots -- A discrete localized solution for the intruder problem","author":[{"first_name":"Laszlo","full_name":"Blazovics, Laszlo","last_name":"Blazovics"},{"last_name":"Lukovszki","full_name":"Lukovszki, Tamas","first_name":"Tamas"},{"full_name":"Forstner, Bertalan ","last_name":"Forstner","first_name":"Bertalan "}],"date_created":"2017-10-17T12:42:01Z","date_updated":"2022-01-06T06:59:25Z","publisher":"Fuji Technology Press Ltd.","citation":{"mla":"Blazovics, Laszlo, et al. “Surrounding Robots -- A Discrete Localized Solution for the Intruder Problem.” <i>Journal of Advanced Computational Intelligence and Intelligent Informatics</i>, no. 3, Fuji Technology Press Ltd., 2014, pp. 315--319, doi:<a href=\"https://doi.org/10.20965/jaciii.2014.p0315\">10.20965/jaciii.2014.p0315</a>.","bibtex":"@article{Blazovics_Lukovszki_Forstner_2014, title={Surrounding robots -- A discrete localized solution for the intruder problem}, DOI={<a href=\"https://doi.org/10.20965/jaciii.2014.p0315\">10.20965/jaciii.2014.p0315</a>}, number={3}, journal={Journal of Advanced Computational Intelligence and Intelligent Informatics}, publisher={Fuji Technology Press Ltd.}, author={Blazovics, Laszlo and Lukovszki, Tamas and Forstner, Bertalan }, year={2014}, pages={315--319} }","short":"L. Blazovics, T. Lukovszki, B. Forstner, Journal of Advanced Computational Intelligence and Intelligent Informatics (2014) 315--319.","apa":"Blazovics, L., Lukovszki, T., &#38; Forstner, B. (2014). Surrounding robots -- A discrete localized solution for the intruder problem. <i>Journal of Advanced Computational Intelligence and Intelligent Informatics</i>, (3), 315--319. <a href=\"https://doi.org/10.20965/jaciii.2014.p0315\">https://doi.org/10.20965/jaciii.2014.p0315</a>","ieee":"L. Blazovics, T. Lukovszki, and B. Forstner, “Surrounding robots -- A discrete localized solution for the intruder problem,” <i>Journal of Advanced Computational Intelligence and Intelligent Informatics</i>, no. 3, pp. 315--319, 2014.","chicago":"Blazovics, Laszlo, Tamas Lukovszki, and Bertalan  Forstner. “Surrounding Robots -- A Discrete Localized Solution for the Intruder Problem.” <i>Journal of Advanced Computational Intelligence and Intelligent Informatics</i>, no. 3 (2014): 315--319. <a href=\"https://doi.org/10.20965/jaciii.2014.p0315\">https://doi.org/10.20965/jaciii.2014.p0315</a>.","ama":"Blazovics L, Lukovszki T, Forstner B. Surrounding robots -- A discrete localized solution for the intruder problem. <i>Journal of Advanced Computational Intelligence and Intelligent Informatics</i>. 2014;(3):315--319. doi:<a href=\"https://doi.org/10.20965/jaciii.2014.p0315\">10.20965/jaciii.2014.p0315</a>"},"page":"315--319","year":"2014","issue":"3","has_accepted_license":"1","file_date_updated":"2018-03-20T07:21:58Z","ddc":["040"],"user_id":"477","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"356","file":[{"file_size":323838,"access_level":"closed","file_name":"356-Lukowski.pdf","file_id":"1411","date_updated":"2018-03-20T07:21:58Z","creator":"florida","date_created":"2018-03-20T07:21:58Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","abstract":[{"text":"Decentralized algorithms are often used in the cooperative robotics field, especially by large swarm systems. We present a distributed algorithm for a problem in which a group of autonomous mobile robots must surround a given target. These robots are oblivious, i.e., they have no memory of the past. They use only local sensing and need no dedicated communication among themselves. We introduce, then solve the problem in which the group of autonomous mobile robots must surround a given target – we call it the “discrete multiorbit target surrounding problem” (DMTSP). We evaluate our solution using simulation and prove that our solution invariably ensures that robots enclose the target in finite time. ","lang":"eng"}],"type":"journal_article","publication":"Journal of Advanced Computational Intelligence and Intelligent Informatics"},{"citation":{"short":"O. Ebel, Struktur und algorithmische Bestimmung stabiler Matchings in one-to-one Matching Märkten, Universität Paderborn, 2014.","bibtex":"@book{Ebel_2014, title={Struktur und algorithmische Bestimmung stabiler Matchings in one-to-one Matching Märkten}, publisher={Universität Paderborn}, author={Ebel, Olga}, year={2014} }","mla":"Ebel, Olga. <i>Struktur und algorithmische Bestimmung stabiler Matchings in one-to-one Matching Märkten</i>. Universität Paderborn, 2014.","apa":"Ebel, O. (2014). <i>Struktur und algorithmische Bestimmung stabiler Matchings in one-to-one Matching Märkten</i>. Universität Paderborn.","ieee":"O. Ebel, <i>Struktur und algorithmische Bestimmung stabiler Matchings in one-to-one Matching Märkten</i>. Universität Paderborn, 2014.","chicago":"Ebel, Olga. <i>Struktur und algorithmische Bestimmung stabiler Matchings in one-to-one Matching Märkten</i>. Universität Paderborn, 2014.","ama":"Ebel O. <i>Struktur und algorithmische Bestimmung stabiler Matchings in one-to-one Matching Märkten</i>. Universität Paderborn; 2014."},"year":"2014","title":"Struktur und algorithmische Bestimmung stabiler Matchings in one-to-one Matching Märkten","author":[{"first_name":"Olga","full_name":"Ebel, Olga","last_name":"Ebel"}],"date_created":"2017-10-17T12:42:01Z","date_updated":"2022-01-06T06:59:25Z","publisher":"Universität Paderborn","status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"user_id":"477","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"357"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"358","user_id":"477","department":[{"_id":"19"},{"_id":"205"}],"ddc":["040"],"file_date_updated":"2018-03-20T07:21:29Z","language":[{"iso":"eng"}],"type":"dissertation","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-20T07:21:29Z","creator":"florida","date_created":"2018-03-20T07:21:29Z","file_size":1230059,"file_id":"1410","file_name":"358-DissertationRoehl.pdf","access_level":"closed"}],"status":"public","date_updated":"2022-01-06T06:59:25Z","publisher":"Universität Paderborn","author":[{"last_name":"Röhl","full_name":"Röhl, Nils","first_name":"Nils"}],"supervisor":[{"id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen"}],"date_created":"2017-10-17T12:42:01Z","title":"Strategic and Cooperative Games in Network Economics","has_accepted_license":"1","year":"2014","citation":{"ama":"Röhl N. <i>Strategic and Cooperative Games in Network Economics</i>. Universität Paderborn; 2014.","ieee":"N. Röhl, <i>Strategic and Cooperative Games in Network Economics</i>. Universität Paderborn, 2014.","chicago":"Röhl, Nils. <i>Strategic and Cooperative Games in Network Economics</i>. Universität Paderborn, 2014.","bibtex":"@book{Röhl_2014, title={Strategic and Cooperative Games in Network Economics}, publisher={Universität Paderborn}, author={Röhl, Nils}, year={2014} }","short":"N. Röhl, Strategic and Cooperative Games in Network Economics, Universität Paderborn, 2014.","mla":"Röhl, Nils. <i>Strategic and Cooperative Games in Network Economics</i>. Universität Paderborn, 2014.","apa":"Röhl, N. (2014). <i>Strategic and Cooperative Games in Network Economics</i>. Universität Paderborn."}},{"year":"2014","citation":{"bibtex":"@inproceedings{Dräxler_Keller_Karl_2014, title={Specifying and Placing Chains of Virtual Network Functions}, DOI={<a href=\"https://doi.org/10.1109/CloudNet.2014.6968961\">10.1109/CloudNet.2014.6968961</a>}, booktitle={Proceedings of the 3rd International Conference on Cloud Networking (CloudNet)}, author={Dräxler, Sevil and Keller, Matthias and Karl, Holger}, year={2014}, pages={7–13} }","short":"S. Dräxler, M. Keller, H. Karl, in: Proceedings of the 3rd International Conference on Cloud Networking (CloudNet), 2014, pp. 7–13.","mla":"Dräxler, Sevil, et al. “Specifying and Placing Chains of Virtual Network Functions.” <i>Proceedings of the 3rd International Conference on Cloud Networking (CloudNet)</i>, 2014, pp. 7–13, doi:<a href=\"https://doi.org/10.1109/CloudNet.2014.6968961\">10.1109/CloudNet.2014.6968961</a>.","apa":"Dräxler, S., Keller, M., &#38; Karl, H. (2014). Specifying and Placing Chains of Virtual Network Functions. In <i>Proceedings of the 3rd International Conference on Cloud Networking (CloudNet)</i> (pp. 7–13). <a href=\"https://doi.org/10.1109/CloudNet.2014.6968961\">https://doi.org/10.1109/CloudNet.2014.6968961</a>","chicago":"Dräxler, Sevil, Matthias Keller, and Holger Karl. “Specifying and Placing Chains of Virtual Network Functions.” In <i>Proceedings of the 3rd International Conference on Cloud Networking (CloudNet)</i>, 7–13, 2014. <a href=\"https://doi.org/10.1109/CloudNet.2014.6968961\">https://doi.org/10.1109/CloudNet.2014.6968961</a>.","ieee":"S. Dräxler, M. Keller, and H. Karl, “Specifying and Placing Chains of Virtual Network Functions,” in <i>Proceedings of the 3rd International Conference on Cloud Networking (CloudNet)</i>, 2014, pp. 7–13.","ama":"Dräxler S, Keller M, Karl H. Specifying and Placing Chains of Virtual Network Functions. In: <i>Proceedings of the 3rd International Conference on Cloud Networking (CloudNet)</i>. ; 2014:7-13. doi:<a href=\"https://doi.org/10.1109/CloudNet.2014.6968961\">10.1109/CloudNet.2014.6968961</a>"},"page":"7-13","has_accepted_license":"1","title":"Specifying and Placing Chains of Virtual Network Functions","doi":"10.1109/CloudNet.2014.6968961","date_updated":"2022-01-06T06:59:27Z","oa":"1","author":[{"first_name":"Sevil","full_name":"Dräxler, Sevil","id":"31764","last_name":"Dräxler"},{"last_name":"Keller","full_name":"Keller, Matthias","first_name":"Matthias"},{"last_name":"Karl","id":"126","full_name":"Karl, Holger","first_name":"Holger"}],"date_created":"2017-10-17T12:42:02Z","urn":"3601","abstract":[{"lang":"eng","text":"Network appliances perform different functions on network flows and constitute an important part of an operator’s network. Normally, a set of chained network functions process network flows. Following the trend of virtualization of networks, virtualization of the network functions has also become a topic of interest. We define a model for formalizing the chaining of network functions using a context-free language. We process deployment requests and construct virtual network function graphs that can be mapped to the network. We describe the mapping as a Mixed Integer Quadratically Constrained Program (MIQCP) for finding the placement of the network functions and chaining them together considering the limited network resources and requirements of the functions. We have performed a Pareto set analysis to investigate the possible trade-offs between different optimization objectives. "}],"file":[{"relation":"main_file","content_type":"application/pdf","file_name":"360-Mehr1410_Specifying_preprint_01.pdf","file_id":"1409","access_level":"open_access","file_size":422019,"date_created":"2018-03-20T07:21:01Z","creator":"florida","date_updated":"2018-06-25T08:08:44Z"}],"status":"public","type":"conference","publication":"Proceedings of the 3rd International Conference on Cloud Networking (CloudNet)","ddc":["040"],"file_date_updated":"2018-06-25T08:08:44Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"360","user_id":"31764","department":[{"_id":"75"}]},{"user_id":"15504","department":[{"_id":"75"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"361","type":"bachelorsthesis","status":"public","author":[{"first_name":"Daniel","full_name":"Roeske, Daniel","last_name":"Roeske"}],"date_created":"2017-10-17T12:42:02Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:27Z","title":"Simulating load-dependent operation of picocells","citation":{"ama":"Roeske D. <i>Simulating Load-Dependent Operation of Picocells</i>. Universität Paderborn; 2014.","ieee":"D. Roeske, <i>Simulating load-dependent operation of picocells</i>. Universität Paderborn, 2014.","chicago":"Roeske, Daniel. <i>Simulating Load-Dependent Operation of Picocells</i>. Universität Paderborn, 2014.","short":"D. Roeske, Simulating Load-Dependent Operation of Picocells, Universität Paderborn, 2014.","mla":"Roeske, Daniel. <i>Simulating Load-Dependent Operation of Picocells</i>. Universität Paderborn, 2014.","bibtex":"@book{Roeske_2014, title={Simulating load-dependent operation of picocells}, publisher={Universität Paderborn}, author={Roeske, Daniel}, year={2014} }","apa":"Roeske, D. (2014). <i>Simulating load-dependent operation of picocells</i>. Universität Paderborn."},"year":"2014"},{"type":"bachelorsthesis","status":"public","department":[{"_id":"280"}],"user_id":"42447","_id":"362","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"language":[{"iso":"ger"}],"citation":{"apa":"Kaiser, S. (2014). <i>Signalisieren und Screening in Arbeitsmärkten - die Experimente von Brandts &#38; Holt und Kübler et. al</i>. Universität Paderborn.","bibtex":"@book{Kaiser_2014, title={Signalisieren und Screening in Arbeitsmärkten - die Experimente von Brandts &#38; Holt und Kübler et. al}, publisher={Universität Paderborn}, author={Kaiser, Sarah}, year={2014} }","short":"S. Kaiser, Signalisieren und Screening in Arbeitsmärkten - die Experimente von Brandts &#38; Holt und Kübler et. al, Universität Paderborn, 2014.","mla":"Kaiser, Sarah. <i>Signalisieren und Screening in Arbeitsmärkten - die Experimente von Brandts &#38; Holt und Kübler et. al</i>. Universität Paderborn, 2014.","ama":"Kaiser S. <i>Signalisieren und Screening in Arbeitsmärkten - die Experimente von Brandts &#38; Holt und Kübler et. al</i>. Universität Paderborn; 2014.","chicago":"Kaiser, Sarah. <i>Signalisieren und Screening in Arbeitsmärkten - die Experimente von Brandts &#38; Holt und Kübler et. al</i>. Universität Paderborn, 2014.","ieee":"S. Kaiser, <i>Signalisieren und Screening in Arbeitsmärkten - die Experimente von Brandts &#38; Holt und Kübler et. al</i>. Universität Paderborn, 2014."},"year":"2014","author":[{"full_name":"Kaiser, Sarah","last_name":"Kaiser","first_name":"Sarah"}],"supervisor":[{"first_name":"Burkhard","id":"37339","full_name":"Hehenkamp, Burkhard","last_name":"Hehenkamp"}],"date_created":"2017-10-17T12:42:02Z","date_updated":"2022-01-06T06:59:27Z","publisher":"Universität Paderborn","title":"Signalisieren und Screening in Arbeitsmärkten - die Experimente von Brandts & Holt und Kübler et. al"},{"type":"conference","publication":"Proceedings of the International Conference on Collaboration Technologies and Systems (CTS)","abstract":[{"text":"Online social networks are attracting billions of nowadays, both on a global scale as well as in social enterprise networks. Using distributed hash tables and peer-to-peer technology allows online social networks to be operated securely and efficiently only by using the resources of the user devices, thus alleviating censorship or data misuse by a single network operator. In this paper, we address the challenges that arise in implementing reliably and conveniently to use distributed data structures, such as lists or sets, in such a distributed hash-tablebased online social network. We present a secure, distributed list data structure that manages the list entries in several buckets in the distributed hash table. The list entries are authenticated, integrity is maintained and access control for single users and also groups is integrated. The approach for secure distributed lists is also applied for prefix trees and sets, and implemented and evaluated in a peer-to-peer framework for social networks. Evaluation shows that the distributed data structure is convenient and efficient to use and that the requirements on security hold.","lang":"eng"}],"file":[{"file_id":"1404","access_level":"closed","file_name":"367-cts_conf.pdf","file_size":647997,"creator":"florida","date_created":"2018-03-20T07:18:12Z","date_updated":"2018-03-20T07:18:12Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"367","user_id":"477","department":[{"_id":"79"}],"ddc":["040"],"file_date_updated":"2018-03-20T07:18:12Z","language":[{"iso":"eng"}],"has_accepted_license":"1","year":"2014","citation":{"bibtex":"@inproceedings{Janiuk_Mäcker_Graffi_2014, title={Secure Distributed Data Structures for Peer-to-Peer-based Social Networks}, DOI={<a href=\"https://doi.org/10.1109/CTS.2014.6867595\">10.1109/CTS.2014.6867595</a>}, booktitle={Proceedings of the International Conference on Collaboration Technologies and Systems (CTS)}, author={Janiuk, Jens and Mäcker, Alexander and Graffi, Kalman}, year={2014}, pages={396–405} }","short":"J. Janiuk, A. Mäcker, K. Graffi, in: Proceedings of the International Conference on Collaboration Technologies and Systems (CTS), 2014, pp. 396–405.","mla":"Janiuk, Jens, et al. “Secure Distributed Data Structures for Peer-to-Peer-Based Social Networks.” <i>Proceedings of the International Conference on Collaboration Technologies and Systems (CTS)</i>, 2014, pp. 396–405, doi:<a href=\"https://doi.org/10.1109/CTS.2014.6867595\">10.1109/CTS.2014.6867595</a>.","apa":"Janiuk, J., Mäcker, A., &#38; Graffi, K. (2014). Secure Distributed Data Structures for Peer-to-Peer-based Social Networks. In <i>Proceedings of the International Conference on Collaboration Technologies and Systems (CTS)</i> (pp. 396–405). <a href=\"https://doi.org/10.1109/CTS.2014.6867595\">https://doi.org/10.1109/CTS.2014.6867595</a>","chicago":"Janiuk, Jens, Alexander Mäcker, and Kalman Graffi. “Secure Distributed Data Structures for Peer-to-Peer-Based Social Networks.” In <i>Proceedings of the International Conference on Collaboration Technologies and Systems (CTS)</i>, 396–405, 2014. <a href=\"https://doi.org/10.1109/CTS.2014.6867595\">https://doi.org/10.1109/CTS.2014.6867595</a>.","ieee":"J. Janiuk, A. Mäcker, and K. Graffi, “Secure Distributed Data Structures for Peer-to-Peer-based Social Networks,” in <i>Proceedings of the International Conference on Collaboration Technologies and Systems (CTS)</i>, 2014, pp. 396–405.","ama":"Janiuk J, Mäcker A, Graffi K. Secure Distributed Data Structures for Peer-to-Peer-based Social Networks. In: <i>Proceedings of the International Conference on Collaboration Technologies and Systems (CTS)</i>. ; 2014:396-405. doi:<a href=\"https://doi.org/10.1109/CTS.2014.6867595\">10.1109/CTS.2014.6867595</a>"},"page":"396-405","date_updated":"2022-01-06T06:59:29Z","date_created":"2017-10-17T12:42:03Z","author":[{"first_name":"Jens","last_name":"Janiuk","full_name":"Janiuk, Jens"},{"first_name":"Alexander","full_name":"Mäcker, Alexander","id":"13536","last_name":"Mäcker"},{"first_name":"Kalman","full_name":"Graffi, Kalman","last_name":"Graffi"}],"title":"Secure Distributed Data Structures for Peer-to-Peer-based Social Networks","doi":"10.1109/CTS.2014.6867595"},{"author":[{"first_name":"Tobias","last_name":"Harks","full_name":"Harks, Tobias"},{"full_name":"Höfer, Martin","last_name":"Höfer","first_name":"Martin"},{"first_name":"Kevin","full_name":"Schewior, Kevin","last_name":"Schewior"},{"first_name":"Alexander","full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik"}],"date_created":"2017-10-17T12:42:04Z","date_updated":"2022-01-06T06:59:30Z","doi":"10.1109/TNET.2015.2468571","title":"Routing Games with Progressive Filling","has_accepted_license":"1","page":"352-360","citation":{"apa":"Harks, T., Höfer, M., Schewior, K., &#38; Skopalik, A. (2014). Routing Games with Progressive Filling. In <i>Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14)</i> (pp. 352–360). <a href=\"https://doi.org/10.1109/TNET.2015.2468571\">https://doi.org/10.1109/TNET.2015.2468571</a>","bibtex":"@inproceedings{Harks_Höfer_Schewior_Skopalik_2014, title={Routing Games with Progressive Filling}, DOI={<a href=\"https://doi.org/10.1109/TNET.2015.2468571\">10.1109/TNET.2015.2468571</a>}, booktitle={Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14)}, author={Harks, Tobias and Höfer, Martin and Schewior, Kevin and Skopalik, Alexander}, year={2014}, pages={352–360} }","mla":"Harks, Tobias, et al. “Routing Games with Progressive Filling.” <i>Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14)</i>, 2014, pp. 352–60, doi:<a href=\"https://doi.org/10.1109/TNET.2015.2468571\">10.1109/TNET.2015.2468571</a>.","short":"T. Harks, M. Höfer, K. Schewior, A. Skopalik, in: Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14), 2014, pp. 352–360.","chicago":"Harks, Tobias, Martin Höfer, Kevin Schewior, and Alexander Skopalik. “Routing Games with Progressive Filling.” In <i>Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14)</i>, 352–60, 2014. <a href=\"https://doi.org/10.1109/TNET.2015.2468571\">https://doi.org/10.1109/TNET.2015.2468571</a>.","ieee":"T. Harks, M. Höfer, K. Schewior, and A. Skopalik, “Routing Games with Progressive Filling,” in <i>Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14)</i>, 2014, pp. 352–360.","ama":"Harks T, Höfer M, Schewior K, Skopalik A. Routing Games with Progressive Filling. In: <i>Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14)</i>. ; 2014:352-360. doi:<a href=\"https://doi.org/10.1109/TNET.2015.2468571\">10.1109/TNET.2015.2468571</a>"},"year":"2014","department":[{"_id":"63"},{"_id":"541"}],"user_id":"477","_id":"370","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file_date_updated":"2018-03-20T07:17:04Z","language":[{"iso":"eng"}],"ddc":["040"],"publication":"Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM'14)","type":"conference","status":"public","file":[{"date_updated":"2018-03-20T07:17:04Z","creator":"florida","date_created":"2018-03-20T07:17:04Z","file_size":179583,"file_name":"370-HHSS14.pdf","access_level":"closed","file_id":"1402","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"text":"Max-min fairness (MMF) is a widely known approach to a fair allocation of bandwidth to each of the users in a network. This allocation can be computed by uniformly raising the bandwidths of all users without violating capacity constraints. We consider an extension of these allocations by raising the bandwidth with arbitrary and not necessarily uniform time-depending velocities (allocation rates). These allocations are used in a game-theoretic context for routing choices, which we formalize in progressive filling games (PFGs).We present a variety of results for equilibria in PFGs. We show that these games possess pure Nash and strong equilibria. While computation in general is NP-hard, there are polynomial-time algorithms for prominent classes of Max-Min-Fair Games (MMFG), including the case when all users have the same source-destination pair. We characterize prices of anarchy and stability for pure Nash and strong equilibria in PFGs and MMFGs when players have different or the same source-destination pairs. In addition, we show that when a designer can adjust allocation rates, it is possible to design games with optimal strong equilibria. Some initial results on polynomial-time algorithms in this direction are also derived. ","lang":"eng"}]},{"publication":"Proceedings of the SIGCOMM workshop on Distributed cloud computing","type":"conference","abstract":[{"text":"In the near future many more compute resources will be available at different geographical locations. To minimize the response time of requests, application servers closer to the user can hence be used to shorten network round trip times. However, this advantage is neutralized if the used data centre is highly loaded as the processing time of re- quests is important as well. We model the request response time as the network round trip time plus the processing time at a data centre.We present a capacitated facility location problem formal- ization where the processing time is modelled as the sojourn time of a queueing model. We discuss the Pareto trade-off between the number of used data centres and the resulting response time. For example, using fewer data centres could cut expenses but results in high utilization, high response time, and smaller revenues.Previous work presented a non-linear cost function. We prove its convexity and exploit this property in two ways: First, we transform the convex model into a linear model while controlling the maximum approximation error. Sec- ond, we used a convex solver instead of a slower non-linear solver. Numerical results on network topologies exemplify our work.","lang":"eng"}],"status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"5259","file_name":"p47-keller.pdf","file_size":804240,"date_created":"2018-11-02T14:00:54Z","creator":"ups","date_updated":"2018-11-02T14:00:54Z"}],"_id":"372","project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"75"}],"user_id":"477","ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T14:00:54Z","has_accepted_license":"1","year":"2014","page":"47--52","citation":{"apa":"Keller, M., &#38; Karl, H. (2014). Response Time-Optimized Distributed Cloud Resource Allocation. In <i>Proceedings of the SIGCOMM workshop on Distributed cloud computing</i> (pp. 47--52). <a href=\"https://doi.org/10.1145/2627566.2627570\">https://doi.org/10.1145/2627566.2627570</a>","bibtex":"@inproceedings{Keller_Karl_2014, title={Response Time-Optimized Distributed Cloud Resource Allocation}, DOI={<a href=\"https://doi.org/10.1145/2627566.2627570\">10.1145/2627566.2627570</a>}, booktitle={Proceedings of the SIGCOMM workshop on Distributed cloud computing}, author={Keller, Matthias and Karl, Holger}, year={2014}, pages={47--52} }","short":"M. Keller, H. Karl, in: Proceedings of the SIGCOMM Workshop on Distributed Cloud Computing, 2014, pp. 47--52.","mla":"Keller, Matthias, and Holger Karl. “Response Time-Optimized Distributed Cloud Resource Allocation.” <i>Proceedings of the SIGCOMM Workshop on Distributed Cloud Computing</i>, 2014, pp. 47--52, doi:<a href=\"https://doi.org/10.1145/2627566.2627570\">10.1145/2627566.2627570</a>.","ama":"Keller M, Karl H. Response Time-Optimized Distributed Cloud Resource Allocation. In: <i>Proceedings of the SIGCOMM Workshop on Distributed Cloud Computing</i>. ; 2014:47--52. doi:<a href=\"https://doi.org/10.1145/2627566.2627570\">10.1145/2627566.2627570</a>","ieee":"M. Keller and H. Karl, “Response Time-Optimized Distributed Cloud Resource Allocation,” in <i>Proceedings of the SIGCOMM workshop on Distributed cloud computing</i>, 2014, pp. 47--52.","chicago":"Keller, Matthias, and Holger Karl. “Response Time-Optimized Distributed Cloud Resource Allocation.” In <i>Proceedings of the SIGCOMM Workshop on Distributed Cloud Computing</i>, 47--52, 2014. <a href=\"https://doi.org/10.1145/2627566.2627570\">https://doi.org/10.1145/2627566.2627570</a>."},"date_updated":"2022-01-06T06:59:31Z","date_created":"2017-10-17T12:42:04Z","author":[{"first_name":"Matthias","full_name":"Keller, Matthias","last_name":"Keller"},{"full_name":"Karl, Holger","id":"126","last_name":"Karl","first_name":"Holger"}],"title":"Response Time-Optimized Distributed Cloud Resource Allocation","doi":"10.1145/2627566.2627570"},{"date_created":"2017-10-17T12:42:04Z","supervisor":[{"full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik","first_name":"Alexander"}],"author":[{"last_name":"Pahl","full_name":"Pahl, David","first_name":"David"}],"date_updated":"2022-01-06T06:59:31Z","publisher":"Universität Paderborn","title":"Reputationssysteme für zusammengesetzte Dienstleistungen","citation":{"apa":"Pahl, D. (2014). <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>. Universität Paderborn.","bibtex":"@book{Pahl_2014, title={Reputationssysteme für zusammengesetzte Dienstleistungen}, publisher={Universität Paderborn}, author={Pahl, David}, year={2014} }","short":"D. Pahl, Reputationssysteme für zusammengesetzte Dienstleistungen, Universität Paderborn, 2014.","mla":"Pahl, David. <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>. Universität Paderborn, 2014.","ama":"Pahl D. <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>. Universität Paderborn; 2014.","ieee":"D. Pahl, <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>. Universität Paderborn, 2014.","chicago":"Pahl, David. <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>. Universität Paderborn, 2014."},"year":"2014","department":[{"_id":"63"},{"_id":"541"}],"user_id":"14052","_id":"373","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public"},{"title":"Reducing Energy Consumption of Radio Access Networks","date_created":"2017-10-17T12:42:05Z","supervisor":[{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"}],"author":[{"first_name":"Matthias","full_name":"Herlich, Matthias","last_name":"Herlich"}],"date_updated":"2022-01-06T06:59:35Z","publisher":"Universität Paderborn","citation":{"apa":"Herlich, M. (2014). <i>Reducing Energy Consumption of Radio Access Networks</i>. Universität Paderborn.","bibtex":"@book{Herlich_2014, title={Reducing Energy Consumption of Radio Access Networks}, publisher={Universität Paderborn}, author={Herlich, Matthias}, year={2014} }","mla":"Herlich, Matthias. <i>Reducing Energy Consumption of Radio Access Networks</i>. Universität Paderborn, 2014.","short":"M. Herlich, Reducing Energy Consumption of Radio Access Networks, Universität Paderborn, 2014.","ama":"Herlich M. <i>Reducing Energy Consumption of Radio Access Networks</i>. Universität Paderborn; 2014.","ieee":"M. Herlich, <i>Reducing Energy Consumption of Radio Access Networks</i>. Universität Paderborn, 2014.","chicago":"Herlich, Matthias. <i>Reducing Energy Consumption of Radio Access Networks</i>. Universität Paderborn, 2014."},"year":"2014","has_accepted_license":"1","file_date_updated":"2018-03-20T07:14:52Z","ddc":["040"],"user_id":"477","department":[{"_id":"75"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"376","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":1476366,"file_id":"1398","file_name":"376-Herlich-Dissertation.pdf","access_level":"closed","date_updated":"2018-03-20T07:14:52Z","creator":"florida","date_created":"2018-03-20T07:14:52Z"}],"status":"public","abstract":[{"text":"Radio access networks (RANs) have become one of the largest energy consumers of communication technology [LLH+13] and their energy consumption is predicted to increase [FFMB11]. To reduce the energy consumption of RANs different techniques have been proposed. One of the most promising techniques is the use of a low-power sleep mode. However, a sleep mode can also reduce the performance. In this dissertation, I quantify how much energy can be conserved with a sleep mode and which negative effects it has on the performance of RANs. Additionally, I analyze how a sleep mode can be enabled more often and how the performance can be kept high. First, I quantify the effect of power-cycle durations on energy consumption and latency in an abstract queuing system. This results in a trade-off between energy consumption and latency for a single base station (BS). Second, I show that considering a network as a whole (instead of each BS individually) allows the energy consumption to be reduced even further. After these analyses, which are not specific for RANs, I study RANs for the rest of the dissertation. RANs need to both detect and execute the requests of users. Because detection and execution of requests have different requirements, I analyze them independently. I quantify how the number of active BSs can be reduced if the detection ranges of BSs are increased by cooperative transmissions. Next, I analyze how more BSs can be deactivated if the remaining active BSs cooperate to transmit data to the users. However, in addition to increasing the range, cooperative transmissions also radiate more power. This results in higher interference for other users which slows their transmissions down and, thus, increases energy consumption. Therefore, I describe how the radiated power of cooperative transmissions can be reduced if instantaneous channel knowledge is available. Because the implementation in real hardware is impractical for demonstration purposes, I show the results of a simulation that incorporates all effects I studied analytically earlier. In conclusion, I show that a sleep mode can reduce the energy consumption of RANs if applied correctly. To apply a sleep mode correctly, it is necessary to consider power-cycle durations, power profiles, and the interaction of BSs. When this knowledge is combined the energy consumption of RANs can be reduced with only a slight loss of performance. Because this results in a trade-off between energy consumption and performance, each RAN operator has to decide which trade-off is preferred.","lang":"eng"}],"type":"dissertation"},{"page":"591-612","citation":{"bibtex":"@article{Kniesburges_Koutsopoulos_Scheideler_2014, title={Re-Chord: A Self-stabilizing Chord Overlay Network}, DOI={<a href=\"https://doi.org/10.1007/s00224-012-9431-2\">10.1007/s00224-012-9431-2</a>}, number={3}, journal={Theory of Computing Systems}, publisher={Springer}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2014}, pages={591–612} }","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, Theory of Computing Systems (2014) 591–612.","mla":"Kniesburges, Sebastian, et al. “Re-Chord: A Self-Stabilizing Chord Overlay Network.” <i>Theory of Computing Systems</i>, no. 3, Springer, 2014, pp. 591–612, doi:<a href=\"https://doi.org/10.1007/s00224-012-9431-2\">10.1007/s00224-012-9431-2</a>.","apa":"Kniesburges, S., Koutsopoulos, A., &#38; Scheideler, C. (2014). Re-Chord: A Self-stabilizing Chord Overlay Network. <i>Theory of Computing Systems</i>, (3), 591–612. <a href=\"https://doi.org/10.1007/s00224-012-9431-2\">https://doi.org/10.1007/s00224-012-9431-2</a>","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “Re-Chord: A Self-Stabilizing Chord Overlay Network.” <i>Theory of Computing Systems</i>, no. 3 (2014): 591–612. <a href=\"https://doi.org/10.1007/s00224-012-9431-2\">https://doi.org/10.1007/s00224-012-9431-2</a>.","ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “Re-Chord: A Self-stabilizing Chord Overlay Network,” <i>Theory of Computing Systems</i>, no. 3, pp. 591–612, 2014.","ama":"Kniesburges S, Koutsopoulos A, Scheideler C. Re-Chord: A Self-stabilizing Chord Overlay Network. <i>Theory of Computing Systems</i>. 2014;(3):591-612. doi:<a href=\"https://doi.org/10.1007/s00224-012-9431-2\">10.1007/s00224-012-9431-2</a>"},"year":"2014","issue":"3","has_accepted_license":"1","doi":"10.1007/s00224-012-9431-2","title":"Re-Chord: A Self-stabilizing Chord Overlay Network","author":[{"first_name":"Sebastian","last_name":"Kniesburges","full_name":"Kniesburges, Sebastian"},{"first_name":"Andreas","last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2017-10-17T12:42:05Z","date_updated":"2022-01-06T06:59:35Z","publisher":"Springer","status":"public","file":[{"access_level":"closed","file_id":"1396","file_name":"378-re-chord_journal.pdf","file_size":310961,"date_created":"2018-03-20T07:13:36Z","creator":"florida","date_updated":"2018-03-20T07:13:36Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"The Chord peer-to-peer system is considered, together with CAN, Tapestry and Pastry, as one of the pioneering works on peer-to-peer distributed hash tables (DHT) that inspired a large volume of papers and projects on DHTs as well as peer-to-peer systems in general. Chord, in particular, has been studied thoroughly, and many variants of Chord have been presented that optimize various criteria. Also, several implementations of Chord are available on various platforms. Though Chord is known to be very efficient and scalable and it can handle churn quite well, no protocol is known yet that guarantees that Chord is self-stabilizing, i.e., the Chord network can be recovered from any initial state in which the network is still weakly connected. This is not too surprising since it is known that the Chord network is not locally checkable for its current topology. We present a slight extension of the Chord network, called Re-Chord (reactive Chord), that turns out to be locally checkable, and we present a self-stabilizing distributed protocol for it that can recover the Re-Chord network from any initial state, in which the n peers are weakly connected, in O(nlogn) communication rounds. We also show that our protocol allows a new peer to join or an old peer to leave an already stable Re-Chord network so that within O(logn)^2) communication rounds the Re-Chord network is stable again."}],"publication":"Theory of Computing Systems","type":"journal_article","file_date_updated":"2018-03-20T07:13:36Z","ddc":["040"],"department":[{"_id":"79"}],"user_id":"477","_id":"378","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"},{"name":"SFB 901 - Project Area A","_id":"2"}]}]