The eight fallacies of distributed computing: Why they still matter after 21 years
By
George Michaelson
Crackling crust, pillowy middle. The kind of bagel that earns a second cup of coffee.
Summary
This article revisits the eight fallacies of distributed computing, originally formulated in the 1990s, which describe common but incorrect assumptions developers and network administrators make about networks. These fallacies include beliefs that the network is reliable, latency is zero, bandwidth is infinite, the network is secure, topology doesn't change, there is one administrator, transport cost is zero, and the network is homogeneous. The article explains why each fallacy persists despite decades of evidence to the contrary, and discusses their continued relevance in modern cloud computing, microservices, and distributed systems design.
Key quotes
· 3 pulledYou'd think that by now, networks were well enough understood that people would stop making assumptions that we have known, almost since the dawn of networking, to be untrue.
Perhaps the best-known collection of mistaken ideas about networks is the eight fallacies of distributed computing.
The network is reliable. Latency is zero. Bandwidth is infinite. The network is secure. Topology doesn't change.
You might also wanna read
A beginner's guide to computing clusters: how distributed computing powers modern data analysis
This article provides a beginner-friendly introduction to computing clusters, explaining how they work as collections of individual computer

Decentralizing Cybersecurity: The Science of Ineffable Cryptography
The article discusses the flaws in current cybersecurity models, emphasizing the vulnerabilities of centralized authority. It introduces the
DEV Community·10mo ago
Why Enterprise Networks Must Be Designed for Adaptability, Not Rebuilt for Each Technology Shift
The article argues that enterprise networks have undergone too many costly rebuilds with each technology shift (mainframe to client-server,
The Mathematical Foundations of Expander Graphs for Optimal Routing Networks
This article explores the mathematical foundations of optimal routing networks, tracing back to the late 1970s with the study of "expander"
