Search

(MOPs), which uses loose text to document management steps and rules of thumbs, and thus can be easily misinterpreted by individual operators and often requires manual translation into scripts or configlets [...] consistent and correct state. Efficiency. Many changes need to be deployed as quickly as possible, e.g., to mitigate failures, to balance traffic, and to deploy a security patch. Thus, scheduling and executing [...] Meta and Malt at Google. All network management tasks require read and write to the network data in some form. Thus, we can abstract the network management workflows as changes to the network data and apply

training and do not take network transmission time into account. However, as the complexity of models and datasets rapidly improves, network transmission has become a crucial factor in DNN training and cannot [...] data, how can we group jobs and place partitions to minimize JCT degradation and maximize GPU resource utilization? To answer this question, we first propose two theorems and provide the corresponding proofs [...] Training Investigators: Yiting Xia, Jialong Li, and Yiming Lei, in cooperation with Rui Pan (Princeton University), Zhiqiang Xie (Stanford University), and Binhang Yuan (ETH Zürich) Recent years have witnessed

(b) we prove the optimality and robustness of the HOHO algorithm, and sketch its implementation on programmable switches, including the time synchronization, routing lookup, and packet buffering mechanisms; [...] runtime system for the offline HOHO algorithm on ToRs and hosts, using P4 on Intel Tofino2 switches and VMA on Mellanox NICs. We bear the aforementioned challenges in mind and embrace a systematic design by [...] latency-sensitive flows and summarize our contributions as follows [1]: (a) we present a Hop-On Hop-Off (HOHO) routing algorithm that provides the fastest paths—packets can “hop on” and “hop off” at intermediate

flow of information, services, and data across the digital landscape. From the cables and hardware that form the physical infrastructure to the software and protocols that govern communication, digital in [...] the conduit for innovation, economic growth, and societal advancement. Understanding and nurturing this infrastructure is essential for ensuring a prosperous and interconnected future. Analyzing the Cloudification [...] Lichtblau, C. H. Gañán, A. Feldmann, O. Gasser, and T. Fiebig. How ready is DNS for an IPv6-only world? In A. Brunstrom, M. Flores, and M. Fiore, eds., Passive and Active Measurement (PAM 2023), Virtual Event

CDN. We analyzed scan sources, and studied targeted services and addresses. We find that, unlike IPv4 scans, large-scale IPv6 scans are still comparably rare events, and we find them originating only from [...] dataset, and we discussed potential reasons for our observations. In this project [1], we developed methods to identify IPv6 scans, assessed current and past levels of IPv6 scanning activity, and studied [...] “snmpEngineID is the unique and unambiguous identifier of an SNMP engine. Since there is a one-to-one association between SNMP engines and SNMP entities, it also uniquely and unambiguously identifies the

DDoS attacks are still on the rise and at an all time high. To date, attackers incorporate more sophisticated techniques and exploit by far more different mechanisms and protocols to form DDoS attacks at [...] IXPs to get a more informed view on the attacks and improve the local attack detection. We unify the data of 11 IXPs across Europe and North America and identify 120k amplification DDoS attack events throughout [...] Hohlfeld, G. Smaragdakis, and A. Feldmann. United we stand: Collaborative detection and mitigation of amplification DDoS attacks at scale. In Y. Kim, J. Kim, G. Vigna, E. Shi, H. Kim, and J. B. Hong, eds., CCS

Research Departments Algorithms and Complexity Teaching Winter 2023/24 Teaching - Winter 2023/24 Algorithms and Data Structures Core Course (4+2). Lecturers: Karl Bringmann and Philip Wellnitz more Sublinear [...] Mehlhorn und Corinna Coupette more Algorithms and Data Structures Sublinear Algorithms Ideen und Konzepte der Informatik [...] Sublinear Algorithms Advanced Course (2+1). Lecturers: Karl Bringmann and Nithin Varma more Ideen und Konzepte der Informatik Veranstaltung für Studierende anderer Fakultäten (2+2). Dozenten: Kurt Mehlhorn

Research Departments Automation of Logic Teaching Summer 2023 Algorithmic Quantifier Elimination Algorithmic Quantifier Elimination Overview Lecturer Thomas Sturm Start Tuesday, April 11, 2023, 8: 30 a [...] (Excercises) Wednesdays 8: 30– 10 s.t. Place Room 630, building E1 5(6 th floor) for both lecture and excercises Prerequisites Basic knowledge in computer science, in particular in first-order logic Quantifier [...] Nutshell Consider the formula ∀x ∃y (x² + xy + b > 0 ∧ x + ay² + b ≤ 0). A quantifier elimination algorithm for the real numbers can compute an equivalent formula without any quantifiers, which in this example

guarantees on their predictive power and complexity measures, typically sample complexity. We do not cover more recent advances in the theoretical understanding of neural nets and deep learning. Other related [...] Adam Polak Introduction and PAC Learning Chapters 1 and 2 (mostly 2) E1 4, 024 April 19 Adam Polak, Hans Simon PAC Learning for Finite and Infinite Hypothesis Classes Chapters 2 and 3 E1 4, 024 April 26 Hans [...] Research Departments Algorithms and Complexity Teaching Summer 2023 Seminar: Foundations of Machine Learning Foundations of Machine Learning Seminar Basic Information Lectures: Wednesday, 16:00 to 18:00

into how data networks work, and how they work together to create the network of networks we know as the Internet. After going on this journey from the history of networks and protocols to newest developments [...] every layer of the stack – from the physical wire to the applications – like the Web and Email – everyone knows and uses. After successful completion of this course, you will be able to: Describe the relevant [...] Network, Transport, and Application) to a given case, e.g., use a routing protocol to determine how packets would traverse a given network. Analyze multiple protocols for a given use-case and evaluate which