Domain Names - Concepts and Facilities
Paul Mockapetris
Replaces a single flat host table with a distributed, hierarchical namespace delegated across independently administered zones.
link checked 17 Sept 2026Moving bits between machines that do not trust each other.
11 topics · 34 curated works
No prior grounding assumed.
Domain Names - Concepts and Facilities
Paul Mockapetris · 1987
Replaces a single flat host table with a distributed, hierarchical namespace delegated across independently administered zones.
+3 more at this level
Assumes you know the vocabulary.
Internet Protocol
Jon Postel · 1981
Specifies a connectionless, best-effort packet delivery service and pushes reliability entirely to the endpoints, the decision that let heterogeneous…
+10 more at this level
Primary sources and full treatments.
A Protocol for Packet Network Intercommunication
Vinton G. Cerf & Robert E. Kahn · 1974
Proposes that networks of different technologies interconnect by agreeing only on how gateways pass packets between them, the design that became…
+18 more at this level
12 of 34 works
Paul Mockapetris
Replaces a single flat host table with a distributed, hierarchical namespace delegated across independently administered zones.
link checked 17 Sept 2026Tim Berners-Lee
Proposes a hypertext system that links documents across a heterogeneous set of existing systems rather than replacing them, becoming the founding proposal for the web.
link checked 17 Sept 2026Larry L. Peterson & Bruce S. Davie
Teaches networking bottom-up by asking what problem each layer solves, rather than by having a reader memorise the OSI stack from the outside.
link checked 17 Sept 2026Stuart Cheshire
Argues that many performance problems blamed on insufficient bandwidth are actually caused by latency, which no amount of added bandwidth can fix.
link checked 17 Sept 2026Jon Postel
Specifies a connectionless, best-effort packet delivery service and pushes reliability entirely to the endpoints, the decision that let heterogeneous networks interconnect without central coordination.
link checked 17 Sept 2026Jon Postel
Specifies a reliable byte stream built on top of IP's unreliable datagrams using sequence numbers, acknowledgements and a sliding window, and remains the base that every later congestion-control scheme modifies rather than replaces.
link checked 17 Sept 2026David D. Clark
Argues the internet's protocols were shaped by an explicit priority ordering - survivability first, efficiency and cost last - and that this ordering explains design choices that otherwise look arbitrary.
link checked 17 Sept 2026Roy Fielding et al.
Formalises persistent connections, caching and content negotiation that ad hoc HTTP/1.0 deployments had already improvised, turning informal practice into an interoperable standard.
link checked 17 Sept 2026Jaeyeon Jung, Emil Sit, Hari Balakrishnan & Robert Morris
Measures real DNS traffic to show that caching absorbs most load even with low time-to-live values, but that a small share of misbehaving clients generates a disproportionate share of failed lookups.
link checked 17 Sept 2026Stuart Staniford, Vern Paxson & Nicholas Weaver
Models how fast a well-engineered worm could spread across the whole internet, arguing existing defences could not react in time and that automated countermeasures were the only feasible response.
link checked 17 Sept 2026Bram Cohen
Argues a tit-for-tat exchange of pieces between peers, rather than altruism, is what keeps a swarm functioning even when every peer acts purely in its own interest.
link checked 17 Sept 2026Michael J. Freedman, Eric Freudenthal & David Mazières
Shows a self-organising peer-to-peer network of caches can give any web publisher the load-shedding benefit of a commercial content delivery network without paying for one.
link checked 17 Sept 2026