In this talk we explore algorithmic solutions for the visualization of hierarchical networks, one of the core tools for monitoring and troubleshooting offered by Sysdig. Speaker: Claudio Squarcella - Engineering Manager - Sysdig

1. Topology
Visualization at
Sysdig
Claudio Squarcella. Engineering Manager
claudio.squarcella@sysdig.com

2. Hierarchical
maps of your
infrastructure

3. Preview

4. Live demo

5. Recursive
layout +
Sugiyama

6. • Start with outer layout
• Step into expanded nodes
• Use parent layout as constraint
Recursive layout at a glance

7. Identify links between nodes at Host (H) level Simplify graph accordingly and compute layout
Recursion: Outer layout

8. Identify nodes and links + outer constraints at
Container (C) level inside H3
Compute layout influenced by constraints
Recursion: Inner layout

9. • Break all cycles
• Assign nodes to vertical layers
• Break long links with dummy nodes
• Minimize crossings
• Minimize ink
• Restore cycles and long links
Sugiyama at a glance

10. Identify cycles Reverse smallest number of links
Sugiyama: Break all cycles

11. Traverse acyclic version of the graph Assign nodes to layers
Sugiyama: Vertical layers

12. Identify links that span 2+ layers Break links with dummy nodes
Sugiyama: Dummy nodes

13. Compute median offset of neighbor nodes Use median as new offset
Sugiyama: Minimize crossings

14. Same but backwards Use median as new offset
Sugiyama: Minimize crossings (2)

15. Compute median position of neighbor nodes Use median as new position (without breaking order)
Sugiyama: Minimize ink

16. Identify dummy nodes and reverse links Restore link direction, add Bezier curves
Sugiyama: Cycles + Bezier

17. Questions?

18. We are hiring!

19. Topology
Visualization at
Sysdig
Claudio Squarcella. Engineering Manager
claudio.squarcella@sysdig.com