[{"intvolume":"       161","page":"2563-2586","citation":{"ama":"Mavronicolas M, Monien B, Papadopoulou Lesta V. How many attackers can selfish defenders catch? <i>Discrete Applied Mathematics</i>. 2013;161(16-17):2563-2586. doi:<a href=\"https://doi.org/10.1016/j.dam.2013.05.022\">10.1016/j.dam.2013.05.022</a>","ieee":"M. Mavronicolas, B. Monien, and V. Papadopoulou Lesta, “How many attackers can selfish defenders catch?,” <i>Discrete Applied Mathematics</i>, vol. 161, no. 16–17, pp. 2563–2586, 2013.","chicago":"Mavronicolas, Marios, Burkhard Monien, and Vicky Papadopoulou Lesta. “How Many Attackers Can Selfish Defenders Catch?” <i>Discrete Applied Mathematics</i> 161, no. 16–17 (2013): 2563–86. <a href=\"https://doi.org/10.1016/j.dam.2013.05.022\">https://doi.org/10.1016/j.dam.2013.05.022</a>.","apa":"Mavronicolas, M., Monien, B., &#38; Papadopoulou Lesta, V. (2013). How many attackers can selfish defenders catch? <i>Discrete Applied Mathematics</i>, <i>161</i>(16–17), 2563–2586. <a href=\"https://doi.org/10.1016/j.dam.2013.05.022\">https://doi.org/10.1016/j.dam.2013.05.022</a>","short":"M. Mavronicolas, B. Monien, V. Papadopoulou Lesta, Discrete Applied Mathematics 161 (2013) 2563–2586.","mla":"Mavronicolas, Marios, et al. “How Many Attackers Can Selfish Defenders Catch?” <i>Discrete Applied Mathematics</i>, vol. 161, no. 16–17, Elsevier, 2013, pp. 2563–86, doi:<a href=\"https://doi.org/10.1016/j.dam.2013.05.022\">10.1016/j.dam.2013.05.022</a>.","bibtex":"@article{Mavronicolas_Monien_Papadopoulou Lesta_2013, title={How many attackers can selfish defenders catch?}, volume={161}, DOI={<a href=\"https://doi.org/10.1016/j.dam.2013.05.022\">10.1016/j.dam.2013.05.022</a>}, number={16–17}, journal={Discrete Applied Mathematics}, publisher={Elsevier}, author={Mavronicolas, Marios and Monien, Burkhard and Papadopoulou Lesta, Vicky}, year={2013}, pages={2563–2586} }"},"has_accepted_license":"1","doi":"10.1016/j.dam.2013.05.022","date_updated":"2022-01-06T07:01:47Z","volume":161,"author":[{"full_name":"Mavronicolas, Marios","last_name":"Mavronicolas","first_name":"Marios"},{"first_name":"Burkhard","last_name":"Monien","full_name":"Monien, Burkhard"},{"full_name":"Papadopoulou Lesta, Vicky","last_name":"Papadopoulou Lesta","first_name":"Vicky"}],"status":"public","type":"journal_article","file_date_updated":"2018-03-15T10:37:35Z","_id":"523","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"user_id":"42447","year":"2013","issue":"16-17","title":"How many attackers can selfish defenders catch?","publisher":"Elsevier","date_created":"2017-10-17T12:42:34Z","abstract":[{"text":"In a distributed system with attacks and defenses, both attackers and defenders are self-interested entities. We assume a reward-sharing scheme among interdependent defenders; each defender wishes to (locally) maximize her own total fair share to the attackers extinguished due to her involvement (and possibly due to those of others). What is the maximum amount of protection achievable by a number of such defenders against a number of attackers while the system is in a Nash equilibrium? As a measure of system protection, we adopt the Defense-Ratio (Mavronicolas et al., 2008)[20], which provides the expected (inverse) proportion of attackers caught by the defenders. In a Defense-Optimal Nash equilibrium, the Defense-Ratio matches a simple lower bound.We discover that the existence of Defense-Optimal Nash equilibria depends in a subtle way on how the number of defenders compares to two natural graph-theoretic thresholds we identify. In this vein, we obtain, through a combinatorial analysis of Nash equilibria, a collection of trade-off results:• When the number of defenders is either sufficiently small or sufficiently large, Defense-Optimal Nash equilibria may exist. The corresponding decision problem is computationally tractable for a large number of defenders; the problem becomes NPNP-complete for a small number of defenders and the intractability is inherited from a previously unconsidered combinatorial problem in Fractional Graph Theory.• Perhaps paradoxically, there is a middle range of values for the number of defenders where Defense-Optimal Nash equilibria do not exist.","lang":"eng"}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"523-MMP13.pdf","file_id":"1297","access_level":"closed","file_size":1127543,"date_created":"2018-03-15T10:37:35Z","creator":"florida","date_updated":"2018-03-15T10:37:35Z"}],"publication":"Discrete Applied Mathematics","ddc":["040"],"language":[{"iso":"eng"}]},{"department":[{"_id":"63"}],"user_id":"15415","_id":"524","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file_date_updated":"2018-03-15T10:37:07Z","type":"preprint","status":"public","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"first_name":"Kamil","full_name":"Swirkot, Kamil","last_name":"Swirkot"}],"date_updated":"2022-01-06T07:01:48Z","has_accepted_license":"1","citation":{"bibtex":"@article{Meyer auf der Heide_Swirkot_2013, title={Hierarchies in Local Distributed Decision}, publisher={arXiv}, author={Meyer auf der Heide, Friedhelm and Swirkot, Kamil}, year={2013} }","short":"F. Meyer auf der Heide, K. Swirkot, (2013).","mla":"Meyer auf der Heide, Friedhelm, and Kamil Swirkot. <i>Hierarchies in Local Distributed Decision</i>. arXiv, 2013.","apa":"Meyer auf der Heide, F., &#38; Swirkot, K. (2013). Hierarchies in Local Distributed Decision. arXiv.","ieee":"F. Meyer auf der Heide and K. Swirkot, “Hierarchies in Local Distributed Decision.” arXiv, 2013.","chicago":"Meyer auf der Heide, Friedhelm, and Kamil Swirkot. “Hierarchies in Local Distributed Decision.” arXiv, 2013.","ama":"Meyer auf der Heide F, Swirkot K. Hierarchies in Local Distributed Decision. 2013."},"external_id":{"arxiv":["1311.7229"]},"language":[{"iso":"eng"}],"ddc":["040"],"file":[{"date_updated":"2018-03-15T10:37:07Z","date_created":"2018-03-15T10:37:07Z","creator":"florida","file_size":534906,"file_name":"524-paper_01.pdf","access_level":"closed","file_id":"1296","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"text":"We study the complexity theory for the local distributed setting introduced by Korman, Peleg and Fraigniaud. They have defined three complexity classes LD (Local Decision), NLD (Nondeterministic Local Decision) and NLD^#n. The class LD consists of all languages which can be decided with a constant number of communication rounds. The class NLD consists of all languages which can be verified by a nondeterministic algorithm with a constant number of communication rounds. In order to define the nondeterministic classes, they have transferred the notation of nondeterminism into the distributed setting by the use of certificates and verifiers. The class NLD^#n consists of all languages which can be verified by a nondeterministic algorithm where each node has access to an oracle for the number of nodes. They have shown the hierarchy LD subset NLD subset NLD^#n. Our main contributions are strict hierarchies within the classes defined by Korman, Peleg and Fraigniaud. We define additional complexity classes: the class LD(t) consists of all languages which can be decided with at most t communication rounds. The class NLD-O(f) consists of all languages which can be verified by a local verifier such that the size of the certificates that are needed to verify the language are bounded by a function from O(f). Our main results are refined strict hierarchies within these nondeterministic classes.","lang":"eng"}],"date_created":"2017-10-17T12:42:34Z","publisher":"arXiv","title":"Hierarchies in Local Distributed Decision","year":"2013"},{"year":"2013","citation":{"ama":"Niklas Vinkemeier T. <i>Haptics - Hadoop Performance Testing in Concurrent Job Scenarios</i>. Universität Paderborn; 2013.","chicago":"Niklas Vinkemeier, Tim. <i>Haptics - Hadoop Performance Testing in Concurrent Job Scenarios</i>. Universität Paderborn, 2013.","ieee":"T. Niklas Vinkemeier, <i>Haptics - Hadoop performance testing in concurrent job scenarios</i>. Universität Paderborn, 2013.","apa":"Niklas Vinkemeier, T. (2013). <i>Haptics - Hadoop performance testing in concurrent job scenarios</i>. Universität Paderborn.","bibtex":"@book{Niklas Vinkemeier_2013, title={Haptics - Hadoop performance testing in concurrent job scenarios}, publisher={Universität Paderborn}, author={Niklas Vinkemeier, Tim}, year={2013} }","short":"T. Niklas Vinkemeier, Haptics - Hadoop Performance Testing in Concurrent Job Scenarios, Universität Paderborn, 2013.","mla":"Niklas Vinkemeier, Tim. <i>Haptics - Hadoop Performance Testing in Concurrent Job Scenarios</i>. Universität Paderborn, 2013."},"title":"Haptics - Hadoop performance testing in concurrent job scenarios","date_updated":"2022-01-06T07:01:48Z","publisher":"Universität Paderborn","author":[{"first_name":"Tim","full_name":"Niklas Vinkemeier, Tim","last_name":"Niklas Vinkemeier"}],"date_created":"2017-10-17T12:42:34Z","status":"public","type":"bachelorsthesis","_id":"525","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"75"}],"user_id":"15504"},{"user_id":"15504","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"526","type":"mastersthesis","status":"public","date_created":"2017-10-17T12:42:35Z","author":[{"last_name":"Mäcker","full_name":"Mäcker, Alexander","id":"13536","first_name":"Alexander"}],"date_updated":"2022-01-06T07:01:48Z","publisher":"Universität Paderborn","title":"Greedy Network Creation With Heavy And Light Edges","citation":{"apa":"Mäcker, A. (2013). <i>Greedy Network Creation With Heavy And Light Edges</i>. Universität Paderborn.","mla":"Mäcker, Alexander. <i>Greedy Network Creation With Heavy And Light Edges</i>. Universität Paderborn, 2013.","short":"A. Mäcker, Greedy Network Creation With Heavy And Light Edges, Universität Paderborn, 2013.","bibtex":"@book{Mäcker_2013, title={Greedy Network Creation With Heavy And Light Edges}, publisher={Universität Paderborn}, author={Mäcker, Alexander}, year={2013} }","ama":"Mäcker A. <i>Greedy Network Creation With Heavy And Light Edges</i>. Universität Paderborn; 2013.","ieee":"A. Mäcker, <i>Greedy Network Creation With Heavy And Light Edges</i>. Universität Paderborn, 2013.","chicago":"Mäcker, Alexander. <i>Greedy Network Creation With Heavy And Light Edges</i>. Universität Paderborn, 2013."},"year":"2013"},{"user_id":"15504","department":[{"_id":"75"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"534","type":"mastersthesis","status":"public","date_created":"2017-10-17T12:42:36Z","author":[{"first_name":"Suhas","last_name":"Satya","full_name":"Satya, Suhas"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:50Z","title":"Emulating Wavelength Division Multiplexing using Openflow","citation":{"apa":"Satya, S. (2013). <i>Emulating Wavelength Division Multiplexing using Openflow</i>. Universität Paderborn.","bibtex":"@book{Satya_2013, title={Emulating Wavelength Division Multiplexing using Openflow}, publisher={Universität Paderborn}, author={Satya, Suhas}, year={2013} }","mla":"Satya, Suhas. <i>Emulating Wavelength Division Multiplexing Using Openflow</i>. Universität Paderborn, 2013.","short":"S. Satya, Emulating Wavelength Division Multiplexing Using Openflow, Universität Paderborn, 2013.","ama":"Satya S. <i>Emulating Wavelength Division Multiplexing Using Openflow</i>. Universität Paderborn; 2013.","ieee":"S. Satya, <i>Emulating Wavelength Division Multiplexing using Openflow</i>. Universität Paderborn, 2013.","chicago":"Satya, Suhas. <i>Emulating Wavelength Division Multiplexing Using Openflow</i>. Universität Paderborn, 2013."},"year":"2013"},{"type":"mastersthesis","status":"public","citation":{"ieee":"M. Reineke, <i>Effizienzsteigerung durch gewichtete Produktbewertungen</i>. Universität Paderborn, 2013.","chicago":"Reineke, Max. <i>Effizienzsteigerung durch gewichtete Produktbewertungen</i>. Universität Paderborn, 2013.","ama":"Reineke M. <i>Effizienzsteigerung durch gewichtete Produktbewertungen</i>. Universität Paderborn; 2013.","apa":"Reineke, M. (2013). <i>Effizienzsteigerung durch gewichtete Produktbewertungen</i>. Universität Paderborn.","mla":"Reineke, Max. <i>Effizienzsteigerung durch gewichtete Produktbewertungen</i>. Universität Paderborn, 2013.","short":"M. Reineke, Effizienzsteigerung durch gewichtete Produktbewertungen, Universität Paderborn, 2013.","bibtex":"@book{Reineke_2013, title={Effizienzsteigerung durch gewichtete Produktbewertungen}, publisher={Universität Paderborn}, author={Reineke, Max}, year={2013} }"},"year":"2013","user_id":"477","date_created":"2017-10-17T12:42:36Z","author":[{"full_name":"Reineke, Max","last_name":"Reineke","first_name":"Max"}],"_id":"535","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:50Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"language":[{"iso":"ger"}],"title":"Effizienzsteigerung durch gewichtete Produktbewertungen"},{"_id":"536","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"205"}],"user_id":"13264","status":"public","type":"mastersthesis","title":"Dynamic One-to-One Matching: Theory and a Job Market Application","date_updated":"2022-01-06T07:01:50Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:36Z","author":[{"first_name":"Nadja","full_name":"Stroh-Maraun, Nadja","id":"13264","last_name":"Stroh-Maraun"}],"year":"2013","citation":{"mla":"Stroh-Maraun, Nadja. <i>Dynamic One-to-One Matching: Theory and a Job Market Application</i>. Universität Paderborn, 2013.","bibtex":"@book{Stroh-Maraun_2013, title={Dynamic One-to-One Matching: Theory and a Job Market Application}, publisher={Universität Paderborn}, author={Stroh-Maraun, Nadja}, year={2013} }","short":"N. Stroh-Maraun, Dynamic One-to-One Matching: Theory and a Job Market Application, Universität Paderborn, 2013.","apa":"Stroh-Maraun, N. (2013). <i>Dynamic One-to-One Matching: Theory and a Job Market Application</i>. Universität Paderborn.","ieee":"N. Stroh-Maraun, <i>Dynamic One-to-One Matching: Theory and a Job Market Application</i>. Universität Paderborn, 2013.","chicago":"Stroh-Maraun, Nadja. <i>Dynamic One-to-One Matching: Theory and a Job Market Application</i>. Universität Paderborn, 2013.","ama":"Stroh-Maraun N. <i>Dynamic One-to-One Matching: Theory and a Job Market Application</i>. Universität Paderborn; 2013."}},{"author":[{"last_name":"Heindorf","full_name":"Heindorf, Stefan","first_name":"Stefan"}],"date_created":"2017-10-17T12:42:37Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:50Z","title":"Dispersion of Multi-Robot Teams","citation":{"ieee":"S. Heindorf, <i>Dispersion of Multi-Robot Teams</i>. Universität Paderborn, 2013.","chicago":"Heindorf, Stefan. <i>Dispersion of Multi-Robot Teams</i>. Universität Paderborn, 2013.","ama":"Heindorf S. <i>Dispersion of Multi-Robot Teams</i>. Universität Paderborn; 2013.","bibtex":"@book{Heindorf_2013, title={Dispersion of Multi-Robot Teams}, publisher={Universität Paderborn}, author={Heindorf, Stefan}, year={2013} }","short":"S. Heindorf, Dispersion of Multi-Robot Teams, Universität Paderborn, 2013.","mla":"Heindorf, Stefan. <i>Dispersion of Multi-Robot Teams</i>. Universität Paderborn, 2013.","apa":"Heindorf, S. (2013). <i>Dispersion of Multi-Robot Teams</i>. Universität Paderborn."},"year":"2013","user_id":"15504","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"537","type":"mastersthesis","status":"public"},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"539","user_id":"477","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:51Z","date_created":"2017-10-17T12:42:37Z","author":[{"first_name":"Tobias","full_name":"Kornhoff, Tobias","last_name":"Kornhoff"}],"title":"Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen","year":"2013","citation":{"ieee":"T. Kornhoff, <i>Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen</i>. Universität Paderborn, 2013.","chicago":"Kornhoff, Tobias. <i>Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen</i>. Universität Paderborn, 2013.","ama":"Kornhoff T. <i>Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen</i>. Universität Paderborn; 2013.","short":"T. Kornhoff, Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen, Universität Paderborn, 2013.","bibtex":"@book{Kornhoff_2013, title={Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen}, publisher={Universität Paderborn}, author={Kornhoff, Tobias}, year={2013} }","mla":"Kornhoff, Tobias. <i>Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen</i>. Universität Paderborn, 2013.","apa":"Kornhoff, T. (2013). <i>Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen</i>. Universität Paderborn."}},{"has_accepted_license":"1","citation":{"apa":"Graffi, K., &#38; Rapp, V. (2013). Continuous Gossip-based Aggregation through Dynamic Information Aging. In <i>Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13)</i> (pp. 1–7). <a href=\"https://doi.org/10.1109/ICCCN.2013.6614118\">https://doi.org/10.1109/ICCCN.2013.6614118</a>","mla":"Graffi, Kalman, and Vitaly Rapp. “Continuous Gossip-Based Aggregation through Dynamic Information Aging.” <i>Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13)</i>, 2013, pp. 1–7, doi:<a href=\"https://doi.org/10.1109/ICCCN.2013.6614118\">10.1109/ICCCN.2013.6614118</a>.","bibtex":"@inproceedings{Graffi_Rapp_2013, title={Continuous Gossip-based Aggregation through Dynamic Information Aging}, DOI={<a href=\"https://doi.org/10.1109/ICCCN.2013.6614118\">10.1109/ICCCN.2013.6614118</a>}, booktitle={Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13)}, author={Graffi, Kalman and Rapp, Vitaly}, year={2013}, pages={1–7} }","short":"K. Graffi, V. Rapp, in: Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13), 2013, pp. 1–7.","chicago":"Graffi, Kalman, and Vitaly Rapp. “Continuous Gossip-Based Aggregation through Dynamic Information Aging.” In <i>Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13)</i>, 1–7, 2013. <a href=\"https://doi.org/10.1109/ICCCN.2013.6614118\">https://doi.org/10.1109/ICCCN.2013.6614118</a>.","ieee":"K. Graffi and V. Rapp, “Continuous Gossip-based Aggregation through Dynamic Information Aging,” in <i>Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13)</i>, 2013, pp. 1–7.","ama":"Graffi K, Rapp V. Continuous Gossip-based Aggregation through Dynamic Information Aging. In: <i>Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13)</i>. ; 2013:1-7. doi:<a href=\"https://doi.org/10.1109/ICCCN.2013.6614118\">10.1109/ICCCN.2013.6614118</a>"},"page":"1-7","year":"2013","author":[{"last_name":"Graffi","full_name":"Graffi, Kalman","first_name":"Kalman"},{"first_name":"Vitaly","last_name":"Rapp","full_name":"Rapp, Vitaly"}],"date_created":"2017-10-17T12:42:37Z","date_updated":"2022-01-06T07:01:52Z","doi":"10.1109/ICCCN.2013.6614118","title":"Continuous Gossip-based Aggregation through Dynamic Information Aging","type":"conference","publication":"Proceedings of the International Conference on Computer Communications and Networks (ICCCN'13)","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-15T10:33:20Z","date_created":"2018-03-15T10:33:20Z","creator":"florida","file_size":272960,"file_id":"1290","access_level":"closed","file_name":"541-Continuous.Gossip.based.Aggregation.Through.Dynamic.Information.Aging.pdf"}],"status":"public","abstract":[{"text":"Existing solutions for gossip-based aggregation in peer-to-peer networks use epochs to calculate a global estimation from an initial static set of local values. Once the estimation converges system-wide, a new epoch is started with fresh initial values. Long epochs result in precise estimations based on old measurements and short epochs result in imprecise aggregated estimations. In contrast to this approach, we present in this paper a continuous, epoch-less approach which considers fresh local values in every round of the gossip-based aggregation. By using an approach for dynamic information aging, inaccurate values and values from left peers fade from the aggregation memory. Evaluation shows that the presented approach for continuous information aggregation in peer-to-peer systems monitors the system performance precisely, adapts to changes and is lightweight to operate.","lang":"eng"}],"user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"541","language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T10:33:20Z","ddc":["040"]},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"544","user_id":"14052","department":[{"_id":"79"}],"ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T10:32:17Z","type":"conference","publication":"Proceedings of the International Conference on High Performance Computing and Simulation (HPCS'13)","abstract":[{"lang":"eng","text":"Comparative evaluations of peer-to-peer protocols through simulations are a viable approach to judge the performance and costs of the individual protocols in large-scale networks. In order to support this work, we enhanced the peer-to-peer systems simulator PeerfactSim.KOM with a fine-grained analyzer concept, with exhaustive automated measurements and gnuplot generators as well as a coordination control to evaluate a set of experiment setups in parallel. Thus, by configuring all experiments and protocols only once and starting the simulator, all desired measurements are performed, analyzed, evaluated and combined, resulting in a holistic environment for the comparative evaluation of peer-to-peer systems."}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":899441,"file_name":"544-FeldGraffi13.pdf","access_level":"closed","file_id":"1288","date_updated":"2018-03-15T10:32:17Z","creator":"florida","date_created":"2018-03-15T10:32:17Z"}],"status":"public","date_updated":"2022-01-06T07:01:53Z","author":[{"first_name":"Matthias","last_name":"Feldotto","orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","id":"14052"},{"first_name":"Kalman","last_name":"Graffi","full_name":"Graffi, Kalman"}],"date_created":"2017-10-17T12:42:38Z","title":"Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM","doi":"10.1109/HPCSim.2013.6641399","has_accepted_license":"1","year":"2013","citation":{"mla":"Feldotto, Matthias, and Kalman Graffi. “Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.” <i>Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13)</i>, 2013, pp. 99–106, doi:<a href=\"https://doi.org/10.1109/HPCSim.2013.6641399\">10.1109/HPCSim.2013.6641399</a>.","bibtex":"@inproceedings{Feldotto_Graffi_2013, title={Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM}, DOI={<a href=\"https://doi.org/10.1109/HPCSim.2013.6641399\">10.1109/HPCSim.2013.6641399</a>}, booktitle={Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13)}, author={Feldotto, Matthias and Graffi, Kalman}, year={2013}, pages={99–106} }","short":"M. Feldotto, K. Graffi, in: Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13), 2013, pp. 99–106.","apa":"Feldotto, M., &#38; Graffi, K. (2013). Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM. In <i>Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13)</i> (pp. 99–106). <a href=\"https://doi.org/10.1109/HPCSim.2013.6641399\">https://doi.org/10.1109/HPCSim.2013.6641399</a>","ieee":"M. Feldotto and K. Graffi, “Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM,” in <i>Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13)</i>, 2013, pp. 99–106.","chicago":"Feldotto, Matthias, and Kalman Graffi. “Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.” In <i>Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13)</i>, 99–106, 2013. <a href=\"https://doi.org/10.1109/HPCSim.2013.6641399\">https://doi.org/10.1109/HPCSim.2013.6641399</a>.","ama":"Feldotto M, Graffi K. Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM. In: <i>Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13)</i>. ; 2013:99-106. doi:<a href=\"https://doi.org/10.1109/HPCSim.2013.6641399\">10.1109/HPCSim.2013.6641399</a>"},"page":"99-106"},{"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"_id":"545","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"user_id":"477","year":"2013","citation":{"apa":"Blumentritt, F. (2013). <i>Cliquenbildung in verteilten Systemen</i>. Universität Paderborn.","short":"F. Blumentritt, Cliquenbildung in verteilten Systemen, Universität Paderborn, 2013.","bibtex":"@book{Blumentritt_2013, title={Cliquenbildung in verteilten Systemen}, publisher={Universität Paderborn}, author={Blumentritt, Fritz}, year={2013} }","mla":"Blumentritt, Fritz. <i>Cliquenbildung in verteilten Systemen</i>. Universität Paderborn, 2013.","ama":"Blumentritt F. <i>Cliquenbildung in verteilten Systemen</i>. Universität Paderborn; 2013.","chicago":"Blumentritt, Fritz. <i>Cliquenbildung in verteilten Systemen</i>. Universität Paderborn, 2013.","ieee":"F. Blumentritt, <i>Cliquenbildung in verteilten Systemen</i>. Universität Paderborn, 2013."},"title":"Cliquenbildung in verteilten Systemen","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:54Z","date_created":"2017-10-17T12:42:38Z","author":[{"first_name":"Fritz","last_name":"Blumentritt","full_name":"Blumentritt, Fritz"}]},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Subproject C1","_id":"13"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"546","user_id":"15504","department":[{"_id":"79"}],"ddc":["040"],"file_date_updated":"2018-03-15T10:30:42Z","type":"conference","publication":"Proceedings of the Conference on Networked Systems (NetSys)","abstract":[{"text":"Self-stabilization is the property of a system to transfer itself regardless of the initial state into a legitimate state. Chord as a simple, decentralized and scalable distributed hash table is an ideal showcase to introduce self-stabilization for p2p overlays. In this paper, we present Re-Chord, a self-stabilizing version of Chord. We show, that the stabilization process is functional, but prone to strong churn. For that, we present Ca-Re-Chord, a churn resistant version of Re-Chord, that allows the creation of a useful DHT in any kind of graph regardless of the initial state. Simulation results attest the churn resistance and good performance of Ca-Re-Chord.","lang":"eng"}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":244841,"file_name":"546-Kalman.Graffi_CaReChord.A.Churn.Resistant.Selfstabilizing.Chord.Overlay.Network_02.pdf","access_level":"closed","file_id":"1286","date_updated":"2018-03-15T10:30:42Z","creator":"florida","date_created":"2018-03-15T10:30:42Z"}],"status":"public","date_updated":"2022-01-06T07:01:55Z","date_created":"2017-10-17T12:42:38Z","author":[{"first_name":"Kalman","full_name":"Graffi, Kalman","last_name":"Graffi"},{"last_name":"Benter","full_name":"Benter, Markus","first_name":"Markus"},{"last_name":"Divband","full_name":"Divband, Mohammad","first_name":"Mohammad"},{"full_name":"Kniesburges, Sebastian","last_name":"Kniesburges","first_name":"Sebastian"},{"first_name":"Andreas","full_name":"Koutsopoulos, Andreas","last_name":"Koutsopoulos"}],"title":"Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network","doi":"10.1109/NetSys.2013.11","has_accepted_license":"1","year":"2013","citation":{"bibtex":"@inproceedings{Graffi_Benter_Divband_Kniesburges_Koutsopoulos_2013, title={Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network}, DOI={<a href=\"https://doi.org/10.1109/NetSys.2013.11\">10.1109/NetSys.2013.11</a>}, booktitle={Proceedings of the Conference on Networked Systems (NetSys)}, author={Graffi, Kalman and Benter, Markus and Divband, Mohammad and Kniesburges, Sebastian and Koutsopoulos, Andreas}, year={2013}, pages={27–34} }","short":"K. Graffi, M. Benter, M. Divband, S. Kniesburges, A. Koutsopoulos, in: Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 27–34.","mla":"Graffi, Kalman, et al. “Ca-Re-Chord: A Churn Resistant Self-Stabilizing Chord Overlay Network.” <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 2013, pp. 27–34, doi:<a href=\"https://doi.org/10.1109/NetSys.2013.11\">10.1109/NetSys.2013.11</a>.","apa":"Graffi, K., Benter, M., Divband, M., Kniesburges, S., &#38; Koutsopoulos, A. (2013). Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network. In <i>Proceedings of the Conference on Networked Systems (NetSys)</i> (pp. 27–34). <a href=\"https://doi.org/10.1109/NetSys.2013.11\">https://doi.org/10.1109/NetSys.2013.11</a>","ama":"Graffi K, Benter M, Divband M, Kniesburges S, Koutsopoulos A. Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network. In: <i>Proceedings of the Conference on Networked Systems (NetSys)</i>. ; 2013:27-34. doi:<a href=\"https://doi.org/10.1109/NetSys.2013.11\">10.1109/NetSys.2013.11</a>","chicago":"Graffi, Kalman, Markus Benter, Mohammad Divband, Sebastian Kniesburges, and Andreas Koutsopoulos. “Ca-Re-Chord: A Churn Resistant Self-Stabilizing Chord Overlay Network.” In <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 27–34, 2013. <a href=\"https://doi.org/10.1109/NetSys.2013.11\">https://doi.org/10.1109/NetSys.2013.11</a>.","ieee":"K. Graffi, M. Benter, M. Divband, S. Kniesburges, and A. Koutsopoulos, “Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network,” in <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 2013, pp. 27–34."},"page":"27-34"},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"548","user_id":"477","department":[{"_id":"79"}],"ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T10:30:09Z","type":"conference","publication":"Proceedings of the International Conference on Peer-to-Peer Computing (P2P'13)","abstract":[{"text":"Peer-to-peer systems scale to millions of nodes and provide routing and storage functions with best effort quality. In order to provide a guaranteed quality of the overlay functions, even under strong dynamics in the network with regard to peer capacities, online participation and usage patterns, we propose to calibrate the peer-to-peer overlay and to autonomously learn which qualities can be reached. For that, we simulate the peer-to-peer overlay systematically under a wide range of parameter configurations and use neural networks to learn the effects of the configurations on the quality metrics. Thus, by choosing a specific quality setting by the overlay operator, the network can tune itself to the learned parameter configurations that lead to the desired quality. Evaluation shows that the presented self-calibration succeeds in learning the configuration-quality interdependencies and that peer-to-peer systems can learn and adapt their behavior according to desired quality goals.","lang":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-15T10:30:09Z","creator":"florida","date_updated":"2018-03-15T10:30:09Z","file_name":"548-Bootstrapping.Skynet.Calibration.and.Autonomic.Self-Control.of.Structured.P2P.Networks_01.pdf","access_level":"closed","file_id":"1285","file_size":629234}],"status":"public","date_updated":"2022-01-06T07:01:56Z","author":[{"full_name":"Graffi, Kalman","last_name":"Graffi","first_name":"Kalman"},{"last_name":"Klerx","full_name":"Klerx, Timo","first_name":"Timo"}],"date_created":"2017-10-17T12:42:39Z","title":"Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks","doi":"10.1109/P2P.2013.6688720","has_accepted_license":"1","year":"2013","citation":{"ama":"Graffi K, Klerx T. Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks. In: <i>Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13)</i>. ; 2013:1-5. doi:<a href=\"https://doi.org/10.1109/P2P.2013.6688720\">10.1109/P2P.2013.6688720</a>","ieee":"K. Graffi and T. Klerx, “Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks,” in <i>Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13)</i>, 2013, pp. 1–5.","chicago":"Graffi, Kalman, and Timo Klerx. “Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks.” In <i>Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13)</i>, 1–5, 2013. <a href=\"https://doi.org/10.1109/P2P.2013.6688720\">https://doi.org/10.1109/P2P.2013.6688720</a>.","short":"K. Graffi, T. Klerx, in: Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13), 2013, pp. 1–5.","mla":"Graffi, Kalman, and Timo Klerx. “Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks.” <i>Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13)</i>, 2013, pp. 1–5, doi:<a href=\"https://doi.org/10.1109/P2P.2013.6688720\">10.1109/P2P.2013.6688720</a>.","bibtex":"@inproceedings{Graffi_Klerx_2013, title={Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks}, DOI={<a href=\"https://doi.org/10.1109/P2P.2013.6688720\">10.1109/P2P.2013.6688720</a>}, booktitle={Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13)}, author={Graffi, Kalman and Klerx, Timo}, year={2013}, pages={1–5} }","apa":"Graffi, K., &#38; Klerx, T. (2013). Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks. In <i>Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13)</i> (pp. 1–5). <a href=\"https://doi.org/10.1109/P2P.2013.6688720\">https://doi.org/10.1109/P2P.2013.6688720</a>"},"page":"1-5"},{"type":"bachelorsthesis","year":"2013","status":"public","citation":{"mla":"Meckenstock, Kevin. <i>Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse</i>. Universität Paderborn, 2013.","bibtex":"@book{Meckenstock_2013, title={Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse}, publisher={Universität Paderborn}, author={Meckenstock, Kevin}, year={2013} }","short":"K. Meckenstock, Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse, Universität Paderborn, 2013.","apa":"Meckenstock, K. (2013). <i>Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse</i>. Universität Paderborn.","ama":"Meckenstock K. <i>Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse</i>. Universität Paderborn; 2013.","chicago":"Meckenstock, Kevin. <i>Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse</i>. Universität Paderborn, 2013.","ieee":"K. Meckenstock, <i>Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse</i>. Universität Paderborn, 2013."},"_id":"552","date_updated":"2022-01-06T07:01:57Z","publisher":"Universität Paderborn","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_created":"2017-10-17T12:42:39Z","user_id":"477","author":[{"first_name":"Kevin","last_name":"Meckenstock","full_name":"Meckenstock, Kevin"}],"title":"Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse","language":[{"iso":"ger"}]},{"citation":{"bibtex":"@article{Brangewitz_Gamp_2013, title={Asymmetric Nash bargaining solutions and competitive payoffs}, DOI={<a href=\"https://doi.org/10.1016/j.econlet.2013.08.013\">10.1016/j.econlet.2013.08.013</a>}, number={2}, journal={Economics Letters}, publisher={Elsevier}, author={Brangewitz, Sonja and Gamp, Jan-Philip}, year={2013}, pages={224–227} }","mla":"Brangewitz, Sonja, and Jan-Philip Gamp. “Asymmetric Nash Bargaining Solutions and Competitive Payoffs.” <i>Economics Letters</i>, no. 2, Elsevier, 2013, pp. 224–27, doi:<a href=\"https://doi.org/10.1016/j.econlet.2013.08.013\">10.1016/j.econlet.2013.08.013</a>.","short":"S. Brangewitz, J.-P. Gamp, Economics Letters (2013) 224–227.","apa":"Brangewitz, S., &#38; Gamp, J.-P. (2013). Asymmetric Nash bargaining solutions and competitive payoffs. <i>Economics Letters</i>, (2), 224–227. <a href=\"https://doi.org/10.1016/j.econlet.2013.08.013\">https://doi.org/10.1016/j.econlet.2013.08.013</a>","ieee":"S. Brangewitz and J.-P. Gamp, “Asymmetric Nash bargaining solutions and competitive payoffs,” <i>Economics Letters</i>, no. 2, pp. 224–227, 2013.","chicago":"Brangewitz, Sonja, and Jan-Philip Gamp. “Asymmetric Nash Bargaining Solutions and Competitive Payoffs.” <i>Economics Letters</i>, no. 2 (2013): 224–27. <a href=\"https://doi.org/10.1016/j.econlet.2013.08.013\">https://doi.org/10.1016/j.econlet.2013.08.013</a>.","ama":"Brangewitz S, Gamp J-P. Asymmetric Nash bargaining solutions and competitive payoffs. <i>Economics Letters</i>. 2013;(2):224-227. doi:<a href=\"https://doi.org/10.1016/j.econlet.2013.08.013\">10.1016/j.econlet.2013.08.013</a>"},"page":"224 - 227","has_accepted_license":"1","doi":"10.1016/j.econlet.2013.08.013","date_updated":"2022-01-06T07:01:58Z","author":[{"first_name":"Sonja","last_name":"Brangewitz","full_name":"Brangewitz, Sonja"},{"last_name":"Gamp","full_name":"Gamp, Jan-Philip","first_name":"Jan-Philip"}],"status":"public","type":"journal_article","file_date_updated":"2018-03-15T10:29:34Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"554","user_id":"477","department":[{"_id":"205"}],"year":"2013","issue":"2","title":"Asymmetric Nash bargaining solutions and competitive payoffs","publisher":"Elsevier","date_created":"2017-10-17T12:42:40Z","abstract":[{"lang":"eng","text":"We establish a link between cooperative and competitive behavior. For every possible vector of weights of an asymmetric Nash bargaining solution there exists a market that has this asymmetric Nash bargaining solution as its unique competitive payoff vector."}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-15T10:29:34Z","date_created":"2018-03-15T10:29:34Z","creator":"florida","file_size":374965,"access_level":"closed","file_id":"1284","file_name":"554-Asymmetric_Nash_bargaining_solutions_and_competitive_payoffs.pdf"}],"publication":"Economics Letters","ddc":["040"],"language":[{"iso":"eng"}]},{"department":[{"_id":"79"}],"user_id":"477","_id":"555","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","type":"mastersthesis","title":"Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs","date_created":"2017-10-17T12:42:40Z","author":[{"id":"11108","full_name":"Setzer, Alexander","last_name":"Setzer","first_name":"Alexander"}],"date_updated":"2022-01-06T07:01:59Z","publisher":"Universität Paderborn","citation":{"chicago":"Setzer, Alexander. <i>Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs</i>. Universität Paderborn, 2013.","ieee":"A. Setzer, <i>Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs</i>. Universität Paderborn, 2013.","ama":"Setzer A. <i>Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs</i>. Universität Paderborn; 2013.","bibtex":"@book{Setzer_2013, title={Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs}, publisher={Universität Paderborn}, author={Setzer, Alexander}, year={2013} }","short":"A. Setzer, Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs, Universität Paderborn, 2013.","mla":"Setzer, Alexander. <i>Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs</i>. Universität Paderborn, 2013.","apa":"Setzer, A. (2013). <i>Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs</i>. Universität Paderborn."},"year":"2013"},{"year":"2013","title":"Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics","publisher":"Springer","date_created":"2017-10-17T12:42:41Z","file":[{"date_updated":"2018-11-02T16:29:07Z","date_created":"2018-11-02T16:29:07Z","creator":"ups","file_size":9186107,"file_id":"5327","access_level":"closed","file_name":"2014_Book_AlgorithmsForSensorSystems-1.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"ddc":["000"],"language":[{"iso":"eng"}],"intvolume":"      8243","citation":{"chicago":"Flocchini, Paola, Jie Gao, Evangelos Kranakis, and Friedhelm Meyer auf der Heide, eds. <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics</i>. Vol. 8243. LNCS. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-45346-5\">https://doi.org/10.1007/978-3-642-45346-5</a>.","ieee":"P. Flocchini, J. Gao, E. Kranakis, and F. Meyer auf der Heide, Eds., <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics</i>, vol. 8243. Springer, 2013.","ama":"Flocchini P, Gao J, Kranakis E, Meyer auf der Heide F, eds. <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics</i>. Vol 8243. Springer; 2013. doi:<a href=\"https://doi.org/10.1007/978-3-642-45346-5\">10.1007/978-3-642-45346-5</a>","bibtex":"@book{Flocchini_Gao_Kranakis_Meyer auf der Heide_2013, series={LNCS}, title={Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics}, volume={8243}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-45346-5\">10.1007/978-3-642-45346-5</a>}, publisher={Springer}, year={2013}, collection={LNCS} }","short":"P. Flocchini, J. Gao, E. Kranakis, F. Meyer auf der Heide, eds., Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, Springer, 2013.","mla":"Flocchini, Paola, et al., editors. <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics</i>. Vol. 8243, Springer, 2013, doi:<a href=\"https://doi.org/10.1007/978-3-642-45346-5\">10.1007/978-3-642-45346-5</a>.","apa":"Flocchini, P., Gao, J., Kranakis, E., &#38; Meyer auf der Heide, F. (Eds.). (2013). <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics</i> (Vol. 8243). Presented at the ALGOSENSORS 2013, Sophia Antipolis, France: Springer. <a href=\"https://doi.org/10.1007/978-3-642-45346-5\">https://doi.org/10.1007/978-3-642-45346-5</a>"},"has_accepted_license":"1","doi":"10.1007/978-3-642-45346-5","conference":{"start_date":"2013-09-05","name":"ALGOSENSORS 2013","location":"Sophia Antipolis, France","end_date":"2013-09-06"},"date_updated":"2022-01-06T07:02:02Z","volume":8243,"editor":[{"last_name":"Flocchini","full_name":"Flocchini, Paola","first_name":"Paola"},{"first_name":"Jie","full_name":"Gao, Jie","last_name":"Gao"},{"first_name":"Evangelos","full_name":"Kranakis, Evangelos","last_name":"Kranakis"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"status":"public","type":"conference_editor","file_date_updated":"2018-11-02T16:29:07Z","_id":"558","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"63"}],"series_title":"LNCS","user_id":"477"},{"date_updated":"2022-01-06T07:02:04Z","author":[{"first_name":"Philip","last_name":"Wette","full_name":"Wette, Philip"},{"full_name":"Graffi, Kalman","last_name":"Graffi","first_name":"Kalman"}],"date_created":"2017-10-17T12:42:41Z","title":"Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables","doi":"10.1109/NetSys.2013.9","has_accepted_license":"1","year":"2013","citation":{"chicago":"Wette, Philip, and Kalman Graffi. “Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables.” In <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 35–42, 2013. <a href=\"https://doi.org/10.1109/NetSys.2013.9\">https://doi.org/10.1109/NetSys.2013.9</a>.","ieee":"P. Wette and K. Graffi, “Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables,” in <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 2013, pp. 35–42.","ama":"Wette P, Graffi K. Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables. In: <i>Proceedings of the Conference on Networked Systems (NetSys)</i>. ; 2013:35-42. doi:<a href=\"https://doi.org/10.1109/NetSys.2013.9\">10.1109/NetSys.2013.9</a>","apa":"Wette, P., &#38; Graffi, K. (2013). Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables. In <i>Proceedings of the Conference on Networked Systems (NetSys)</i> (pp. 35–42). <a href=\"https://doi.org/10.1109/NetSys.2013.9\">https://doi.org/10.1109/NetSys.2013.9</a>","bibtex":"@inproceedings{Wette_Graffi_2013, title={Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables}, DOI={<a href=\"https://doi.org/10.1109/NetSys.2013.9\">10.1109/NetSys.2013.9</a>}, booktitle={Proceedings of the Conference on Networked Systems (NetSys)}, author={Wette, Philip and Graffi, Kalman}, year={2013}, pages={35–42} }","short":"P. Wette, K. Graffi, in: Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 35–42.","mla":"Wette, Philip, and Kalman Graffi. “Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables.” <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 2013, pp. 35–42, doi:<a href=\"https://doi.org/10.1109/NetSys.2013.9\">10.1109/NetSys.2013.9</a>."},"page":"35-42","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"559","user_id":"477","department":[{"_id":"79"}],"ddc":["040"],"file_date_updated":"2018-03-15T10:27:21Z","language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the Conference on Networked Systems (NetSys)","abstract":[{"lang":"eng","text":"Distributed hash tables are very versatile to use, as distributed storage is a desirable feature for various applications. Typical structured overlays like Chord, Pastry or Kademlia consider only homogeneous nodes with equal capacities, which does not resemble reality. In a practical use case, nodes might get overloaded by storing popular data. In this paper, we present a general approach to enable capacity awareness and load-balancing capability of homogeneous structured overlays. We introduce a hierarchical second structured overlay aside, which allows efficient capacity-based access on the nodes in the system as hosting mirrors. Simulation results show that the structured overlay is able to store various contents, such as of a social network, with only a negligible number of overloaded peers. Content, even if very popular, is hosted by easily findable capable peers. Thus, long-existing and well-evaluated overlays like Chord or Pastry can be used to create attractive DHT-based applications."}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-15T10:27:21Z","creator":"florida","date_updated":"2018-03-15T10:27:21Z","access_level":"closed","file_name":"559-Adding.Capacity.Aware.Storage.Indirection.to.Homogeneous.Distributed.Hash.Tables.pdf","file_id":"1282","file_size":734618}],"status":"public"},{"page":"429-434","citation":{"apa":"Keller, M., Pawlik, S., Pietrzyk, P., &#38; Karl, H. (2013). A Local Heuristic for Latency-Optimized Distributed Cloud Deployment. In <i>Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing</i> (pp. 429–434). <a href=\"https://doi.org/10.1109/UCC.2013.85\">https://doi.org/10.1109/UCC.2013.85</a>","short":"M. Keller, S. Pawlik, P. Pietrzyk, H. Karl, in: Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud Computing, 2013, pp. 429–434.","bibtex":"@inproceedings{Keller_Pawlik_Pietrzyk_Karl_2013, title={A Local Heuristic for Latency-Optimized Distributed Cloud Deployment}, DOI={<a href=\"https://doi.org/10.1109/UCC.2013.85\">10.1109/UCC.2013.85</a>}, booktitle={Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing}, author={Keller, Matthias and Pawlik, Stefan and Pietrzyk, Peter and Karl, Holger}, year={2013}, pages={429–434} }","mla":"Keller, Matthias, et al. “A Local Heuristic for Latency-Optimized Distributed Cloud Deployment.” <i>Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud Computing</i>, 2013, pp. 429–34, doi:<a href=\"https://doi.org/10.1109/UCC.2013.85\">10.1109/UCC.2013.85</a>.","ama":"Keller M, Pawlik S, Pietrzyk P, Karl H. A Local Heuristic for Latency-Optimized Distributed Cloud Deployment. In: <i>Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud Computing</i>. ; 2013:429-434. doi:<a href=\"https://doi.org/10.1109/UCC.2013.85\">10.1109/UCC.2013.85</a>","chicago":"Keller, Matthias, Stefan Pawlik, Peter Pietrzyk, and Holger Karl. “A Local Heuristic for Latency-Optimized Distributed Cloud Deployment.” In <i>Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud Computing</i>, 429–34, 2013. <a href=\"https://doi.org/10.1109/UCC.2013.85\">https://doi.org/10.1109/UCC.2013.85</a>.","ieee":"M. Keller, S. Pawlik, P. Pietrzyk, and H. Karl, “A Local Heuristic for Latency-Optimized Distributed Cloud Deployment,” in <i>Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing</i>, 2013, pp. 429–434."},"year":"2013","has_accepted_license":"1","doi":"10.1109/UCC.2013.85","title":"A Local Heuristic for Latency-Optimized Distributed Cloud Deployment","author":[{"first_name":"Matthias","full_name":"Keller, Matthias","last_name":"Keller"},{"last_name":"Pawlik","full_name":"Pawlik, Stefan","first_name":"Stefan"},{"last_name":"Pietrzyk","full_name":"Pietrzyk, Peter","first_name":"Peter"},{"first_name":"Holger","last_name":"Karl","id":"126","full_name":"Karl, Holger"}],"date_created":"2017-10-17T12:42:41Z","date_updated":"2022-01-06T07:02:11Z","status":"public","file":[{"date_updated":"2018-03-15T10:25:45Z","date_created":"2018-03-15T10:25:45Z","creator":"florida","file_size":347873,"access_level":"closed","file_id":"1279","file_name":"562-dcc13_paper.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"text":"In Distributed Cloud Computing, applications are deployed across many data centres at topologically diverse locations to improved network-related quality of service (QoS). As we focus on interactive applications, we minimize the latency between users and an application by allocating Cloud resources nearby the customers. Allocating resources at all locations will result in the best latency but also in the highest expenses. So we need to find an optimal subset of locations which reduces the latency but also the expenses – the facility location problem (FLP). In addition, we consider resource capacity restrictions, as a resource can only serve a limited amount of users. An FLP can be globally solved. Additionally, we propose a local, distributed heuristic. This heuristic is running within the network and does not depend on a global component. No distributed, local approximations for the capacitated FLP have been proposed so far due to the complexity of the problem. We compared the heuristic with an optimal solution obtained from a mixed integer program for different network topologies. We investigated the influence of different parameters like overall resource utilization or different latency weights.","lang":"eng"}],"publication":"Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing","type":"conference","file_date_updated":"2018-03-15T10:25:45Z","language":[{"iso":"eng"}],"ddc":["040"],"department":[{"_id":"75"},{"_id":"63"}],"user_id":"477","_id":"562","project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}]}]