@inproceedings{1851,
author = {Derakhshandeh, Zahra and Gmyr, Robert and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik},
booktitle = {Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM' 15, Boston, MA, USA, September 21-22, 2015},
isbn = {978-1-4503-3674-1},
pages = {21:1----21:2},
publisher = {ACM},
title = {{An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems}},
doi = {10.1145/2800795.2800829},
year = {2015},
}
@inproceedings{1852,
author = {Derakhshandeh, Zahra and Gmyr, Robert and Strothmann, Thim Frederik and A. Bazzi, Rida and W. Richa, Andrea and Scheideler, Christian},
booktitle = {Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\'{a}}n, Spain, July 21 - 23, 2015},
isbn = {978-1-4503-3617-8},
pages = {67----69},
publisher = {ACM},
title = {{Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter}},
doi = {10.1145/2767386.2767451},
year = {2015},
}
@article{327,
abstract = {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 address 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)O(n)) or bits (O(nlogn)O(nlogn)) a node receives or sends coincides with the lower bound, while ensuring only a linear runtime (O(n)O(n)) on the number of rounds.},
author = {Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian},
journal = {Theoretical Computer Science},
pages = {67--79},
publisher = {Elsevier},
title = {{A deterministic worst-case message complexity optimal solution for resource discovery}},
doi = {10.1016/j.tcs.2014.11.027},
year = {2015},
}
@inproceedings{241,
abstract = {Distributed applications are commonly based on overlay networks interconnecting their sites so that they can exchange information. For these overlay networks to preserve their functionality, they should be able to recover from various problems like membership changes or faults. Various self-stabilizing overlay networks have already been proposed in recent years, which have the advantage of being able to recover from any illegal state, but none of these networks can give any guarantees on its functionality while the recovery process is going on. We initiate research on overlay networks that are not only self-stabilizing but that also ensure that searchability is maintained while the recovery process is going on, as long as there are no corrupted messages in the system. More precisely, once a search message from node u to another node v is successfully delivered, all future search messages from u to v succeed as well. We call this property monotonic searchability. We show that in general it is impossible to provide monotonic searchability if corrupted messages are present in the system, which justifies the restriction to system states without corrupted messages. Furthermore, we provide a self-stabilizing protocol for the line for which we can also show monotonic searchability. It turns out that even for the line it is non-trivial to achieve this property. Additionally, we extend our protocol to deal with node departures in terms of the Finite Departure Problem of Foreback et. al (SSS 2014). This makes our protocol even capable of handling node dynamics.},
author = {Scheideler, Christian and Setzer, Alexander and Strothmann, Thim Frederik},
booktitle = {Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS)},
title = {{Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures}},
doi = {10.4230/LIPIcs.OPODIS.2015.24},
year = {2015},
}
@inproceedings{1853,
author = {Koutsopoulos, Andreas and Scheideler, Christian and Strothmann, Thim Frederik},
booktitle = {Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015},
isbn = {978-1-4503-3588-1},
pages = {77----79},
publisher = {ACM},
title = {{Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks}},
doi = {10.1145/2755573.2755614},
year = {2015},
}
@article{284,
abstract = {In this work, we present the first scalable distributed information system, that is, a system with low storage overhead, that is provably robust against denial-of-service (DoS) attacks by a current insider. We allow a current insider to have complete knowledge about the information system and to have the power to block any ϵ-fraction of its servers by a DoS attack, where ϵ can be chosen up to a constant. The task of the system is to serve any collection of lookup requests with at most one per nonblocked server in an efficient way despite this attack. Previously, scalable solutions were only known for DoS attacks of past insiders, where a past insider only has complete knowledge about some past time point t0 of the information system. Scheideler et al. [Awerbuch and Scheideler 2007; Baumgart et al. 2009] showed that in this case, it is possible to design an information system so that any information that was inserted or last updated after t0 is safe against a DoS attack. But their constructions would not work at all for a current insider. The key idea behind our IRIS system is to make extensive use of coding. More precisely, we present two alternative distributed coding strategies with an at most logarithmic storage overhead that can handle up to a constant fraction of blocked servers.},
author = {Eikel, Martina and Scheideler, Christian},
journal = {Transactions on Parallel Computing},
number = {3},
pages = {18:1----18:33},
publisher = {ACM},
title = {{IRIS: A Robust Information System Against Insider DoS Attacks}},
doi = {10.1145/2809806},
year = {2015},
}
@inproceedings{242,
abstract = {A fundamental problem for overlay networks is to safely exclude leaving nodes, i.e., the nodes requesting to leave the overlay network are excluded from it without affecting its connectivity. There are a number of studies for safe node exclusion if the overlay is in a well-defined state, but almost no formal results are known 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 when woken up by an incoming message. We are the first to present a self-stabilizing protocol for the FDP and the FSP that can be combined with a large class of overlay maintenance protocols so that these are then guaranteed to safely exclude leaving nodes from the system from any initial state while operating as specified for the staying nodes. In order to formally define the properties these overlay maintenance protocols have to satisfy, we identify four basic primitives for manipulating edges in an overlay network that might be of independent interest.},
author = {Koutsopoulos, Andreas and Scheideler, Christian and Strothmann, Thim Frederik},
booktitle = {Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)},
pages = {201--216},
title = {{Towards a Universal Approach for the Finite Departure Problem in Overlay Networks}},
doi = {10.1007/978-3-319-21741-3_14},
year = {2015},
}
@inproceedings{1850,
author = {Derakhshandeh, Zahra and Gmyr, Robert and Strothmann, Thim Frederik and A. Bazzi, Rida and W. Richa, Andrea and Scheideler, Christian},
booktitle = {DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings},
isbn = {978-3-319-21998-1},
pages = {117----132},
title = {{Leader Election and Shape Formation with Self-organizing Programmable Matter}},
doi = {10.1007/978-3-319-21999-8_8},
volume = {9211},
year = {2015},
}
@inproceedings{1863,
author = {Derakhshandeh, Zahra and Dolev, Shlomi and Gmyr, Robert and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik},
booktitle = {26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'14, Prague, Czech Republic - June 23 - 25, 2014},
isbn = {978-1-4503-2821-0},
pages = {220----222},
publisher = {ACM},
title = {{Brief announcement: amoebot - a new model for programmable matter}},
doi = {10.1145/2612669.2612712},
year = {2014},
}
@inproceedings{371,
abstract = {In this work we present the first distributed storage system that is provably robust against crash failures issued by an adaptive adversary, i.e., for each batch of requests the adversary can decide based on the entire system state which servers will be unavailable for that batch of requests. Despite up to \gamma n^{1/\log\log n} crashed servers, with \gamma>0 constant and n denoting the number of servers, our system can correctly process any batch of lookup and write requests (with at most a polylogarithmic number of requests issued at each non-crashed server) in at most a polylogarithmic number of communication rounds, with at most polylogarithmic time and work at each server and only a logarithmic storage overhead. Our system is based on previous work by Eikel and Scheideler (SPAA 2013), who presented IRIS, a distributed information system that is provably robust against the same kind of crash failures. However, IRIS is only able to serve lookup requests. Handling both lookup and write requests has turned out to require major changes in the design of IRIS.},
author = {Scheideler, Christian and Setzer, Alexander and Eikel, Martina},
booktitle = {Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)},
pages = {107----122},
title = {{RoBuSt: A Crash-Failure-Resistant Distributed Storage System}},
doi = {10.1007/978-3-319-14472-6_8},
year = {2014},
}