← all systems · see it in The System
Computer network
A group of communicating computers and peripherals (hosts) that send data to one another by communication protocols, through networking hardware (network interface controllers, repeaters, switches, routers, modems, firewalls) and transmission media (copper, optical fibre, radio). Walked as the thing network engineers describe: its media, links, nodes, addresses, protocols in layers, routing, congestion control and topology, from a single local area network up to the wide area networks it joins; and as the field that builds and studies it.
Properties published scienceour proposal
Sourced fields, and our own readings.
| born at | 1940 (Stibitz's teletype at Dartmouth to the Complex Number Calculator in New York); packet-switched: NPL network 1968-69, ARPANET's first four nodes 1969 |
| born precision | year |
| boundary | Inside: the hosts' network interfaces and protocol software, the links, and the nodes that forward between them (repeaters, hubs, bridges and switches, routers), under the addressing and protocols of one administration or one technology. Outside: the people and programs that use it, the operating systems the protocol software runs in (shared with the host), the physical medium's wider field, and the other networks it is joined to through routers. 'The cloud ... distinguishes between the nodes on the inside that implement the network ... and the nodes on the outside of the cloud that use the network' (src:pd-requirements). The boundary is recursive: 'a network can be constructed from a nesting of networks' (src:pd-requirements). |
| nested level | Built from hosts' network interfaces, transmission media and forwarding nodes; embedded in an organisation's administration and joined by routers into internetworks, the largest being the Internet, where a whole network is one 'directly connected network' seen from IP. |
| scale | technological |
Measures (23) published science
| characteristic clock: transcontinental round-trip time | 100 ms |
| characteristic clock: Ethernet backoff slot | 51.2 μs (waits of k slots, k random in 0..2^n - 1 after n collisions; up to 16 tries) |
| characteristic clock: distance-vector advertisement period (RIP) | 30 s |
| AQM target setpoint (CoDel) | 5-10 % of the round-trip time (1-20 ms in tests) |
| signal speed in optical fibre | 2.0e8 m/s (copper 2.3e8, vacuum 3.0e8) |
| ARPANET circuit rate, 1969 | 50 kbit/s (first four nodes) |
| Ethernet top standard rate | 800 Gbit/s (IEEE, 2024) |
| minimum Ethernet frame | 512 bits (64 bytes); data 46 to 1500 bytes |
| first commercial computer modem rate (Bell 101, 1958) | 110 bit/s |
| classical Ethernet reach | 2500 m (no more than four repeaters between hosts) |
| twisted-pair segment length before a repeater | 100 m |
| payload share of a full Ethernet packet (TCP/IPv4) | 1460 of 1500 bytes (per-hand-off efficiency 0.973 at the IP layer, derived from the two sourced figures) |
| error check overhead on Ethernet | 32 per 12,000 bits (CRC-32 per full frame) |
| optical loss of the clearest glass, 1966 | 200 dB/km (Kao and Hockham foresaw 20 dB/km; Corning reached 17 dB/km in 1970) |
| congestion collapse, October 1986 | 32 Kbps to 40 bps throughput LBL to UC Berkeley (a factor of about a thousand) |
| redundancy level for survivability (Baran) | about 3 links per node (1.5 enough without attack) |
| reorganisation time after half the network destroyed (simulation) | < 1 s of simulated time |
| telephone tandem link limit (AT&T, c. 1960) | 5 switched tandem links |
| one-way delay that feels transparent | < 150 ms (400 ms the planning limit) |
| Mirai peak infections | 600,000 devices (attack on Krebs above 600 Gbps) |
| node failures tolerated with unchanged diameter (scale-free model) | 5 % of nodes |
| MAC address size | 6 octets (first three name the maker) |
| distance-vector 'infinity' | 16 hops |
Open contentions (6) open contention
Where sources or readings disagree. Both stay on the map.
- C-736 When a system first throws away its excess energy and later learns to store it for reuse, is that one process that grew or two separate ones?
booked: The map keeps both readings side by side and rules neither. A few examples fit the 'one process that grew' reading, but it hasn't been tested.
the other reading: one Function seen before and after a fold: early tail-drop only dumps; AQM 'stashes' the excess as information for the sender - C-1364 Is the Internet fragile to targeted attack?
booked: The map keeps both: the finding that such networks shrug off random failures but break under targeted attack, and the reply that the real router network isn't built that way.
the other reading: the router-level Internet is not scale-free in that sense: 'alternative approaches to modeling the Internet often make extremely different assumptions and derive opposite conclusions about fundamental properties of one and the same system' (Doyle et al. 2005, read in abstract) - C-1365 Are network attackers or defenders winning?
booked: The map records attacks and defences escalating together, and keeps the reading that one side is pulling ahead alongside.
the other reading: one side gains (the Mirai authors 'argue that Mirai may represent a sea change'), not a stalemate - C-1366 How does a network's value grow with its size?
booked: No law is settled. The map keeps Metcalfe's square law and the slower and faster alternatives side by side.
the other reading: Metcalfe's law (V ∝ n²); Odlyzko's law (V ∝ n log n) for strongly localised networks such as carriers; a cube law fits recent Facebook and Tencent data (Zhang et al. 2023, via Wang et al.) - C-1370 Who invented packet switching?
booked: The map credits both Paul Baran and Donald Davies, independently, and keeps the note on what Baran's design did not include.
the other reading: Baran's work 'did not include routers with software switches, nor the idea that users, rather than the network itself, would provide the reliability' (encyclopedia, citing Kleinrock 1978); Davies' design 'included high-speed routers, communication protocols and the essence of the end-to-end principle' - C-1373 Do networks really have seven layers?
booked: The map uses the seven-layer OSI model as the field teaches it, and keeps the Internet's four-layer view, which folds two of them into the applications, alongside.
the other reading: the Internet architecture has four broad layers and folds session and presentation into applications and TCP ('RFC 3439 contains a section entitled "Layering considered harmful"'); 'there is no OSI-based network running today, the terminology it defined is still widely used' (src:pd-architecture); 'Some engineers argue the OSI reference model is still relevant to cloud computing. Others say the original OSI model does not fit today's networking protocols' (src:wp:osi-model)
Partners and parts published science
Built from / builds (11)
- Attackers against defenders for control of computing
- router
- Computer
- Network interface controller
- The medium or field that carries it
- Bridges and switches
- Repeaters and hubs
- Modem
- Firewall (computing)
- Communication protocols (in layers)
- Cloud computing
Sits inside / holds (6)
- Internet protocol suite (TCP/IP): the layered datagram protocols every host and router runs, the RFC record that specifies them, and the community that keeps them
- Intrusion detection system
- Firewall (computing)
- Wireless network
- Internet
- Organization
Trades with (valence) (26)
- Internet protocol suite (TCP/IP): the layered datagram protocols every host and router runs, the RFC record that specifies them, and the community that keeps them via sys:electromagnetic-field · Computer network gain
- Operating system via sys:electromagnetic-field · Computer network gain
- Intrusion detection system via sys:electromagnetic-field · Computer network mixed
- Security operations center (SOC) via sys:electromagnetic-field · Computer network gain
- Incident response via sys:electromagnetic-field · Computer network mixed
- Botnet via sys:electromagnetic-field · Computer network loss
- Denial-of-service attack via sys:internet · Computer network loss
- Information security via sys:electromagnetic-field · Computer network gain
- Organization via sys:computer · Computer network gain
- Computer hardware via sys:electromagnetic-field · Computer network gain
- Firewall (computing) via sys:electromagnetic-field · Computer network mixed
- Wireless network via sys:electromagnetic-field · Computer network gain
- Database via sys:electromagnetic-field · Computer network even
- Electromagnetic field via sys:electromagnetic-field · Computer network mixed
- Human (Homo sapiens) via sys:sensory-environment · Computer network gain
- Software via sys:electromagnetic-field · Computer network gain
- Internet via sys:electromagnetic-field · Computer network gain
- Computer via sys:electromagnetic-field · Computer network gain
- Cryptography via sys:written-record · Computer network mixed
- Computer security via sys:electromagnetic-field · Computer network mixed
- Telephone network (circuit-switched carrier) via sys:electromagnetic-field · Computer network gain
- Cloud computing via sys:electromagnetic-field · Computer network gain
- Security information and event management (SIEM) via sys:electromagnetic-field · Computer network mixed
- Cyber threat intelligence via sys:computer-network · Computer network even
- Communication: the passing of messages between senders and receivers through a channel (and, on other readings, the making of meaning between them), and communication studies, the field that studies it via sys:electromagnetic-field · Computer network gain
- Telephone via sys:electromagnetic-field · Computer network gain
expressed by (29)
- Generation/Synthesis
- Recombination/Composition
- Scaffolding/Enablement (Meta-Tooling)
- Templating / Standardization
- Quality Improvement/Refinement
- Interoperability/Transduction (Bridging)
- Encapsulation & Modularity (Abstraction)
- Evolvability/Plasticity Engineering (Design for Future Variation)
- Distributed Autonomy/Decentralized Execution (Subsidiarity)
- Internal Coordination/Regulation
- Sensing/Scanning
- Mapping/Modeling
- Navigation/Pathfinding
- Uncertainty Reduction/Learning
- Surprise / Change-Point Detection
- Social Learning / Public Information Use
- Quick Harm Avoidance
- Reactive Response
- Physical/Virtual Barrier
- Self-Monitoring
- Validation of Identity/Intention
- Validation of Effectiveness
- Enclave/Segregation
- Resilience & Repair
- Redundancy & Diversity
- Triage & Prioritized Allocation
- Quality Control & Error Correction
- Bridging Supply Gaps (Store & Dormancy)
- Scheduled Build-and-Dismantle (On-Demand Structure)
floor filled by (36)
- Internet protocol suite (TCP/IP): the layered datagram protocols every host and router runs, the RFC record that specifies them, and the community that keeps them
- Intrusion detection system
- Security operations center (SOC)
- Incident response
- Insider threat
- Firewall (computing)
- Database
- Electromagnetic field
- Human (Homo sapiens)
- Software
- router
- Computer
- Operating system
- Network interface controller
- Cryptography
- Bridges and switches
- Repeaters and hubs
- Wireless network
- Bus network
- Network topology
- Twisted pair
- Optical fibre
- Radio and microwave links
- Routing protocol
- spanning tree protocol
- presentation layer
- software defined networking
- active queue management
- metcalfes law
- session layer
- ethernet
- Cloud computing
- Physical security
- Security information and event management (SIEM)
- Cyber threat intelligence
- Penetration testing
Kinds (14)
- Internet
- Local area network (LAN)
- Wide area network (WAN)
- Personal area network (PAN)
- Metropolitan area network (MAN)
- Campus area network (CAN)
- Nanoscale network
- Storage area network (SAN)
- Backbone network
- Wireless network
- Overlay network
- Virtual private network (VPN)
- Intranet
- Darknet
Notes published science
- Paul Baran found in the early 1960s that a network with about three links per node becomes 'extremely robust': in RAND simulations, after half the network was 'instantly destroyed', the rest reorganized itself and was routing traffic again in under a second of simulated time. His routing worked by learning from passing traffic, and he wrote that the network 'not only learned, it also had to forget' (src:baran-2002).
- Ethernet is named after the luminiferous aether of 19th-century physics, because its single shared cable carried every station's signal the way the aether was supposed to carry light; when two stations talk at once each doubles its random wait, in steps of 51.2 microseconds, and the cable's 2,500 m length limit and the 512-bit minimum frame both come from how long a collision takes to travel end to end (src:wp:ethernet, src:pd-ethernet).
- Harvester ants run something like the internet's congestion control: outgoing foragers leave at a rate set by how often foragers come back with food, and the Stanford team that modelled it (a computer scientist and an ant biologist) wrote that the process is 'analogous to those operating in many other distributed networks, from computer networks to neural integrators' (src:prabhakar-2012).
Layers
The ways it takes in its world, where they meet, and how it acts back, each from L1 (where it meets the world) up.
the boardroom (shared floors)
- L3: The network layer in every router and switch: control plane (routing table built from routing protocols, configuration and learned addresses) and forwarding plane (each packet matched against the forwarding table), with an output queue per link
- L4: Transport in the end hosts: segmentation, retransmission, flow control and congestion control; only the hosts run it
- L5: Sessions between applications: setup, checkpoint, restart, teardown
- L6: Formats, encryption and compression agreed between peers
- L7: Applications and services (web, mail, file sharing, DNS, DHCP) and management across all layers (CMIP, network management, SDN controller applications), where the owners' purposes for the network are set
the computer network as network engineers draw it: signals on the medium up to the applications people use (the OSI seven layers; reader's view)
- L1: Physical layer: signals on copper, optical fibre or radio; network interface circuits, repeaters and hubs
- L2: Data link layer: frames between directly connected nodes; medium access (CSMA/CD, CSMA/CA, token), MAC addresses, error detection (CRC-32); bridges and switches forward by MAC address
- L3: Network layer: packets addressed and routed between networks by routers; routing tables built by routing protocols (distance vector, link state) or by hand; queues at each output link
- L4: Transport layer, in the hosts: segments, end-to-end reliability, flow control and congestion control
- L5: Session layer: setting up, managing and tearing down sessions; checkpointing and restart (in the Internet, folded into applications and transport)
- L6: Presentation layer: data formats, translation, encryption and compression
- L7: Application layer: the services people use (web, email, file sharing, printing, DNS, DHCP) and the management functions that configure and monitor the network
the network as a graph: nodes, links and how they are joined (topology and robustness; secondary stack)
- L1: Nodes and links: hosts, switches and routers joined by point-to-point or multiple-access links
- L2: Topology: bus, star, ring, mesh, tree, fully connected; logical topology may differ from physical layout
- L3: Redundancy: extra links so that surviving nodes stay connected (Baran's redundancy levels)
- L4: Degree structure and its robustness to random failure and to targeted attack (contested for the router-level Internet)
- L5: Value against size: Metcalfe's n squared and its rivals (n log n, n, 2^n, n cubed)
way in: Acknowledgments returning from receivers
- L1: Acknowledgment signals on the return path, spaced by the bottleneck
- L2: Ack frames on each link of the return path
- L3: Ack packets routed back to the sending host
way in: Address resolution and configuration requests (ARP, DHCP)
- L1: A request broadcast to every station on the local network
- L2: The ARP module reads the request; the owner of the address answers; the sender's pair is cached in the translation table
way in: Hostile traffic (scans, worms, floods)
- L1: Traffic from hundreds of thousands of compromised devices, or probes and worms
- L2: Frames arriving at the network edge; port-based access control (802.1X) asks who is attaching
way in: Link and node failures, damage and cuts
- L1: A link or node stops: damage, fire, power failure, flooding, a cut
- L2: The link is found down; learned entries age out; switches reconfigure the spanning tree
way in: Load on the queues (arrivals faster than a link drains)
- L1: Several input streams arriving for one outgoing link
- L2: Frames buffered in the output queue; queue occupancy and each packet's sojourn time measured
way in: Noise, interference and attenuation (bit errors)
- L1: Noise, crosstalk, interference and attenuation corrupting bits; worse on radio
- L2: The frame check: CRC-32 over the frame; a frame that fails is discarded (or corrected where codes allow)
way in: Operators' configuration and policy
- L1: Administrators' commands and policies (static routes, access rules, VLANs)
- L2: Each device's configuration interface, or one controller program over many devices (SDN)
way in: Routing and topology messages from neighbouring switches and routers
- L1: Distance-vector advertisements every 30 s, link-state packets flooded to all, spanning-tree configuration messages between switches
- L2: Spanning-tree configuration messages read at the link: claimed root, distance to it, sender
way in: The shared medium's state: idle, busy or colliding
- L1: Energy on the shared cable or radio channel: another station transmitting, or two at once
- L2: The adaptor's medium access logic: carrier sense, collision detection (wired) or acknowledgment (radio), random exponential backoff
way in: Traffic from attached hosts and neighbouring nodes (frames and packets)
- L1: Bits arriving as voltage, light or radio on a port
- L2: The frame read at the port: preamble to synchronise, 48-bit addresses, type field naming the protocol above, data up to 1500 bytes, CRC checked
way out: Advertise routes and topology
- L1: Flooded or sent on every directly connected link
- L3: Routes or link states sent to neighbours, periodically and on change
way out: Deliver to applications and people
- L1: On the host's display or speaker, where people meet it
- L7: The receiving application gets the data (a page, a message, a file)
way out: Drop or mark (the congestion signal)
- L1: The packet never leaves; the gap travels on as a missing acknowledgment
- L3: The queue manager drops early, or marks, when the standing queue exceeds target
way out: Forward and transmit
- L1: Bits leave as voltage, light or radio
- L2: Framed and sent when the medium allows (carrier sense, backoff)
- L3: The forwarding table picks the outgoing interface
way out: Refuse (firewall, access control)
- L1: The refused traffic goes no further onto the inner links
- L3: Rules reject unrecognised sources and allow recognised ones
way out: Slow down (window reduction, backoff)
- L1: Fewer packets on the links
- L4: The sender's window shrinks on loss and grows on acks