Why can one cable cut disconnect a whole area while another barely matters?
Did this make sense?
Your thumbs help us make it clearer.
Thanks! That helps us make it clearer.
See it another way
The Internet: Packets, Routing & Reliability
Watch packet routes split across a network and see traffic use another available path when part of the network fails.
Requires internet. You’re leaving Clickory in a new tab; YouTube may show ads or recommendations.
Keep going
What else makes you wonder?
Which pairs of cuts can defeat a network that survives any one cut?
Trace two complete routes first, then look for a pair of links that touches both.
How would the test change if one whole router vanished?
Remove the node and every link touching it before checking what remains reachable.
Where could one new link protect the most important places for the least cost?
Mark the required crossings first, then compare which single addition creates the most useful detours.
After you watchWhy can one cable cut disconnect a whole area while another barely matters?
The short answer
A network survives one broken link when the points that matter still have another complete path between them. A link whose removal splits the network is called a bridge. Useful redundancy creates a route around that bridge; extra links elsewhere may add cost without protecting the weak crossing.
Try this next
- What if the network must survive any two link cuts? Draw three genuinely separate routes between important points, then test different pairs of removed links.
- What if two routes share one router? Erase that router and every touching link together, then check whether the routes were truly independent.
- What if the backup path is much slower? Keep reachability and travel time as separate measurements, then compare normal and failure routes.
Now you — bend it
- What if What if every important place needs two link-disjoint routes?Trace two routes that do not share a link, then remove one link from either route.
- What if What if a backup route has limited capacity?First test whether it connects, then ask how many messages it can carry at once.
Can you prove it?More total wire can still leave one weak crossing. — Draw extra links only inside one side of a two-part map. Remove the sole crossing and trace whether any complete route reaches the other side.
Design your own test:Before drawing it, predict which planned failure your link routes around and name the complete detour.
Explain it to a 6-year-old: If one road closes, another whole road must still go all the way around.
The whole story
How it works
Messages travel along connected sequences of links called paths. Remove one link and every path using it disappears. If at least one complete alternate path remains, a message can detour. If every path between two sides used the removed link, those sides separate. Network designers add carefully placed links and routing equipment so common failures have another route.
What people get wrong
A large wire count does not automatically make a network resilient. Several extra links inside an already connected region can leave one required crossing unchanged. Placement matters: a backup protects a failure only when it belongs to a complete route that goes around the failed part.
The catch
Redundant links can keep traffic moving, but cables, radios, ports, routers, power, monitoring, and repairs cost money and energy. Protection is also specific: surviving one link cut does not guarantee survival of a router failure, two cuts, overload, or a single last-mile connection.
Questions kids ask
Does one cut always break a network?
No. It breaks communication between chosen points only when every complete path between them needed that link. If another complete path remains, routing can use the detour.
Does adding any extra wire help?
Not necessarily. A useful backup must participate in a complete route around the threatened link. An extra wire entirely inside one side can leave the same crossing required.
Can a network survive a cable cut but fail when a router breaks?
Yes. A router is a node with several incident links. When it fails, several links may disappear together, so two routes that share that router can fail at the same time.
Why can one town still lose service if the wider internet has many paths?
The wider network may be richly connected while the final branch into that town, building, or island uses one cable. That last-mile link can still be a single point of failure.
Talk about it
- Ask your child to trace one complete route before looking for a second.
- After a cut, ask which exact link the detour uses that the original route did not.
- Name a nearby road, cable, or bridge that might be a last-mile single connection.
For grown-ups
In graph theory, a bridge is an edge whose deletion increases the number of connected components. A graph with no bridges is 2-edge-connected within each relevant component, and pairs of vertices have two edge-disjoint paths. This is an edge-failure statement, not a guarantee about vertex failures, correlated failures, capacity, latency, or access links.