direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Distributed Systems

Almost every computing system nowadays is distributed, ranging from multi-core laptops to Internet-scale services; understanding the principles of distributed computing is hence important for the design and engineering of modern computing systems.  Fundamental issues that arise in reliable and efficient distributed systems include developing adequate methods for modeling failures and synchrony assumptions, determining precise performance bounds on implementations of concurrent data structures, capturing the trade-off between consistency and efficiency, and demarcating the frontier of feasibility in distributed computing.

For example, popular Internet services and applications such as CNN.com, YouTube, Facebook, Skype, BitTorrent attract millions of users every day, and only by the effective load-balancing and collaboration of many thousand machines, an acceptable Quality-of-Service/Quality-of-Experience can be guaranteed. While distributed systems promise a good scalability as well as a high robustness, they pose challenging research problems, such as: How to design robust and scalable distributed architectures and services? How to coordinate access to a shared resource, e.g., by electing a leader? Or how to provide incentives for cooperation in an open, collaborative distributed system?

Selected Publications

2010

Gafni, Eli and Kuznetsov, Petr (2010). Turning Adversaries into Friends: Simplified, Made Constructive, and Extended. Proceedings of 14th International Conference On Principles Of Distributed Systems (OPODIS '10). Springer, 380–394.


Richa, Andréa and Scheideler, Christian and Schmid, Stefan and Zhang, Jin (2010). A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks. 24th International Symposium on Distributed Computing (DISC). Springer, 179–193.


Richa, Andréa and Scheideler, Christian and Schmid, Stefan and Zhang, Jin (2010). A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks.


Bienkowski, Marcin and Schmid, Stefan (2010). Online Function Tracking with Generalized Penalties. Proceedings of 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2010). Springer, 359–370.


Kuhn, Fabian and Schmid, Stefan and Wattenhofer, Roger (2010). Towards Worst-Case Churn Resistant Peer-to-Peer Systems. Distributed Computing Journal (DC). Springer, 249–267.


