Philip Brighten Godfrey
Office: 3211 Siebel Center
I am an Assistant Professor in the Department of Computer Science at the University of Illinois at Urbana-Champaign. I completed my Ph.D. in May 2009, advised by Ion Stoica at UC Berkeley (which means this is something of a coincidence). From February to July 2009, I was a visiting researcher at Intel Labs Berkeley.
|2014||Dec||PCC, GCC, and Geode all accepted to NSDI 2015!|
|Internet at the Speed of Light featured in front page story in the San Jose Mercury News and Oakland Tribune|
|Sep||Ankit's Internet at the Speed of Light accepted to HotNets 2014|
|Aug||Soudeh Ghorbani wins best paper award at HotSDN 2014!|
|Google Research Award — Thanks Google!|
|NSF grant with Alexandra Kolla awarded for Designing networks for high throughput — Thanks NSF!|
|Jul||Cisco research grant awarded for work on the Jellyfish project|
|Apr||Soudeh's paper Towards Correct Network Virtualization accepted to HotSDN 2014|
|Mar||Chi-Yao's Software Defined Transport and Anduo's SDN as DB appear at ONS 2014|
|Feb||Sloan Fellowship (Illinois press release)|
|Fellow in the Center for Advanced Study Beckman Fellow in 2014-15|
|2013||Dec||Ankit's paper High Throughput Data Center Topology Design accepted to NSDI 2014|
|Nov||Co-chairing HotNets 2014 with Anja Feldmann|
|Sep||Ashish's paper Low Latency via Redundancy accepted to CoNEXT 2013|
|Jun||PhD students Mo Dong and Qingxi Li win a 2013 Internet2 Innovate Application Award for Black Box Congestion Control (BBCC)|
|VeriFlow code released|
|Apr||Ankit Singla and Chi-Yao Hong's work on Jellyfish wins a UIUC CS Undergraduate - Graduate Symposium Outstanding Research Project Award|
|Rachit Agarwal's paper in PODC 2013: A Simple Stretch 2 Distance Oracle|
|Mar||The Summer School on Formal Methods and Networks in June will cover SDN, verification, and more — join us!|
|Submit your CoNEXT 2013 workshop proposals by April 15!|
- Spring 2014: CS 241: Systems Programming
- Fall 2013: CS 538: Advanced Computer Networks
- Fall 2012: CS 538: Advanced Computer Networks
- Spring 2012: CS 241: System Programming
- Fall 2011: CS 538: Advanced Computer Networks
- Spring 2011: CS 438: Communication Networks
- Fall 2010: CS 598: Advanced Computer Networks
- Spring 2010: CS 241: System Programming
- Spring 2010: CS 591: Foundations of Systems and Networking
- Fall 2009: CS 598: Advanced Internet
My research integrates networked systems and theory. You can check out my complete list of papers. Here are my group's current themes.
Networking at the speed of light
- PCC: Re-architecting Congestion Control for Consistent High Performance [NSDI 2015]
- The Internet at the Speed of Light [HotNets 2014]
- Low Latency via Redundancy [CoNEXT 2013]
- More is Less: Reducing Latency via Redundancy [HotNets 2012]
- Finishing Flows Quickly with Preemptive Scheduling [SIGCOMM 2012]
- ASAP: A Low-Latency Transport Layer [CoNEXT 2011]
Reduces the latency of DNS and TCP connection establishment; awarded a grant from VeriSign's Internet Infrastructure Grant Program.
Even a simple task on the Internet like retrieving a small web object typically takes more than 30 times longer than the fundamental physical limits. How can we design the Internet's protocols to approach speed-of-light responsiveness?
All the awesomeness at the project site
- Enforcing Generalized Consistency Properties in Software-Defined Networks [NSDI 2015]
- Towards Correct Network Virtualization [HotSDN 2014]
Today's virtualization techniques can cause application-level bugs. How do we guarantee that the virtual-to-physical mapping faithfully preserves the semantics of the virtual network?
- VeriFlow: Verifying Network-Wide Invariants in Real Time [NSDI 2013, HotSDN 2012]
Verifies a network's correctness and security invariants with millisecond-level latency as each forwarding rule is modified by the SDN controller.
- Debugging the Data Plane with Anteater [SIGCOMM 2011]
By checking a network's actual behavior in the data plane, Anteater can catch errors that would be difficult to reveal with other tools. Anteater successfully found real-world bugs in a large campus network.
- Ensuring Connectivity via Data Plane Mechanisms [NSDI 2013]
Data center network topology
- Measuring and Understanding Throughput of Network Topologies [arxiv]
- High Throughput Data Center Topology Design [NSDI 2014]
- Jellyfish: Networking Data Centers Randomly [NSDI 2012, HotCloud 2011]
A random graph topology simplifies incremental expansion and modification, and has higher bandwidth than a comparable fat-tree.
Compact routing and paths in social networks
- A Simple Stretch 2 Distance Oracle [PODC 2013 brief announcement]
- Distance Oracles for Stretch Less Than 2 [SODA 2013]
- Shortest Paths in Less Than a Millisecond [WOSN 2012, arXiv]
The structure of giant social networks enables this algorithm, after some pre-processing, to find exact point-to-point shortest paths in less than a millisecond.
- Compact routing in sparse graphs [INFOCOM 2011]
Improves the latency/space tradeoff of routing protocols in the realistic case of sparse graphs, introducing a tradeoff with computation time. Compactly finds exact shortest paths more than 99% of the time in an Internet topology.
- Scalable routing on flat names [CoNEXT 2010]
Guarantees delivery of packets within close to the lowest possible latency, given only an arbitrary location-independent name like a DNS name.
Flexible Internet architecture
- Architecting for Innovation [CCR July 2011]
How can we design an Internet architecture to accomodate evolution and diversity of protocols?
- Slick Packets [SIGMETRICS 2011]
The flexibility of source-controlled routing combined with fast re-routing in the network in case of failures.
- Pathlet Routing [SIGCOMM 2009]
An Internet routing architecture designed for flexibility, essentially source-controlled routing over a (policy-compliant) virtual topology. Routing flexibility can lead to benefits in reliability, performance, traffic engineering, and security. Also check out our demo at GEC9.
- Anduo Wang
- Sangeetha Abdu Jyothi
- Mo Dong
- Soudeh Ghorbani
- Chi-Yao Hong (co-advised with Matt Caesar)
- Qingxi Li
- Ankit Singla
- Ashish Vulimiri (co-advised with Gul Agha)
- Fan Yang
- Kyle Jao
- Xuefeng Zhu
Past group members
- Rachit Agarwal (co-advised with Matt Caesar), now a postdoc at UC Berkeley
- Abhishek Sharma, M.S. July 2013, now at Yelp
- Kelvin Zou, undergraduate researcher (2012-2013), now Ph.D. student at Princeton
- Sri Varsha Gorge, undergraduate researcher (2012), now at Salesforce
- Sam Mussmann, M.S. December 2012, now at Google
- Oliver Michel, undergraduate researcher (2011-2012), now Ph.D. student at the University of Colorado
- SIGCOMM 2015 program committee
- Dagstuhl Seminar on Formal Methods and Networks (2015), co-organizer
- HotNets 2014 PC co-chair
- SIGMETRICS 2014 program committee
- SIGCOMM 2014 program committee and web chair
- NSDI 2014 program committee
- HotNets 2013 program committee
- IEEE SafeConfig 2013 program committee
- CoNEXT 2013 Workshop Co-Chair
- ANCS 2013 program committee
- HotSDN 2013 program committee
- WWW 2013 program committee, Social Network and Graph Analysis track
- DIMACS Workshop on Software Defined Networking 2012 co-organizer
- HotNets 2011 program committee
- SIGMETRICS 2011 program committee
- CoNEXT 2010 Student Workshop co-chair
- IFIP Networking 2010 program committee
- Short biography
- You Infinite Snake: blog
- Outreach activities
- Advice on obtaining grants
- Presidential Electability Predictor
- Repository of Availability Traces
Traces from measurement studies of PlanetLab, web sites, corporate PCs, Skype superpeers, and DNS servers packaged in a single compact format.
- Aggregate CS conference statistics
- Mindy: A Minimalist "Development Environment"
- Conference deadlines: networks, theory
- Great talks on education: Clifford Stoll, Ken Robinson