@inproceedings{623,
abstract = {This paper initiates the formal study of a fundamental problem: How to efficiently allocate a shared communication medium among a set of K co-existing networks in the presence of arbitrary external interference? While most literature on medium access focuses on how to share a medium among nodes, these approaches are often either not directly applicable to co-existing networks as they would violate the independence requirement, or they yield a low throughput if applied to multiple networks. We present the randomized medium access (MAC) protocol COMAC which guarantees that a given communication channel is shared fairly among competing and independent networks, and that the available bandwidth is used efficiently. These performance guarantees hold in the presence of arbitrary external interference or even under adversarial jamming. Concretely, we show that the co-existing networks can use a Ω(ε2 min{ε, 1/poly(K)})-fraction of the non-jammed time steps for successful message transmissions, where ε is the (arbitrarily distributed) fraction of time which is not jammed.},
author = {Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin },
booktitle = {Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)},
pages = {291--300},
title = {{Competitive and fair throughput for co-existing networks under adversarial interference}},
doi = {10.1145/2332432.2332488},
year = {2012},
}
@inproceedings{1899,
author = {Kniesburges, Sebastian and Scheideler, Christian},
booktitle = {WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings},
isbn = {978-3-642-19093-3},
pages = {170----181},
publisher = {Springer},
title = {{Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems}},
doi = {10.1007/978-3-642-19094-0_18},
volume = {6552},
year = {2011},
}
@inproceedings{662,
abstract = {We present Corona, a deterministic self-stabilizing algorithm for skip list construction in structured overlay networks. Corona operates in the low-atomicity message-passing asynchronous system model. Corona requires constant process memory space for its operation and, therefore, scales well. We prove the general necessary conditions limiting the initial states from which a self-stabilizing structured overlay network in message-passing system can be constructed. The conditions require that initial state information has to form a weakly connected graph and it should only contain identiers that are present in the system. We formally describe Corona and rigorously prove that it stabilizes from an arbitrary initial state subject to the necessary conditions. We extend Corona to construct a skip graph.},
author = {Nesterenko, Mikhail and Mohd, Rizal and Scheideler, Christian},
booktitle = {Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)},
pages = {356----370},
title = {{Corona: A Stabilizing Deterministic Message-Passing Skip List}},
doi = {10.1007/978-3-642-24550-3_27},
year = {2011},
}
@inproceedings{1895,
author = {Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian},
booktitle = {SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011)},
isbn = {978-1-4503-0743-7},
pages = {235----244},
title = {{Re-Chord: a self-stabilizing chord overlay network}},
doi = {10.1145/1989493.1989527},
year = {2011},
}
@inproceedings{1891,
author = {W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin},
booktitle = {2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011},
isbn = {978-0-7695-4364-2},
pages = {507----516},
publisher = {IEEE Computer Society},
title = {{Competitive and Fair Medium Access Despite Reactive Jamming}},
doi = {10.1109/ICDCS.2011.8},
year = {2011},
}
@inproceedings{645,
abstract = {In the standard consensus problem there are n processes with possibly di®erent input values and the goal is to eventually reach a point at which all processes commit to exactly one of these values. We are studying a slight variant of the consensus problem called the stabilizing consensus problem [2]. In this problem, we do not require that each process commits to a ¯nal value at some point, but that eventually they arrive at a common, stable value without necessarily being aware of that. This should work irrespective of the states in which the processes are starting. Our main result is a simple randomized algorithm called median rule that, with high probability, just needs O(logmlog log n + log n) time and work per process to arrive at an almost stable consensus for any set of m legal values as long as an adversary can corrupt the states of at most p n processes at any time. Without adversarial involvement, just O(log n) time and work is needed for a stable consensus, with high probability. As a by-product, we obtain a simple distributed algorithm for approximating the median of n numbers in time O(logmlog log n + log n) under adversarial presence.},
author = {Doerr, Benjamin and Goldberg, Leslie Ann and Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian},
booktitle = {Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
pages = {149--158},
title = {{Stabilizing consensus with the power of two choices}},
doi = {10.1145/1989493.1989516},
year = {2011},
}
@inproceedings{1892,
author = {W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin},
booktitle = {Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011},
isbn = {978-1-4503-0868-7},
pages = {33----36},
publisher = {ACM},
title = {{Towards jamming-resistant and competitive medium access in the SINR model}},
doi = {10.1145/2030686.2030697},
year = {2011},
}
@inbook{1900,
author = {Scheideler, Christian and Graffi, Kalman},
booktitle = {Computer Science, The Hardware, Software and Heart of It},
isbn = {978-1-4614-1167-3},
pages = {155----168},
publisher = {Springer},
title = {{Programming for Distributed Computing: From Physical to Logical Networks}},
doi = {10.1007/978-1-4614-1168-0_9},
year = {2011},
}
@inproceedings{1924,
author = {Kolman, Petr and Scheideler, Christian},
booktitle = {28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany},
pages = {129----140},
title = {{Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing}},
doi = {10.4230/LIPIcs.STACS.2011.129},
year = {2011},
}
@inproceedings{646,
abstract = {This paper presents a dynamic overlay network based on the De Bruijn graph which we call Linearized De Bruijn (LDB) network. The LDB network has the advantage that it has a guaranteed constant node degree and that the routing between any two nodes takes at most O(log n) hops with high probability. Also, we show that there is a simple local-control algorithm that can recover the LDB network from any network topology that is weakly connected.},
author = {Richa, Andrea W. and Scheideler, Christian},
booktitle = {Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)},
pages = {416--430},
title = {{Self-Stabilizing DeBruijn Networks}},
doi = {10.1007/978-3-642-24550-3_31},
year = {2011},
}
@inproceedings{1893,
author = {W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin},
booktitle = {Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011},
isbn = {978-1-4503-0722-2},
pages = {15},
publisher = {ACM},
title = {{Self-stabilizing leader election for single-hop wireless networks despite jamming}},
doi = {10.1145/2107502.2107522},
year = {2011},
}
@inbook{1901,
author = {Scheideler, Christian},
booktitle = {Algorithms Unplugged},
isbn = {978-3-642-15327-3},
pages = {223----229},
publisher = {Springer},
title = {{Broadcasting - How Can I Quickly Disseminate Information?}},
doi = {10.1007/978-3-642-15328-0_22},
year = {2011},
}
@inproceedings{1907,
author = {Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin},
booktitle = {Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings},
isbn = {978-3-642-15762-2},
pages = {179----193},
publisher = {Springer},
title = {{A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks}},
doi = {10.1007/978-3-642-15763-9_17},
volume = {6343},
year = {2010},
}
@article{1903,
author = {Meyer auf der Heide, Friedhelm and Scheideler, Christian},
journal = {Informatik Spektrum},
number = {5},
pages = {468----474},
title = {{Algorithmische Grundlagen verteilter Speichersysteme}},
doi = {10.1007/s00287-010-0470-2},
year = {2010},
}
@inproceedings{1908,
author = {Doerr, Benjamin and Ann Goldberg, Leslie and Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian},
booktitle = {Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings},
pages = {528----530},
publisher = {Springer},
title = {{Brief Announcement: Stabilizing Consensus with the Power of Two Choices}},
doi = {10.1007/978-3-642-15763-9_50},
volume = {6343},
year = {2010},
}
@article{1904,
author = {Gavoille, Cyril and Patt-Shamir, Boaz and Scheideler, Christian},
journal = {Theory of Computing Systems},
number = {4},
pages = {809----810},
title = {{Foreword}},
doi = {10.1007/s00224-010-9284-5},
year = {2010},
}
@inproceedings{1905,
author = {Gall, Dominik and Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo},
booktitle = {LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings},
isbn = {978-3-642-12199-9},
pages = {294----305},
publisher = {Springer},
title = {{Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization}},
doi = {10.1007/978-3-642-12200-2_27},
volume = {6034},
year = {2010},
}
@inproceedings{1906,
author = {Richa, Andrea W. and Zhang, Jin and Scheideler, Christian and Schmid, Stefan},
booktitle = {Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010},
isbn = {978-1-60558-888-9},
pages = {114----115},
publisher = {ACM},
title = {{Brief announcement: towards robust medium access in multi-hop networks}},
doi = {10.1145/1835698.1835726},
year = {2010},
}
@inproceedings{1933,
author = {Baumgart, Matthias and Scheideler, Christian and Schmid, Stefan},
booktitle = {SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009},
isbn = {978-1-60558-606-9},
pages = {300----309},
title = {{A DoS-resilient information system for dynamic data management}},
doi = {10.1145/1583991.1584064},
year = {2009},
}
@article{1927,
author = {Awerbuch, Baruch and Scheideler, Christian},
journal = {Theory Comput. Syst.},
number = {2},
pages = {234----260},
title = {{Towards a Scalable and Robust DHT}},
doi = {10.1007/s00224-008-9099-9},
year = {2009},
}