History of the Internet

Pool Had Spare Servers. The Session Could Not Move: RFC 2391

The Pool Had Spare Servers. The Session Could Not Move: RFC 2391

A service address can look like a place while concealing a choice. In RFC 2391, that address stood in front of a pool. A Load Sharing Network Address Translator chose one server when a new session arrived, rewrote the packets and kept both directions passing through itself. The pool might still contain healthy machines after the chosen server failed. That did not make the existing session portable. Selection happened once; the resulting binding governed every later packet until the session ended.

Jon Crowcroft and the Internet That Became One Context Among Many

The cleanest network diagram has one middle and many edges. Plutarch drew a more difficult picture. In the 2003 architecture proposed by Jon Crowcroft, Steven Hand, Richard Mortier, Timothy Roscoe and Andrew Warfield, the globally routed Internet remained useful but ceased to be the semantic centre of everything. It became one context among many. The decisive work moved to the borders, where an interstitial function had to say exactly how a name, address, route or transport behaviour crossed into a different world.

Server Listed Its Features. The Command Still Had to Succeed: RFC 2389

The Server Listed Its Features. The Command Still Had to Succeed: RFC 2389

FTP had accumulated extensions faster than clients could safely discover them. Before 1998, a client might learn whether a server understood a new command by sending it and seeing what happened. RFC 2389 inserted a quieter exchange: ask for the feature inventory first, then select an option if the relevant extension allowed it. The list reduced guesswork. It did not authenticate the server, authorize the user, reserve a resource or prove that the next command would work.

Frank Kelly and the Fairness That No Single Flow Could Prove

One connection can report its rate, delay and losses. It cannot, from those observations alone, certify that a shared network is fair. Frank Kelly's work on proportional fairness made the missing evidence precise: the claim belongs to a complete feasible allocation, not to the experience of one flow. His deeper contribution was to show how local congestion reactions might approach that global condition—and why the chosen identities, weights, constraints and feedback remain part of the proof.

Map Knew the Capacity. The Path Still Needed Admission: RFC 2386

The Map Knew the Capacity. The Path Still Needed Admission: RFC 2386

In August 1998, RFC 2386 imagined routers choosing paths from more than reachability and hop count. They might know delay, available bandwidth and the requirements of a particular flow. Yet the document refused the seductive conclusion that a better map was the same thing as capacity in hand. A route could look feasible and still be refused at setup, defeated by stale aggregation, blocked by policy or delivered below promise.

Option Protected the Segment and Trapped the Algorithm: RFC 2385

The Option Protected the Segment and Trapped the Algorithm: RFC 2385

In 1998, BGP needed a practical defense against forged TCP resets. RFC 2385 put a keyed MD5 digest into every protected segment. It also left out one small field that would shape the next decade: the packet carried proof for the configured algorithm, but no way to name another one.

URL Named the Mailbox. It Did Not Authorize the Server: RFC 2384

The URL Named the Mailbox. It Did Not Authorize the Server: RFC 2384

In 1998, a POP mailbox could be reduced to one portable string. RFC 2384 made that convenience precise, then drew a boundary that modern deep-link systems still get wrong: a reference can tell software where to go and how it might authenticate, but it cannot decide whether a stored credential should follow.

Circuit Could Drop the Messages That Kept It Alive: RFC 2382

The Circuit Could Drop the Messages That Kept It Alive: RFC 2382

The most economical control path in an ATM network could also be the most fragile: put RSVP messages on the data circuit, and traffic that broke that circuit's contract might erase the messages needed to maintain its reservation.

Circuit Reserved Resources. The Stream Still Had No Recovery: RFC 2383

The Circuit Reserved Resources. The Stream Still Had No Recovery: RFC 2383

RFC 2383 could give an ST2+ hop a dedicated ATM virtual circuit, preserve its traffic contract and receive an ATM failure indication. It still required every connection to select `NoRecover`. The network could report that a path had failed; it could not settle how a distributed set of agents should rebuild the stream.

ATM Could Carry Most of a Packet and Deliver None of It: RFC 2381

