Skip to main content

Time Horizon

Structural

Within the Time Horizon facet, Structural time-horizon intelligence organises articles by the period over which a signal is expected to matter. The page helps readers distinguish immediate operational changes from longer-cycle governance, investment, standards, and infrastructure shifts that may unfold across quarters or years. It connects timing assumptions with public evidence, related actors, market context, customer exposure, policy pressure, and infrastructure planning so readers can judge whether a development is urgent, strategic, or still waiting on confirming evidence. The page also explains how time horizon changes the meaning of a signal, which organisations may be exposed, and which infrastructure decisions require short-term action or long-cycle monitoring.

AI editorial portrait of Leslie Daigle beside maintained archival namespace records and several separate resolution paths toward changing destinations

IETF

Leslie Daigle and the URN Namespace That Needed a Steward, Not a Resolver

A persistent name is easy to mistake for a durable hyperlink. Leslie Daigle’s work on the rules for Uniform Resource Name namespaces made the harder bargain visible: the name survives only if an institution keeps assigning it consistently, never recycles it and preserves the…

Sep 10, 2026
AI editorial portrait of Neal Cardwell beside a TCP send-time path where later delivery, a bounded reordering window and one tail probe lead to a separate recovery gate

IETF

Neal Cardwell and the Loss Detector That Trusted Time Over Duplicate ACKs

Three duplicate acknowledgments once served TCP as a rough witness to loss. They are not a clock, and they say little when a transfer ends before a third witness arrives. RFC 8985 replaces that counting habit with a temporal test: later-sent data must be known delivered, then…

Sep 10, 2026
AI editorial portrait of Shumon Huque beside a TLS DNSSEC evidence chain where a positive path changes into authenticated absence while a separate missing path stops

IETF

Shumon Huque and the Extension Pin That Promised Evidence, Not DANE Forever

A service can promise to keep answering a security question without promising that tomorrow’s answer will match today’s. That is the subtle bargain inside RFC 9102. The TLS DNSSEC Chain extension can pin a server’s obligation to deliver verifiable DNSSEC evidence, yet still…

Sep 10, 2026
AI editorial portrait of Tim Bruijnzeels beside an RPKI certificate tree whose verified branch continues while an overclaimed resource is clipped at the validation boundary

IETF

Tim Bruijnzeels and the RPKI Overclaim That No Longer Invalidated the Whole Subtree

A certificate can be wrong in one place without being worthless everywhere. That proposition sounds modest, yet it changed the failure geometry of the Resource Public Key Infrastructure. In RFC 8360, Tim Bruijnzeels and five co-authors replaced one all-or-nothing consequence with…

Sep 10, 2026
AI editorial portrait of Michael Tüxen beside a negotiated SCTP association whose zero-checksum path remains covered by alternate error detection and CRC32c fallback

IETF

Michael Tüxen and the Zero SCTP Checksum That Still Needed Error Detection

Zero usually looks like absence. In RFC 9653, a zero in SCTP's checksum field means something narrower: one endpoint may omit the correct CRC32c only after its peer has named an acceptable alternative error-detection method for that association. Michael Tüxen's work on the…

Sep 10, 2026
AI editorial portrait of Mark Handley beside two separate SDP origin lineages whose revision sequences stop at a shared boundary

IETF

Mark Handley and the SDP Version You Cannot Compare Across Origins

A controller receives two session descriptions. One places version 391 in its `o=` line, the other 402. A dashboard sorts the larger number to the top and calls it latest. The arithmetic is flawless and the conclusion can still be wrong: the two descriptions carry different…

Sep 10, 2026
AI editorial portrait of George Varghese beside unequal packet queues and carried deficit ledgers tracing a circular service round

History

George Varghese and the Deficit Counter That Made Round Robin Count Bytes

Round robin looks fair when a scheduler gives every queue one turn. On a packet link, however, turns are not equal units: one queue may send 1,500 bytes while another sends 500. M. Shreedhar and George Varghese changed the accounting unit. Deficit Round Robin lets each queue…

Sep 10, 2026
AI editorial portrait of Jennifer Rexford beside two abstract network exits, where the nearer local doorway leads to a longer uncertain downstream path

History

Jennifer Rexford and the Nearest BGP Exit That Was Never an End-to-End Optimum

An engineer changes one interior link weight. No external route is withdrawn, no new neighbour appears, and the destination prefix stays the same. Yet traffic leaves through another border router. Jennifer Rexford and her collaborators made this seam between IGP and BGP visible…

Sep 10, 2026
Three sealed evidence plates feed an anonymous classification node, which separates a ranked blank-candidate ledger at a seat cutoff from a future quota-eligibility gate and a transparent review receipt.

Story

LACNIC’s Election Commission Can Assign a Candidate to a Country They Are Not a Citizen Of

In 2025, LACNIC published an Electoral Commission candidate as a citizen of Uruguay and a resident of Brazil, then ruled that his long residence and economic activity meant he would occupy Brazil’s country slot. The official result and current roster continue to list him as…

Aug 25, 2026