Search result: Catalogue data in Autumn Semester 2018
Electrical Engineering and Information Technology Master  | ||||||
 Master Studies (Programme Regulations 2018) | ||||||
| Computers and Networks The core courses and specialization courses below are a selection for students who wish to specialize in the area of "Computers and Networks", see https://www.ee.ethz.ch/studies/main-master/areas-of-specialisation.html. The individual study plan is subject to the tutor's approval. | ||||||
| Core Courses These core courses are particularly recommended for the field of "Computers and Networks". You may choose core courses form other fields in agreement with your tutor. A minimum of 24 credits must be obtained from core courses during the MSc EEIT. | ||||||
| Foundation Core Courses | ||||||
| Number | Title | Type | ECTS | Hours | Lecturers | |
|---|---|---|---|---|---|---|
| 227-0102-00L | Discrete Event Systems | W | 6 credits | 4G | L. Thiele, 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-0121-00L | Communication Systems | W | 6 credits | 4G | A. Wittneben | |
| Abstract | Information Theory, Signal Space Analysis, Baseband Transmission, Passband Transmission, Example und Channel, Data Link Layer, MAC, Example Layer 2, Layer 3, Internet | |||||
| Learning objective | Introduction into the fundamentals of digital communication systems. Selected examples on the application of the fundamental principles in existing and upcoming communication systems | |||||
| Content | Covered are the lower three layer of the OSI reference model: the physical, the data link, and the network layer. The basic terms of information theory are introduced. After this, we focus on the methods for the point to point communication, which may be addressed elegantly and coherently in the signal space. Methods for error detection and correction as well as protocols for the retransmission of perturbed data will be covered. Also the medium access for systems with shared medium will be discussed. Finally, algorithms for routing and flow control will be treated. The application of the basic methods will be extensively explained using existing and future wireless and wired systems. | |||||
| Lecture notes | Lecture Slides | |||||
| Literature | [1] Simon Haykin, Communication Systems, 4. Auflage, John Wiley & Sons, 2001 [2] Andrew S. Tanenbaum, Computernetzwerke, 3. Auflage, Pearson Studium, 2003 [3] M. Bossert und M. Breitbach, Digitale Netze, 1. Auflage, Teubner, 1999 | |||||
Page
1
of
1
