Seeing the Internet as a System, Not a Pile of Logs

Infrastructure rarely fails in isolation. It fails through dependencies you didn’t know you had.

Net Intel is a graph intelligence tool that turns raw network data into a navigable model of reality—so you can see how things are actually connected before they break in production. See it live at Net Intel

What It Does

The tool loads datasets and builds an inferred graph across:

• BGP data
• ASNs
• Network and infrastructure entities
• Observed and derived relationships

Instead of static diagrams or endless tables, everything is unified into a single graph model that reflects real-world structure.

The Main View: A 2D Map

The primary interface is an interactive 2D map with heatmaps on the most 'connected' countries:

• Nodes represent networks, or entities
• Edges represent inferred or observed relationships
• You can also see the announced routes and prefixes

You can pan, zoom, filter, and explore the graph like a map—because spatial intuition beats spreadsheets every time.

Inferred Relationships (Where It Gets Interesting)

The real value isn’t just what’s in the data—it’s what’s between it.

By analyzing BGP paths and ASN relationships, we infer:

• Hidden and transitive dependencies
• Shared upstream risks
• Structural choke points
• Coupling between systems that appear unrelated

These are the failure modes that don’t show up in alerts until everything is already on fire.

Finding Dependency Problems Early

With the graph, you can quickly spot:

• Over-centralized dependencies
• Single points of failure
• Unexpected blast-radius paths
• Risky network relationships worth fixing now

It’s designed for exploration, not just monitoring—so you can ask “what depends on this?” and get an answer you can see.

Who It’s For

• Network and infrastructure engineers
• SREs and reliability teams
• Security and threat intel analysts
• Anyone tired of being surprised by outages

If your system is complex (it is), this helps make that complexity legible.

Why a Graph?

Because dependency problems are graph problems.

Once you can see them clearly, they stop being mysterious—and start being solvable.