This course covers advanced topics and technologies in computer networks, both theoretically and practically. In the Fall 2021, the course will cover advanced topics in Internet routing and forwarding. The goal for this course is to provide students with a deeper understanding of 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.
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 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.
Prof. Laurent Vanbever, Prof. Ankit Singla