Laurent Vanbever: Catalogue data in Autumn Semester 2024 |  |
| 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. Vanbever, L. Josipovic, B. Keller, R. Wattenhofer | |||||||||||||||||||||||||||||||||||
| Abstract | Introduction to discrete event systems. We start out by studying popular models of discrete event systems. Then we analyze discrete event systems from an average-case and from a worst-case perspective, and study verification. Topics include: Automata and Languages, Specification Models, Stochastic Discrete Event Systems, Worst-Case Event Systems, Verification, Petri Nets. | ||||||||||||||||||||||||||||||||||||||
| 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 exploring the limits of what is computable and what is not. In doing so, we will consider three distinct models of computation which are often used to model discrete event systems: finite automata, push-down automata and Turing machines (ranked in terms of expressiveness power). 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 continuous time markov chains and queueing theory for an understanding of the typical behavior of a system. Then we analyze discrete event systems from a worst-case perspective using the theory of online algorithms and adversarial queueing. In the last part of the course we introduce methods that allow to formally verify certain properties of Finite Automata and Petri Nets. These are some typical analysis questions we will look at: Do two given systems behave the same? Does a given system behave as intended? Does the system eventually enter a dangerous state? | ||||||||||||||||||||||||||||||||||||||
| Content | 1. Regular Languages 2. Non-Regular Languages 3. Markov Chains 4. Stochastic Discrete Event Systems 5. Worst-Case Event Systems 6. Verification of Finite Automata 7. Petri Nets | ||||||||||||||||||||||||||||||||||||||
| Lecture notes | Available at https://disco.ethz.ch/courses/des/ | ||||||||||||||||||||||||||||||||||||||
| 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 [burch] Symbolic Model Checking J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang Inf. Comput. 98, 2 (June 1992), pp. 142-170 [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 [murata] Petri Nets: Properties, Analysis and Applications Tadao Murata Proceedings of the IEEE, vol. 99, issue 4, April 1989. pp. 541-580 [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 | ||||||||||||||||||||||||||||||||||||||
| Competencies |
| ||||||||||||||||||||||||||||||||||||||
| 227-0575-00L | Advanced Topics in Communication Networks | 6 credits | 2V + 2U | L. Vanbever | |||||||||||||||||||||||||||||||||||
| Abstract | This course covers advanced topics and technologies in computer networks, both theoretically and practically. It is offered each Fall. Repetition for credit is possible with the consent of the instructor. | ||||||||||||||||||||||||||||||||||||||
| Learning objective | The goals of this course is to provide students with a deeper understanding of the existing and upcoming Internet 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. | ||||||||||||||||||||||||||||||||||||||
| Content | In 2023, the course will cover advanced topics in communication networks such as: - Advanced Internet routing (convergence, optimality, scalability, flexibility); - Network programmability (OpenFlow, P4); - Traffic engineering / Load Balancing; - Network verification and synthesis; - Network measurements; - Network security; - Upcoming transport protocols and technologies; - Adaptive video streaming; and - Network sustainability. The course will be composed of lectures and practical exercises (some of which including labs). | ||||||||||||||||||||||||||||||||||||||
| 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 / programming skills (in any language) are expected (some of the exercises will involve coding). | ||||||||||||||||||||||||||||||||||||||
| Competencies |
| ||||||||||||||||||||||||||||||||||||||