Yale University.  
Computer Science.  
     
Computer Science
Main Page
Academics
Graduate Program
Undergraduate Program
Course Information
Course Web Pages
Research
Our Research
Research Areas
Technical Reports
People
Faculty
Graduate Students
Research and Technical Staff
Administrative Staff
Alumni
Degree Recipients
Resources
Calendars
Computing Facilities
CS Talks Mailing List
Yale Computer Science FAQ
Yale Workstation Support
Computing Lab
AfterCollege Job Resource
Graduate Writing Center
Department Information
Contact Us
History
Life in the Department
Life About Town
Directions
Job Openings
Faculty Positions
Useful Links
City of New Haven
Yale Applied Mathematics
Yale C2: Creative Consilience of
Computing and the Arts
Yale Faculty of Engineering
Yale GSAS Staff Directory
Yale University Home Page
Google Search
Yale Info Phonebook
Internal
Internal
 

CS Talk
March 29, 2012
10:30 a.m., AKW 200

Speaker:
Theophilus Benson
Title: Towards Networks without Management Complexity

Abstract: Networks are a crucial and integral aspect of modern enterprises, with the productivity and fate of many enterprises significantly intertwined with the performance and reliability of their networks. Yet despite their importance, these networks remain highly susceptible to poor performance, failures, and outages.

I posit that the fragility of enterprise networks is largely a byproduct of the complexity involved in managing conflicting global policies. In this talk, I argue that only by understanding this complexity can we harden these networks. In my research, I have developed simple yet highly effective models of enterprise networks and used these models as first order principles in designing practical frameworks that improve the performance and reliability of these networks. In the first half of this talk, I will present a set of novel models that capture the difficulty of implementing high level network objectives within the network. In the second half of the talk, I will focus on using the frameworks arising out of these models to mitigate complexity by informing the design of more efficient and reliable services and by enabling large enterprises to debug their network's configuration.

Together these studies illustrate how eliminating complexity can lead to manageable networks, thus reducing misconfigurations and promoting innovative changes. Understanding complexity has several benefits: in the short run, knowledge of complexity leads to the development of mechanisms that foster better performance and higher resiliency; and in the long run, the dialogue created by understanding complexity will shape the design of future networking interfaces and abstractions.

Bio: Theophilus Benson is passionate about eliminating the complexity and overhead of managing networks both within local area networks and within the cloud. His graduate work has focused on configuration management, data center networks, and cloud computing. This work has earned him an IBM fellowship, a best paper award at IMC 2010, and, more recently, his cloud computing platform was acquired by a large cloud provider. He is a Ph.D. candidate at the University of Wisconsin - Madison, where he previously received his M.S. in Computer Science. Prior to that, he received his B.S. at Tufts University and worked as a software engineer at an MIT based startup in Waltham, MA.