An ATM switch could spend bandwidth carrying forty-seven useful fragments and still deliver no IP datagram if the missing forty-eighth cell prevented AAL5 reassembly. RFC 2381 made that waste a question of where a network was still able to see the packet whole.

PREPARED Survived the Crash. The Proof Had to Survive Too: RFC 2372

RFC 2372 placed a quiet but consequential condition on a transaction manager’s vocabulary. Before a subordinate could say PREPARED, it was supposed to leave behind a recovery record. Before a superior could say COMMIT from that state, it was supposed to preserve another one. The message crossed a connection; the obligation had to outlive it.

Smaller Reservation Succeeded. The Larger Circuit Stayed: RFC 2380

The Smaller Reservation Succeeded. The Larger Circuit Stayed: RFC 2380

RFC 2380 allowed an RSVP request for fewer resources to be reported as a successful change even when ATM could not build the smaller replacement and the old, larger circuit remained. That 1998 rule was not sloppy accounting. It exposed the price of preserving service when protocol intent and physical allocation could not move in lockstep.

David Tennenhouse and the Packet That Asked the Router to Run Code

In the passive Internet, a packet could ask to be forwarded. David Tennenhouse and David Wetherall proposed a more demanding message: a capsule that arrived carrying, or naming, the computation it wanted the next node to perform. That change made service innovation faster in theory. It also forced a harder question into the data path. Before the router could say yes, it needed to know which program this was, who could invoke it, how much of the machine it could consume and what a safe no looked like.

Guaranteed Circuit Began with an Unguaranteed Message

The Guaranteed Circuit Began with an Unguaranteed Message

In August 1998, RFC 2379 confronted a small architectural embarrassment inside RSVP over ATM: the control message requesting reserved service was supposed to travel first across the ordinary best-effort path. That choice was not a contradiction to be hidden. It was a disciplined refusal to confuse a request, the state it created, the circuit configured in response and the service ultimately observed.

Envelope Reached the Area. The Application Still Had to Believe It: RFC 2370

The Envelope Reached the Area. The Application Still Had to Believe It: RFC 2370

RFC 2370 gave OSPF a reusable envelope for information the base routing protocol did not itself define. The envelope could be scoped, flooded, acknowledged and stored with ordinary link-state machinery. That success stopped at a precise boundary: the receiving application still had to understand the payload, decide whether it was current and useful, and turn it into an operational result.

One Record, Five Different Directories: RFC 2378

RFC 2378 described a people directory in which a field could exist without being discoverable, be discoverable without being searchable, be searchable without being returned, and be editable without being changeable over the network. The important invention was not a phone book. It was the admission that every answer is a policy-shaped view.

Link Wrote the Message. The User Still Had to Send It: RFC 2368

The Link Wrote the Message. The User Still Had to Send It: RFC 2368

RFC 2368 turned a web-era address link into a compact message template: recipient, selected headers and even a short body could arrive prefilled. Its decisive safeguard was the remaining gap. Resolving `mailto:` created a draft, not a transmission, and the user still owned the decision to edit, approve or abandon it.

Identifier Looked Like Email. It Was Not a Mailbox: RFC 2377

The Identifier Looked Like Email. It Was Not a Mailbox: RFC 2377

RFC 2377 tried to make LDAP naming deployable by borrowing names the Internet already had. Its most revealing warning concerned a value that looked perfectly familiar: `uid=mailbox-shaped-identifier` could name a directory entry without being a working email address. Reuse lowered coordination cost, but resemblance did not merge identity, directory placement and delivery.

Craig Partridge and the Gigabit That Did Not Need a New Internet

In 1989, one gigabit per second sounded large enough to indict an architecture. Craig Partridge answered by refusing to let the unit make the decision. He converted the rate into packets, instructions, memory touches, buffers and round trips, then asked which component actually failed. The exercise did not make high-speed networking easy. It made the burden of proof specific: speed alone was not a mandate to replace the Internet.

Envelope Overruled the Document: RFC 2376

The Envelope Overruled the Document: RFC 2376

RFC 2376 gave XML two places to declare its character encoding: the transport envelope and the document itself. In one common case, a missing value outside the document defeated an explicit declaration inside it. The history is a compact lesson in where protocol authority actually lives.