[{"has_accepted_license":"1","date_updated":"2022-01-06T06:59:25Z","author":[{"full_name":"Röhl, Nils","last_name":"Röhl","first_name":"Nils"}],"title":"Strategic and Cooperative Games in Network Economics","year":"2014","status":"public","user_id":"477","ddc":["040"],"_id":"358","language":[{"iso":"eng"}],"publisher":"Universität Paderborn","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"chicago":"Röhl, Nils. <i>Strategic and Cooperative Games in Network Economics</i>. Universität Paderborn, 2014.","short":"N. Röhl, Strategic and Cooperative Games in Network Economics, Universität Paderborn, 2014.","apa":"Röhl, N. (2014). <i>Strategic and Cooperative Games in Network Economics</i>. Universität Paderborn.","ieee":"N. Röhl, <i>Strategic and Cooperative Games in Network Economics</i>. Universität Paderborn, 2014.","ama":"Röhl N. <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} }","mla":"Röhl, Nils. <i>Strategic and Cooperative Games in Network Economics</i>. Universität Paderborn, 2014."},"supervisor":[{"last_name":"Haake","first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","id":"20801"}],"file_date_updated":"2018-03-20T07:21:29Z","department":[{"_id":"19"},{"_id":"205"}],"type":"dissertation","date_created":"2017-10-17T12:42:01Z","file":[{"access_level":"closed","file_size":1230059,"file_name":"358-DissertationRoehl.pdf","date_updated":"2018-03-20T07:21:29Z","relation":"main_file","content_type":"application/pdf","success":1,"file_id":"1410","creator":"florida","date_created":"2018-03-20T07:21:29Z"}]},{"date_created":"2017-10-17T12:42:02Z","type":"mastersthesis","citation":{"bibtex":"@book{Töws_2014, title={Statistisches Testen von unbeweisbaren Anforderungen an Programmspezifikationen in SMT-LIB}, publisher={Universität Paderborn}, author={Töws, Manuel}, year={2014} }","ama":"Töws M. <i>Statistisches Testen von unbeweisbaren Anforderungen an Programmspezifikationen in SMT-LIB</i>. Universität Paderborn; 2014.","mla":"Töws, Manuel. <i>Statistisches Testen von unbeweisbaren Anforderungen an Programmspezifikationen in SMT-LIB</i>. Universität Paderborn, 2014.","short":"M. Töws, Statistisches Testen von unbeweisbaren Anforderungen an Programmspezifikationen in SMT-LIB, Universität Paderborn, 2014.","chicago":"Töws, Manuel. <i>Statistisches Testen von unbeweisbaren Anforderungen an Programmspezifikationen in SMT-LIB</i>. Universität Paderborn, 2014.","ieee":"M. Töws, <i>Statistisches Testen von unbeweisbaren Anforderungen an Programmspezifikationen in SMT-LIB</i>. Universität Paderborn, 2014.","apa":"Töws, M. (2014). <i>Statistisches Testen von unbeweisbaren Anforderungen an Programmspezifikationen in SMT-LIB</i>. Universität Paderborn."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"_id":"3","name":"SFB 901 - Project Area B"}],"language":[{"iso":"ger"}],"_id":"359","publisher":"Universität Paderborn","user_id":"15504","status":"public","year":"2014","title":"Statistisches Testen von unbeweisbaren Anforderungen an Programmspezifikationen in SMT-LIB","author":[{"id":"11315","full_name":"Töws, Manuel","first_name":"Manuel","last_name":"Töws"}],"date_updated":"2022-01-06T06:59:26Z"},{"publication":"Proceedings of the 3rd International Conference on Cloud Networking (CloudNet)","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":[{"date_created":"2018-03-20T07:21:01Z","creator":"florida","content_type":"application/pdf","file_id":"1409","date_updated":"2018-06-25T08:08:44Z","relation":"main_file","access_level":"open_access","file_size":422019,"file_name":"360-Mehr1410_Specifying_preprint_01.pdf"}],"date_created":"2017-10-17T12:42:02Z","type":"conference","department":[{"_id":"75"}],"year":"2014","title":"Specifying and Placing Chains of Virtual Network Functions","author":[{"first_name":"Sevil","last_name":"Dräxler","full_name":"Dräxler, Sevil","id":"31764"},{"first_name":"Matthias","last_name":"Keller","full_name":"Keller, Matthias"},{"id":"126","last_name":"Karl","first_name":"Holger","full_name":"Karl, Holger"}],"date_updated":"2022-01-06T06:59:27Z","doi":"10.1109/CloudNet.2014.6968961","file_date_updated":"2018-06-25T08:08:44Z","citation":{"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>.","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} }","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>","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.","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>.","short":"S. Dräxler, M. Keller, H. Karl, in: Proceedings of the 3rd International Conference on Cloud Networking (CloudNet), 2014, pp. 7–13."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"oa":"1","status":"public","has_accepted_license":"1","page":"7-13","urn":"3601","_id":"360","user_id":"31764","ddc":["040"]},{"date_updated":"2022-01-06T06:59:27Z","year":"2014","title":"Simulating load-dependent operation of picocells","status":"public","author":[{"last_name":"Roeske","first_name":"Daniel","full_name":"Roeske, Daniel"}],"user_id":"15504","_id":"361","publisher":"Universität Paderborn","project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}],"citation":{"ama":"Roeske D. <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} }","mla":"Roeske, Daniel. <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.","apa":"Roeske, D. (2014). <i>Simulating load-dependent operation of picocells</i>. Universität Paderborn.","ieee":"D. Roeske, <i>Simulating load-dependent operation of picocells</i>. Universität Paderborn, 2014."},"type":"bachelorsthesis","department":[{"_id":"75"}],"date_created":"2017-10-17T12:42:02Z"},{"date_created":"2017-10-17T12:42:02Z","department":[{"_id":"280"}],"type":"bachelorsthesis","citation":{"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.","short":"S. Kaiser, Signalisieren und Screening in Arbeitsmärkten - die Experimente von Brandts &#38; Holt und Kübler et. al, 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.","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} }","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.","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."},"supervisor":[{"id":"37339","last_name":"Hehenkamp","first_name":"Burkhard","full_name":"Hehenkamp, Burkhard"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"publisher":"Universität Paderborn","_id":"362","language":[{"iso":"ger"}],"user_id":"42447","author":[{"full_name":"Kaiser, Sarah","last_name":"Kaiser","first_name":"Sarah"}],"status":"public","year":"2014","title":"Signalisieren und Screening in Arbeitsmärkten - die Experimente von Brandts & Holt und Kübler et. al","date_updated":"2022-01-06T06:59:27Z"},{"file_date_updated":"2018-03-20T07:19:59Z","citation":{"mla":"Arifulina, Svetlana, et al. “SeSAME: Modeling and Analyzing High-Quality Service Compositions.” <i>Proceedings of the 29th IEEE/ACM International Conference on Automated Software Engineering (ASE 2014)</i>, 2014, pp. 839–42, doi:<a href=\"https://doi.org/10.1145/2642937.2648621\">10.1145/2642937.2648621</a>.","ama":"Arifulina S, Becker M, Platenius MC, Walther S. SeSAME: Modeling and Analyzing High-Quality Service Compositions. In: <i>Proceedings of the 29th IEEE/ACM International Conference on Automated Software Engineering (ASE 2014)</i>. ; 2014:839-842. doi:<a href=\"https://doi.org/10.1145/2642937.2648621\">10.1145/2642937.2648621</a>","bibtex":"@inproceedings{Arifulina_Becker_Platenius_Walther_2014, title={SeSAME: Modeling and Analyzing High-Quality Service Compositions}, DOI={<a href=\"https://doi.org/10.1145/2642937.2648621\">10.1145/2642937.2648621</a>}, booktitle={Proceedings of the 29th IEEE/ACM International Conference on Automated Software Engineering (ASE 2014)}, author={Arifulina, Svetlana and Becker, Matthias and Platenius, Marie Christin and Walther, Sven}, year={2014}, pages={839–842} }","apa":"Arifulina, S., Becker, M., Platenius, M. C., &#38; Walther, S. (2014). SeSAME: Modeling and Analyzing High-Quality Service Compositions. In <i>Proceedings of the 29th IEEE/ACM International Conference on Automated Software Engineering (ASE 2014)</i> (pp. 839–842). <a href=\"https://doi.org/10.1145/2642937.2648621\">https://doi.org/10.1145/2642937.2648621</a>","ieee":"S. Arifulina, M. Becker, M. C. Platenius, and S. Walther, “SeSAME: Modeling and Analyzing High-Quality Service Compositions,” in <i>Proceedings of the 29th IEEE/ACM International Conference on Automated Software Engineering (ASE 2014)</i>, 2014, pp. 839–842.","chicago":"Arifulina, Svetlana, Matthias Becker, Marie Christin Platenius, and Sven Walther. “SeSAME: Modeling and Analyzing High-Quality Service Compositions.” In <i>Proceedings of the 29th IEEE/ACM International Conference on Automated Software Engineering (ASE 2014)</i>, 839–42, 2014. <a href=\"https://doi.org/10.1145/2642937.2648621\">https://doi.org/10.1145/2642937.2648621</a>.","short":"S. Arifulina, M. Becker, M.C. Platenius, S. Walther, in: Proceedings of the 29th IEEE/ACM International Conference on Automated Software Engineering (ASE 2014), 2014, pp. 839–842."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"name":"SFB 901 - Subproject B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"}],"status":"public","has_accepted_license":"1","page":"839-842","_id":"364","user_id":"477","ddc":["040"],"publication":"Proceedings of the 29th IEEE/ACM International Conference on Automated Software Engineering (ASE 2014)","abstract":[{"text":"Today, software components are traded on markets in form of services. These services can also be service compositions consisting of several services. If a software architect wants to provide such a service composition in the market for trade, she needs to perform several tasks: she needs to model the composition, to discover existing services to be part of that composition, and to analyze the composition's functional correctness as well as its quality, e.g., performance. Up to now, the architect needed to find and use different tools for these tasks. Typically, these tools are not interoperable with each other. We provide the tool SeSAME that supports a software architect in all of these tasks. SeSAME is an integrated Eclipse-based tool-suite providing a comprehensive service specification language to model service compositions and existing services. Furthermore, it includes modules for service matching, functional analysis, and non-functional analysis. SeSAME is the first tool that integrates all these tasks into one tool-suite and, thereby, provides holistic support for trading software services. Thus, it contributes to a software provider's market success.","lang":"eng"}],"file":[{"file_id":"1407","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2018-03-20T07:19:59Z","file_name":"364-ASE2014.pdf","access_level":"closed","file_size":473308,"date_created":"2018-03-20T07:19:59Z","creator":"florida"}],"date_created":"2017-10-17T12:42:03Z","type":"conference","department":[{"_id":"66"},{"_id":"76"}],"year":"2014","title":"SeSAME: Modeling and Analyzing High-Quality Service Compositions","author":[{"first_name":"Svetlana","last_name":"Arifulina","full_name":"Arifulina, Svetlana"},{"full_name":"Becker, Matthias","first_name":"Matthias","last_name":"Becker"},{"first_name":"Marie Christin","last_name":"Platenius","full_name":"Platenius, Marie Christin"},{"full_name":"Walther, Sven","first_name":"Sven","last_name":"Walther"}],"date_updated":"2022-01-06T06:59:28Z","language":[{"iso":"eng"}],"doi":"10.1145/2642937.2648621"},{"department":[{"_id":"76"}],"type":"conference","date_created":"2017-10-17T12:42:03Z","file":[{"date_created":"2018-03-20T07:18:47Z","creator":"florida","content_type":"application/pdf","success":1,"file_id":"1405","access_level":"closed","file_size":74488,"file_name":"366-otf-security-privacy-final.pdf","date_updated":"2018-03-20T07:18:47Z","relation":"main_file"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"10","name":"SFB 901 - Subproject B2"}],"abstract":[{"text":"On-The-Fly (OTF) Computing constitutes an approach towards highly dynamic and individualized software markets. Based on service-oriented computing, OTF Computing is about realizing global markets of services that can be flexibly combined. We report on our current research activities, the security and privacy implications thereof, and our approaches to tackle the challenges. Furthermore, we discuss how the security and privacy challenges are addressed in research projects similar to OTF Computing.","lang":"eng"}],"citation":{"ieee":"R. Petrlic, A. Jungmann, M. C. Platenius, W. Schäfer, and C. Sorge, “Security and Privacy Challenges in On-The-Fly Computing,” in <i>Tagungsband der 4. Konferenz Software-Technologien und -Prozesse (STeP 2014)</i>, 2014, pp. 131–142.","apa":"Petrlic, R., Jungmann, A., Platenius, M. C., Schäfer, W., &#38; Sorge, C. (2014). Security and Privacy Challenges in On-The-Fly Computing. In <i>Tagungsband der 4. Konferenz Software-Technologien und -Prozesse (STeP 2014)</i> (pp. 131–142).","mla":"Petrlic, Ronald, et al. “Security and Privacy Challenges in On-The-Fly Computing.” <i>Tagungsband Der 4. Konferenz Software-Technologien Und -Prozesse (STeP 2014)</i>, 2014, pp. 131–42.","bibtex":"@inproceedings{Petrlic_Jungmann_Platenius_Schäfer_Sorge_2014, title={Security and Privacy Challenges in On-The-Fly Computing}, booktitle={Tagungsband der 4. Konferenz Software-Technologien und -Prozesse (STeP 2014)}, author={Petrlic, Ronald and Jungmann, Alexander and Platenius, Marie Christin and Schäfer, Wilhelm and Sorge, Christoph}, year={2014}, pages={131–142} }","ama":"Petrlic R, Jungmann A, Platenius MC, Schäfer W, Sorge C. Security and Privacy Challenges in On-The-Fly Computing. In: <i>Tagungsband Der 4. Konferenz Software-Technologien Und -Prozesse (STeP 2014)</i>. ; 2014:131-142.","short":"R. Petrlic, A. Jungmann, M.C. Platenius, W. Schäfer, C. Sorge, in: Tagungsband Der 4. Konferenz Software-Technologien Und -Prozesse (STeP 2014), 2014, pp. 131–142.","chicago":"Petrlic, Ronald, Alexander Jungmann, Marie Christin Platenius, Wilhelm Schäfer, and Christoph Sorge. “Security and Privacy Challenges in On-The-Fly Computing.” In <i>Tagungsband Der 4. Konferenz Software-Technologien Und -Prozesse (STeP 2014)</i>, 131–42, 2014."},"publication":"Tagungsband der 4. Konferenz Software-Technologien und -Prozesse (STeP 2014)","file_date_updated":"2018-03-20T07:18:47Z","ddc":["040"],"user_id":"477","language":[{"iso":"eng"}],"_id":"366","page":"131-142","has_accepted_license":"1","date_updated":"2022-01-06T06:59:29Z","author":[{"last_name":"Petrlic","first_name":"Ronald","full_name":"Petrlic, Ronald"},{"first_name":"Alexander","last_name":"Jungmann","full_name":"Jungmann, Alexander"},{"first_name":"Marie Christin","last_name":"Platenius","full_name":"Platenius, Marie Christin"},{"full_name":"Schäfer, Wilhelm","last_name":"Schäfer","first_name":"Wilhelm"},{"full_name":"Sorge, Christoph","first_name":"Christoph","last_name":"Sorge"}],"year":"2014","title":"Security and Privacy Challenges in On-The-Fly Computing","status":"public"},{"department":[{"_id":"79"}],"type":"conference","date_created":"2017-10-17T12:42:03Z","file":[{"file_id":"1404","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-20T07:18:12Z","file_name":"367-cts_conf.pdf","access_level":"closed","file_size":647997,"date_created":"2018-03-20T07:18:12Z","creator":"florida"}],"abstract":[{"lang":"eng","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."}],"publication":"Proceedings of the International Conference on Collaboration Technologies and Systems (CTS)","doi":"10.1109/CTS.2014.6867595","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:59:29Z","author":[{"full_name":"Janiuk, Jens","first_name":"Jens","last_name":"Janiuk"},{"first_name":"Alexander","last_name":"Mäcker","full_name":"Mäcker, Alexander","id":"13536"},{"full_name":"Graffi, Kalman","first_name":"Kalman","last_name":"Graffi"}],"year":"2014","title":"Secure Distributed Data Structures for Peer-to-Peer-based Social Networks","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"citation":{"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>.","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>","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} }","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>","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.","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>.","short":"J. Janiuk, A. Mäcker, K. Graffi, in: Proceedings of the International Conference on Collaboration Technologies and Systems (CTS), 2014, pp. 396–405."},"file_date_updated":"2018-03-20T07:18:12Z","user_id":"477","ddc":["040"],"_id":"367","page":"396-405","has_accepted_license":"1","status":"public"},{"date_updated":"2022-01-06T06:59:30Z","year":"2014","title":"Scheduling Shared Continuous Resources on Many-Cores","author":[{"first_name":"Andre","last_name":"Brinkmann","full_name":"Brinkmann, Andre"},{"last_name":"Kling","first_name":"Peter","full_name":"Kling, Peter"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Nagel, Lars","last_name":"Nagel","first_name":"Lars"},{"full_name":"Riechers, Sören","first_name":"Sören","last_name":"Riechers"},{"full_name":"Suess, Tim ","last_name":"Suess","first_name":"Tim "}],"doi":"10.1145/2612669.2612698","language":[{"iso":"eng"}],"abstract":[{"text":"We consider the problem of scheduling a number of jobs on $m$ identical processors sharing a continuously divisible resource. Each job j comes with a resource requirement r_j \\in {0,1}. The job can be processed at full speed if granted its full resource requirement. If receiving only an x-portion of r_j, it is processed at an x-fraction of the full speed. Our goal is to find a resource assignment that minimizes the makespan (i.e., the latest completion time). Variants of such problems, relating the resource assignment of jobs to their \\emph{processing speeds}, have been studied under the term discrete-continuous scheduling. Known results are either very pessimistic or heuristic in nature.In this paper, we suggest and analyze a slightly simplified model. It focuses on the assignment of shared continuous resources to the processors. The job assignment to processors and the ordering of the jobs have already been fixed. It is shown that, even for unit size jobs, finding an optimal solution is NP-hard if the number of processors is part of the input. Positive results for unit size jobs include an efficient optimal algorithm for 2 processors. Moreover, we prove that balanced schedules yield a 2-1/m-approximation for a fixed number of processors. Such schedules are computed by our GreedyBalance algorithm, for which the bound is tight.","lang":"eng"}],"publication":"Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","type":"conference","department":[{"_id":"63"}],"file":[{"creator":"florida","date_created":"2018-03-20T07:17:38Z","file_size":485767,"access_level":"closed","file_name":"368-BKMNRS14.pdf","date_updated":"2018-03-20T07:17:38Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1403"}],"date_created":"2017-10-17T12:42:03Z","has_accepted_license":"1","status":"public","user_id":"15415","ddc":["040"],"page":"128-137","_id":"368","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"14","name":"SFB 901 - Subproject C2"},{"name":"SFB 901 - Project Area C","_id":"4"}],"file_date_updated":"2018-03-20T07:17:38Z","citation":{"ama":"Brinkmann A, Kling P, Meyer auf der Heide F, Nagel L, Riechers S, Suess T. Scheduling Shared Continuous Resources on Many-Cores. In: <i>Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2014:128-137. doi:<a href=\"https://doi.org/10.1145/2612669.2612698\">10.1145/2612669.2612698</a>","bibtex":"@inproceedings{Brinkmann_Kling_Meyer auf der Heide_Nagel_Riechers_Suess_2014, title={Scheduling Shared Continuous Resources on Many-Cores}, DOI={<a href=\"https://doi.org/10.1145/2612669.2612698\">10.1145/2612669.2612698</a>}, booktitle={Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Brinkmann, Andre and Kling, Peter and Meyer auf der Heide, Friedhelm and Nagel, Lars and Riechers, Sören and Suess, Tim }, year={2014}, pages={128–137} }","mla":"Brinkmann, Andre, et al. “Scheduling Shared Continuous Resources on Many-Cores.” <i>Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2014, pp. 128–37, doi:<a href=\"https://doi.org/10.1145/2612669.2612698\">10.1145/2612669.2612698</a>.","chicago":"Brinkmann, Andre, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel, Sören Riechers, and Tim  Suess. “Scheduling Shared Continuous Resources on Many-Cores.” In <i>Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 128–37, 2014. <a href=\"https://doi.org/10.1145/2612669.2612698\">https://doi.org/10.1145/2612669.2612698</a>.","short":"A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S. Riechers, T. Suess, in: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2014, pp. 128–137.","apa":"Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L., Riechers, S., &#38; Suess, T. (2014). Scheduling Shared Continuous Resources on Many-Cores. <i>Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 128–137. <a href=\"https://doi.org/10.1145/2612669.2612698\">https://doi.org/10.1145/2612669.2612698</a>","ieee":"A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S. Riechers, and T. Suess, “Scheduling Shared Continuous Resources on Many-Cores,” in <i>Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2014, pp. 128–137, doi: <a href=\"https://doi.org/10.1145/2612669.2612698\">10.1145/2612669.2612698</a>."}},{"department":[{"_id":"64"}],"type":"bachelorsthesis","date_created":"2017-10-17T12:42:04Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"abstract":[{"lang":"eng","text":"RSA Full Domain Hash ist im Zufallsorakelmodell ein EUF-CMA sicheres Signaturverfahren (existentially unforgeable under chosen-message attacks). Der Sicherheitsbeweis wird unter anderem in der Vorlesung Einf{\\\"u}hrung in die Kryptographie vorgestellt. Auch bei einer genaueren Analyse verliert man bei der Reduktion einen Faktor \\nicefrac{1}{q_{s}}(wobei q_{s}die Anzahl der Anfragen an das Signaturorakel darstellt), was f{\\\"u}r die Praxis in relativ großen Systemparametern (RSA-Modul) resultiert [1].Seit der Ver{\\\"o}ffentlichung von [2] wurde geglaubt, dass der Faktor \\nicefrac{1}{q_{s}}optimal ist. Erst zehn Jahre sp{\\\"a}ter offenbarten die Autoren von [3] einen Fehler in [2] und zeigten eine bessere Reduktion allerdings unter einer etwas st{\\\"a}rkeren Sicherheitsannahme.Die Ergebnisse aus [3] lassen sich auf PSS-Verfahren (Probabilistic Signature Scheme), das z.B. in PKCS #1 benutzt wird, {\\\"u}bertragen und sind somit von großer Bedeutung f{\\\"u}r die Praxis. Weiterhin sind die in den Beweisen verwendete Techniken n{\\\"u}tzlich auch bei anderen kryptographischen Verfahren.In Rahmen dieser Arbeit sollen die entsprechenden Sicherheitsbeweise aufgearbeitet und dessen Auswirkungen f{\\\"u}r die Praxis analysiert werden.[1] J.S. Coron, “On the Exact Security of Full Domain Hash”, CRYPTO 2000. LNCS 1880, pp. 229-235, 2000.[2] J.S. Coron, “Optimal security proofs for PPS and other signature schemes”, EUROCRYPT 2002. LNCS 2332, pp 272-287, 2002.[3] S.A. Kakvi and E. Kiltz, “Optimal Security Proofs for Full Domain Hash, Revisited”, in EUROCRYPT 2012. LNCS 7237, pp 537-553, 2012."}],"supervisor":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"}],"citation":{"short":"T. Rath, RSA-Full Domain Hash Revisited, Universität Paderborn, 2014.","chicago":"Rath, Timo. <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn, 2014.","ieee":"T. Rath, <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn, 2014.","apa":"Rath, T. (2014). <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn.","bibtex":"@book{Rath_2014, title={RSA-Full Domain Hash Revisited}, publisher={Universität Paderborn}, author={Rath, Timo}, year={2014} }","ama":"Rath T. <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn; 2014.","mla":"Rath, Timo. <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn, 2014."},"user_id":"477","_id":"369","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:30Z","author":[{"first_name":"Timo","last_name":"Rath","full_name":"Rath, Timo"}],"title":"RSA-Full Domain Hash Revisited","year":"2014","status":"public"},{"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>","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.","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>.","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.","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>.","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>","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} }"},"file_date_updated":"2018-03-20T07:17:04Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","has_accepted_license":"1","_id":"370","page":"352-360","user_id":"477","ddc":["040"],"publication":"Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM'14)","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"}],"date_created":"2017-10-17T12:42:04Z","file":[{"file_id":"1402","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2018-03-20T07:17:04Z","file_name":"370-HHSS14.pdf","access_level":"closed","file_size":179583,"date_created":"2018-03-20T07:17:04Z","creator":"florida"}],"department":[{"_id":"63"},{"_id":"541"}],"type":"conference","author":[{"full_name":"Harks, Tobias","first_name":"Tobias","last_name":"Harks"},{"last_name":"Höfer","first_name":"Martin","full_name":"Höfer, Martin"},{"full_name":"Schewior, Kevin","last_name":"Schewior","first_name":"Kevin"},{"id":"40384","last_name":"Skopalik","first_name":"Alexander","full_name":"Skopalik, Alexander"}],"title":"Routing Games with Progressive Filling","year":"2014","date_updated":"2022-01-06T06:59:30Z","language":[{"iso":"eng"}],"doi":"10.1109/TNET.2015.2468571"},{"file":[{"content_type":"application/pdf","success":1,"file_id":"1401","date_updated":"2018-03-20T07:16:32Z","relation":"main_file","file_size":269941,"access_level":"closed","file_name":"371-RoBuSt-OPODIS.pdf","date_created":"2018-03-20T07:16:32Z","creator":"florida"}],"date_created":"2017-10-17T12:42:04Z","type":"conference","department":[{"_id":"79"}],"publication":"Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)","abstract":[{"lang":"eng","text":"In this work we present the first distributed storage system that is provably robust against crash failures issued by an adaptive adversary, i.e., for each batch of requests the adversary can decide based on the entire system state which servers will be unavailable for that batch of requests. Despite up to \\gamma n^{1/\\log\\log n} crashed servers, with \\gamma>0 constant and n denoting the number of servers, our system can correctly process any batch of lookup and write requests (with at most a polylogarithmic number of requests issued at each non-crashed server) in at most a polylogarithmic number of communication rounds, with at most polylogarithmic time and work at each server and only a logarithmic storage overhead. Our system is based on previous work by Eikel and Scheideler (SPAA 2013), who presented IRIS, a distributed information system that is provably robust against the same kind of crash failures. However, IRIS is only able to serve lookup requests. Handling both lookup and write requests has turned out to require major changes in the design of IRIS."}],"series_title":"LNCS","doi":"10.1007/978-3-319-14472-6_8","title":"RoBuSt: A Crash-Failure-Resistant Distributed Storage System","year":"2014","author":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"full_name":"Setzer, Alexander","last_name":"Setzer","first_name":"Alexander","id":"11108"},{"full_name":"Eikel, Martina","last_name":"Eikel","first_name":"Martina"}],"date_updated":"2022-01-06T06:59:31Z","file_date_updated":"2018-03-20T07:16:32Z","citation":{"ama":"Scheideler C, Setzer A, Eikel M. RoBuSt: A Crash-Failure-Resistant Distributed Storage System. In: <i>Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)</i>. LNCS. ; 2014:107--122. doi:<a href=\"https://doi.org/10.1007/978-3-319-14472-6_8\">10.1007/978-3-319-14472-6_8</a>","short":"C. Scheideler, A. Setzer, M. Eikel, in: Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS), 2014, pp. 107--122.","chicago":"Scheideler, Christian, Alexander Setzer, and Martina Eikel. “RoBuSt: A Crash-Failure-Resistant Distributed Storage System.” In <i>Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)</i>, 107--122. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-14472-6_8\">https://doi.org/10.1007/978-3-319-14472-6_8</a>.","bibtex":"@inproceedings{Scheideler_Setzer_Eikel_2014, series={LNCS}, title={RoBuSt: A Crash-Failure-Resistant Distributed Storage System}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-14472-6_8\">10.1007/978-3-319-14472-6_8</a>}, booktitle={Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)}, author={Scheideler, Christian and Setzer, Alexander and Eikel, Martina}, year={2014}, pages={107--122}, collection={LNCS} }","apa":"Scheideler, C., Setzer, A., &#38; Eikel, M. (2014). RoBuSt: A Crash-Failure-Resistant Distributed Storage System. In <i>Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)</i> (pp. 107--122). <a href=\"https://doi.org/10.1007/978-3-319-14472-6_8\">https://doi.org/10.1007/978-3-319-14472-6_8</a>","mla":"Scheideler, Christian, et al. “RoBuSt: A Crash-Failure-Resistant Distributed Storage System.” <i>Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)</i>, 2014, pp. 107--122, doi:<a href=\"https://doi.org/10.1007/978-3-319-14472-6_8\">10.1007/978-3-319-14472-6_8</a>.","ieee":"C. Scheideler, A. Setzer, and M. Eikel, “RoBuSt: A Crash-Failure-Resistant Distributed Storage System,” in <i>Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)</i>, 2014, pp. 107--122."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"page":"107--122","_id":"371","user_id":"15504","ddc":["040"],"status":"public","has_accepted_license":"1"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"file_date_updated":"2018-11-02T14:00:54Z","citation":{"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>","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} }","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>","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.","short":"M. Keller, H. Karl, in: Proceedings of the SIGCOMM Workshop on Distributed Cloud Computing, 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>."},"ddc":["000"],"user_id":"477","page":"47--52","_id":"372","has_accepted_license":"1","status":"public","type":"conference","department":[{"_id":"75"}],"file":[{"relation":"main_file","date_updated":"2018-11-02T14:00:54Z","file_name":"p47-keller.pdf","file_size":804240,"access_level":"closed","file_id":"5259","success":1,"content_type":"application/pdf","creator":"ups","date_created":"2018-11-02T14:00:54Z"}],"date_created":"2017-10-17T12:42:04Z","abstract":[{"lang":"eng","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."}],"publication":"Proceedings of the SIGCOMM workshop on Distributed cloud computing","doi":"10.1145/2627566.2627570","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:59:31Z","year":"2014","title":"Response Time-Optimized Distributed Cloud Resource Allocation","author":[{"last_name":"Keller","first_name":"Matthias","full_name":"Keller, Matthias"},{"id":"126","last_name":"Karl","first_name":"Holger","full_name":"Karl, Holger"}]},{"type":"bachelorsthesis","department":[{"_id":"63"},{"_id":"541"}],"date_created":"2017-10-17T12:42:04Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"citation":{"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.","bibtex":"@book{Pahl_2014, title={Reputationssysteme für zusammengesetzte Dienstleistungen}, publisher={Universität Paderborn}, author={Pahl, David}, year={2014} }","apa":"Pahl, D. (2014). <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>. Universität Paderborn.","ieee":"D. Pahl, <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>. Universität Paderborn, 2014.","short":"D. Pahl, Reputationssysteme für zusammengesetzte Dienstleistungen, Universität Paderborn, 2014.","chicago":"Pahl, David. <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>. Universität Paderborn, 2014."},"supervisor":[{"full_name":"Skopalik, Alexander","first_name":"Alexander","last_name":"Skopalik","id":"40384"}],"user_id":"14052","_id":"373","publisher":"Universität Paderborn","language":[{"iso":"ger"}],"date_updated":"2022-01-06T06:59:31Z","year":"2014","title":"Reputationssysteme für zusammengesetzte Dienstleistungen","status":"public","author":[{"first_name":"David","last_name":"Pahl","full_name":"Pahl, David"}]},{"date_created":"2017-10-17T12:42:05Z","file":[{"date_updated":"2018-03-20T07:15:59Z","relation":"main_file","file_size":818625,"access_level":"closed","file_name":"374-2014_wold_arc.pdf","content_type":"application/pdf","success":1,"file_id":"1400","creator":"florida","date_created":"2018-03-20T07:15:59Z"}],"type":"conference","publication":"Proceedings of the 10th International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications","abstract":[{"text":"Run-time reconfiguration provides an opportunity to increase performance, reduce cost and improve energy efficiency in FPGA-based systems. However, run-time reconfigurable systems are more complex to implement than static only systems. This increases time to market, and introduces run-time overhead into the system. Our research aims to raise the abstraction level to develop run-time reconfigurable systems. We present operating system extensions which enable seamless integration of run-time reconfigurable hardware threads into applications. To improve resource utilization, the hardware threads are placed on a fine granularity tile grid. We take advantage of a relocatable module placer targeting modern FPGA to manage the reconfigurable area. The module placer accurately models the FPGA resources to compute feasible placement locations for the hardware threads at run-time. Finally, we evaluate our work by means of a case study that consists of a synthetic application to validate the functionality and performance of the implementation. The results show a reduction in reconfiguration time of up to 42% and more than double resource utilization.","lang":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-319-05960-0_6","author":[{"full_name":"Wold, Alexander","first_name":"Alexander","last_name":"Wold"},{"first_name":"Andreas","last_name":"Agne","full_name":"Agne, Andreas"},{"first_name":"Jim","last_name":"Torresen","full_name":"Torresen, Jim"}],"title":"Relocatable Hardware Threads in Run-Time Reconfigurable Systems","year":"2014","date_updated":"2022-01-06T06:59:32Z","citation":{"ieee":"A. Wold, A. Agne, and J. Torresen, “Relocatable Hardware Threads in Run-Time Reconfigurable Systems,” in <i>Proceedings of the 10th International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications</i>, 2014, pp. 61–72.","apa":"Wold, A., Agne, A., &#38; Torresen, J. (2014). Relocatable Hardware Threads in Run-Time Reconfigurable Systems. In D. Goehringer, M. Santambrogio, J. P. Cardoso, &#38; K. Bertels (Eds.), <i>Proceedings of the 10th International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications</i> (pp. 61–72). <a href=\"https://doi.org/10.1007/978-3-319-05960-0_6\">https://doi.org/10.1007/978-3-319-05960-0_6</a>","chicago":"Wold, Alexander, Andreas Agne, and Jim Torresen. “Relocatable Hardware Threads in Run-Time Reconfigurable Systems.” In <i>Proceedings of the 10th International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications</i>, edited by Diana Goehringer, MarcoDomenico Santambrogio, JoãoM.P. Cardoso, and Koen Bertels, 61–72. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-05960-0_6\">https://doi.org/10.1007/978-3-319-05960-0_6</a>.","short":"A. Wold, A. Agne, J. Torresen, in: D. Goehringer, M. Santambrogio, J.P. Cardoso, K. Bertels (Eds.), Proceedings of the 10th International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications, 2014, pp. 61–72.","mla":"Wold, Alexander, et al. “Relocatable Hardware Threads in Run-Time Reconfigurable Systems.” <i>Proceedings of the 10th International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications</i>, edited by Diana Goehringer et al., 2014, pp. 61–72, doi:<a href=\"https://doi.org/10.1007/978-3-319-05960-0_6\">10.1007/978-3-319-05960-0_6</a>.","bibtex":"@inproceedings{Wold_Agne_Torresen_2014, series={LNCS}, title={Relocatable Hardware Threads in Run-Time Reconfigurable Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-05960-0_6\">10.1007/978-3-319-05960-0_6</a>}, booktitle={Proceedings of the 10th International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications}, author={Wold, Alexander and Agne, Andreas and Torresen, Jim}, editor={Goehringer, Diana and Santambrogio, MarcoDomenico and Cardoso, JoãoM.P. and Bertels, KoenEditors}, year={2014}, pages={61–72}, collection={LNCS} }","ama":"Wold A, Agne A, Torresen J. Relocatable Hardware Threads in Run-Time Reconfigurable Systems. In: Goehringer D, Santambrogio M, Cardoso JP, Bertels K, eds. <i>Proceedings of the 10th International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications</i>. LNCS. ; 2014:61-72. doi:<a href=\"https://doi.org/10.1007/978-3-319-05960-0_6\">10.1007/978-3-319-05960-0_6</a>"},"file_date_updated":"2018-03-20T07:15:59Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"374","page":"61-72","editor":[{"last_name":"Goehringer","first_name":"Diana","full_name":"Goehringer, Diana"},{"last_name":"Santambrogio","first_name":"MarcoDomenico","full_name":"Santambrogio, MarcoDomenico"},{"full_name":"Cardoso, JoãoM.P.","last_name":"Cardoso","first_name":"JoãoM.P."},{"full_name":"Bertels, Koen","last_name":"Bertels","first_name":"Koen"}],"ddc":["040"],"user_id":"15504","status":"public","has_accepted_license":"1"},{"file":[{"file_id":"1399","success":1,"content_type":"application/pdf","file_name":"375-sosym.pdf","file_size":3356333,"access_level":"closed","relation":"main_file","date_updated":"2018-03-20T07:15:26Z","date_created":"2018-03-20T07:15:26Z","creator":"florida"}],"date_created":"2017-10-17T12:42:05Z","type":"journal_article","publication":"Journal of Software and Systems Modeling","issue":"4","abstract":[{"text":"Many software development, planning, or analysis tasks require an up-to-date software architecture documentation. However, this documentation is often outdated, unavailable, or at least not available as a formal model which analysis tools could use. Reverse engineering methods try to fill this gap. However, as they process the system’s source code, they are easily misled by design deficiencies (e.g., violations of component encapsulation) which leaked into the code during the system’s evolution. Despite the high impact of design deficiencies on the quality of the resulting software architecture models, none of the surveyed related works is able to cope with them during the reverse engineering process. Therefore, we have developed the Archimetrix approach which semi-automatically recovers the system’s concrete architecture in a formal model while simultaneously detecting and removing design deficiencies. We have validated Archi metrix on a case-study system and two implementation variants of the CoCoME benchmark system. Results show that the removal of relevant design deficiencies leads to an architecture model which more closely matches the system’s conceptual architecture.","lang":"eng"}],"doi":"10.1007/s10270-013-0341-9","year":"2014","title":"Reengineering Component-Based Software Systems with Archimetrix","author":[{"first_name":"Markus","last_name":"von Detten","full_name":"von Detten, Markus"},{"full_name":"Platenius, Marie Christin","first_name":"Marie Christin","last_name":"Platenius"},{"full_name":"Becker, Steffen","first_name":"Steffen","last_name":"Becker"}],"date_updated":"2022-01-06T06:59:34Z","file_date_updated":"2018-03-20T07:15:26Z","citation":{"mla":"von Detten, Markus, et al. “Reengineering Component-Based Software Systems with Archimetrix.” <i>Journal of Software and Systems Modeling</i>, no. 4, Springer, 2014, pp. 1239--1268, doi:<a href=\"https://doi.org/10.1007/s10270-013-0341-9\">10.1007/s10270-013-0341-9</a>.","bibtex":"@article{von Detten_Platenius_Becker_2014, title={Reengineering Component-Based Software Systems with Archimetrix}, DOI={<a href=\"https://doi.org/10.1007/s10270-013-0341-9\">10.1007/s10270-013-0341-9</a>}, number={4}, journal={Journal of Software and Systems Modeling}, publisher={Springer}, author={von Detten, Markus and Platenius, Marie Christin and Becker, Steffen}, year={2014}, pages={1239--1268} }","ama":"von Detten M, Platenius MC, Becker S. Reengineering Component-Based Software Systems with Archimetrix. <i>Journal of Software and Systems Modeling</i>. 2014;(4):1239--1268. doi:<a href=\"https://doi.org/10.1007/s10270-013-0341-9\">10.1007/s10270-013-0341-9</a>","ieee":"M. von Detten, M. C. Platenius, and S. Becker, “Reengineering Component-Based Software Systems with Archimetrix,” <i>Journal of Software and Systems Modeling</i>, no. 4, pp. 1239--1268, 2014.","apa":"von Detten, M., Platenius, M. C., &#38; Becker, S. (2014). Reengineering Component-Based Software Systems with Archimetrix. <i>Journal of Software and Systems Modeling</i>, (4), 1239--1268. <a href=\"https://doi.org/10.1007/s10270-013-0341-9\">https://doi.org/10.1007/s10270-013-0341-9</a>","chicago":"Detten, Markus von, Marie Christin Platenius, and Steffen Becker. “Reengineering Component-Based Software Systems with Archimetrix.” <i>Journal of Software and Systems Modeling</i>, no. 4 (2014): 1239--1268. <a href=\"https://doi.org/10.1007/s10270-013-0341-9\">https://doi.org/10.1007/s10270-013-0341-9</a>.","short":"M. von Detten, M.C. Platenius, S. Becker, Journal of Software and Systems Modeling (2014) 1239--1268."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"page":"1239--1268","publisher":"Springer","_id":"375","user_id":"477","ddc":["040"],"status":"public","has_accepted_license":"1"},{"user_id":"477","ddc":["040"],"_id":"376","publisher":"Universität Paderborn","has_accepted_license":"1","date_updated":"2022-01-06T06:59:35Z","author":[{"full_name":"Herlich, Matthias","last_name":"Herlich","first_name":"Matthias"}],"title":"Reducing Energy Consumption of Radio Access Networks","year":"2014","status":"public","department":[{"_id":"75"}],"type":"dissertation","date_created":"2017-10-17T12:42:05Z","file":[{"date_created":"2018-03-20T07:14:52Z","creator":"florida","file_id":"1398","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-20T07:14:52Z","file_name":"376-Herlich-Dissertation.pdf","file_size":1476366,"access_level":"closed"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}],"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"}],"citation":{"ama":"Herlich M. <i>Reducing Energy Consumption of Radio Access Networks</i>. Universität Paderborn; 2014.","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.","chicago":"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.","apa":"Herlich, M. (2014). <i>Reducing Energy Consumption of Radio Access Networks</i>. Universität Paderborn.","ieee":"M. Herlich, <i>Reducing Energy Consumption of Radio Access Networks</i>. Universität Paderborn, 2014."},"supervisor":[{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}],"file_date_updated":"2018-03-20T07:14:52Z"},{"date_updated":"2022-01-06T06:59:35Z","title":"Re-Chord: A Self-stabilizing Chord Overlay Network","year":"2014","author":[{"full_name":"Kniesburges, Sebastian","first_name":"Sebastian","last_name":"Kniesburges"},{"last_name":"Koutsopoulos","first_name":"Andreas","full_name":"Koutsopoulos, Andreas"},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}],"doi":"10.1007/s00224-012-9431-2","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","issue":"3","type":"journal_article","department":[{"_id":"79"}],"file":[{"file_id":"1396","content_type":"application/pdf","success":1,"file_name":"378-re-chord_journal.pdf","file_size":310961,"access_level":"closed","relation":"main_file","date_updated":"2018-03-20T07:13:36Z","date_created":"2018-03-20T07:13:36Z","creator":"florida"}],"date_created":"2017-10-17T12:42:05Z","has_accepted_license":"1","status":"public","ddc":["040"],"user_id":"477","page":"591-612","publisher":"Springer","_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"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file_date_updated":"2018-03-20T07:13:36Z","citation":{"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.","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>","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} }","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>.","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>","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, Theory of Computing Systems (2014) 591–612."}},{"ddc":["040"],"user_id":"15504","page":"25-34","_id":"379","has_accepted_license":"1","status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file_date_updated":"2018-03-20T07:12:57Z","citation":{"short":"S. Abshoff, C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2014, pp. 25–34.","chicago":"Abshoff, Sebastian, Christine Markarian, and Friedhelm Meyer auf der Heide. “Randomized Online Algorithms for Set Cover Leasing Problems.” In <i>Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 25–34. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-12691-3_3\">https://doi.org/10.1007/978-3-319-12691-3_3</a>.","ieee":"S. Abshoff, C. Markarian, and F. Meyer auf der Heide, “Randomized Online Algorithms for Set Cover Leasing Problems,” in <i>Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2014, pp. 25–34.","apa":"Abshoff, S., Markarian, C., &#38; Meyer auf der Heide, F. (2014). Randomized Online Algorithms for Set Cover Leasing Problems. In <i>Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i> (pp. 25–34). <a href=\"https://doi.org/10.1007/978-3-319-12691-3_3\">https://doi.org/10.1007/978-3-319-12691-3_3</a>","bibtex":"@inproceedings{Abshoff_Markarian_Meyer auf der Heide_2014, series={LNCS}, title={Randomized Online Algorithms for Set Cover Leasing Problems}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-12691-3_3\">10.1007/978-3-319-12691-3_3</a>}, booktitle={Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Abshoff, Sebastian and Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2014}, pages={25–34}, collection={LNCS} }","ama":"Abshoff S, Markarian C, Meyer auf der Heide F. Randomized Online Algorithms for Set Cover Leasing Problems. In: <i>Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>. LNCS. ; 2014:25-34. doi:<a href=\"https://doi.org/10.1007/978-3-319-12691-3_3\">10.1007/978-3-319-12691-3_3</a>","mla":"Abshoff, Sebastian, et al. “Randomized Online Algorithms for Set Cover Leasing Problems.” <i>Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2014, pp. 25–34, doi:<a href=\"https://doi.org/10.1007/978-3-319-12691-3_3\">10.1007/978-3-319-12691-3_3</a>."},"doi":"10.1007/978-3-319-12691-3_3","series_title":"LNCS","date_updated":"2022-01-06T06:59:36Z","title":"Randomized Online Algorithms for Set Cover Leasing Problems","year":"2014","author":[{"full_name":"Abshoff, Sebastian","last_name":"Abshoff","first_name":"Sebastian"},{"full_name":"Markarian, Christine","first_name":"Christine","last_name":"Markarian","id":"37612"},{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}],"type":"conference","department":[{"_id":"63"}],"file":[{"file_size":214299,"access_level":"closed","file_name":"379-COCOA14.pdf","date_updated":"2018-03-20T07:12:57Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1395","creator":"florida","date_created":"2018-03-20T07:12:57Z"}],"date_created":"2017-10-17T12:42:06Z","abstract":[{"text":"In the leasing variant of Set Cover presented by Anthony et al.[1], elements U arrive over time and must be covered by sets from a familyF of subsets of U. Each set can be leased for K different periods of time.Let |U| = n and |F| = m. Leasing a set S for a period k incurs a cost ckS and allows S to cover its elements for the next lk time steps. The objectiveis to minimize the total cost of the sets leased, such that elements arrivingat any time t are covered by sets which contain them and are leased duringtime t. Anthony et al. [1] gave an optimal O(log n)-approximation forthe problem in the offline setting, unless P = NP [22]. In this paper, wegive randomized algorithms for variants of Set Cover Leasing in the onlinesetting, including a generalization of Online Set Cover with Repetitionspresented by Alon et al. [2], where elements appear multiple times andmust be covered by a different set at each arrival. Our results improve theO(log2(mn)) competitive factor of Online Set Cover with Repetitions [2]to O(log d log(dn)) = O(logmlog(mn)), where d is the maximum numberof sets an element belongs to.","lang":"eng"}],"publication":"Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)"},{"publication":"Proceedings of the 10th International Conference on Web and Internet Economics (WINE)","file_date_updated":"2018-03-20T07:05:59Z","citation":{"ieee":"A. Cord-Landwehr, A. Mäcker, and F. Meyer auf der Heide, “Quality of Service in Network Creation Games,” in <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 423–428.","apa":"Cord-Landwehr, A., Mäcker, A., &#38; Meyer auf der Heide, F. (2014). Quality of Service in Network Creation Games. In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i> (pp. 423–428). <a href=\"https://doi.org/10.1007/978-3-319-13129-0_34\">https://doi.org/10.1007/978-3-319-13129-0_34</a>","chicago":"Cord-Landwehr, Andreas, Alexander Mäcker, and Friedhelm Meyer auf der Heide. “Quality of Service in Network Creation Games.” In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 423–28, 2014. <a href=\"https://doi.org/10.1007/978-3-319-13129-0_34\">https://doi.org/10.1007/978-3-319-13129-0_34</a>.","short":"A. Cord-Landwehr, A. Mäcker, F. Meyer auf der Heide, in: Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 423–428.","mla":"Cord-Landwehr, Andreas, et al. “Quality of Service in Network Creation Games.” <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 423–28, doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_34\">10.1007/978-3-319-13129-0_34</a>.","bibtex":"@inproceedings{Cord-Landwehr_Mäcker_Meyer auf der Heide_2014, title={Quality of Service in Network Creation Games}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-13129-0_34\">10.1007/978-3-319-13129-0_34</a>}, booktitle={Proceedings of the 10th International Conference on Web and Internet Economics (WINE)}, author={Cord-Landwehr, Andreas and Mäcker, Alexander and Meyer auf der Heide, Friedhelm}, year={2014}, pages={423–428} }","ama":"Cord-Landwehr A, Mäcker A, Meyer auf der Heide F. Quality of Service in Network Creation Games. In: <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>. ; 2014:423-428. doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_34\">10.1007/978-3-319-13129-0_34</a>"},"abstract":[{"lang":"eng","text":"Network creation games model the creation and usage costs of networks formed by n selfish nodes. Each node v can buy a set of edges, each for a fixed price α > 0. Its goal is to minimize its private costs, i.e., the sum (SUM-game, Fabrikant et al., PODC 2003) or maximum (MAX-game, Demaine et al., PODC 2007) of distances from v to all other nodes plus the prices of the bought edges. The above papers show the existence of Nash equilibria as well as upper and lower bounds for the prices of anarchy and stability. In several subsequent papers, these bounds were improved for a wide range of prices α. In this paper, we extend these models by incorporating quality-of-service aspects: Each edge cannot only be bought at a fixed quality (edge length one) for a fixed price α. Instead, we assume that quality levels (i.e., edge lengths) are varying in a fixed interval [βˇ,β^] , 0 series = {LNCS}"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"file":[{"content_type":"application/pdf","success":1,"file_id":"1394","access_level":"closed","file_size":166640,"file_name":"380-WINE2014.pdf","date_updated":"2018-03-20T07:05:59Z","relation":"main_file","date_created":"2018-03-20T07:05:59Z","creator":"florida"}],"date_created":"2017-10-17T12:42:06Z","type":"conference","department":[{"_id":"63"}],"title":"Quality of Service in Network Creation Games","year":"2014","status":"public","author":[{"first_name":"Andreas","last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas"},{"id":"13536","first_name":"Alexander","last_name":"Mäcker","full_name":"Mäcker, Alexander"},{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}],"date_updated":"2022-01-06T06:59:36Z","has_accepted_license":"1","page":"423-428","_id":"380","ddc":["040"],"doi":"10.1007/978-3-319-13129-0_34","user_id":"15504"}]