# Packet switching: Science

Source page: https://www.materialinsights.org/technologies/packet_switching/tech-science/

#### Principles

The science it rests on, with why each principle matters to it
 Relies on

- [Queueing theory](https://www.materialinsights.org/science/queueing_theory/) Packets wait in queues at each switch; Kleinrock's extension of queueing theory to data network design helped make UCLA the first ARPANET node ^[5].
- [Graph theory](https://www.materialinsights.org/science/graph_theory/) A network is a graph of nodes and links, and routing means finding good paths through it; Baran's design relied on many redundant paths ^[1].
- [Information theory](https://www.materialinsights.org/science/shannon_information/) Treating messages as strings of bits is what lets any message be cut into equal blocks and sent the same way.

as of 2026-11-11

#### Discoveries

The discoveries that made it possible: when, by whom and what was found

| Year | Who | What |
|---|---|---|
| 1736 | Leonhard Euler | Solved the bridges of Königsberg problem, the start of graph theory, the mathematics of networks ^[7] |
| 1909 | Agner Krarup Erlang | Published his first paper on the probability of telephone traffic, The theory of probability and telephone conversations ^[6] |
| 1917 | Agner Krarup Erlang | Gave a formula for loss and waiting time, the root of queueing theory used to size networks ^[6] |

as of 2026-11-11

#### The science explained

The science behind it explained for a curious reader

Think of a motorway compared with a private railway. A telephone circuit is like a private railway line laid for each call: nothing else can use it, even when the train is standing still. Packet switching is like a motorway. Each car is a packet with its own address, and cars from thousands of journeys share the same lanes. At each junction a car joins a short queue, then takes the road that leads nearer its goal. If a road is closed, cars go round. The maths of graphs, begun by Euler in 1736 ^[7], describes the road map. The maths of queues, begun by Erlang in 1909 for telephone traffic ^[6], says how long the waits will be.

as of 2026-11-11

#### Sources

1. [On Distributed Communications: I. Introduction to Distributed Communications Networks](https://www.rand.org/pubs/research_memoranda/RM3420.html) RAND Corporation (Paul Baran), 1964
2. [Milestones:Birthplace of the Internet, 1969](https://ethw.org/Milestones:Birthplace_of_the_Internet%2C_1969) IEEE, Engineering and Technology History Wiki
3. [Agner Krarup Erlang](https://www.informs.org/Explore/History-of-O.R.-Excellence/Biographical-Profiles/Erlang-Agner-Krarup) INFORMS, History of O.R. Excellence
4. [Maths in a minute: The bridges of Königsberg](https://plus.maths.org/content/maths-minute-bridges-konigsberg) Plus Magazine, University of Cambridge

## Other sections

- [Summary](https://www.materialinsights.org/technologies/packet_switching/index.md)
- [Overview](https://www.materialinsights.org/technologies/packet_switching/tech-overview/index.md)
- [Evolution](https://www.materialinsights.org/technologies/packet_switching/tech-evolution/index.md)
- [Energy footprint](https://www.materialinsights.org/technologies/packet_switching/tech-energy-footprint/index.md)
- [Industries](https://www.materialinsights.org/technologies/packet_switching/tech-industries/index.md)
