[{"date_updated":"2022-01-06T06:53:51Z","author":[{"last_name":"W. Richa","full_name":"W. Richa, Andrea","first_name":"Andrea"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"},{"full_name":"Zhang, Jin","last_name":"Zhang","first_name":"Jin"}],"date_created":"2018-03-28T06:32:59Z","title":"An Efficient and Fair MAC Protocol Robust to Reactive Interference","doi":"10.1109/TNET.2012.2210241","issue":"3","year":"2013","page":"760--771","citation":{"ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “An Efficient and Fair MAC Protocol Robust to Reactive Interference,” <i>IEEE/ACM Trans. Netw.</i>, no. 3, pp. 760--771, 2013.","chicago":"W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang. “An Efficient and Fair MAC Protocol Robust to Reactive Interference.” <i>IEEE/ACM Trans. Netw.</i>, no. 3 (2013): 760--771. <a href=\"https://doi.org/10.1109/TNET.2012.2210241\">https://doi.org/10.1109/TNET.2012.2210241</a>.","ama":"W. Richa A, Scheideler C, Schmid S, Zhang J. An Efficient and Fair MAC Protocol Robust to Reactive Interference. <i>IEEE/ACM Trans Netw</i>. 2013;(3):760--771. doi:<a href=\"https://doi.org/10.1109/TNET.2012.2210241\">10.1109/TNET.2012.2210241</a>","short":"A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, IEEE/ACM Trans. Netw. (2013) 760--771.","bibtex":"@article{W. Richa_Scheideler_Schmid_Zhang_2013, title={An Efficient and Fair MAC Protocol Robust to Reactive Interference}, DOI={<a href=\"https://doi.org/10.1109/TNET.2012.2210241\">10.1109/TNET.2012.2210241</a>}, number={3}, journal={IEEE/ACM Trans. Netw.}, author={W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2013}, pages={760--771} }","mla":"W. Richa, Andrea, et al. “An Efficient and Fair MAC Protocol Robust to Reactive Interference.” <i>IEEE/ACM Trans. Netw.</i>, no. 3, 2013, pp. 760--771, doi:<a href=\"https://doi.org/10.1109/TNET.2012.2210241\">10.1109/TNET.2012.2210241</a>.","apa":"W. Richa, A., Scheideler, C., Schmid, S., &#38; Zhang, J. (2013). An Efficient and Fair MAC Protocol Robust to Reactive Interference. <i>IEEE/ACM Trans. Netw.</i>, (3), 760--771. <a href=\"https://doi.org/10.1109/TNET.2012.2210241\">https://doi.org/10.1109/TNET.2012.2210241</a>"},"_id":"1871","department":[{"_id":"79"}],"user_id":"15504","publication":"IEEE/ACM Trans. Netw.","type":"journal_article","status":"public"},{"citation":{"ama":"Blumentritt F. <i>Cliquenbildung in Verteilten Systemen</i>. Universität Paderborn; 2013.","ieee":"F. Blumentritt, <i>Cliquenbildung in verteilten Systemen</i>. Universität Paderborn, 2013.","chicago":"Blumentritt, Fritz. <i>Cliquenbildung in Verteilten Systemen</i>. Universität Paderborn, 2013.","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.","apa":"Blumentritt, F. (2013). <i>Cliquenbildung in verteilten Systemen</i>. Universität Paderborn."},"year":"2013","title":"Cliquenbildung in verteilten Systemen","date_created":"2020-08-17T08:14:17Z","author":[{"full_name":"Blumentritt, Fritz","last_name":"Blumentritt","first_name":"Fritz"}],"supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:25Z","status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"department":[{"_id":"79"}],"user_id":"477","_id":"18000","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}]},{"abstract":[{"lang":"eng","text":"An elementary h-route ow, for an integer h 1, is a set of h edge- disjoint paths between a source and a sink, each path carrying a unit of ow, and an h-route ow is a non-negative linear combination of elementary h-routeows. An h-route cut is a set of edges whose removal decreases the maximum h-route ow between a given source-sink pair (or between every source-sink pair in the multicommodity setting) to zero. The main result of this paper is an approximate duality theorem for multicommodity h-route cuts and ows, for h 3: The size of a minimum h-route cut is at least f=h and at most O(log4 k f) where f is the size of the maximum h-routeow and k is the number of commodities. The main step towards the proof of this duality is the design and analysis of a polynomial-time approximation algorithm for the minimum h-route cut problem for h = 3 that has an approximation ratio of O(log4 k). Previously, polylogarithmic approximation was known only for h-route cuts for h 2. A key ingredient of our algorithm is a novel rounding technique that we call multilevel ball-growing. Though the proof of the duality relies on this algorithm, it is not a straightforward corollary of it as in the case of classical multicommodity ows and cuts. Similar results are shown also for the sparsest multiroute cut problem."}],"file":[{"date_created":"2018-03-15T14:07:18Z","creator":"florida","date_updated":"2018-03-15T14:07:18Z","file_name":"476-tocsrevised3b.pdf","access_level":"closed","file_id":"1326","file_size":264308,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","type":"journal_article","publication":"Theory of Computing Systems","ddc":["040"],"file_date_updated":"2018-03-15T14:07:18Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"476","user_id":"477","department":[{"_id":"79"}],"year":"2013","citation":{"apa":"Kolman, P., &#38; Scheideler, C. (2013). Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. <i>Theory of Computing Systems</i>, (2), 341–363. <a href=\"https://doi.org/10.1007/s00224-013-9454-3\">https://doi.org/10.1007/s00224-013-9454-3</a>","mla":"Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.” <i>Theory of Computing Systems</i>, no. 2, Springer, 2013, pp. 341–63, doi:<a href=\"https://doi.org/10.1007/s00224-013-9454-3\">10.1007/s00224-013-9454-3</a>.","short":"P. Kolman, C. Scheideler, Theory of Computing Systems (2013) 341–363.","bibtex":"@article{Kolman_Scheideler_2013, title={Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing}, DOI={<a href=\"https://doi.org/10.1007/s00224-013-9454-3\">10.1007/s00224-013-9454-3</a>}, number={2}, journal={Theory of Computing Systems}, publisher={Springer}, author={Kolman, Petr and Scheideler, Christian}, year={2013}, pages={341–363} }","ama":"Kolman P, Scheideler C. Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. <i>Theory of Computing Systems</i>. 2013;(2):341-363. doi:<a href=\"https://doi.org/10.1007/s00224-013-9454-3\">10.1007/s00224-013-9454-3</a>","ieee":"P. Kolman and C. Scheideler, “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing,” <i>Theory of Computing Systems</i>, no. 2, pp. 341–363, 2013.","chicago":"Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.” <i>Theory of Computing Systems</i>, no. 2 (2013): 341–63. <a href=\"https://doi.org/10.1007/s00224-013-9454-3\">https://doi.org/10.1007/s00224-013-9454-3</a>."},"page":"341-363","has_accepted_license":"1","issue":"2","title":"Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing","doi":"10.1007/s00224-013-9454-3","publisher":"Springer","date_updated":"2022-01-06T07:01:21Z","date_created":"2017-10-17T12:42:24Z","author":[{"first_name":"Petr","last_name":"Kolman","full_name":"Kolman, Petr"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}]},{"_id":"481","project":[{"name":"SFB 901","_id":"1"},{"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-15T14:02:01Z","publication":"Proceedings of the International Conference on Communications (ICC'13)","type":"conference","abstract":[{"lang":"eng","text":"Cloud computing offers high availability, dynamic scalability, and elasticity requiring only very little administration. However, this service comes with financial costs. Peer-to-peer systems, in contrast, operate at very low costs but cannot match the quality of service of the cloud. This paper focuses on the case study of Wikipedia and presents an approach to reduce the operational costs of hosting similar websites in the cloud by using a practical peer-to-peer approach. The visitors of the site are joining a Chord overlay, which acts as first cache for article lookups. Simulation results show, that up to 72% of the article lookups in Wikipedia could be answered by other visitors instead of using the cloud."}],"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-15T14:02:01Z","creator":"florida","date_updated":"2018-03-15T14:02:01Z","access_level":"closed","file_id":"1321","file_name":"481-Symbiotic.Coupling.of.P2P.and.Cloud.Systems.The.Wikipedia.Case2.pdf","file_size":1405789}],"date_updated":"2022-01-06T07:01:25Z","date_created":"2017-10-17T12:42:26Z","author":[{"last_name":"Graffi","full_name":"Graffi, Kalman","first_name":"Kalman"},{"last_name":"Bremer","full_name":"Bremer, Lars","first_name":"Lars"}],"title":"Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case","doi":"10.1109/ICC.2013.6655082","has_accepted_license":"1","year":"2013","page":"3444 - 3449 ","citation":{"ieee":"K. Graffi and L. Bremer, “Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case,” in <i>Proceedings of the International Conference on Communications (ICC’13)</i>, 2013, pp. 3444–3449.","chicago":"Graffi, Kalman, and Lars Bremer. “Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case.” In <i>Proceedings of the International Conference on Communications (ICC’13)</i>, 3444–49, 2013. <a href=\"https://doi.org/10.1109/ICC.2013.6655082\">https://doi.org/10.1109/ICC.2013.6655082</a>.","ama":"Graffi K, Bremer L. Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case. In: <i>Proceedings of the International Conference on Communications (ICC’13)</i>. ; 2013:3444-3449. doi:<a href=\"https://doi.org/10.1109/ICC.2013.6655082\">10.1109/ICC.2013.6655082</a>","bibtex":"@inproceedings{Graffi_Bremer_2013, title={Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case}, DOI={<a href=\"https://doi.org/10.1109/ICC.2013.6655082\">10.1109/ICC.2013.6655082</a>}, booktitle={Proceedings of the International Conference on Communications (ICC’13)}, author={Graffi, Kalman and Bremer, Lars}, year={2013}, pages={3444–3449} }","short":"K. Graffi, L. Bremer, in: Proceedings of the International Conference on Communications (ICC’13), 2013, pp. 3444–3449.","mla":"Graffi, Kalman, and Lars Bremer. “Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case.” <i>Proceedings of the International Conference on Communications (ICC’13)</i>, 2013, pp. 3444–49, doi:<a href=\"https://doi.org/10.1109/ICC.2013.6655082\">10.1109/ICC.2013.6655082</a>.","apa":"Graffi, K., &#38; Bremer, L. (2013). Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case. In <i>Proceedings of the International Conference on Communications (ICC’13)</i> (pp. 3444–3449). <a href=\"https://doi.org/10.1109/ICC.2013.6655082\">https://doi.org/10.1109/ICC.2013.6655082</a>"}},{"has_accepted_license":"1","year":"2013","citation":{"apa":"Avin, C., Häupler, B., Lotker, Z., Scheideler, C., &#38; Schmid, S. (2013). Locally Self-Adjusting Tree Networks. In <i>Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i> (pp. 395–406). <a href=\"https://doi.org/10.1109/IPDPS.2013.40\">https://doi.org/10.1109/IPDPS.2013.40</a>","mla":"Avin, Chen, et al. “Locally Self-Adjusting Tree Networks.” <i>Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2013, pp. 395–406, doi:<a href=\"https://doi.org/10.1109/IPDPS.2013.40\">10.1109/IPDPS.2013.40</a>.","bibtex":"@inproceedings{Avin_Häupler_Lotker_Scheideler_Schmid_2013, title={Locally Self-Adjusting Tree Networks}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2013.40\">10.1109/IPDPS.2013.40</a>}, booktitle={Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Avin, Chen and Häupler, Bernhard and Lotker, Zvi and Scheideler, Christian and Schmid, Stefan}, year={2013}, pages={395–406} }","short":"C. Avin, B. Häupler, Z. Lotker, C. Scheideler, S. Schmid, in: Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2013, pp. 395–406.","ieee":"C. Avin, B. Häupler, Z. Lotker, C. Scheideler, and S. Schmid, “Locally Self-Adjusting Tree Networks,” in <i>Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2013, pp. 395–406.","chicago":"Avin, Chen, Bernhard Häupler, Zvi Lotker, Christian Scheideler, and Stefan Schmid. “Locally Self-Adjusting Tree Networks.” In <i>Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 395–406, 2013. <a href=\"https://doi.org/10.1109/IPDPS.2013.40\">https://doi.org/10.1109/IPDPS.2013.40</a>.","ama":"Avin C, Häupler B, Lotker Z, Scheideler C, Schmid S. Locally Self-Adjusting Tree Networks. In: <i>Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. ; 2013:395-406. doi:<a href=\"https://doi.org/10.1109/IPDPS.2013.40\">10.1109/IPDPS.2013.40</a>"},"page":"395-406","date_updated":"2022-01-06T07:01:38Z","author":[{"last_name":"Avin","full_name":"Avin, Chen","first_name":"Chen"},{"first_name":"Bernhard","last_name":"Häupler","full_name":"Häupler, Bernhard"},{"first_name":"Zvi","full_name":"Lotker, Zvi","last_name":"Lotker"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"}],"date_created":"2017-10-17T12:42:32Z","title":"Locally Self-Adjusting Tree Networks","doi":"10.1109/IPDPS.2013.40","type":"conference","publication":"Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)","abstract":[{"lang":"eng","text":"This paper initiates the study of self-adjusting networks (or distributed data structures) whose topologies dynamically adapt to a communication pattern $\\sigma$. We present a fully decentralized self-adjusting solution called SplayNet. A SplayNet is a distributed generalization of the classic splay tree concept. It ensures short paths (which can be found using local-greedy routing) between communication partners while minimizing topological rearrangements. We derive an upper bound for the amortized communication cost of a SplayNet based on empirical entropies of $\\sigma$, and show that SplayNets have several interesting convergence properties. For instance, SplayNets features a provable online optimality under special requests scenarios. We also investigate the optimal static network and prove different lower bounds for the average communication cost based on graph cuts and on the empirical entropy of the communication pattern $\\sigma$. From these lower bounds it follows, e.g., that SplayNets are optimal in scenarios where the requests follow a product distribution as well. Finally, this paper shows that in contrast to the Minimum Linear Arrangement problem which is generally NP-hard, the optimal static tree network can be computed in polynomial time for any guest graph, despite the exponentially large graph family. We complement our formal analysis with a small simulation study on a Facebook graph."}],"file":[{"access_level":"closed","file_name":"513-ipdps13_01.pdf","file_id":"1303","file_size":518804,"date_created":"2018-03-15T10:45:15Z","creator":"florida","date_updated":"2018-03-15T10:45:15Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"513","user_id":"15504","department":[{"_id":"79"}],"ddc":["040"],"file_date_updated":"2018-03-15T10:45:15Z"},{"date_created":"2017-10-17T12:42:33Z","author":[{"last_name":"Eikel","full_name":"Eikel, Martina","first_name":"Martina"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"date_updated":"2022-01-06T07:01:42Z","doi":"10.1145/2486159.2486186","title":"IRIS: A Robust Information System Against Insider DoS-Attacks","has_accepted_license":"1","page":"119-129","citation":{"chicago":"Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS-Attacks.” In <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 119–29, 2013. <a href=\"https://doi.org/10.1145/2486159.2486186\">https://doi.org/10.1145/2486159.2486186</a>.","ieee":"M. Eikel and C. Scheideler, “IRIS: A Robust Information System Against Insider DoS-Attacks,” in <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2013, pp. 119–129.","ama":"Eikel M, Scheideler C. IRIS: A Robust Information System Against Insider DoS-Attacks. In: <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2013:119-129. doi:<a href=\"https://doi.org/10.1145/2486159.2486186\">10.1145/2486159.2486186</a>","apa":"Eikel, M., &#38; Scheideler, C. (2013). IRIS: A Robust Information System Against Insider DoS-Attacks. In <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 119–129). <a href=\"https://doi.org/10.1145/2486159.2486186\">https://doi.org/10.1145/2486159.2486186</a>","short":"M. Eikel, C. Scheideler, in: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2013, pp. 119–129.","bibtex":"@inproceedings{Eikel_Scheideler_2013, title={IRIS: A Robust Information System Against Insider DoS-Attacks}, DOI={<a href=\"https://doi.org/10.1145/2486159.2486186\">10.1145/2486159.2486186</a>}, booktitle={Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Eikel, Martina and Scheideler, Christian}, year={2013}, pages={119–129} }","mla":"Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS-Attacks.” <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2013, pp. 119–29, doi:<a href=\"https://doi.org/10.1145/2486159.2486186\">10.1145/2486159.2486186</a>."},"year":"2013","department":[{"_id":"79"}],"user_id":"15504","_id":"519","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"file_date_updated":"2018-03-15T10:38:34Z","ddc":["040"],"publication":"Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","type":"conference","status":"public","file":[{"file_size":554618,"access_level":"closed","file_name":"519-iris-spaa2013_01.pdf","file_id":"1299","date_updated":"2018-03-15T10:38:34Z","creator":"florida","date_created":"2018-03-15T10:38:34Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"In this work we present the first scalable distributed information system,i.e., a system with low storage overhead, that is provably robust againstDenial-of-Service (DoS) attacks by a current insider. We allow acurrent insider to have complete knowledge about the information systemand to have the power to block any \\epsilon-fraction of its serversby a DoS-attack, where \\epsilon can be chosen up to a constant. The taskof the system is to serve any collection of lookup requests with at most oneper non-blocked server in an efficient way despite this attack. Previously,scalable solutions were only known for DoS-attacks of past insiders, where apast insider only has complete knowledge about some past time pointt_0 of the information system. Scheideler et al. (DISC 2007, SPAA 2009) showedthat in this case it is possible to design an information system so that anyinformation that was inserted or last updated after t_0 is safe against a DoS-attack. But their constructions would not work at all for a current insider. The key idea behindour IRIS system is to make extensive use of coding. More precisely, we presenttwo alternative distributed coding strategies with an at most logarithmicstorage overhead that can handle up to a constant fraction of blocked servers."}]},{"title":"HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths","date_updated":"2022-01-06T07:01:47Z","publisher":"Universität Paderborn","author":[{"orcid":"0000-0003-1348-6516","last_name":"Feldotto","id":"14052","full_name":"Feldotto, Matthias","first_name":"Matthias"}],"supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2017-10-17T12:42:34Z","year":"2013","citation":{"ama":"Feldotto M. <i>HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths</i>. Universität Paderborn; 2013.","chicago":"Feldotto, Matthias. <i>HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths</i>. Universität Paderborn, 2013.","ieee":"M. Feldotto, <i>HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths</i>. Universität Paderborn, 2013.","short":"M. Feldotto, HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths, Universität Paderborn, 2013.","mla":"Feldotto, Matthias. <i>HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths</i>. Universität Paderborn, 2013.","bibtex":"@book{Feldotto_2013, title={HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths}, publisher={Universität Paderborn}, author={Feldotto, Matthias}, year={2013} }","apa":"Feldotto, M. (2013). <i>HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths</i>. Universität Paderborn."},"_id":"522","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Teilprojekt A"},{"name":"SFB 901 - Subprojekt A1","_id":"5"}],"department":[{"_id":"79"}],"user_id":"14052","status":"public","type":"mastersthesis"},{"title":"Continuous Gossip-based Aggregation through Dynamic Information Aging","doi":"10.1109/ICCCN.2013.6614118","date_updated":"2022-01-06T07:01:52Z","date_created":"2017-10-17T12:42:37Z","author":[{"first_name":"Kalman","last_name":"Graffi","full_name":"Graffi, Kalman"},{"full_name":"Rapp, Vitaly","last_name":"Rapp","first_name":"Vitaly"}],"year":"2013","citation":{"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>","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.","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>.","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} }","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>.","short":"K. Graffi, V. Rapp, in: Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13), 2013, pp. 1–7.","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>"},"page":"1-7","has_accepted_license":"1","ddc":["040"],"file_date_updated":"2018-03-15T10:33:20Z","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"541","user_id":"477","department":[{"_id":"79"}],"abstract":[{"lang":"eng","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."}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-15T10:33:20Z","creator":"florida","date_updated":"2018-03-15T10:33:20Z","file_id":"1290","access_level":"closed","file_name":"541-Continuous.Gossip.based.Aggregation.Through.Dynamic.Information.Aging.pdf","file_size":272960}],"status":"public","type":"conference","publication":"Proceedings of the International Conference on Computer Communications and Networks (ICCCN'13)"},{"status":"public","file":[{"access_level":"closed","file_id":"1289","file_name":"542-CONE-DHT_A_distributed_self-stabilizing_algorithm_for_a_heterogeneous_storage_system.pdf","file_size":262302,"creator":"florida","date_created":"2018-03-15T10:32:48Z","date_updated":"2018-03-15T10:32:48Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"We consider the problem of managing a dynamic heterogeneous storagesystem in a distributed way so that the amount of data assigned to a hostin that system is related to its capacity. Two central problems have to be solvedfor this: (1) organizing the hosts in an overlay network with low degree and diameterso that one can efficiently check the correct distribution of the data androute between any two hosts, and (2) distributing the data among the hosts so thatthe distribution respects the capacities of the hosts and can easily be adapted asthe set of hosts or their capacities change. We present distributed protocols forthese problems that are self-stabilizing and that do not need any global knowledgeabout the system such as the number of nodes or the overall capacity of thesystem. Prior to this work no solution was known satisfying these properties."}],"publication":"Proceedings of the 27th International Symposium on Distributed Computing (DISC)","type":"conference","file_date_updated":"2018-03-15T10:32:48Z","ddc":["040"],"department":[{"_id":"79"}],"user_id":"15504","series_title":"LNCS","_id":"542","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"page":"537-549","citation":{"ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system,” in <i>Proceedings of the 27th International Symposium on Distributed Computing (DISC)</i>, 2013, pp. 537–549.","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage System.” In <i>Proceedings of the 27th International Symposium on Distributed Computing (DISC)</i>, 537–49. LNCS, 2013. <a href=\"https://doi.org/10.1007/978-3-642-41527-2_37\">https://doi.org/10.1007/978-3-642-41527-2_37</a>.","ama":"Kniesburges S, Koutsopoulos A, Scheideler C. CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system. In: <i>Proceedings of the 27th International Symposium on Distributed Computing (DISC)</i>. LNCS. ; 2013:537-549. doi:<a href=\"https://doi.org/10.1007/978-3-642-41527-2_37\">10.1007/978-3-642-41527-2_37</a>","mla":"Kniesburges, Sebastian, et al. “CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage System.” <i>Proceedings of the 27th International Symposium on Distributed Computing (DISC)</i>, 2013, pp. 537–49, doi:<a href=\"https://doi.org/10.1007/978-3-642-41527-2_37\">10.1007/978-3-642-41527-2_37</a>.","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of the 27th International Symposium on Distributed Computing (DISC), 2013, pp. 537–549.","bibtex":"@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2013, series={LNCS}, title={CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-41527-2_37\">10.1007/978-3-642-41527-2_37</a>}, booktitle={Proceedings of the 27th International Symposium on Distributed Computing (DISC)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2013}, pages={537–549}, collection={LNCS} }","apa":"Kniesburges, S., Koutsopoulos, A., &#38; Scheideler, C. (2013). CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system. In <i>Proceedings of the 27th International Symposium on Distributed Computing (DISC)</i> (pp. 537–549). <a href=\"https://doi.org/10.1007/978-3-642-41527-2_37\">https://doi.org/10.1007/978-3-642-41527-2_37</a>"},"year":"2013","has_accepted_license":"1","doi":"10.1007/978-3-642-41527-2_37","title":"CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system","author":[{"last_name":"Kniesburges","full_name":"Kniesburges, Sebastian","first_name":"Sebastian"},{"full_name":"Koutsopoulos, Andreas","last_name":"Koutsopoulos","first_name":"Andreas"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2017-10-17T12:42:38Z","date_updated":"2022-01-06T07:01:53Z"},{"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-15T10:32:17Z","date_created":"2018-03-15T10:32:17Z","creator":"florida","file_size":899441,"access_level":"closed","file_id":"1288","file_name":"544-FeldGraffi13.pdf"}],"status":"public","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."}],"type":"conference","publication":"Proceedings of the International Conference on High Performance Computing and Simulation (HPCS'13)","language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T10:32:17Z","ddc":["040"],"user_id":"14052","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"544","citation":{"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.","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>.","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","year":"2013","has_accepted_license":"1","doi":"10.1109/HPCSim.2013.6641399","title":"Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM","author":[{"full_name":"Feldotto, Matthias","id":"14052","orcid":"0000-0003-1348-6516","last_name":"Feldotto","first_name":"Matthias"},{"full_name":"Graffi, Kalman","last_name":"Graffi","first_name":"Kalman"}],"date_created":"2017-10-17T12:42:38Z","date_updated":"2022-01-06T07:01:53Z"},{"file_date_updated":"2018-03-15T10:30:42Z","ddc":["040"],"user_id":"15504","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"13","name":"SFB 901 - Subproject C1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"546","file":[{"access_level":"closed","file_name":"546-Kalman.Graffi_CaReChord.A.Churn.Resistant.Selfstabilizing.Chord.Overlay.Network_02.pdf","file_id":"1286","file_size":244841,"creator":"florida","date_created":"2018-03-15T10:30:42Z","date_updated":"2018-03-15T10:30:42Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","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."}],"type":"conference","publication":"Proceedings of the Conference on Networked Systems (NetSys)","doi":"10.1109/NetSys.2013.11","title":"Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network","date_created":"2017-10-17T12:42:38Z","author":[{"full_name":"Graffi, Kalman","last_name":"Graffi","first_name":"Kalman"},{"full_name":"Benter, Markus","last_name":"Benter","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","last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas"}],"date_updated":"2022-01-06T07:01:55Z","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>","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","year":"2013","has_accepted_license":"1"},{"citation":{"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>","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} }","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>.","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>"},"page":"1-5","year":"2013","has_accepted_license":"1","doi":"10.1109/P2P.2013.6688720","title":"Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks","date_created":"2017-10-17T12:42:39Z","author":[{"first_name":"Kalman","last_name":"Graffi","full_name":"Graffi, Kalman"},{"full_name":"Klerx, Timo","last_name":"Klerx","first_name":"Timo"}],"date_updated":"2022-01-06T07:01:56Z","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","abstract":[{"lang":"eng","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."}],"type":"conference","publication":"Proceedings of the International Conference on Peer-to-Peer Computing (P2P'13)","language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T10:30:09Z","ddc":["040"],"user_id":"477","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"548"},{"author":[{"last_name":"Setzer","full_name":"Setzer, Alexander","id":"11108","first_name":"Alexander"}],"date_created":"2017-10-17T12:42:40Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:59Z","title":"Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs","citation":{"ama":"Setzer A. <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.","ieee":"A. Setzer, <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.","mla":"Setzer, Alexander. <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."},"year":"2013","user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"555","type":"mastersthesis","status":"public"},{"year":"2013","citation":{"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>","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.","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>.","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>"},"page":"35-42","has_accepted_license":"1","title":"Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables","doi":"10.1109/NetSys.2013.9","date_updated":"2022-01-06T07:02:04Z","date_created":"2017-10-17T12:42:41Z","author":[{"full_name":"Wette, Philip","last_name":"Wette","first_name":"Philip"},{"first_name":"Kalman","full_name":"Graffi, Kalman","last_name":"Graffi"}],"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","file_name":"559-Adding.Capacity.Aware.Storage.Indirection.to.Homogeneous.Distributed.Hash.Tables.pdf","access_level":"closed","file_id":"1282","file_size":734618}],"status":"public","type":"conference","publication":"Proceedings of the Conference on Networked Systems (NetSys)","ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T10:27:21Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"559","user_id":"477","department":[{"_id":"79"}]},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"564","user_id":"15504","series_title":"Lecture Notes in Computer Science","department":[{"_id":"79"}],"ddc":["040"],"file_date_updated":"2018-03-15T10:24:40Z","type":"conference","publication":"Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO)","abstract":[{"lang":"eng","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."}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-15T10:24:40Z","date_updated":"2018-03-15T10:24:40Z","file_id":"1277","access_level":"closed","file_name":"564-SIROCCO13.pdf","file_size":168884}],"status":"public","date_updated":"2022-01-06T07:02:17Z","author":[{"last_name":"Kniesburges","full_name":"Kniesburges, Sebastian","first_name":"Sebastian"},{"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","title":"A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery","doi":"10.1007/978-3-319-03578-9_14","has_accepted_license":"1","year":"2013","citation":{"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.","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>","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"},{"page":"1","citation":{"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} }","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.","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>","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","doi":"10.1016/j.tcs.2012.07.012","title":"Editorial for Algorithmic Aspects of Wireless Sensor Networks","author":[{"first_name":"Shlomi","last_name":"Dolev","full_name":"Dolev, 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","status":"public","publication":"Theor. Comput. Sci.","type":"journal_article","department":[{"_id":"79"}],"user_id":"15504","_id":"1882"},{"type":"conference","publication":"Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings","status":"public","user_id":"15504","series_title":"Lecture Notes in Computer Science","department":[{"_id":"79"}],"_id":"1884","publication_identifier":{"isbn":["978-3-642-32819-0"]},"citation":{"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>.","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.","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>","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>","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>."},"page":"1--2","intvolume":"      7484","year":"2012","author":[{"first_name":"Burkhard","full_name":"Monien, Burkhard","last_name":"Monien"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2018-03-28T06:44:57Z","volume":7484,"date_updated":"2022-01-06T06:53:52Z","publisher":"Springer","doi":"10.1007/978-3-642-32820-6_1","title":"Selfish Distributed Optimization"},{"citation":{"ama":"Meith FI. <i>Jamming-Resistente MAC-Protokolle</i>.; 2012.","chicago":"Meith, Frank Ingo. <i>Jamming-Resistente MAC-Protokolle</i>, 2012.","ieee":"F. I. Meith, <i>Jamming-resistente MAC-Protokolle</i>. 2012.","apa":"Meith, F. I. (2012). <i>Jamming-resistente MAC-Protokolle</i>.","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} }","short":"F.I. Meith, Jamming-Resistente MAC-Protokolle, 2012."},"year":"2012","title":"Jamming-resistente MAC-Protokolle","author":[{"first_name":"Frank Ingo","full_name":"Meith, Frank Ingo","last_name":"Meith"}],"date_created":"2020-08-17T08:13:21Z","supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"date_updated":"2022-01-06T06:53:24Z","status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"department":[{"_id":"79"}],"user_id":"15504","_id":"17999"},{"_id":"570","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"}],"user_id":"477","ddc":["040"],"file_date_updated":"2018-03-15T10:16:20Z","publication":"Theoretical Computer Science","type":"journal_article","abstract":[{"lang":"eng","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"}],"status":"public","file":[{"creator":"florida","date_created":"2018-03-15T10:16:20Z","date_updated":"2018-03-15T10:16:20Z","file_name":"570-Delaunay-Journal.pdf","file_id":"1272","access_level":"closed","file_size":250051,"content_type":"application/pdf","relation":"main_file","success":1}],"publisher":"Elsevier","date_updated":"2022-01-06T07:02:36Z","author":[{"first_name":"Riko","full_name":"Jacob, Riko","last_name":"Jacob"},{"last_name":"Ritscher","full_name":"Ritscher, Stephan","first_name":"Stephan"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"}],"date_created":"2017-10-17T12:42:43Z","title":"Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs","doi":"10.1016/j.tcs.2012.07.029","has_accepted_license":"1","year":"2012","page":"137-148","citation":{"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>","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.","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>","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} }","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>.","short":"R. Jacob, S. Ritscher, C. Scheideler, S. Schmid, Theoretical Computer Science (2012) 137–148."}},{"has_accepted_license":"1","year":"2012","page":"18-35","citation":{"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.","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>.","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} }","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.","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>.","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>"},"date_updated":"2022-01-06T07:02:38Z","publisher":"Elsevier","author":[{"last_name":"Clouser","full_name":"Clouser, Thomas","first_name":"Thomas"},{"first_name":"Mikhail","full_name":"Nesterenko, Mikhail","last_name":"Nesterenko"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"date_created":"2017-10-17T12:42:44Z","title":"Tiara: A self-stabilizing deterministic skip list and skip graph","doi":"10.1016/j.tcs.2011.12.079","publication":"Theoretical Computer Science","type":"journal_article","abstract":[{"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.","lang":"eng"}],"status":"public","file":[{"file_id":"1268","file_name":"574-tiara.pdf","access_level":"closed","file_size":315843,"date_created":"2018-03-15T09:09:29Z","creator":"florida","date_updated":"2018-03-15T09:09:29Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"_id":"574","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"],"file_date_updated":"2018-03-15T09:09:29Z"}]