Thursday, March 16, 2006
4:15 pm
B17 Upson Hall

Computer Science
Spring 2006

Boon Thau Loo
UC Berkeley


Declarative Networking: Extensible Networks with Declarative Queries

As new and varied applications are developed and deployed on the Internet, there is an increased pressure on the Internet to provide better services and support new functionalities. In this talk, I present P2, a declarative networking system that aims to address the lack of flexibility in today's Internet by providing a declarative framework for rapid prototyping, development and experimentation with new network designs. In P2, networks are specified using a high-level recursive query language. These specifications are then compiled into efficient distributed implementations. This approach provides ease and compactness of specification, and offers additional benefits such as optimizability and the potential for safety checks. I will demonstrate the use of P2 for building extensible routers, and as a platform for rapid prototyping of new overlay networks. I will also address a number of database research issues that arises in declarative networking, in the areas of language semantics, distributed execution strategies and query optimizations.

Boon Thau Loo is a Ph.D. candidate in the Computer Science Department at the University of California at Berkeley. He received his M.S. degree in Computer Science from Stanford University in 2000, and his B.S. degree in Electrical Engineering and Computer Science from UC Berkeley in 1999. His research interests center on distributed data management systems, Internet-scale query processing, and the application of database technologies to various aspects of networked systems.