Internet Routing Simulator

Discrete Math · Axiom Academy

REAL WORLD Internet Routing Simulator Explore how graph algorithms power the internet by simulating packet routing, optimizing network topology, and handling failures in real-time. Every time you click a link, send a message, or stream a video, data packets travel across a complex network of routers. But how do these packets know where to go? The answer lies in graph algorithms —the same concepts you're learning in Discrete Math! Nodes (vertices): Routers or servers Edges: Network connections between routers Weights: Latency (delay) or bandwidth capacity Path: A sequence of routers from source to destination In this simulator, you'll build and test network topologies, route packets using shortest-path algorithms, and see how networks adapt when connections fail. Here's a simple network with 5 routers. The numbers on the connections represent latency (delay in milliseconds). Click "Send Packet" to route data from Router A to Router E. In the real world, network connections fail all the time—cables get cut, routers crash, or connections become congested. How does the internet adapt? When a link fails, routers use graph algorithms to find alternative paths. This is why you rarely notice when a connection goes down—the network automatically routes around the problem! Network engineers constantly optimize topology for better performance. Can you improve this network's throughput? Average Latency: Mean time for packets to travel across the network

This is the written version of the interactive lesson above. See the full Discrete Math course.