[{"page":"36:1--36:26","citation":{"short":"R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, J. ACM (2014) 36:1--36:26.","ieee":"R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “SKIP*: A Self-Stabilizing Skip Graph,” J. ACM, no. 6, pp. 36:1--36:26, 2014.","apa":"Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., & Täubig, H. (2014). SKIP*: A Self-Stabilizing Skip Graph. J. ACM, (6), 36:1--36:26. https://doi.org/10.1145/2629695","ama":"Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. SKIP*: A Self-Stabilizing Skip Graph. J ACM. 2014;(6):36:1--36:26. doi:10.1145/2629695","chicago":"Jacob, Riko, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Hanjo Täubig. “SKIP*: A Self-Stabilizing Skip Graph.” J. ACM, no. 6 (2014): 36:1--36:26. https://doi.org/10.1145/2629695.","bibtex":"@article{Jacob_W. Richa_Scheideler_Schmid_Täubig_2014, title={SKIP*: A Self-Stabilizing Skip Graph}, DOI={10.1145/2629695}, number={6}, journal={J. ACM}, author={Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo}, year={2014}, pages={36:1--36:26} }","mla":"Jacob, Riko, et al. “SKIP*: A Self-Stabilizing Skip Graph.” J. ACM, no. 6, 2014, pp. 36:1--36:26, doi:10.1145/2629695."},"type":"journal_article","year":"2014","_id":"1858","date_updated":"2022-01-06T06:53:40Z","issue":"6","doi":"10.1145/2629695","publication":"J. ACM","department":[{"_id":"79"}],"author":[{"last_name":"Jacob","first_name":"Riko","full_name":"Jacob, Riko"},{"full_name":"W. Richa, Andrea","first_name":"Andrea","last_name":"W. Richa"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"last_name":"Täubig","first_name":"Hanjo","full_name":"Täubig, Hanjo"}],"date_created":"2018-03-28T06:17:25Z","status":"public","user_id":"15504","title":"SKIP*: A Self-Stabilizing Skip Graph"},{"language":[{"iso":"eng"}],"page":"220--222","year":"2014","citation":{"chicago":"Derakhshandeh, Zahra, Shlomi Dolev, Robert Gmyr, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “Brief Announcement: Amoebot - a New Model for Programmable Matter.” In 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014, 220--222. ACM, 2014. https://doi.org/10.1145/2612669.2612712.","apa":"Derakhshandeh, Z., Dolev, S., Gmyr, R., W. Richa, A., Scheideler, C., & Strothmann, T. F. (2014). Brief announcement: amoebot - a new model for programmable matter. In 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014 (pp. 220--222). ACM. https://doi.org/10.1145/2612669.2612712","ama":"Derakhshandeh Z, Dolev S, Gmyr R, W. Richa A, Scheideler C, Strothmann TF. Brief announcement: amoebot - a new model for programmable matter. In: 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014. ACM; 2014:220--222. doi:10.1145/2612669.2612712","mla":"Derakhshandeh, Zahra, et al. “Brief Announcement: Amoebot - a New Model for Programmable Matter.” 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014, ACM, 2014, pp. 220--222, doi:10.1145/2612669.2612712.","bibtex":"@inproceedings{Derakhshandeh_Dolev_Gmyr_W. Richa_Scheideler_Strothmann_2014, title={Brief announcement: amoebot - a new model for programmable matter}, DOI={10.1145/2612669.2612712}, booktitle={26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014}, publisher={ACM}, author={Derakhshandeh, Zahra and Dolev, Shlomi and Gmyr, Robert and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}, year={2014}, pages={220--222} }","short":"Z. Derakhshandeh, S. Dolev, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann, in: 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014, ACM, 2014, pp. 220--222.","ieee":"Z. Derakhshandeh, S. Dolev, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann, “Brief announcement: amoebot - a new model for programmable matter,” in 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014, 2014, pp. 220--222."},"type":"conference","_id":"1863","date_updated":"2022-01-06T06:53:47Z","doi":"10.1145/2612669.2612712","publication":"26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'14, Prague, Czech Republic - June 23 - 25, 2014","department":[{"_id":"79"}],"publisher":"ACM","author":[{"last_name":"Derakhshandeh","full_name":"Derakhshandeh, Zahra","first_name":"Zahra"},{"last_name":"Dolev","first_name":"Shlomi","full_name":"Dolev, Shlomi"},{"first_name":"Robert","full_name":"Gmyr, Robert","last_name":"Gmyr"},{"full_name":"W. Richa, Andrea","first_name":"Andrea","last_name":"W. Richa"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"full_name":"Strothmann, Thim Frederik","first_name":"Thim Frederik","id":"11319","last_name":"Strothmann"}],"date_created":"2018-03-28T06:24:00Z","status":"public","publication_identifier":{"isbn":["978-1-4503-2821-0"]},"user_id":"15504","title":"Brief announcement: amoebot - a new model for programmable matter"},{"page":"2751--2759","citation":{"mla":"Ogierman, Adrian, et al. “Competitive MAC under Adversarial SINR.” Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM), 2014, pp. 2751--2759, doi:10.1109/INFOCOM.2014.6848224.","bibtex":"@inproceedings{Ogierman_Richa_Scheideler_Schmid_Zhang_2014, title={Competitive MAC under adversarial SINR}, DOI={10.1109/INFOCOM.2014.6848224}, booktitle={Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM)}, author={Ogierman, Adrian and Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2014}, pages={2751--2759} }","chicago":"Ogierman, Adrian, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Competitive MAC under Adversarial SINR.” In Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM), 2751--2759, 2014. https://doi.org/10.1109/INFOCOM.2014.6848224.","apa":"Ogierman, A., Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2014). Competitive MAC under adversarial SINR. In Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM) (pp. 2751--2759). https://doi.org/10.1109/INFOCOM.2014.6848224","ama":"Ogierman A, Richa AW, Scheideler C, Schmid S, Zhang J. Competitive MAC under adversarial SINR. In: Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM). ; 2014:2751--2759. doi:10.1109/INFOCOM.2014.6848224","ieee":"A. Ogierman, A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive MAC under adversarial SINR,” in Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM), 2014, pp. 2751--2759.","short":"A. Ogierman, A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM), 2014, pp. 2751--2759."},"year":"2014","type":"conference","_id":"446","date_updated":"2022-01-06T07:01:05Z","doi":"10.1109/INFOCOM.2014.6848224","file":[{"date_created":"2018-03-16T11:27:04Z","file_name":"446-infocom14_01.pdf","access_level":"closed","file_size":378095,"creator":"florida","file_id":"1348","content_type":"application/pdf","date_updated":"2018-03-16T11:27:04Z","relation":"main_file","success":1}],"file_date_updated":"2018-03-16T11:27:04Z","publication":"Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM)","department":[{"_id":"79"}],"author":[{"last_name":"Ogierman","first_name":"Adrian","full_name":"Ogierman, Adrian"},{"last_name":"Richa","first_name":"Andrea W.","full_name":"Richa, Andrea W."},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"},{"last_name":"Zhang","first_name":"Jin","full_name":"Zhang, Jin"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"date_created":"2017-10-17T12:42:18Z","has_accepted_license":"1","status":"public","abstract":[{"text":"This paper considers the problem of how to efficiently share a wireless medium which is subject to harsh external interference or even jamming. While this problem has already been studied intensively for simplistic single-hop or unit disk graph models, we make a leap forward and study MAC protocols for the SINR interference model (a.k.a. the physical model). We make two contributions. First, we introduce a new adversarial SINR model which captures a wide range of interference phenomena. Concretely, we consider a powerful, adaptive adversary which can jam nodes at arbitrary times and which is only limited by some energy budget. The second contribution of this paper is a distributed MAC protocol which provably achieves a constant competitive throughput in this environment: we show that, with high probability, the protocol ensures that a constant fraction of the non-blocked time periods is used for successful transmissions.","lang":"eng"}],"user_id":"15504","title":"Competitive MAC under adversarial SINR","ddc":["040"]},{"page":"1-13","type":"conference","year":"2014","citation":{"short":"S. Kniesburges, C. Markarian, F. Meyer auf der Heide, C. Scheideler, in: Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2014, pp. 1–13.","ieee":"S. Kniesburges, C. Markarian, F. Meyer auf der Heide, and C. Scheideler, “Algorithmic Aspects of Resource Management in the Cloud,” in Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2014, pp. 1–13.","apa":"Kniesburges, S., Markarian, C., Meyer auf der Heide, F., & Scheideler, C. (2014). Algorithmic Aspects of Resource Management in the Cloud. In Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO) (pp. 1–13). https://doi.org/10.1007/978-3-319-09620-9_1","ama":"Kniesburges S, Markarian C, Meyer auf der Heide F, Scheideler C. Algorithmic Aspects of Resource Management in the Cloud. In: Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO). LNCS. ; 2014:1-13. doi:10.1007/978-3-319-09620-9_1","chicago":"Kniesburges, Sebastian, Christine Markarian, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Algorithmic Aspects of Resource Management in the Cloud.” In Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 1–13. LNCS, 2014. https://doi.org/10.1007/978-3-319-09620-9_1.","mla":"Kniesburges, Sebastian, et al. “Algorithmic Aspects of Resource Management in the Cloud.” Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2014, pp. 1–13, doi:10.1007/978-3-319-09620-9_1.","bibtex":"@inproceedings{Kniesburges_Markarian_Meyer auf der Heide_Scheideler_2014, series={LNCS}, title={Algorithmic Aspects of Resource Management in the Cloud}, DOI={10.1007/978-3-319-09620-9_1}, booktitle={Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)}, author={Kniesburges, Sebastian and Markarian, Christine and Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2014}, pages={1–13}, collection={LNCS} }"},"_id":"459","date_created":"2017-10-17T12:42:21Z","status":"public","has_accepted_license":"1","file":[{"file_name":"459-SIROCCO2014.pdf","date_created":"2018-03-16T11:21:54Z","access_level":"closed","file_size":274496,"creator":"florida","file_id":"1338","content_type":"application/pdf","date_updated":"2018-03-16T11:21:54Z","relation":"main_file","success":1}],"file_date_updated":"2018-03-16T11:21:54Z","publication":"Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)","author":[{"last_name":"Kniesburges","full_name":"Kniesburges, Sebastian","first_name":"Sebastian"},{"full_name":"Markarian, Christine","first_name":"Christine","id":"37612","last_name":"Markarian"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"user_id":"477","ddc":["040"],"abstract":[{"text":"In this survey article, we discuss two algorithmic research areas that emerge from problems that arise when resources are offered in the cloud. The first area, online leasing, captures problems arising from the fact that resources in the cloud are not bought, but leased by cloud vendors. The second area, Distributed Storage Systems, deals with problems arising from so-called cloud federations, i.e., when several cloud providers are needed to fulfill a given task.","lang":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-319-09620-9_1","date_updated":"2022-01-06T07:01:14Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"},{"_id":"63"}],"title":"Algorithmic Aspects of Resource Management in the Cloud"},{"abstract":[{"text":"Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful network topologies. The goal is to devise distributed algorithms where nodes forward, insert, and delete links to neighboring nodes, and that converge quickly to such a desirable topology, independently of the initial network configuration. This article proposes a new model to study the parallel convergence time. Our model sheds light on the achievable parallelism by avoiding bottlenecks of existing models that can yield a distorted picture. As a case study, we consider local graph linearization—i.e., how to build a sorted list of the nodes of a connected graph in a distributed and self-stabilizing manner. In order to study the main structure and properties of our model, we propose two variants of a most simple local linearization algorithm. For each of these variants, we present analyses of the worst-case and bestcase parallel time complexities, as well as the performance under a greedy selection of the actions to be executed. It turns out that the analysis is non-trivial despite the simple setting, and to complement our formal insights we report on our experiments which indicate that the runtimes may be better in the average case.","lang":"eng"}],"user_id":"477","ddc":["040"],"file":[{"date_updated":"2018-03-16T11:19:45Z","content_type":"application/pdf","success":1,"relation":"main_file","file_size":947484,"file_id":"1334","creator":"florida","access_level":"closed","file_name":"464-GJRSST2014.pdf","date_created":"2018-03-16T11:19:45Z"}],"file_date_updated":"2018-03-16T11:19:45Z","publication":"Theory of Computing Systems","publisher":"Springer","author":[{"last_name":"Gall","full_name":"Gall, Dominik","first_name":"Dominik"},{"last_name":"Jacob","full_name":"Jacob, Riko","first_name":"Riko"},{"last_name":"Richa","first_name":"Andrea W.","full_name":"Richa, Andrea W."},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"},{"first_name":"Hanjo ","full_name":"Täubig, Hanjo ","last_name":"Täubig"}],"date_created":"2017-10-17T12:42:22Z","status":"public","has_accepted_license":"1","_id":"464","issue":"1","page":"110-135","citation":{"short":"D. Gall, R. Jacob, A.W. Richa, C. Scheideler, S. Schmid, H. Täubig, Theory of Computing Systems (2014) 110–135.","ieee":"D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization,” Theory of Computing Systems, no. 1, pp. 110–135, 2014.","chicago":"Gall, Dominik, Riko Jacob, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Hanjo Täubig. “A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization.” Theory of Computing Systems, no. 1 (2014): 110–35. https://doi.org/10.1007/s00224-013-9504-x.","ama":"Gall D, Jacob R, Richa AW, Scheideler C, Schmid S, Täubig H. A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization. Theory of Computing Systems. 2014;(1):110-135. doi:10.1007/s00224-013-9504-x","apa":"Gall, D., Jacob, R., Richa, A. W., Scheideler, C., Schmid, S., & Täubig, H. (2014). A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization. Theory of Computing Systems, (1), 110–135. https://doi.org/10.1007/s00224-013-9504-x","mla":"Gall, Dominik, et al. “A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization.” Theory of Computing Systems, no. 1, Springer, 2014, pp. 110–35, doi:10.1007/s00224-013-9504-x.","bibtex":"@article{Gall_Jacob_Richa_Scheideler_Schmid_Täubig_2014, title={A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization}, DOI={10.1007/s00224-013-9504-x}, number={1}, journal={Theory of Computing Systems}, publisher={Springer}, author={Gall, Dominik and Jacob, Riko and Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo }, year={2014}, pages={110–135} }"},"year":"2014","type":"journal_article","title":"A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_updated":"2022-01-06T07:01:16Z","doi":"10.1007/s00224-013-9504-x"},{"language":[{"iso":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-319-11764-5_4","date_updated":"2022-01-06T06:59:56Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"79"}],"title":"On Stabilizing Departures in Overlay Networks","page":"48--62","year":"2014","type":"conference","citation":{"chicago":"Foreback, Dianne, Andreas Koutsopoulos, Mikhail Nesterenko, Christian Scheideler, and Thim Frederik Strothmann. “On Stabilizing Departures in Overlay Networks.” In Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 48--62. LNCS, 2014. https://doi.org/10.1007/978-3-319-11764-5_4.","ama":"Foreback D, Koutsopoulos A, Nesterenko M, Scheideler C, Strothmann TF. On Stabilizing Departures in Overlay Networks. In: Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems. LNCS. ; 2014:48--62. doi:10.1007/978-3-319-11764-5_4","apa":"Foreback, D., Koutsopoulos, A., Nesterenko, M., Scheideler, C., & Strothmann, T. F. (2014). On Stabilizing Departures in Overlay Networks. In Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems (pp. 48--62). https://doi.org/10.1007/978-3-319-11764-5_4","mla":"Foreback, Dianne, et al. “On Stabilizing Departures in Overlay Networks.” Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2014, pp. 48--62, doi:10.1007/978-3-319-11764-5_4.","bibtex":"@inproceedings{Foreback_Koutsopoulos_Nesterenko_Scheideler_Strothmann_2014, series={LNCS}, title={On Stabilizing Departures in Overlay Networks}, DOI={10.1007/978-3-319-11764-5_4}, booktitle={Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems}, author={Foreback, Dianne and Koutsopoulos, Andreas and Nesterenko, Mikhail and Scheideler, Christian and Strothmann, Thim Frederik}, year={2014}, pages={48--62}, collection={LNCS} }","short":"D. Foreback, A. Koutsopoulos, M. Nesterenko, C. Scheideler, T.F. Strothmann, in: Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2014, pp. 48--62.","ieee":"D. Foreback, A. Koutsopoulos, M. Nesterenko, C. Scheideler, and T. F. Strothmann, “On Stabilizing Departures in Overlay Networks,” in Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2014, pp. 48--62."},"_id":"393","date_created":"2017-10-17T12:42:08Z","status":"public","has_accepted_license":"1","publication":"Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems","file_date_updated":"2018-03-20T07:00:28Z","author":[{"last_name":"Foreback","full_name":"Foreback, Dianne","first_name":"Dianne"},{"last_name":"Koutsopoulos","first_name":"Andreas","full_name":"Koutsopoulos, Andreas"},{"last_name":"Nesterenko","full_name":"Nesterenko, Mikhail","first_name":"Mikhail"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"id":"11319","last_name":"Strothmann","full_name":"Strothmann, Thim Frederik","first_name":"Thim Frederik"}],"file":[{"file_size":287539,"file_id":"1384","creator":"florida","content_type":"application/pdf","date_updated":"2018-03-20T07:00:28Z","success":1,"relation":"main_file","date_created":"2018-03-20T07:00:28Z","file_name":"393-departures.pdf","access_level":"closed"}],"ddc":["040"],"user_id":"477","abstract":[{"lang":"eng","text":"A fundamental problem for peer-to-peer systems is to maintain connectivity while nodes are leaving, i.e., the nodes requesting to leave the peer-to-peer system are excluded from the overlay network without affecting its connectivity. There are a number of studies for safe node exclusion if the overlay is in a well-defined state initially. Surprisingly, the problem is not formally studied yet for the case in which the overlay network is in an arbitrary initial state, i.e., when looking for a self-stabilizing solution for excluding leaving nodes. We study this problem in two variants: the Finite Departure Problem (FDP) ) and the Finite Sleep Problem (FSP). In the FDP the leaving nodes have to irrevocably decide when it is safe to leave the network, whereas in the FSP, this leaving decision does not have to be final: the nodes may resume computation if necessary. We show that there is no self-stabilizing distributed algorithm for the FDP, even in a synchronous message passing model. To allow a solution, we introduce an oracle called NIDEC and show that it is sufficient even for the asynchronous message passing model by proposing an algorithm that can solve the FDP using NIDEC. We also show that a solution to the FSP does not require an oracle."}]},{"date_updated":"2022-01-06T07:00:02Z","series_title":"LNCS","title":"Minimum Linear Arrangement of Series-Parallel Graphs","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"}],"_id":"397","page":"168--180","type":"conference","citation":{"bibtex":"@inproceedings{Scheideler_Eikel_Setzer_2014, series={LNCS}, title={Minimum Linear Arrangement of Series-Parallel Graphs}, booktitle={Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA)}, author={Scheideler, Christian and Eikel, Martina and Setzer, Alexander}, year={2014}, pages={168--180}, collection={LNCS} }","mla":"Scheideler, Christian, et al. “Minimum Linear Arrangement of Series-Parallel Graphs.” Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA), 2014, pp. 168--180.","apa":"Scheideler, C., Eikel, M., & Setzer, A. (2014). Minimum Linear Arrangement of Series-Parallel Graphs. In Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA) (pp. 168--180).","ama":"Scheideler C, Eikel M, Setzer A. Minimum Linear Arrangement of Series-Parallel Graphs. In: Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA). LNCS. ; 2014:168--180.","chicago":"Scheideler, Christian, Martina Eikel, and Alexander Setzer. “Minimum Linear Arrangement of Series-Parallel Graphs.” In Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA), 168--180. LNCS, 2014.","ieee":"C. Scheideler, M. Eikel, and A. Setzer, “Minimum Linear Arrangement of Series-Parallel Graphs,” in Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA), 2014, pp. 168--180.","short":"C. Scheideler, M. Eikel, A. Setzer, in: Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA), 2014, pp. 168--180."},"year":"2014","ddc":["040"],"user_id":"15504","abstract":[{"text":"We present a factor $14D^2$ approximation algorithm for the minimum linear arrangement problem on series-parallel graphs, where $D$ is the maximum degree in the graph. Given a suitable decomposition of the graph, our algorithm runs in time $O(|E|)$ and is very easy to implement. Its divide-and-conquer approach allows for an effective parallelization. Note that a suitable decomposition can also be computed in time $O(|E|\\log{|E|})$ (or even $O(\\log{|E|}\\log^*{|E|})$ on an EREW PRAM using $O(|E|)$ processors). For the proof of the approximation ratio, we use a sophisticated charging method that uses techniques similar to amortized analysis in advanced data structures. On general graphs, the minimum linear arrangement problem is known to be NP-hard. To the best of our knowledge, the minimum linear arrangement problem on series-parallel graphs has not been studied before.","lang":"eng"}],"date_created":"2017-10-17T12:42:09Z","status":"public","has_accepted_license":"1","publication":"Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA)","file_date_updated":"2018-03-20T06:58:44Z","author":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"full_name":"Eikel, Martina","first_name":"Martina","last_name":"Eikel"},{"full_name":"Setzer, Alexander","first_name":"Alexander","id":"11108","last_name":"Setzer"}],"file":[{"file_size":365818,"creator":"florida","file_id":"1381","date_updated":"2018-03-20T06:58:44Z","content_type":"application/pdf","success":1,"relation":"main_file","file_name":"397-WAOA14_01.pdf","date_created":"2018-03-20T06:58:44Z","access_level":"closed"}]},{"doi":"10.1109/P2P.2014.6934300","date_updated":"2022-01-06T07:00:20Z","title":"HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths","external_id":{"arxiv":["1408.0395"]},"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"79"},{"_id":"63"},{"_id":"541"}],"_id":"412","citation":{"ama":"Feldotto M, Scheideler C, Graffi K. HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. In: Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P). ; 2014:1-10. doi:10.1109/P2P.2014.6934300","apa":"Feldotto, M., Scheideler, C., & Graffi, K. (2014). HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. In Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P) (pp. 1–10). https://doi.org/10.1109/P2P.2014.6934300","chicago":"Feldotto, Matthias, Christian Scheideler, and Kalman Graffi. “HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths.” In Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P), 1–10, 2014. https://doi.org/10.1109/P2P.2014.6934300.","mla":"Feldotto, Matthias, et al. “HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths.” Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10, doi:10.1109/P2P.2014.6934300.","bibtex":"@inproceedings{Feldotto_Scheideler_Graffi_2014, title={HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths}, DOI={10.1109/P2P.2014.6934300}, booktitle={Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)}, author={Feldotto, Matthias and Scheideler, Christian and Graffi, Kalman}, year={2014}, pages={1–10} }","short":"M. Feldotto, C. Scheideler, K. Graffi, in: Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10.","ieee":"M. Feldotto, C. Scheideler, and K. Graffi, “HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths,” in Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10."},"type":"conference","year":"2014","page":"1-10","user_id":"14052","ddc":["040"],"abstract":[{"lang":"eng","text":"In this paper we present and analyze HSkip+, a self-stabilizing overlay network for nodes with arbitrary heterogeneous bandwidths. HSkip+ has the same topology as the Skip+ graph proposed by Jacob et al. [PODC 2009] but its self-stabilization mechanism significantly outperforms the self-stabilization mechanism proposed for Skip+. Also, the nodes are now ordered according to their bandwidths and not according to their identifiers. Various other solutions have already been proposed for overlay networks with heterogeneous bandwidths, but they are not self-stabilizing. In addition to HSkip+ being self-stabilizing, its performance is on par with the best previous bounds on the time and work for joining or leaving a network of peers of logarithmic diameter and degree and arbitrary bandwidths. Also, the dilation and congestion for routing messages is on par with the best previous bounds for such networks, so that HSkip+ combines the advantages of both worlds. Our theoretical investigations are backed by simulations demonstrating that HSkip+ is indeed performing much better than Skip+ and working correctly under high churn rates."}],"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:42:12Z","file":[{"access_level":"closed","date_created":"2018-03-16T11:34:00Z","file_name":"412-FSG2014P2P.pdf","content_type":"application/pdf","date_updated":"2018-03-16T11:34:00Z","success":1,"relation":"main_file","file_size":472321,"creator":"florida","file_id":"1361"}],"author":[{"full_name":"Feldotto, Matthias","orcid":"0000-0003-1348-6516","first_name":"Matthias","id":"14052","last_name":"Feldotto"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"full_name":"Graffi, Kalman","first_name":"Kalman","last_name":"Graffi"}],"file_date_updated":"2018-03-16T11:34:00Z","publication":"Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)"},{"date_updated":"2022-01-06T06:53:50Z","_id":"1868","doi":"10.1007/s00446-012-0180-x","issue":"3","page":"159--171","citation":{"chicago":"W. Richa, Andr{\\’{e}}a, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Competitive Throughput in Multi-Hop Wireless Networks despite Adaptive Jamming.” Distributed Computing, no. 3 (2013): 159--171. https://doi.org/10.1007/s00446-012-0180-x.","apa":"W. Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2013). Competitive throughput in multi-hop wireless networks despite adaptive jamming. Distributed Computing, (3), 159--171. https://doi.org/10.1007/s00446-012-0180-x","ama":"W. Richa A, Scheideler C, Schmid S, Zhang J. Competitive throughput in multi-hop wireless networks despite adaptive jamming. Distributed Computing. 2013;(3):159--171. doi:10.1007/s00446-012-0180-x","mla":"W. Richa, Andr{\\’{e}}a, et al. “Competitive Throughput in Multi-Hop Wireless Networks despite Adaptive Jamming.” Distributed Computing, no. 3, 2013, pp. 159--171, doi:10.1007/s00446-012-0180-x.","bibtex":"@article{W. Richa_Scheideler_Schmid_Zhang_2013, title={Competitive throughput in multi-hop wireless networks despite adaptive jamming}, DOI={10.1007/s00446-012-0180-x}, number={3}, journal={Distributed Computing}, author={W. Richa, Andr{\\’{e}}a and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2013}, pages={159--171} }","short":"A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, Distributed Computing (2013) 159--171.","ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive throughput in multi-hop wireless networks despite adaptive jamming,” Distributed Computing, no. 3, pp. 159--171, 2013."},"type":"journal_article","year":"2013","title":"Competitive throughput in multi-hop wireless networks despite adaptive jamming","user_id":"15504","publication":"Distributed Computing","department":[{"_id":"79"}],"author":[{"last_name":"W. Richa","first_name":"Andr{\\'{e}}a","full_name":"W. Richa, Andr{\\'{e}}a"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"},{"full_name":"Zhang, Jin","first_name":"Jin","last_name":"Zhang"}],"date_created":"2018-03-28T06:31:02Z","status":"public"},{"type":"journal_article","year":"2013","citation":{"ieee":"R. Mohd Nor, M. Nesterenko, and C. Scheideler, “Corona: A stabilizing deterministic message-passing skip list,” Theor. Comput. Sci., pp. 119--129, 2013.","short":"R. Mohd Nor, M. Nesterenko, C. Scheideler, Theor. Comput. Sci. (2013) 119--129.","mla":"Mohd Nor, Rizal, et al. “Corona: A Stabilizing Deterministic Message-Passing Skip List.” Theor. Comput. Sci., 2013, pp. 119--129, doi:10.1016/j.tcs.2012.08.029.","bibtex":"@article{Mohd Nor_Nesterenko_Scheideler_2013, title={Corona: A stabilizing deterministic message-passing skip list}, DOI={10.1016/j.tcs.2012.08.029}, journal={Theor. Comput. Sci.}, author={Mohd Nor, Rizal and Nesterenko, Mikhail and Scheideler, Christian}, year={2013}, pages={119--129} }","apa":"Mohd Nor, R., Nesterenko, M., & Scheideler, C. (2013). Corona: A stabilizing deterministic message-passing skip list. Theor. Comput. Sci., 119--129. https://doi.org/10.1016/j.tcs.2012.08.029","ama":"Mohd Nor R, Nesterenko M, Scheideler C. Corona: A stabilizing deterministic message-passing skip list. Theor Comput Sci. 2013:119--129. doi:10.1016/j.tcs.2012.08.029","chicago":"Mohd Nor, Rizal, Mikhail Nesterenko, and Christian Scheideler. “Corona: A Stabilizing Deterministic Message-Passing Skip List.” Theor. Comput. Sci., 2013, 119--129. https://doi.org/10.1016/j.tcs.2012.08.029."},"page":"119--129","date_updated":"2022-01-06T06:53:51Z","_id":"1870","doi":"10.1016/j.tcs.2012.08.029","author":[{"last_name":"Mohd Nor","full_name":"Mohd Nor, Rizal","first_name":"Rizal"},{"last_name":"Nesterenko","full_name":"Nesterenko, Mikhail","first_name":"Mikhail"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publication":"Theor. Comput. Sci.","department":[{"_id":"79"}],"status":"public","date_created":"2018-03-28T06:32:26Z","title":"Corona: A stabilizing deterministic message-passing skip list","user_id":"15504"}]