History of the Internet

Bytes That Did Not Belong to the Value: How XDR Made Machines Agree

The Bytes That Did Not Belong to the Value: How XDR Made Machines Agree

XDR made unlike computers meet on a four-byte grid. Its most revealing rule concerned the blank spaces: zero octets could be required on the wire while remaining outside the value, a small distinction on which deterministic decoding depended.

Number That Belonged to the Operation, Not the Packet: How LDAP Message IDs Let Replies Interleave

The Number That Belonged to the Operation, Not the Packet: How LDAP Message IDs Let Replies Interleave

LDAP put a client-chosen integer on every request and echoed it across every response belonging to that operation. That small envelope field made one search into a recognizable stream, allowed several streams to cross on one connection, and exposed why identifying work is not the same as proving how it ended.

Neighbor Was Not Dead When the Cache Turned STALE: How IPv6 Waited for Positive Evidence

The Neighbor Was Not Dead When the Cache Turned STALE: How IPv6 Waited for Positive Evidence

IPv6 gave an aging cache entry a deliberately modest meaning. STALE did not announce a failure; it announced that the last proof was old, and that the next useful packet should begin a measured search for new evidence.

Cookie That Changed the Matching Law: Why SIP Branches Begin with z9hG4bK

The Cookie That Changed the Matching Law: Why SIP Branches Begin with z9hG4bK

Seven conspicuous characters in a SIP Via branch do not hide anything. They tell the receiver which generation of transaction evidence it is allowed to trust.

Server Answered Without Giving the Time: How NTP's Kiss-o'-Death Made Clients Back Off

The Server Answered Without Giving the Time: How NTP's Kiss-o'-Death Made Clients Back Off

An NTP reply could be perfectly recognizable and still be useless as time. By placing zero in the Stratum field and a short code in the Reference Identifier, a server could refuse service, report rate pressure or expose a transient condition. The packet did not enforce its own advice. Its effect depended on a client linking it to a request, interpreting the code correctly and changing local state without handing an unauthenticated sender unlimited control of the next poll.

Mask Was Public. The Bytes Were Not Predictable: How WebSocket Protected Old Proxies

The Mask Was Public. The Bytes Were Not Predictable: How WebSocket Protected Old Proxies

A WebSocket client places its 32-bit masking key beside the payload it disguises. The server can reverse the operation immediately, and so can anyone watching the path. That apparent contradiction reveals the rule's real purpose: the key was not meant to hide a message. It was meant to keep untrusted browser code from choosing, in advance, the exact bytes that an obsolete intermediary would mistake for HTTP.

Same Eight Bits Could Name Different Attempts: How RADIUS Made the Request Authenticator Carry the Rest

The Same Eight Bits Could Name Different Attempts: How RADIUS Made the Request Authenticator Carry the Rest

A network access server has already used Identifier 37, received an answer, and eventually cycles back to 37. Then an old UDP response arrives. The number matches the new request, yet it has no right to decide it. Classic RADIUS survived its 256-name space by making the visible byte only the beginning of a transaction identity: pending state, transport context, a 16-octet Request Authenticator and a shared secret carried the rest.

Newest LSA Had to Disappear Before the Oldest Could Return: How OSPF Reset Sequence Time

The Newest LSA Had to Disappear Before the Oldest Could Return: How OSPF Reset Sequence Time

OSPF gave every new instance of a link-state advertisement a larger number. The rule was simple until the largest number had already been used. A direct wrap would make the next truth look older than the last one, so OSPF turned rollover into a public ceremony: withdraw the old maximum, prove that it had left circulation, and only then begin again.

Report One Listener Could Send for a Crowd: Why IGMPv3 Ended Host Suppression

The Report One Listener Could Send for a Crowd: Why IGMPv3 Ended Host Suppression

When a multicast router asked who was listening, the first widely deployed IGMP did not want every host to answer. Each listener waited for a random interval; the first report stood for the group, and the rest went silent. That economy was sound while the only decision was whether anyone remained. It stopped being sound when reports began to carry different source preferences and switches needed port-specific evidence.

Route That Came Back as Unreachable: How RIP Used Poisoned Reverse

The Route That Came Back as Unreachable: How RIP Used Poisoned Reverse

