[{"date_updated":"2022-01-06T07:01:55Z","author":[{"first_name":"Kalman","last_name":"Graffi","full_name":"Graffi, Kalman"},{"first_name":"Markus","full_name":"Benter, Markus","last_name":"Benter"},{"first_name":"Mohammad","full_name":"Divband, Mohammad","last_name":"Divband"},{"full_name":"Kniesburges, Sebastian","last_name":"Kniesburges","first_name":"Sebastian"},{"last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas","first_name":"Andreas"}],"date_created":"2017-10-17T12:42:38Z","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":{"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>","short":"K. Graffi, M. Benter, M. Divband, S. Kniesburges, A. Koutsopoulos, in: Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 27–34.","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} }","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>.","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>","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.","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>."},"page":"27-34","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Subproject C1","_id":"13"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_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":[{"lang":"eng","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."}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"546-Kalman.Graffi_CaReChord.A.Churn.Resistant.Selfstabilizing.Chord.Overlay.Network_02.pdf","file_id":"1286","access_level":"closed","file_size":244841,"creator":"florida","date_created":"2018-03-15T10:30:42Z","date_updated":"2018-03-15T10:30:42Z"}],"status":"public"},{"_id":"548","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"79"}],"user_id":"477","ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T10:30:09Z","publication":"Proceedings of the International Conference on Peer-to-Peer Computing (P2P'13)","type":"conference","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"}],"status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-15T10:30:09Z","date_created":"2018-03-15T10:30:09Z","creator":"florida","file_size":629234,"file_id":"1285","file_name":"548-Bootstrapping.Skynet.Calibration.and.Autonomic.Self-Control.of.Structured.P2P.Networks_01.pdf","access_level":"closed"}],"date_updated":"2022-01-06T07:01:56Z","date_created":"2017-10-17T12:42:39Z","author":[{"full_name":"Graffi, Kalman","last_name":"Graffi","first_name":"Kalman"},{"first_name":"Timo","full_name":"Klerx, Timo","last_name":"Klerx"}],"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","page":"1-5","citation":{"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>.","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.","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>","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>.","short":"K. Graffi, T. Klerx, in: Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13), 2013, pp. 1–5.","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>"}},{"department":[{"_id":"79"}],"user_id":"477","_id":"555","project":[{"_id":"1","name":"SFB 901"},{"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","author":[{"first_name":"Alexander","id":"11108","full_name":"Setzer, Alexander","last_name":"Setzer"}],"date_created":"2017-10-17T12:42:40Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:59Z","citation":{"apa":"Setzer, A. (2013). <i>Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs</i>. Universität Paderborn.","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.","ieee":"A. Setzer, <i>Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs</i>. Universität Paderborn, 2013.","chicago":"Setzer, Alexander. <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."},"year":"2013"},{"has_accepted_license":"1","page":"35-42","citation":{"short":"P. Wette, K. Graffi, in: Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 35–42.","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} }","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>.","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>","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.","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>.","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>"},"year":"2013","author":[{"last_name":"Wette","full_name":"Wette, Philip","first_name":"Philip"},{"first_name":"Kalman","last_name":"Graffi","full_name":"Graffi, Kalman"}],"date_created":"2017-10-17T12:42:41Z","date_updated":"2022-01-06T07:02:04Z","doi":"10.1109/NetSys.2013.9","title":"Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables","publication":"Proceedings of the Conference on Networked Systems (NetSys)","type":"conference","status":"public","file":[{"date_created":"2018-03-15T10:27:21Z","creator":"florida","date_updated":"2018-03-15T10:27:21Z","file_name":"559-Adding.Capacity.Aware.Storage.Indirection.to.Homogeneous.Distributed.Hash.Tables.pdf","file_id":"1282","access_level":"closed","file_size":734618,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"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.","lang":"eng"}],"department":[{"_id":"79"}],"user_id":"477","_id":"559","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T10:27:21Z","ddc":["040"]},{"has_accepted_license":"1","citation":{"apa":"Kniesburges, S., Koutsopoulos, A., &#38; Scheideler, C. (2013). A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery. In <i>Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO)</i> (pp. 165–176). <a href=\"https://doi.org/10.1007/978-3-319-03578-9_14\">https://doi.org/10.1007/978-3-319-03578-9_14</a>","bibtex":"@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2013, series={Lecture Notes in Computer Science}, title={A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-03578-9_14\">10.1007/978-3-319-03578-9_14</a>}, booktitle={Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2013}, pages={165–176}, collection={Lecture Notes in Computer Science} }","mla":"Kniesburges, Sebastian, et al. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.” <i>Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO)</i>, 2013, pp. 165–76, doi:<a href=\"https://doi.org/10.1007/978-3-319-03578-9_14\">10.1007/978-3-319-03578-9_14</a>.","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO), 2013, pp. 165–176.","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.” In <i>Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO)</i>, 165–76. Lecture Notes in Computer Science, 2013. <a href=\"https://doi.org/10.1007/978-3-319-03578-9_14\">https://doi.org/10.1007/978-3-319-03578-9_14</a>.","ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery,” in <i>Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO)</i>, 2013, pp. 165–176.","ama":"Kniesburges S, Koutsopoulos A, Scheideler C. A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery. In: <i>Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO)</i>. Lecture Notes in Computer Science. ; 2013:165-176. doi:<a href=\"https://doi.org/10.1007/978-3-319-03578-9_14\">10.1007/978-3-319-03578-9_14</a>"},"page":"165-176","year":"2013","author":[{"first_name":"Sebastian","full_name":"Kniesburges, Sebastian","last_name":"Kniesburges"},{"full_name":"Koutsopoulos, Andreas","last_name":"Koutsopoulos","first_name":"Andreas"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"date_created":"2017-10-17T12:42:42Z","date_updated":"2022-01-06T07:02:17Z","doi":"10.1007/978-3-319-03578-9_14","title":"A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery","type":"conference","publication":"Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO)","file":[{"access_level":"closed","file_id":"1277","file_name":"564-SIROCCO13.pdf","file_size":168884,"date_created":"2018-03-15T10:24:40Z","creator":"florida","date_updated":"2018-03-15T10:24:40Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","abstract":[{"text":"We consider the problem of resource discovery in distributed systems. In particular we give an algorithm, such that each node in a network discovers the add ress of any other node in the network. We model the knowledge of the nodes as a virtual overlay network given by a directed graph such that complete knowledge of all nodes corresponds to a complete graph in the overlay network. Although there are several solutions for resource discovery, our solution is the first that achieves worst-case optimal work for each node, i.e. the number of addresses (O(n)) or bits (O(nlogn)) a node receives or sendscoincides with the lower bound, while ensuring only a linearruntime (O(n)) on the number of rounds.","lang":"eng"}],"series_title":"Lecture Notes in Computer Science","user_id":"15504","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":"564","file_date_updated":"2018-03-15T10:24:40Z","ddc":["040"]},{"department":[{"_id":"79"}],"user_id":"15504","_id":"1882","publication":"Theor. Comput. Sci.","type":"journal_article","status":"public","author":[{"full_name":"Dolev, Shlomi","last_name":"Dolev","first_name":"Shlomi"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2018-03-28T06:44:05Z","date_updated":"2022-01-06T06:53:52Z","doi":"10.1016/j.tcs.2012.07.012","title":"Editorial for Algorithmic Aspects of Wireless Sensor Networks","page":"1","citation":{"apa":"Dolev, S., &#38; Scheideler, C. (2012). Editorial for Algorithmic Aspects of Wireless Sensor Networks. <i>Theor. Comput. Sci.</i>, 1. <a href=\"https://doi.org/10.1016/j.tcs.2012.07.012\">https://doi.org/10.1016/j.tcs.2012.07.012</a>","mla":"Dolev, Shlomi, and Christian Scheideler. “Editorial for Algorithmic Aspects of Wireless Sensor Networks.” <i>Theor. Comput. Sci.</i>, 2012, p. 1, doi:<a href=\"https://doi.org/10.1016/j.tcs.2012.07.012\">10.1016/j.tcs.2012.07.012</a>.","short":"S. Dolev, C. Scheideler, Theor. Comput. Sci. (2012) 1.","bibtex":"@article{Dolev_Scheideler_2012, title={Editorial for Algorithmic Aspects of Wireless Sensor Networks}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2012.07.012\">10.1016/j.tcs.2012.07.012</a>}, journal={Theor. Comput. Sci.}, author={Dolev, Shlomi and Scheideler, Christian}, year={2012}, pages={1} }","ama":"Dolev S, Scheideler C. Editorial for Algorithmic Aspects of Wireless Sensor Networks. <i>Theor Comput Sci</i>. 2012:1. doi:<a href=\"https://doi.org/10.1016/j.tcs.2012.07.012\">10.1016/j.tcs.2012.07.012</a>","ieee":"S. Dolev and C. Scheideler, “Editorial for Algorithmic Aspects of Wireless Sensor Networks,” <i>Theor. Comput. Sci.</i>, p. 1, 2012.","chicago":"Dolev, Shlomi, and Christian Scheideler. “Editorial for Algorithmic Aspects of Wireless Sensor Networks.” <i>Theor. Comput. Sci.</i>, 2012, 1. <a href=\"https://doi.org/10.1016/j.tcs.2012.07.012\">https://doi.org/10.1016/j.tcs.2012.07.012</a>."},"year":"2012"},{"publication":"Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings","type":"conference","status":"public","department":[{"_id":"79"}],"series_title":"Lecture Notes in Computer Science","user_id":"15504","_id":"1884","publication_identifier":{"isbn":["978-3-642-32819-0"]},"page":"1--2","intvolume":"      7484","citation":{"ama":"Monien B, Scheideler C. Selfish Distributed Optimization. In: <i>Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings</i>. Vol 7484. Lecture Notes in Computer Science. Springer; 2012:1--2. doi:<a href=\"https://doi.org/10.1007/978-3-642-32820-6_1\">10.1007/978-3-642-32820-6_1</a>","ieee":"B. Monien and C. Scheideler, “Selfish Distributed Optimization,” in <i>Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings</i>, 2012, vol. 7484, pp. 1--2.","chicago":"Monien, Burkhard, and Christian Scheideler. “Selfish Distributed Optimization.” In <i>Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings</i>, 7484:1--2. Lecture Notes in Computer Science. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-32820-6_1\">https://doi.org/10.1007/978-3-642-32820-6_1</a>.","bibtex":"@inproceedings{Monien_Scheideler_2012, series={Lecture Notes in Computer Science}, title={Selfish Distributed Optimization}, volume={7484}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-32820-6_1\">10.1007/978-3-642-32820-6_1</a>}, booktitle={Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings}, publisher={Springer}, author={Monien, Burkhard and Scheideler, Christian}, year={2012}, pages={1--2}, collection={Lecture Notes in Computer Science} }","short":"B. Monien, C. Scheideler, in: Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings, Springer, 2012, pp. 1--2.","mla":"Monien, Burkhard, and Christian Scheideler. “Selfish Distributed Optimization.” <i>Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings</i>, vol. 7484, Springer, 2012, pp. 1--2, doi:<a href=\"https://doi.org/10.1007/978-3-642-32820-6_1\">10.1007/978-3-642-32820-6_1</a>.","apa":"Monien, B., &#38; Scheideler, C. (2012). Selfish Distributed Optimization. In <i>Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings</i> (Vol. 7484, pp. 1--2). Springer. <a href=\"https://doi.org/10.1007/978-3-642-32820-6_1\">https://doi.org/10.1007/978-3-642-32820-6_1</a>"},"year":"2012","volume":7484,"author":[{"first_name":"Burkhard","last_name":"Monien","full_name":"Monien, Burkhard"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_created":"2018-03-28T06:44:57Z","publisher":"Springer","date_updated":"2022-01-06T06:53:52Z","doi":"10.1007/978-3-642-32820-6_1","title":"Selfish Distributed Optimization"},{"_id":"17999","department":[{"_id":"79"}],"user_id":"15504","language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","date_updated":"2022-01-06T06:53:24Z","author":[{"full_name":"Meith, Frank Ingo","last_name":"Meith","first_name":"Frank Ingo"}],"supervisor":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"date_created":"2020-08-17T08:13:21Z","title":"Jamming-resistente MAC-Protokolle","year":"2012","citation":{"chicago":"Meith, Frank Ingo. <i>Jamming-Resistente MAC-Protokolle</i>, 2012.","ieee":"F. I. Meith, <i>Jamming-resistente MAC-Protokolle</i>. 2012.","ama":"Meith FI. <i>Jamming-Resistente MAC-Protokolle</i>.; 2012.","apa":"Meith, F. I. (2012). <i>Jamming-resistente MAC-Protokolle</i>.","short":"F.I. Meith, Jamming-Resistente MAC-Protokolle, 2012.","mla":"Meith, Frank Ingo. <i>Jamming-Resistente MAC-Protokolle</i>. 2012.","bibtex":"@book{Meith_2012, title={Jamming-resistente MAC-Protokolle}, author={Meith, Frank Ingo}, year={2012} }"}},{"title":"Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs","doi":"10.1016/j.tcs.2012.07.029","publisher":"Elsevier","date_updated":"2022-01-06T07:02:36Z","author":[{"first_name":"Riko","last_name":"Jacob","full_name":"Jacob, Riko"},{"first_name":"Stephan","full_name":"Ritscher, Stephan","last_name":"Ritscher"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"},{"first_name":"Stefan","full_name":"Schmid, Stefan","last_name":"Schmid"}],"date_created":"2017-10-17T12:42:43Z","year":"2012","page":"137-148","citation":{"apa":"Jacob, R., Ritscher, S., Scheideler, C., &#38; Schmid, S. (2012). Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs. <i>Theoretical Computer Science</i>, 137–148. <a href=\"https://doi.org/10.1016/j.tcs.2012.07.029\">https://doi.org/10.1016/j.tcs.2012.07.029</a>","mla":"Jacob, Riko, et al. “Towards Higher-Dimensional Topological Self-Stabilization: A Distributed Algorithm for Delaunay Graphs.” <i>Theoretical Computer Science</i>, Elsevier, 2012, pp. 137–48, doi:<a href=\"https://doi.org/10.1016/j.tcs.2012.07.029\">10.1016/j.tcs.2012.07.029</a>.","bibtex":"@article{Jacob_Ritscher_Scheideler_Schmid_2012, title={Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2012.07.029\">10.1016/j.tcs.2012.07.029</a>}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Jacob, Riko and Ritscher, Stephan and Scheideler, Christian and Schmid, Stefan}, year={2012}, pages={137–148} }","short":"R. Jacob, S. Ritscher, C. Scheideler, S. Schmid, Theoretical Computer Science (2012) 137–148.","chicago":"Jacob, Riko, Stephan Ritscher, Christian Scheideler, and Stefan Schmid. “Towards Higher-Dimensional Topological Self-Stabilization: A Distributed Algorithm for Delaunay Graphs.” <i>Theoretical Computer Science</i>, 2012, 137–48. <a href=\"https://doi.org/10.1016/j.tcs.2012.07.029\">https://doi.org/10.1016/j.tcs.2012.07.029</a>.","ieee":"R. Jacob, S. Ritscher, C. Scheideler, and S. Schmid, “Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs,” <i>Theoretical Computer Science</i>, pp. 137–148, 2012.","ama":"Jacob R, Ritscher S, Scheideler C, Schmid S. Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs. <i>Theoretical Computer Science</i>. 2012:137-148. doi:<a href=\"https://doi.org/10.1016/j.tcs.2012.07.029\">10.1016/j.tcs.2012.07.029</a>"},"has_accepted_license":"1","ddc":["040"],"file_date_updated":"2018-03-15T10:16:20Z","_id":"570","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"79"}],"user_id":"477","abstract":[{"text":"This article studies the construction of self-stabilizing topologies for distributed systems. While recent research has focused on chain topologies where nodes need to be linearized with respect to their identiers, we explore a natural and relevant 2-dimensional generalization. In particular, we present a local self-stabilizing algorithm DStab which is based on the concept of \\local Delaunay graphs\" and which forwards temporary edges in greedy fashion reminiscent of compass routing. DStab constructs a Delaunay graph from any initial connected topology and in a distributed manner in time O(n3) in the worst-case; if the initial network contains the Delaunay graph, the convergence time is only O(n) rounds. DStab also ensures that individual node joins and leaves aect a small part of the network only. Such self-stabilizing Delaunay networks have interesting applications and our construction gives insights into the necessary geometric reasoning that is required for higherdimensional linearization problems.Keywords: Distributed Algorithms, Topology Control, Social Networks","lang":"eng"}],"status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-15T10:16:20Z","date_created":"2018-03-15T10:16:20Z","creator":"florida","file_size":250051,"file_name":"570-Delaunay-Journal.pdf","file_id":"1272","access_level":"closed"}],"publication":"Theoretical Computer Science","type":"journal_article"},{"file_date_updated":"2018-03-15T09:09:29Z","ddc":["040"],"department":[{"_id":"79"}],"user_id":"477","_id":"574","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-15T09:09:29Z","creator":"florida","date_created":"2018-03-15T09:09:29Z","file_size":315843,"file_id":"1268","file_name":"574-tiara.pdf","access_level":"closed"}],"abstract":[{"lang":"eng","text":"We present Tiara — a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is truly deterministic which allows it to achieve exact performance bounds. Tiara allows logarithmic searches and topology updates. It is based on a novel sparse 0-1 skip list. We then describe its extension to a ringed structure and to a skip-graph.Key words: Peer-to-peer networks, overlay networks, self-stabilization."}],"publication":"Theoretical Computer Science","type":"journal_article","doi":"10.1016/j.tcs.2011.12.079","title":"Tiara: A self-stabilizing deterministic skip list and skip graph","date_created":"2017-10-17T12:42:44Z","author":[{"first_name":"Thomas","full_name":"Clouser, Thomas","last_name":"Clouser"},{"first_name":"Mikhail","full_name":"Nesterenko, Mikhail","last_name":"Nesterenko"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"date_updated":"2022-01-06T07:02:38Z","publisher":"Elsevier","page":"18-35","citation":{"chicago":"Clouser, Thomas, Mikhail Nesterenko, and Christian Scheideler. “Tiara: A Self-Stabilizing Deterministic Skip List and Skip Graph.” <i>Theoretical Computer Science</i>, 2012, 18–35. <a href=\"https://doi.org/10.1016/j.tcs.2011.12.079\">https://doi.org/10.1016/j.tcs.2011.12.079</a>.","ieee":"T. Clouser, M. Nesterenko, and C. Scheideler, “Tiara: A self-stabilizing deterministic skip list and skip graph,” <i>Theoretical Computer Science</i>, pp. 18–35, 2012.","ama":"Clouser T, Nesterenko M, Scheideler C. Tiara: A self-stabilizing deterministic skip list and skip graph. <i>Theoretical Computer Science</i>. 2012:18-35. doi:<a href=\"https://doi.org/10.1016/j.tcs.2011.12.079\">10.1016/j.tcs.2011.12.079</a>","apa":"Clouser, T., Nesterenko, M., &#38; Scheideler, C. (2012). Tiara: A self-stabilizing deterministic skip list and skip graph. <i>Theoretical Computer Science</i>, 18–35. <a href=\"https://doi.org/10.1016/j.tcs.2011.12.079\">https://doi.org/10.1016/j.tcs.2011.12.079</a>","short":"T. Clouser, M. Nesterenko, C. Scheideler, Theoretical Computer Science (2012) 18–35.","bibtex":"@article{Clouser_Nesterenko_Scheideler_2012, title={Tiara: A self-stabilizing deterministic skip list and skip graph}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2011.12.079\">10.1016/j.tcs.2011.12.079</a>}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Clouser, Thomas and Nesterenko, Mikhail and Scheideler, Christian}, year={2012}, pages={18–35} }","mla":"Clouser, Thomas, et al. “Tiara: A Self-Stabilizing Deterministic Skip List and Skip Graph.” <i>Theoretical Computer Science</i>, Elsevier, 2012, pp. 18–35, doi:<a href=\"https://doi.org/10.1016/j.tcs.2011.12.079\">10.1016/j.tcs.2011.12.079</a>."},"year":"2012","has_accepted_license":"1"},{"conference":{"location":"Paderborn, Germany","end_date":"2012-10-04","start_date":"2012-10-01","name":"Stabilization, Safety, and Security of Distributed Systems (SSS)"},"doi":"10.1007/978-3-642-33536-5","title":"Stabilization, Safety, and Security of Distributed Systems","date_created":"2017-10-17T12:42:44Z","date_updated":"2022-01-06T07:02:39Z","citation":{"apa":"Richa, A. W., &#38; Scheideler, C. (Eds.). (2012). <i>Stabilization, Safety, and Security of Distributed Systems</i>. Presented at the Stabilization, Safety, and Security of Distributed Systems (SSS), Paderborn, Germany. <a href=\"https://doi.org/10.1007/978-3-642-33536-5\">https://doi.org/10.1007/978-3-642-33536-5</a>","bibtex":"@book{Richa_Scheideler_2012, title={Stabilization, Safety, and Security of Distributed Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33536-5\">10.1007/978-3-642-33536-5</a>}, year={2012} }","mla":"Richa, Andrea W., and Christian Scheideler, editors. <i>Stabilization, Safety, and Security of Distributed Systems</i>. 2012, doi:<a href=\"https://doi.org/10.1007/978-3-642-33536-5\">10.1007/978-3-642-33536-5</a>.","short":"A.W. Richa, C. Scheideler, eds., Stabilization, Safety, and Security of Distributed Systems, 2012.","ama":"Richa AW, Scheideler C, eds. <i>Stabilization, Safety, and Security of Distributed Systems</i>.; 2012. doi:<a href=\"https://doi.org/10.1007/978-3-642-33536-5\">10.1007/978-3-642-33536-5</a>","chicago":"Richa, Andrea W., and Christian Scheideler, eds. <i>Stabilization, Safety, and Security of Distributed Systems</i>, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33536-5\">https://doi.org/10.1007/978-3-642-33536-5</a>.","ieee":"A. W. Richa and C. Scheideler, Eds., <i>Stabilization, Safety, and Security of Distributed Systems</i>. 2012."},"year":"2012","has_accepted_license":"1","file_date_updated":"2018-03-21T13:09:19Z","ddc":["040"],"department":[{"_id":"79"}],"user_id":"15504","_id":"577","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"status":"public","file":[{"creator":"florida","date_created":"2018-03-21T13:09:19Z","date_updated":"2018-03-21T13:09:19Z","access_level":"closed","file_id":"1569","file_name":"577-SSS2012Richa-Scheideler.pdf","file_size":169564,"content_type":"application/pdf","relation":"main_file","success":1}],"editor":[{"last_name":"Richa","full_name":"Richa, Andrea W.","first_name":"Andrea W."},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"abstract":[{"text":"SSS is an international forum for researchers and practitioners in the design and development of distributed systems with self-properties: (classical) self-stabilizing, self-configuring, self-organizing, self-managing, self-repairing, self-healing, self-optimizing, self-adaptive, and self-protecting. Research in distributed systems is now at a crucialpoint in its evolution, marked by the importance of dynamic systems such as peer-to-peer networks, large-scale wireless sensor networks, mobile ad hoc networks, cloud computing, robotic networks, etc. Moreover, new applications such as grid and web services, banking and e-commerce, e-health and robotics, aerospace and avionics, automotive, industrial process control, etc. have joined the traditional applications of distributed systems. The theory of self-stabilization has been enriched in the last 30 years by high quality research contributions in the areas of algorithmic techniques, formal methodologies, model theoretic issues, and composition techniques. All these areas are essential to the understanding and maintenance of self-properties in fault-tolerant distributed systems.","lang":"eng"}],"type":"conference_editor"},{"ddc":["040"],"file_date_updated":"2018-03-15T09:04:58Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"579","user_id":"477","department":[{"_id":"79"},{"_id":"63"}],"abstract":[{"lang":"eng","text":"A left-to-right maximum in a sequence of n numbers s_1, …, s_n is a number that is strictly larger than all preceding numbers. In this article we present a smoothed analysis of the number of left-to-right maxima in the presence of additive random noise. We show that for every sequence of n numbers s_i ∈ [0,1] that are perturbed by uniform noise from the interval [-ε,ε], the expected number of left-to-right maxima is Θ(&sqrt;n/ε + log n) for ε>1/n. For Gaussian noise with standard deviation σ we obtain a bound of O((log3/2 n)/σ + log n).We apply our results to the analysis of the smoothed height of binary search trees and the smoothed number of comparisons in the quicksort algorithm and prove bounds of Θ(&sqrt;n/ε + log n) and Θ(n/ε+1&sqrt;n/ε + n log n), respectively, for uniform random noise from the interval [-ε,ε]. Our results can also be applied to bound the smoothed number of points on a convex hull of points in the two-dimensional plane and to smoothed motion complexity, a concept we describe in this article. We bound how often one needs to update a data structure storing the smallest axis-aligned box enclosing a set of points moving in d-dimensional space."}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":329282,"file_id":"1266","file_name":"579-a30-damerow.pdf","access_level":"closed","date_updated":"2018-03-15T09:04:58Z","date_created":"2018-03-15T09:04:58Z","creator":"florida"}],"status":"public","type":"journal_article","publication":"Transactions on Algorithms","title":"Smoothed analysis of left-to-right maxima with applications","doi":"10.1145/2229163.2229174","publisher":"ACM","date_updated":"2022-01-06T07:02:41Z","date_created":"2017-10-17T12:42:45Z","author":[{"last_name":"Damerow","full_name":"Damerow, Valentina","first_name":"Valentina"},{"full_name":"Manthey, Bodo","last_name":"Manthey","first_name":"Bodo"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"last_name":"Räcke","full_name":"Räcke, Harald","first_name":"Harald"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"first_name":"Christian","last_name":"Sohler","full_name":"Sohler, Christian"},{"first_name":"Till","last_name":"Tantau","full_name":"Tantau, Till"}],"year":"2012","citation":{"apa":"Damerow, V., Manthey, B., Meyer auf der Heide, F., Räcke, H., Scheideler, C., Sohler, C., &#38; Tantau, T. (2012). Smoothed analysis of left-to-right maxima with applications. <i>Transactions on Algorithms</i>, (3), 30. <a href=\"https://doi.org/10.1145/2229163.2229174\">https://doi.org/10.1145/2229163.2229174</a>","bibtex":"@article{Damerow_Manthey_Meyer auf der Heide_Räcke_Scheideler_Sohler_Tantau_2012, title={Smoothed analysis of left-to-right maxima with applications}, DOI={<a href=\"https://doi.org/10.1145/2229163.2229174\">10.1145/2229163.2229174</a>}, number={3}, journal={Transactions on Algorithms}, publisher={ACM}, author={Damerow, Valentina and Manthey, Bodo and Meyer auf der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian and Tantau, Till}, year={2012}, pages={30} }","mla":"Damerow, Valentina, et al. “Smoothed Analysis of Left-to-Right Maxima with Applications.” <i>Transactions on Algorithms</i>, no. 3, ACM, 2012, p. 30, doi:<a href=\"https://doi.org/10.1145/2229163.2229174\">10.1145/2229163.2229174</a>.","short":"V. Damerow, B. Manthey, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler, T. Tantau, Transactions on Algorithms (2012) 30.","ieee":"V. Damerow <i>et al.</i>, “Smoothed analysis of left-to-right maxima with applications,” <i>Transactions on Algorithms</i>, no. 3, p. 30, 2012.","chicago":"Damerow, Valentina, Bodo Manthey, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler, and Till Tantau. “Smoothed Analysis of Left-to-Right Maxima with Applications.” <i>Transactions on Algorithms</i>, no. 3 (2012): 30. <a href=\"https://doi.org/10.1145/2229163.2229174\">https://doi.org/10.1145/2229163.2229174</a>.","ama":"Damerow V, Manthey B, Meyer auf der Heide F, et al. Smoothed analysis of left-to-right maxima with applications. <i>Transactions on Algorithms</i>. 2012;(3):30. doi:<a href=\"https://doi.org/10.1145/2229163.2229174\">10.1145/2229163.2229174</a>"},"page":"30","has_accepted_license":"1","issue":"3"},{"date_created":"2017-10-17T12:42:45Z","author":[{"first_name":"Maximilian","full_name":"Drees, Maximilian","last_name":"Drees"},{"last_name":"Hüllmann (married name: Eikel)","full_name":"Hüllmann (married name: Eikel), Martina","first_name":"Martina"},{"full_name":"Koutsopoulos, Andreas","last_name":"Koutsopoulos","first_name":"Andreas"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"date_updated":"2022-01-06T07:02:42Z","doi":"10.1109/IPDPS.2012.116","title":"Self-Organizing Particle Systems","has_accepted_license":"1","citation":{"apa":"Drees, M., Hüllmann (married name: Eikel), M., Koutsopoulos, A., &#38; Scheideler, C. (2012). Self-Organizing Particle Systems. In <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i> (pp. 1272–1283). <a href=\"https://doi.org/10.1109/IPDPS.2012.116\">https://doi.org/10.1109/IPDPS.2012.116</a>","short":"M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, C. Scheideler, in: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–1283.","mla":"Drees, Maximilian, et al. “Self-Organizing Particle Systems.” <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2012, pp. 1272–83, doi:<a href=\"https://doi.org/10.1109/IPDPS.2012.116\">10.1109/IPDPS.2012.116</a>.","bibtex":"@inproceedings{Drees_Hüllmann (married name: Eikel)_Koutsopoulos_Scheideler_2012, title={Self-Organizing Particle Systems}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2012.116\">10.1109/IPDPS.2012.116</a>}, booktitle={Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Drees, Maximilian and Hüllmann (married name: Eikel), Martina and Koutsopoulos, Andreas and Scheideler, Christian}, year={2012}, pages={1272–1283} }","ama":"Drees M, Hüllmann (married name: Eikel) M, Koutsopoulos A, Scheideler C. Self-Organizing Particle Systems. In: <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. ; 2012:1272-1283. doi:<a href=\"https://doi.org/10.1109/IPDPS.2012.116\">10.1109/IPDPS.2012.116</a>","chicago":"Drees, Maximilian, Martina Hüllmann (married name: Eikel), Andreas Koutsopoulos, and Christian Scheideler. “Self-Organizing Particle Systems.” In <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 1272–83, 2012. <a href=\"https://doi.org/10.1109/IPDPS.2012.116\">https://doi.org/10.1109/IPDPS.2012.116</a>.","ieee":"M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, and C. Scheideler, “Self-Organizing Particle Systems,” in <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2012, pp. 1272–1283."},"page":"1272-1283","year":"2012","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"581","file_date_updated":"2018-03-15T08:39:33Z","language":[{"iso":"eng"}],"ddc":["040"],"type":"conference","publication":"Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)","file":[{"date_created":"2018-03-15T08:39:33Z","creator":"florida","date_updated":"2018-03-15T08:39:33Z","file_name":"581-IPDPS2012-Scheideler_Huellmann.pdf","access_level":"closed","file_id":"1263","file_size":373131,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","abstract":[{"text":"Nanoparticles are getting more and more in the focus of the scientic community since the potential for the development of very small particles interacting with each other and completing medical and other tasks is getting bigger year by year. In this work we introduce a distributed local algorithm for arranging a set of nanoparticles on the discrete plane into specic geometric shapes, for instance a rectangle. The concept of a particle we use can be seen as a simple mobile robot with the following restrictions: it can only view the state of robots it is physically connected to, is anonymous, has only a constant size memory, can only move by using other particles as an anchor point on which it pulls itself alongside, and it operates in Look-Compute-Move cycles. The main result of this work is the presentation of a random distributed local algorithm which transforms any given connected set of particles into a particular geometric shape. As an example we provide a version of this algorithm for forming a rectangle with an arbitrary predened aspect ratio. To the best of our knowledge this is the rst work that considers arrangement problems for these types of robots.","lang":"eng"}]},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"582","user_id":"477","department":[{"_id":"79"}],"language":[{"iso":"eng"}],"type":"mastersthesis","status":"public","date_updated":"2022-01-06T07:02:42Z","publisher":"Universität Paderborn","author":[{"id":"11319","full_name":"Strothmann, Thim Frederik","last_name":"Strothmann","first_name":"Thim Frederik"}],"date_created":"2017-10-17T12:42:45Z","title":"Self-Optimizing Binary Search Trees - A Game Theoretic Approach","year":"2012","citation":{"bibtex":"@book{Strothmann_2012, title={Self-Optimizing Binary Search Trees - A Game Theoretic Approach}, publisher={Universität Paderborn}, author={Strothmann, Thim Frederik}, year={2012} }","short":"T.F. Strothmann, Self-Optimizing Binary Search Trees - A Game Theoretic Approach, Universität Paderborn, 2012.","mla":"Strothmann, Thim Frederik. <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn, 2012.","apa":"Strothmann, T. F. (2012). <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn.","ieee":"T. F. Strothmann, <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn, 2012.","chicago":"Strothmann, Thim Frederik. <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn, 2012.","ama":"Strothmann TF. <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn; 2012."}},{"has_accepted_license":"1","year":"2012","page":"291-300","citation":{"apa":"Richa, A. W., Scheideler, C., Schmid, S., &#38; Zhang, J. (2012). Competitive and fair throughput for co-existing networks under adversarial interference. In <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i> (pp. 291–300). <a href=\"https://doi.org/10.1145/2332432.2332488\">https://doi.org/10.1145/2332432.2332488</a>","bibtex":"@inproceedings{Richa_Scheideler_Schmid_Zhang_2012, title={Competitive and fair throughput for co-existing networks under adversarial interference}, DOI={<a href=\"https://doi.org/10.1145/2332432.2332488\">10.1145/2332432.2332488</a>}, booktitle={Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)}, author={Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin }, year={2012}, pages={291–300} }","mla":"Richa, Andrea W., et al. “Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.” <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i>, 2012, pp. 291–300, doi:<a href=\"https://doi.org/10.1145/2332432.2332488\">10.1145/2332432.2332488</a>.","short":"A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300.","ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive and fair throughput for co-existing networks under adversarial interference,” in <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i>, 2012, pp. 291–300.","chicago":"Richa, Andrea W., Christian Scheideler, Stefan Schmid, and Jin  Zhang. “Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.” In <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i>, 291–300, 2012. <a href=\"https://doi.org/10.1145/2332432.2332488\">https://doi.org/10.1145/2332432.2332488</a>.","ama":"Richa AW, Scheideler C, Schmid S, Zhang J. Competitive and fair throughput for co-existing networks under adversarial interference. In: <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i>. ; 2012:291-300. doi:<a href=\"https://doi.org/10.1145/2332432.2332488\">10.1145/2332432.2332488</a>"},"date_updated":"2022-01-06T07:02:58Z","date_created":"2017-10-17T12:42:53Z","author":[{"last_name":"Richa","full_name":"Richa, Andrea W.","first_name":"Andrea W."},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Stefan","full_name":"Schmid, Stefan","last_name":"Schmid"},{"last_name":"Zhang","full_name":"Zhang, Jin ","first_name":"Jin "}],"title":"Competitive and fair throughput for co-existing networks under adversarial interference","doi":"10.1145/2332432.2332488","publication":"Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)","type":"conference","abstract":[{"lang":"eng","text":"This paper initiates the formal study of a fundamental problem: How to efficiently allocate a shared communication medium among a set of K co-existing networks in the presence of arbitrary external interference? While most literature on medium access focuses on how to share a medium among nodes, these approaches are often either not directly applicable to co-existing networks as they would violate the independence requirement, or they yield a low throughput if applied to multiple networks. We present the randomized medium access (MAC) protocol COMAC which guarantees that a given communication channel is shared fairly among competing and independent networks, and that the available bandwidth is used efficiently. These performance guarantees hold in the presence of arbitrary external interference or even under adversarial jamming. Concretely, we show that the co-existing networks can use a Ω(ε2 min{ε, 1/poly(K)})-fraction of the non-jammed time steps for successful message transmissions, where ε is the (arbitrarily distributed) fraction of time which is not jammed."}],"status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-15T06:45:25Z","creator":"florida","date_created":"2018-03-15T06:45:25Z","file_size":210382,"file_name":"623-PODC-2012_01.pdf","file_id":"1241","access_level":"closed"}],"_id":"623","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"79"}],"user_id":"15504","ddc":["040"],"file_date_updated":"2018-03-15T06:45:25Z"},{"doi":"10.1007/978-3-642-33651-5_47","title":"Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures","date_created":"2017-10-17T12:42:53Z","author":[{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"},{"first_name":"Chen","last_name":"Avin","full_name":"Avin, Chen"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"first_name":"Bernhard","full_name":"Häupler, Bernhard","last_name":"Häupler"},{"full_name":"Lotker, Zvi","last_name":"Lotker","first_name":"Zvi"}],"date_updated":"2022-01-06T07:02:58Z","citation":{"ama":"Schmid S, Avin C, Scheideler C, Häupler B, Lotker Z. Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. In: <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>. LNCS. ; 2012:439-440. doi:<a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">10.1007/978-3-642-33651-5_47</a>","chicago":"Schmid, Stefan, Chen Avin, Christian Scheideler, Bernhard Häupler, and Zvi Lotker. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.” In <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 439–40. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">https://doi.org/10.1007/978-3-642-33651-5_47</a>.","ieee":"S. Schmid, C. Avin, C. Scheideler, B. Häupler, and Z. Lotker, “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures,” in <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 2012, pp. 439–440.","apa":"Schmid, S., Avin, C., Scheideler, C., Häupler, B., &#38; Lotker, Z. (2012). Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. In <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i> (pp. 439–440). <a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">https://doi.org/10.1007/978-3-642-33651-5_47</a>","mla":"Schmid, Stefan, et al. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.” <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 2012, pp. 439–40, doi:<a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">10.1007/978-3-642-33651-5_47</a>.","bibtex":"@inproceedings{Schmid_Avin_Scheideler_Häupler_Lotker_2012, series={LNCS}, title={Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">10.1007/978-3-642-33651-5_47</a>}, booktitle={Proceedings of the 26th International Symposium on Distributed Computing (DISC)}, author={Schmid, Stefan and Avin, Chen and Scheideler, Christian and Häupler, Bernhard and Lotker, Zvi}, year={2012}, pages={439–440}, collection={LNCS} }","short":"S. Schmid, C. Avin, C. Scheideler, B. Häupler, Z. Lotker, in: Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 439–440."},"page":"439-440","year":"2012","has_accepted_license":"1","file_date_updated":"2018-03-15T06:44:09Z","ddc":["040"],"user_id":"15504","series_title":"LNCS","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":"625","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-15T06:44:09Z","creator":"florida","date_updated":"2018-03-15T06:44:09Z","file_id":"1240","access_level":"closed","file_name":"625-disc12adjBAshort.pdf","file_size":717284}],"status":"public","abstract":[{"text":"This paper initiates the study of self-adjusting distributed data structures for networks. In particular, we present SplayNets: a binary search tree based network that is self-adjusting to routing request.We derive entropy bounds on the amortized routing cost and show that our splaying algorithm has some interesting properties.","lang":"eng"}],"type":"conference","publication":"Proceedings of the 26th International Symposium on Distributed Computing (DISC)"},{"has_accepted_license":"1","year":"2012","citation":{"apa":"Kniesburges, S., &#38; Scheideler, C. (2012). Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems. In <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i> (pp. 435–436). <a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">https://doi.org/10.1007/978-3-642-33651-5_45</a>","short":"S. Kniesburges, C. Scheideler, in: Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 435–436.","bibtex":"@inproceedings{Kniesburges_Scheideler_2012, series={LNCS}, title={Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">10.1007/978-3-642-33651-5_45</a>}, booktitle={Proceedings of the 26th International Symposium on Distributed Computing (DISC)}, author={Kniesburges, Sebastian and Scheideler, Christian}, year={2012}, pages={435–436}, collection={LNCS} }","mla":"Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.” <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 2012, pp. 435–36, doi:<a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">10.1007/978-3-642-33651-5_45</a>.","ieee":"S. Kniesburges and C. Scheideler, “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems,” in <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 2012, pp. 435–436.","chicago":"Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.” In <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 435–36. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">https://doi.org/10.1007/978-3-642-33651-5_45</a>.","ama":"Kniesburges S, Scheideler C. Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems. In: <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>. LNCS. ; 2012:435-436. doi:<a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">10.1007/978-3-642-33651-5_45</a>"},"page":"435-436","date_updated":"2022-01-06T07:02:59Z","date_created":"2017-10-17T12:42:54Z","author":[{"first_name":"Sebastian","full_name":"Kniesburges, Sebastian","last_name":"Kniesburges"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"title":"Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems","doi":"10.1007/978-3-642-33651-5_45","type":"conference","publication":"Proceedings of the 26th International Symposium on Distributed Computing (DISC)","abstract":[{"lang":"eng","text":"The design of ecient search structures for peer-to-peer systems has attracted a lot of attention in recent years. In this announcement we address the problem of nding the predecessor in a key set and present an ecient data structure called hashed Predecessor Patricia trie. Our hashed Predecessor Patricia trie supports PredecessorSearch(x) and Insert(x) and Delete(x) in O(log log u) hash table accesses when u is the size of the universe of the keys. That is the costs only depend on u and not the size of the data structure. One feature of our approach is that it only uses the lookup interface of the hash table and therefore hash table accesses may be realized by any distributed hash table (DHT)."}],"file":[{"date_updated":"2018-03-15T06:42:40Z","creator":"florida","date_created":"2018-03-15T06:42:40Z","file_size":184095,"access_level":"closed","file_id":"1239","file_name":"626-Predecessor-Kniesburges_Scheideler.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"626","user_id":"15504","series_title":"LNCS","department":[{"_id":"79"}],"ddc":["040"],"file_date_updated":"2018-03-15T06:42:40Z"},{"language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T06:42:01Z","ddc":["040"],"department":[{"_id":"79"},{"_id":"63"}],"user_id":"477","series_title":"LNCS","_id":"628","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"status":"public","file":[{"date_updated":"2018-03-15T06:42:01Z","creator":"florida","date_created":"2018-03-15T06:42:01Z","file_size":300591,"file_id":"1238","access_level":"closed","file_name":"628-FULL_paper_bncs_with_interests.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"text":"Network creation games model the creation and usage costs of networks formed by a set of selfish peers.Each peer has the ability to change the network in a limited way, e.g., by creating or deleting incident links.In doing so, a peer can reduce its individual communication cost.Typically, these costs are modeled by the maximum or average distance in the network.We introduce a generalized version of the basic network creation game (BNCG).In the BNCG (by Alon et al., SPAA 2010), each peer may replace one of its incident links by a link to an arbitrary peer.This is done in a selfish way in order to minimize either the maximum or average distance to all other peers.That is, each peer works towards a network structure that allows himself to communicate efficiently with all other peers.However, participants of large networks are seldom interested in all peers.Rather, they want to communicate efficiently with a small subset only.Our model incorporates these (communication) interests explicitly.Given peers with interests and a communication network forming a tree, we prove several results on the structure and quality of equilibria in our model.We focus on the MAX-version, i.e., each node tries to minimize the maximum distance to nodes it is interested in, and give an upper bound of O(\\sqrt(n)) for the private costs in an equilibrium of n peers.Moreover, we give an equilibrium for a circular interest graph where a node has private cost Omega(\\sqrt(n)), showing that our bound is tight.This example can be extended such that we get a tight bound of Theta(\\sqrt(n)) for the price of anarchy.For the case of general networks we show the price of anarchy to be Theta(n).Additionally, we prove an interesting connection between a maximum independent set in the interest graph and the private costs of the peers.","lang":"eng"}],"publication":"Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)","type":"conference","doi":"10.1007/978-3-642-33996-7_7","title":"Basic Network Creation Games with Communication Interests","author":[{"last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas","first_name":"Andreas"},{"first_name":"Martina","last_name":"Huellmann (married name: Eikel)","full_name":"Huellmann (married name: Eikel), Martina"},{"full_name":"Kling, Peter","last_name":"Kling","first_name":"Peter"},{"full_name":"Setzer, Alexander","id":"11108","last_name":"Setzer","first_name":"Alexander"}],"date_created":"2017-10-17T12:42:54Z","date_updated":"2022-01-06T07:02:59Z","page":"72--83","citation":{"ieee":"A. Cord-Landwehr, M. Huellmann (married name: Eikel), P. Kling, and A. Setzer, “Basic Network Creation Games with Communication Interests,” in <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2012, pp. 72--83.","chicago":"Cord-Landwehr, Andreas, Martina Huellmann (married name: Eikel), Peter Kling, and Alexander Setzer. “Basic Network Creation Games with Communication Interests.” In <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>, 72--83. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">https://doi.org/10.1007/978-3-642-33996-7_7</a>.","ama":"Cord-Landwehr A, Huellmann (married name: Eikel) M, Kling P, Setzer A. Basic Network Creation Games with Communication Interests. In: <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>. LNCS. ; 2012:72--83. doi:<a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">10.1007/978-3-642-33996-7_7</a>","apa":"Cord-Landwehr, A., Huellmann (married name: Eikel), M., Kling, P., &#38; Setzer, A. (2012). Basic Network Creation Games with Communication Interests. In <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i> (pp. 72--83). <a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">https://doi.org/10.1007/978-3-642-33996-7_7</a>","bibtex":"@inproceedings{Cord-Landwehr_Huellmann (married name: Eikel)_Kling_Setzer_2012, series={LNCS}, title={Basic Network Creation Games with Communication Interests}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">10.1007/978-3-642-33996-7_7</a>}, booktitle={Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)}, author={Cord-Landwehr, Andreas and Huellmann (married name: Eikel), Martina and Kling, Peter and Setzer, Alexander}, year={2012}, pages={72--83}, collection={LNCS} }","short":"A. Cord-Landwehr, M. Huellmann (married name: Eikel), P. Kling, A. Setzer, in: Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 72--83.","mla":"Cord-Landwehr, Andreas, et al. “Basic Network Creation Games with Communication Interests.” <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2012, pp. 72--83, doi:<a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">10.1007/978-3-642-33996-7_7</a>."},"year":"2012","has_accepted_license":"1"},{"ddc":["040"],"file_date_updated":"2018-03-15T06:35:58Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"632","user_id":"15504","department":[{"_id":"79"}],"abstract":[{"text":"Given an integer h, a graph G = (V;E) with arbitrary positive edge capacities and k pairs of vertices (s1; t1); (s2; t2); : : : ; (sk; tk), called terminals, an h-route cut is a set F µ E of edges such that after the removal of the edges in F no pair si ¡ ti is connected by h edge-disjoint paths (i.e., the connectivity of every si ¡ ti pair is at most h ¡ 1 in (V;E n F)). The h-route cut is a natural generalization of the classical cut problem for multicommodity °ows (take h = 1). The main result of this paper is an O(h722h log2 k)-approximation algorithm for the minimum h-route cut problem in the case that s1 = s2 = ¢ ¢ ¢ = sk, called the single source case. As a corollary of it we obtain an approximate duality theorem for multiroute multicom-modity °ows and cuts with a single source. This partially answers an open question posted in several previous papers dealing with cuts for multicommodity multiroute problems.","lang":"eng"}],"file":[{"file_name":"632-SODA2012-Scheideler_01.pdf","file_id":"1234","access_level":"closed","file_size":220213,"date_created":"2018-03-15T06:35:58Z","creator":"florida","date_updated":"2018-03-15T06:35:58Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","type":"conference","publication":"Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)","title":"Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case","doi":"10.1137/1.9781611973099.64","date_updated":"2022-01-06T07:03:01Z","date_created":"2017-10-17T12:42:55Z","author":[{"full_name":"Kolman, Petr","last_name":"Kolman","first_name":"Petr"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"year":"2012","citation":{"ama":"Kolman P, Scheideler C. Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case. In: <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i>. ; 2012:800-810. doi:<a href=\"https://doi.org/10.1137/1.9781611973099.64\">10.1137/1.9781611973099.64</a>","chicago":"Kolman, Petr, and Christian Scheideler. “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case.” In <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i>, 800–810, 2012. <a href=\"https://doi.org/10.1137/1.9781611973099.64\">https://doi.org/10.1137/1.9781611973099.64</a>.","ieee":"P. Kolman and C. Scheideler, “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case,” in <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i>, 2012, pp. 800–810.","apa":"Kolman, P., &#38; Scheideler, C. (2012). Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case. In <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i> (pp. 800–810). <a href=\"https://doi.org/10.1137/1.9781611973099.64\">https://doi.org/10.1137/1.9781611973099.64</a>","bibtex":"@inproceedings{Kolman_Scheideler_2012, title={Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case}, DOI={<a href=\"https://doi.org/10.1137/1.9781611973099.64\">10.1137/1.9781611973099.64</a>}, booktitle={Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)}, author={Kolman, Petr and Scheideler, Christian}, year={2012}, pages={800–810} }","short":"P. Kolman, C. Scheideler, in: Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA), 2012, pp. 800–810.","mla":"Kolman, Petr, and Christian Scheideler. “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case.” <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i>, 2012, pp. 800–10, doi:<a href=\"https://doi.org/10.1137/1.9781611973099.64\">10.1137/1.9781611973099.64</a>."},"page":"800-810","has_accepted_license":"1"},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"640","user_id":"15504","department":[{"_id":"79"}],"ddc":["040"],"file_date_updated":"2018-03-14T14:13:13Z","type":"conference","publication":"Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)","abstract":[{"lang":"eng","text":"Small-world networks have received significant attention because of their potential as models for the interaction networks of complex systems. Specifically, neither random networks nor regular lattices seem to be an adequate framework within which to study real-world complex systems such as chemical-reaction networks, neural networks, food webs, social networks, scientific-collaboration networks, and computer networks. Small-world networks provide some desired properties like an expected polylogarithmic distance between two processes in the network, which allows routing in polylogarithmic hops by simple greedy routing, and robustness against attacks or failures. By these properties, small-world networks are possible solutions for large overlay networks comparable to structured overlay networks like CAN, Pastry, Chord, which also provide polylogarithmic routing, but due to their uniform structure, structured overlay networks are more vulnerable to attacks or failures. In this paper we bring together a randomized process converging to a small-world network and a self-stabilization process so that a small-world network is formed out of any weakly connected initial state. To the best of our knowledge this is the first distributed self-stabilization process for building a small-world network."}],"file":[{"date_updated":"2018-03-14T14:13:13Z","creator":"florida","date_created":"2018-03-14T14:13:13Z","file_size":210176,"file_id":"1230","access_level":"closed","file_name":"640-IPDPS2012-Kniesb-Kouts-Scheideler.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","date_updated":"2022-01-06T07:03:04Z","author":[{"full_name":"Kniesburges, Sebastian","last_name":"Kniesburges","first_name":"Sebastian"},{"last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas","first_name":"Andreas"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"date_created":"2017-10-17T12:42:56Z","title":"A Self-Stabilization Process for Small-World Networks","doi":"10.1109/IPDPS.2012.115","has_accepted_license":"1","year":"2012","citation":{"ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A Self-Stabilization Process for Small-World Networks,” in <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2012, pp. 1261--1271.","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “A Self-Stabilization Process for Small-World Networks.” In <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 1261--1271, 2012. <a href=\"https://doi.org/10.1109/IPDPS.2012.115\">https://doi.org/10.1109/IPDPS.2012.115</a>.","ama":"Kniesburges S, Koutsopoulos A, Scheideler C. A Self-Stabilization Process for Small-World Networks. In: <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. ; 2012:1261--1271. doi:<a href=\"https://doi.org/10.1109/IPDPS.2012.115\">10.1109/IPDPS.2012.115</a>","bibtex":"@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2012, title={A Self-Stabilization Process for Small-World Networks}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2012.115\">10.1109/IPDPS.2012.115</a>}, booktitle={Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2012}, pages={1261--1271} }","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1261--1271.","mla":"Kniesburges, Sebastian, et al. “A Self-Stabilization Process for Small-World Networks.” <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2012, pp. 1261--1271, doi:<a href=\"https://doi.org/10.1109/IPDPS.2012.115\">10.1109/IPDPS.2012.115</a>.","apa":"Kniesburges, S., Koutsopoulos, A., &#38; Scheideler, C. (2012). A Self-Stabilization Process for Small-World Networks. In <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i> (pp. 1261--1271). <a href=\"https://doi.org/10.1109/IPDPS.2012.115\">https://doi.org/10.1109/IPDPS.2012.115</a>"},"page":"1261--1271"}]