Gall, Dominik and Jacob, Riko and Richa, Andréa and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo (2010). Time Complexity of Distributed Topological Self-Stabilization: The Case of Graph Linearization. Proceedings of 9th Latin American Theoretical Informatics Symposium (LATIN '10). Springer, 294–305.


Pignolet, Yvonne Anne and Schmid, Stefan and Wattenhofer, Roger (2010). Tight Bounds for Delay-Sensitive Aggregation. Discrete Mathematics and Theoretical Computer Science Journal, 39–58.


Kuznetsov, Petr and Schmid, Stefan (2010). Towards Network Games with Social Preferences.


2009

Haeberlen, Andreas and Kuznetsov, Petr (2009). The Fault Detection Problem. Principles of Distributed Systems – Proceedings of the 13th International Conference On Principle Of Distributed Systems (OPODIS '09). Springer, 99–114.


Gafni, Eli and Kuznetsov, Petr (2009). On Set Consensus Numbers. Distributed Computing (Proceedings of the 23rd International Symposium on Distributed Computing (DISC 2009)). Springer, 35–47.


Jacob, Riko and Richa, Andréa and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo (2009). A Polylogarithmic Time Algorithm for Distributed Self-Stabilizing Skip Graphs. 28th ACM Symposium on Principles of Distributed Computing (PODC), 131–140.


Baumgart, Matthias and Scheideler, Christian and Schmid, Stefan (2009). A DoS-Resilient Information System for Dynamic Data Management. 21st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 300–309.


Guerraoui, Rachid and Herlihy, Maurice and Kuznetsov, Petr and Lynch, Nancy and Newport, Calvin (2009). On the Weakest Failure Detector Ever. Distributed Computing Journal (DC). Springer, 353–366.


Gafni, Eli and Kuznetsov, Petr (2009). The Weakest Failure Detector for Solving k-Set Agreement. 28th ACM SIGACT/SIGOPS Symposium on Principles of Distributed Computing (PODC 2009). ACM, 83–91.


Scheideler, Christian and Schmid, Stefan (2009). A Distributed and Oblivious Heap. 36th International Colloquium on Automata, Languages and Programming (ICALP). Springer, 571–582.


Attiya, Hagit and Guerraoui, Rachid and Hendler, Danny and Kuznetsov, Petr (2009). The Complexity of Obstruction-Free Implementations. Journal of the ACM, 1–33.


Moscibroda, Thomas and Schmid, Stefan (2009). On Mechanism Design Without Payments for Throughput Maximization. 28th IEEE Conference on Computer Communications (INFOCOM), 972–980.


Singh, Atul and Fonseca, Pedro and Kuznetsov, Petr and Rodrigues, Rodrigo and Maniatis, Petros (2009). Zeno: Eventually Consistent Byzantine-Fault Tolerance. 6th USENIX Symposium on Networked Systems Design and Implementation (NSDI '09). USENIX Association, 169–184.


2008

Fabian Kuhn and Thomas Locher and Schmid, Stefan (2008). Distributed Computation of the Mode. 27th ACM Symposium on Principles of Distributed Computing (PODC), 15–24.


Meier, Dominic and Oswald, Yvonne Anne and Schmid, Stefan and Wattenhofer, Roger (2008). On the Windfall of Friendship: Inoculation Strategies on Social Networks. 9th ACM Conference on Electronic Commerce (EC), 294–301.


2007

Eidenbenz, Raphael and Oswald, Yvonne Anne and Schmid, Stefan and Wattenhofer, Roger (2007). Manipulation in Games. 18th International Symposium on Algorithms and Computation (ISAAC). Springer, 365–376.


Haeberlen, Andreas and Kouznetsov, Petr and Druschel, Peter (2007). PeerReview: Practical Accountability for Distributed Systems. 21st ACM Symposium on Operating Systems Principles (SOSP 2007), 175–188.


Locher, Thomas and Schmid, Stefan and Wattenhofer, Roger (2007). Rescuing Tit-for-Tat with Source Coding. 7th IEEE International Conference on Peer-to-Peer Computing (P2P), 3–10.


Locher, Thomas and Meier, Remo and Schmid, Stefan and Wattenhofer, Roger (2007). Push-to-Pull Peer-to-Peer Live Streaming. 21st International Symposium on Distributed Computing (DISC). Springer, 388–402.


2006

Locher, Thomas and Moor, Patrick and Schmid, Stefan and Wattenhofer, Roger (2006). Free Riding in BitTorrent is Cheap. 5th Workshop on Hot Topics in Networks (HotNets), 85–90.


Grolimund, Dominik and Meisser, Luzius and Schmid, Stefan and Wattenhofer, Roger (2006). Cryptree: A Folder Tree Structure for Cryptographic File Systems. 25th IEEE Symposium on Reliable Distributed Systems (SRDS), 189–198.


Locher, Thomas and Schmid, Stefan and Wattenhofer, Roger (2006). eQuus: A Provably Robust and Locality-Aware Peer-to-Peer System. 6th IEEE International Conference on Peer-to-Peer Computing (P2P), 3–11.


Moscibroda, Thomas and Schmid, Stefan and Wattenhofer, Roger (2006). On the Topologies Formed by Selfish Peers. 25th Annual Symposium on Principles of Distributed Computing (PODC), 133–142.


Moscibroda, Thomas and Schmid, Stefan and Wattenhofer, Roger (2006). When Selfish Meets Evil: Byzantine Players in a Virus Inoculation Game. 25th Annual Symposium on Principles of Distributed Computing (PODC), 35–44.


2005

von Rickenbach, Pascal and Schmid, Stefan and Wattenhofer, Roger and Zollinger, Aaron (2005). A Robust Interference Model for Wireless Ad-Hoc Networks. 5th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN), 1–8.


Kuhn, Fabian and Schmid, Stefan and Wattenhofer, Roger (2005). A Self-Repairing Peer-to-Peer System Resilient to Dynamic Adversarial Churn. 4th International Workshop on Peer-To-Peer Systems (IPTPS). Springer, 13–23.


2004

Delporte-Gallet, Carole and Fauconnier, Hugues and Hadzilacos, Vassos and Guerraoui, Rachid and Kouznetsov, Petr and Toueg, Sam (2004). The Weakest Failure Detectors to Solve Certain Fundamental Problems in Distributed Computing. Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC '04). ACM, 338–346.


Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Auxiliary Functions