SUNMONTUEWEDTHUFRISAT
Conferences, Lectures, & Seminars
Events for December
-
Vern Paxson: Reflections on Measurement Research: Crooked Lines, Straight Lines, and Moneyshots
Tue, Dec 04, 2012 @ 03:30 PM - 05:00 PM
Thomas Lord Department of Computer Science
Conferences, Lectures, & Seminars
Speaker: Vern Paxson, University of California, Berkeley
Talk Title: Reflections on Measurement Research: Crooked Lines, Straight Lines, and Moneyshots
Series: CS Distinguished Lectures
Abstract: In this talk I'll attempt to capture what it is about Internet measurement research that I find stirring and fundamentally compelling, such that I've now spent 20 years pursuing it in various forms. The essence regards the singular moment of discovery. At its best, this process proves uplifting - the concrete appearance of a significant, unintuitive result. But it can instead sometimes simply have its own pleasing aesthetics; or even prove sobering, when empiricism decisively buries a hoped-for result. I will illustrate each of these three types, and try while doing so to illuminate some of the human energy that drives measurement-based research.
Biography: Vern Paxson is a Professor in Electrical Engineering and Computer Sciences at the University of California, Berkeley, USA, and also has affiliations with the International Computer Science Institute and the Lawrence Berkeley National Laboratory. His research focuses on network measurement and analysis, high-performance monitoring of Internet traffic to detect malicious activity, and addressing the threat of botnets and the underground economy that they fuel. He is an ACM Fellow, and recipient of the 2008 ACM Grace Murray Hopper Award and the 2011 ACM SIGCOMM Award for his work on Internet measurement.
Host: Minlan Yu
Location: SSL 150
Audiences: Everyone Is Invited
Contact: Assistant to CS chair
-
Nate Foster (Cornell): Language Abstractions for Software-Defined Networks
Wed, Dec 05, 2012 @ 03:30 PM - 05:00 PM
Thomas Lord Department of Computer Science
Conferences, Lectures, & Seminars
Speaker: Nate Foster , Cornell
Talk Title: Language Abstractions for Software-Defined Networks
Series: CS Colloquium
Abstract: Modern networks provide a variety of services including routing, traffic monitoring, load balancing, and access control. Unfortunately, the languages used to program today's networks lack modern features -- they are typically defined in terms of hardware-level constructs and lack even rudimentary support for modular programming. As a result, network programs are complicated, hard to reason about, and difficult to maintain.
Frenetic is a new language designed to make it easy to program distributed collections of network routers and switches. It provides a rich collection of declarative constructs that raise the level of abstraction for programmers, allowing them to describe what they want the network to do without specifying how it should be implemented. This talk will describe the design and implementation of the language, focusing especially on support for composition (which allows complicated applications to be decomposed into simple modules) consistent updates (which allow a programmer to gracefully modify the state of the network), as well as a machine-verified compiler (which translates high-level programs down to hardware-level packet processing instructions).
Frenetic (http://www.frenetic-lang.org) is joint work with Arjun Guha (Cornell), Robert Harrison (US Military Academy), Christopher Monsanto (Princeton), Joshua Reich (Princeton), Mark Reitblatt (Cornell), Jennifer Rexford (Princeton), Cole Schlesinger (Princeton), Alec Story (Cornell), and David Walker (Princeton).
Biography: Nate Foster is an Assistant Professor of Computer Science at Cornell University. His research focuses on developing language abstractions and tools for building reliable systems. He received a PhD in Computer Science from the University of Pennsylvania, an MPhil in History and Philosophy of Science from Cambridge University, and a BA in Computer Science from Williams College, and was a postdoc at Princeton University. His honors include a Sloan Research Fellowship, a Yahoo! Academic Career Enhancement Award, and the Morris and Dorothy Rubinoff Award.
Host: Ethan Katz-Bassett
Location: GFS 106
Audiences: Everyone Is Invited
Contact: Assistant to CS chair
-
Joe Touch: An Optical Turing Machine
Mon, Dec 17, 2012 @ 02:00 PM - 04:00 PM
Thomas Lord Department of Computer Science
Conferences, Lectures, & Seminars
Speaker: Joe Touch, USC / ISI
Talk Title: An Optical Turing Machine
Abstract: The Optical Turing Machine (OTM) is our effort to design and implement a digital device that processes network data in an optical multibit/symbol modulation format. Its goal is to support high-speed computation using an encoding capable of high-speed, long-distance transmission. OTM explores the unification of communication and computation, and investigates the nature of Turing-equivalent computation. This talk introduces the OTM approach and discusses its key challenges. We discuss our current OTM projects, including the extension of our earlier all-optical packet hopcount decrement to multibit encoding, and the design and implementation of the world's first all-optical Internet checksum.
The OTM project is supported by grants from USC/ISI's New Research Initiatives (NRI) and the NSF Center for Integrated Access Networks (CIAN).
For those of you that are unable to attend in person, please use the following webcast link to view:
http://webcasterms1.isi.edu/mediasite/Viewer/?peid=83c9a7910ac34185b9e2c61eacff55ec1d
Host: John Wroclawski
Webcast: http://webcasterms1.isi.edu/mediasite/Viewer/?peid=83c9a7910ac34185b9e2c61eacff55ec1dLocation: ISI 11th Floor Large Conference Room
WebCast Link: http://webcasterms1.isi.edu/mediasite/Viewer/?peid=83c9a7910ac34185b9e2c61eacff55ec1d
Audiences: Everyone Is Invited
Contact: Assistant to CS chair