A router learned a path from its neighbour, then deliberately told that same neighbour the path was unreachable. RIP called this poisoned reverse. The apparent contradiction bought fast escape from one kind of loop, while exposing how little any router could know about the network beyond the reports immediately around it.

Row That Existed Before It Could Be Used: How SNMP Separated Creation from Service

The Row That Existed Before It Could Be Used: How SNMP Separated Creation from Service

A network manager could write every visible cell in a configuration table and still not know whether the device had accepted a usable configuration. SNMP's answer was not to pretend that creation and operation were one event. `RowStatus` gave a conceptual row a lifecycle in which existence, readiness and service were separate claims, each narrower than the green light operators often wanted to see.

Reply That Could Not Edit the Request: How PPP Negotiated a Link

The Reply That Could Not Edit the Request: How PPP Negotiated a Link

Two machines could share a point-to-point wire and still disagree about the link they were using. PPP did not resolve that disagreement by choosing a master. Each endpoint proposed the changes it wanted, and the other endpoint could accept the proposal exactly, suggest different values, or refuse an option altogether. The link opened only after both directions had their own evidence of agreement.

Byte That Had to Repeat Itself to Remain Data: How Telnet Made Room for Commands

The Byte That Had to Repeat Itself to Remain Data: How Telnet Made Room for Commands

Telnet put a terminal's characters and the protocol's own instructions into one TCP stream. That economy created a question every parser had to answer: when the value 255 arrived, was it data or the beginning of control? Telnet's answer was that a literal 255 could cross only by appearing twice.

Lease Could Outlive One Server, but Not Its Deadline: How DHCP Moved from Renewal to Rebinding

The Lease Could Outlive One Server, but Not Its Deadline: How DHCP Moved from Renewal to Rebinding

A DHCP client does not lose its address merely because one server falls silent. It first asks the server that granted the lease, later widens the request to other authorised servers, and keeps using the address only while the existing deadline still permits it. DHCP made continuity resilient by changing who could answer as time ran out—without letting silence become an extension.

Deletion That Wasn't Real Until Goodbye: Why POP3 Waited for QUIT

The Deletion That Wasn't Real Until Goodbye: Why POP3 Waited for QUIT

A mail client could ask a server to delete a message and receive a cheerful `+OK`, yet the message still existed. That was not evasive protocol design. POP3 treated deletion first as a reversible intention, then made the final goodbye the boundary at which the server tried to carry it out.

Identifier That Could Survive a Session but Not a Rebirth: Why IMAP Needed UIDVALIDITY

The Identifier That Could Survive a Session but Not a Rebirth: Why IMAP Needed UIDVALIDITY

An email client can remember a message for months, reconnect, and find it again by number. The difficult part is not making that number stable. It is admitting when the number has stopped meaning what the client remembers. IMAP solved that problem by pairing a persistent UID with a mailbox generation called UIDVALIDITY.

A Detour Could Not Also Be a Destination: The Design of DNS CNAME

DNS could let an old name lead to a new destination, but only by making the old node surrender every ordinary answer of its own. CNAME turned that apparent limitation into a reliable instruction: cache the detour, restart the question, and keep authority over the alias separate from authority over what lies at the other end.

Bit That Refused to Make Half an Answer True: How DNS Changed Transport

The Bit That Refused to Make Half an Answer True: How DNS Changed Transport

A DNS server in 1987 had a small envelope for an ordinary reply: 512 bytes over UDP. The consequential invention was not merely a larger route. It was one bit that admitted when the envelope had failed, so a resolver would not mistake the records that happened to fit for the whole truth.

Six Bits That Could Ask but Not Command: How DiffServ Bounded Quality of Service

The Six Bits That Could Ask but Not Command: How DiffServ Bounded Quality of Service

A packet can arrive wearing the mark for expedited treatment and still enter an ordinary queue. DiffServ made that outcome legitimate by design: six header bits could select a behavior, but only the network that owned the queue could decide whether the request was trusted, provisioned and enforceable.

Mark Andrews and the DNS Server That Outlived Its Replacement

A replacement can be announced years before it becomes a migration. Mark Andrews's stewardship of BIND 9 during the BIND 10 programme shows why running infrastructure keeps imposing duties—security fixes, releases, tests and operator support—even while an institution invests in what comes next.