AWhat changed
Perlman gives a distributed protocol that selects a root and forwarding subset of a bridged extended LAN, preserving connectivity while removing forwarding loops after convergence, with explicit aging and reconfiguration delays.
Scientific scope
Perlman gives a distributed protocol that selects a root and forwarding subset of a bridged extended LAN, preserving connectivity while removing forwarding loops after convergence, with explicit aging and reconfiguration delays. The algorithm selects a loop-free spanning tree among bridges using the stated identifiers, messages and timing assumptions. Convergence after topology changes differs from instantaneous forwarding safety. It does not guarantee shortest paths, Byzantine/Sybil robustness or unlimited dynamic-network behavior. Later standardized variants and implementations are separate.
Evidence
Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.
Contributors
- Radia Perlman · SCIENCE: Original source-listed scientific author of this scoped work; byline does not determine effort fractions.
- Perlman 1985: An algorithm for distributed computation of a spanning tree in an extended LAN
- RFC 6325(2011): Routing Bridges base protocol, abstract and authors only
Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.
Full scientific record · Browse contribution grades · Request a correction