Ripple: Uncovering Distributed Service Dependency Graphs
Modern distributed systems are built on a web of interconnected services. While this brings flexibility, it also creates hidden dependencies that can spread faults and trigger cascading failures. Pinpointing the root cause of performance issues in such environments requires accurate service dependency graphs, but traditional approaches struggle, especially when complex routing techniques like Network Address Translation (NAT) obscure what’s really happening.
In this talk, Diogo Landau, Software/Performance Engineer & PhD Candidate at the University of Utrecht, introduces Ripple, a run-time system that constructs process-level service dependency graphs without requiring source code changes. Unlike existing methods, Ripple remains resilient in the face of NAT and other complex routing mechanisms. By leveraging eBPF, Ripple injects lightweight identifiers into TCP connections, ensuring accurate dependency mapping between services and processes.
Diogo will walk through how Ripple works, show its evaluation across multiple real-world scenarios, and share why it consistently achieved near-perfect precision and recall with minimal overhead, outperforming state-of-the-art systems.
Join us to explore a breakthrough approach to observability that makes root cause analysis in distributed systems faster, more reliable, and NAT-proof.
Register now to join this TechTalk at the SUE office, De Ooyen 9 in Geldermalsen. After the session, stay for dinner and drinks and continue the conversation.
