Philip B. Godfrey, Ph.D.

2009 University of California, Berkeley, Berkeley, CA 
Operating Systems & Networking (OSNT); Security (SEC); Networking and distributed computer systems, Quality of Service (Q of S) and resources management, modeling and performance analysis
"Philip Godfrey"


Sign in to add mentor
Ion Stoica grad student 2009 UC Berkeley
 (Designing distributed systems for heterogeneity.)
BETA: Related publications


You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Jyothi SA, Dong M, Godfrey PB. (2015) Towards a flexible data center fabric with source routing Symposium On Software Defined Networking (Sdn) Research, Sosr 2015
Vulimiri A, Curino C, Godfrey PB, et al. (2015) Wanalytics: Geo-distributed analytics for a data intensive world Proceedings of the Acm Sigmod International Conference On Management of Data. 2015: 1087-1092
Godfrey PB, Caesar M, Haken I, et al. (2015) Stabilizing route selection in BGP Ieee/Acm Transactions On Networking. 23: 282-299
Jyothi SA, Singla A, Godfrey PB, et al. (2014) Measuring throughput of data center network topologies Performance Evaluation Review. 42: 597-598
Vulimiri A, Godfrey PB, Mittal R, et al. (2013) Low latency via redundancy Conext 2013 - Proceedings of the 2013 Acm International Conference On Emerging Networking Experiments and Technologies. 283-294
Agarwal R, Godfrey PB. (2013) Brief announcement: A simple stretch 2 distance oracle Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 110-112
Godfrey PB. (2013) HotNets 2012 highlights Computer Communication Review. 43: 38-42
Agarwal R, Godfrey PB. (2013) Distance oracles for stretch less than 2 Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 526-538
Khurshid A, Zhou W, Caesar M, et al. (2012) Veriflow: Verifying network-wide invariants in real time Computer Communication Review. 42: 467-472
Hong CY, Caesar M, Godfrey PB. (2012) Finishing flows quickly with preemptive scheduling Computer Communication Review. 42: 127-138
See more...