Tutorials Streaming

Radia Perlman: The Algorithm That Stops Networks Collapsing

By Infinite Creation · Profile

At a Glance

Radia Joy Perlman (born 1951) devised the spanning tree protocol in 1985 at Digital Equipment Corporation. It lets bridged networks contain redundant links for resilience without those links creating loops that flood the network with endlessly circulating frames. She documented the algorithm in a poem"Algorhyme", and later worked extensively on network security and TRILL.

Born 1951, United States
Anchor year: 1985, the spanning tree protocol
Strand: overlooked, infrastructure nobody sees

Career

The problem as it stood

A network with only one path between two points fails completely if that path breaks. Adding redundant paths fixes that and creates a worse problem: a broadcast frame circulates around the loop forever, is duplicated at every junction, and saturates the network within seconds.

What she actually did

Perlman devised a distributed algorithm by which bridges elect a root and each independently determines which of its ports to use and which to block, so that the active topology is a tree. Loop-free by construction, while the blocked links remain available if a failure occurs.

How it worked

A tree is a graph with no cycles, so a frame cannot loop. The algorithm computes one in a distributed fashion, with no central controller, and recomputes automatically when the topology changes. Redundancy is retained without loops ever forming: the contradiction is resolved rather than traded away.

What it made possible

Large bridged Ethernet networks, which underpin essentially every corporate, campus and data centre network. Broadcast facilities, streaming infrastructure and the delivery chain in this corpus all run over networks that stay up because of this class of algorithm.

What happened to her

She worked at DEC, Sun and Intel, wrote the standard textbook Interconnections, holds over a hundred patents, and later developed TRILL to address spanning tree's own limitations. She has publicly resisted the "mother of the internet" label as overstating one contribution.

Where the credit landed

Perlman is well credited among network engineers and unknown outside, which is the standard fate of infrastructure work. It is noticed only when it fails. Her own resistance to inflated titles is worth recording in a corpus that repeatedly finds women either erased or, in correction, over-claimed. She has consistently asked to be credited for what she actually did.

Known For

A tree has no cycles, so frames cannot loop: that is the whole idea.
Blocked links stay available and reactivate automatically on failure.
She rejects the "mother of the internet" title as overstating one contribution.

Knowledge Base

What You'll Learn

Infrastructure is invisible until it fails, and this stops it failing.

Why a broadcast storm is so destructive

Ethernet frames have no hop count, unlike IP packets, so nothing stops a looping frame circulating. A single broadcast entering a loop is duplicated at every junction on every pass, so traffic grows exponentially and the network becomes unusable within seconds, including for the management traffic an operator would need to fix it. The failure mode is total and immediate, which is why the problem had to be solved structurally rather than mitigated.

Where This Fits

Spanning tree keeps bridged networks running, and the internet delivery link in A History of Broadcast Technology depends on networks like these.

FAQ

Q: What is the spanning tree protocol?
A: A distributed algorithm by which network bridges agree on a loop-free active topology, blocking redundant links while keeping them in reserve. It lets networks contain redundant paths for resilience without traffic looping endlessly.

Q: Why can redundant links break a network?
A: Ethernet frames have no hop limit, so a broadcast frame entering a loop circulates forever and is duplicated at every junction, saturating the network within seconds.

Sources

The paper and the patent were each checked against their own records. Checked 20 August 2026.

Radia Perlman, An Algorithm for Distributed Computation of a Spanning Tree in an Extended LAN. ACM SIGCOMM Computer Communication Review, volume 15, issue 4, pages 44 to 53, September 1985. Perlman is the sole author. This is the publication the 1985 anchor year above refers to, and it is the primary record for the algorithm itself.
US Patent 5,150,360, Utilization of Redundant Links in Bridged Networks. Filed 7 March 1990 and granted 22 September 1992, assigned to Digital Equipment. It names Radia J. Perlman, William Hawe and Anthony Lauck, and it builds on the spanning tree rather than being the original algorithm.