Arpit Gupta will present his Pre FPO on Thursday, July 12, 2018 at 10am in CS402. The members of his committee are as follows: Nick Feamster (advisor), Jennifer Rexford (reader), Walter Willinger (reader), Kyle Jamieson (non-reader), Marshini Chetty (non-reader). His abstract follows below. All are welcome to attend. Abstract: The proliferation of Internet-connected devices, services, and applications makes it more critical than ever to make sure that the network they depend on is reliable, performant, and secure. At the same time, their increasing complexity and diversity have made even simple network management tasks, such as debugging performance or detecting attacks, more complicated than ever. Modern network management needs to provide operators with better ways to (1) monitor what is going on in their networks; (2) take real-time preventive or corrective actions based on this information, to improve reliability, performance, and security of the networks and the services that run on them. Achieving these goals given the limited compute and storage resources available on modern network devices is challenging. This talk describes two projects that address the challenges of better information gathering, and more flexible control, respectively. First, I will present SDX, a Software-Defined Internet Exchange Point that allows an operator to apply fine-grained control over specific network paths in a way that interacts harmoniously with the Internet’s routing protocols. Second, I will present Sonata, a streaming network telemetry system that gathers information based directly on the queries that operators write; Sonata exploits the programmability of the network switches to offload expensive operations inline, whenever possible, ensuring that queries can run online, in real-time. In both cases, I will describe: (1) the abstractions that allow operators to express flexible programs for monitoring and control; (2) the algorithms and data structures that make the best use of limited compute and storage resources; and (3) the systems that glue the high-level abstractions to the low-level algorithms.