Laurent Vanbever: Catalogue data in Autumn Semester 2022 |  |
| Name | Prof. Dr. Laurent Vanbever |
| Field | Networked Systems |
| Address | Inst. f. Techn. Informatik u. K. ETH Zürich, ETZ G 90 Gloriastrasse 35 8092 Zürich SWITZERLAND |
| Telephone | +41 44 632 70 04 |
| lvanbever@ethz.ch | |
| URL | https://nsg.ee.ethz.ch |
| Department | Information Technology and Electrical Engineering |
| Relationship | Associate Professor |
| Number | Title | ECTS | Hours | Lecturers | |||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 227-0102-00L | Discrete Event Systems  | 6 credits | 4G | L. Josipovic, L. Vanbever, R. Wattenhofer | |||||||||||||||||||||||||||||||||||
| Abstract | Introduction to discrete event systems. We start out by studying popular models of discrete event systems. In the second part of the course we analyze discrete event systems from an average-case and from a worst-case perspective. Topics include: Automata and Languages, Specification Models, Stochastic Discrete Event Systems, Worst-Case Event Systems, Verification, Network Calculus. | ||||||||||||||||||||||||||||||||||||||
| Learning objective | Over the past few decades the rapid evolution of computing, communication, and information technologies has brought about the proliferation of new dynamic systems. A significant part of activity in these systems is governed by operational rules designed by humans. The dynamics of these systems are characterized by asynchronous occurrences of discrete events, some controlled (e.g. hitting a keyboard key, sending a message), some not (e.g. spontaneous failure, packet loss). The mathematical arsenal centered around differential equations that has been employed in systems engineering to model and study processes governed by the laws of nature is often inadequate or inappropriate for discrete event systems. The challenge is to develop new modeling frameworks, analysis techniques, design tools, testing methods, and optimization processes for this new generation of systems. In this lecture we give an introduction to discrete event systems. We start out the course by studying popular models of discrete event systems, such as automata and Petri nets. In the second part of the course we analyze discrete event systems. We first examine discrete event systems from an average-case perspective: we model discrete events as stochastic processes, and then apply Markov chains and queuing theory for an understanding of the typical behavior of a system. In the last part of the course we analyze discrete event systems from a worst-case perspective using the theory of online algorithms and adversarial queuing. | ||||||||||||||||||||||||||||||||||||||
| Content | 1. Introduction 2. Automata and Languages 3. Smarter Automata 4. Specification Models 5. Stochastic Discrete Event Systems 6. Worst-Case Event Systems 7. Network Calculus | ||||||||||||||||||||||||||||||||||||||
| Lecture notes | Available | ||||||||||||||||||||||||||||||||||||||
| Literature | [bertsekas] Data Networks Dimitri Bersekas, Robert Gallager Prentice Hall, 1991, ISBN: 0132009161 [borodin] Online Computation and Competitive Analysis Allan Borodin, Ran El-Yaniv. Cambridge University Press, 1998 [boudec] Network Calculus J.-Y. Le Boudec, P. Thiran Springer, 2001 [cassandras] Introduction to Discrete Event Systems Christos Cassandras, Stéphane Lafortune. Kluwer Academic Publishers, 1999, ISBN 0-7923-8609-4 [fiat] Online Algorithms: The State of the Art A. Fiat and G. Woeginger [hochbaum] Approximation Algorithms for NP-hard Problems (Chapter 13 by S. Irani, A. Karlin) D. Hochbaum [schickinger] Diskrete Strukturen (Band 2: Wahrscheinlichkeitstheorie und Statistik) T. Schickinger, A. Steger Springer, Berlin, 2001 [sipser] Introduction to the Theory of Computation Michael Sipser. PWS Publishing Company, 1996, ISBN 053494728X | ||||||||||||||||||||||||||||||||||||||
| 227-0575-00L | Advanced Topics in Communication Networks | 6 credits | 2V + 2U | L. Vanbever, R. Jacob | |||||||||||||||||||||||||||||||||||
| Abstract | This course covers advanced topics and technologies in computer networks, both theoretically and practically. It is offered each Fall semester, with rotating topics. Repetition for credit is possible with consent of the instructor. In the next edition, the course will cover advanced topics in Internet routing and forwarding. | ||||||||||||||||||||||||||||||||||||||
| Learning objective | The goals of this course is to provide students with a deeper understanding of the existing and upcoming Internet routing and forwarding technologies used in large-scale computer networks such as Internet Service Providers (e.g., Swisscom or Deutsche Telekom), Content Delivery Networks (e.g., Netflix) and Data Centers (e.g., Google). Besides covering the fundamentals, the course will be “hands-on” and will enable students to play with the technologies in realistic network environments, and even implement some of them on their own during labs and a final group project. | ||||||||||||||||||||||||||||||||||||||
| Content | The course will cover advanced topics in Internet routing and forwarding such as: - Tunneling - Hierarchical routing - Traffic Engineering and Load Balancing - Virtual Private Networks - Quality of Service/Queuing/Scheduling - Fast Convergence - Network virtualization - Network programmability (OpenFlow, P4) - Network measurements The course will be divided in two main blocks. The first block (~8 weeks) will interleave classical lectures with practical exercises and labs. The second block (~6 weeks) will consist of a practical project which will be performed in small groups (~3 students). During the second block, lecture slots will be replaced by feedback sessions where students will be able to ask questions and get feedback about their project. The last week of the semester will be dedicated to student presentations and demonstrations. | ||||||||||||||||||||||||||||||||||||||
| Lecture notes | Lecture notes and material will be made available before each course on the course website. | ||||||||||||||||||||||||||||||||||||||
| Literature | Relevant references will be made available through the course website. | ||||||||||||||||||||||||||||||||||||||
| Prerequisites / Notice | Prerequisites: Communication Networks (227-0120-00L) or equivalents / good programming skills (in any language) are expected as both the exercices and the final project will involve coding. | ||||||||||||||||||||||||||||||||||||||
| Competencies |
| ||||||||||||||||||||||||||||||||||||||