Philip Brighten Godfrey
Professor
Research Interests
Make your next move.
Prepare your application
Review drafts before you send them.
Explore related searches
About
Philip Brighten Godfrey is an Associate Professor at the University of Illinois at Urbana-Champaign and a researcher at VMware in the United States. His research focuses on network fault localization, particularly in scalable systems, as evidenced by his recent work titled "Flock: Accurate Network Fault Localization at Scale." He is committed to advancing the understanding of network systems through innovative methodologies and technologies.
Articles (7)
Year:
2026
Year:
2025
Year:
2025
A microservice-based application is composed of multiple self-contained components called microservices, and controlling inter-service communication is important for enforcing safety properties. Presently, inter-service communication is configured using microservice deployment tools. However, such tools only support a limited class of single-hop policies, which can be overly permissive because they ignore the rich service tree structure of microservice calls. Policies that can express the service tree structure can offer development and security teams more fine-grained control over communication patterns. To this end, we design an expressive policy language to specify service tree structures, and we develop a visibly pushdown automata-based dynamic enforcement mechanism to enforce service tree policies. Our technique is non-invasive: it does not require any changes to service implementations, and does not require access to microservice code. To realize our method, we build a runtime monitor on top of a service mesh, an emerging network infrastructure layer that can control inter-service communication during deployment. In particular, we employ the programmable network traffic filtering capabilities of Istio, a popular service mesh implementation, to implement an online and distributed monitor. Our experiments show that our monitor can enforce rich safety properties while adding minimal latency overhead on the order of milliseconds.
Year:
2025
Year:
2025
Year:
2025
Inferring the root cause of failures among thousands of components in a data center network is challenging, especially for "gray" failures that are not reported directly by switches. Faults can be localized through end-to-end measurements, but past localization schemes are either too slow for large-scale networks or sacrifice accuracy. We describe Flock, a network fault localization algorithm and system that achieves both high accuracy and speed at datacenter scale. Flock uses a probabilistic graphical model (PGM) to achieve high accuracy, coupled with new techniques to dramatically accelerate inference in discrete-valued Bayesian PGMs. Large-scale simulations and experiments in a hardware testbed show Flock speeds up inference by >10000x compared to past PGM methods, and improves accuracy over the best previous datacenter fault localization approaches, reducing inference error by 1.19-11x on the same input telemetry, and by 1.2-55x after incorporating passive telemetry. We also prove Flock's inference is optimal in restricted settings.
Year:
2023
Collaborators (3)
Deepak Vasisht
Assistant Professor
University of Illinois at Urbana-Champaign
Justin Hsu
Associate Professor
Cornell University
Reyhaneh Jabbarvand
University of Illinois at Urbana-Champaign
Make your next move.
Prepare your application
Review drafts before you send them.