Topic
Software Lifecycle and Lock-in
Within the Topic facet, Software Lifecycle and Lock-in topic intelligence connects articles that share a specific subject, signal focus, or monitoring theme. The page gives readers a richer path through related reporting, source evidence, market actors, and infrastructure implications, with enough context to understand why the topic matters across company movements, governance decisions, regional exposure, and operational risk. Readers can compare recurring signals, affected organisations, public evidence, market context, service continuity, procurement, competition, compliance, and strategic planning questions behind the subject instead of stopping at a thin list of matching articles. It explains what the topic covers, which infrastructure actors or policies are involved, what evidence supports the coverage, and why the subject may matter for operators, customers, investors, and policy readers.
IETF
The Envelope Parsed. The Observation Is Not Yet Proven
`draft-ietf-netconf-notif-envelope-05` gives YANG-Push notifications a header that can travel with the message. That makes correlation easier. It does not collapse identity, continuity, time, provenance and operational truth into one successful parse.
History
The Root Server Became a Stack of Receipts: RFC 2010
RFC 2010 turned confidence in a capable root-server volunteer into inspectable duties—from checksums and clocks to capacity, contacts and outage notices—without deciding who deserved the role.
History
The Message Opened. That Did Not Mean the Evidence Was Complete: RFC 1991
An early PGP message could pass through six visibly successful operations—ASCII decoding, packet parsing, session-key recovery, decryption, decompression and signature verification—without any one of them proving who controlled the key, when the act occurred, whether it was…
CASE FILE
The Two Routes Arrived. Their Bits Still Did Not Belong Together: RFC 9819
An ingress PE can possess the two BGP advertisements required to construct an SRv6 Service SID and still lack permission to treat their bits as one executable instruction. RFC 9819 makes the missing proof visible: identity, argument size, insertion boundary, local acceptance…
CASE FILE
The Datastore Was Complete. The Control Plane Was Still Unproven: RFC 9826
A clean PCEP management tree can show an entity, its peers, live-looking sessions, notifications and counters in one coherent view. That coherence is a major operational gain. It is also where evidence from a management projection is most easily mistaken for proof of the network…
IETF
The Message Reassembled. The Telemetry May Still Be Incomplete
`draft-ietf-netconf-udp-notif-26` makes high-frequency YANG notifications cheaper to move across a controlled network. It also makes an important distinction unavoidable: transport evidence can show what a receiver assembled, but only a wider chain can show what the network…
History
The Address Was Borrowed. The Route Was Never Included: RFC 2008
The Address Was Borrowed. The Route Was Never Included: RFC 2008 intelligence summary explains the development, the public evidence available to readers, the organisations involved, the regional context, market exposure, and the infrastructure consequences that may follow. The…
IETF
The First Packet Left Before the Image Existed. It Still Did Not Prove Low Latency: RFC 9828
A sender can now begin carrying a JPEG 2000 image while that image is still being encoded. That is a useful reduction in one waiting stage. It is not a receipt for the time at which a receiver recovered, decoded and displayed a usable picture.
Creators
Ivan Pepelnjak and the discipline of testing network automation
Ivan Pepelnjak’s career runs from Slovenia’s early internet and exchange infrastructure to ipSpace.net and the open-source netlab project. His recurring argument is practical: automation becomes trustworthy only when intended state is modelled explicitly, vendor claims are…
IETF
The Merge Was Clean. The Baseline May Not Be: NETCONF Private Candidates
`draft-ietf-netconf-privcand-10` gives each client a private place to prepare configuration and a defined way to detect and resolve overlap before commit. The operational mistake would be to let isolation, an empty comparison or a successful merge inherit authority over…
History
One Router Drew the Path. No Router Needed the Whole Map: RFC 1992
Nimrod’s sharpest scaling decision was to abandon the comforting fiction of a single, complete map: knowledge could be partial, private and stale, provided that a chosen path did not depend on every router improvising from a different picture.
IETF
The Transform Was Agreed. The Replay Was Not Yet Rejected: RFC 9827
RFC 9827 gives IKEv2 a broader and more honest contract for packet sequence numbers. The selected Transform ID describes what should be true when an SA's packets enter the network; it does not certify sender coordination, receiver anti-replay policy, the packet stream that…
IETF
A Diagnostic Plan Is Not a Root Cause: Eight Receipts for Scheduled OAM
`draft-ietf-opsawg-scheduling-oam-tests-07` makes network diagnosis programmable as timed, ordered test sequences. The discipline begins when operators refuse to let a stored plan, a green status or a returned metric stand in for the execution, causality, authority and outcome…
IETF
The color matched. The proof did not: RFC 9832’s transport-class evidence chain
Three BGP fields can carry the same 32-bit value and still answer different questions. RFC 9832 supplies an ordered mechanism for classful transport; operators still need a chain of receipts proving which namespace, attribute, database, fallback and forwarding state actually…
History
The Grant Was Automatic. The Boundary Was Not: RFC 1988
RFC 1988 removed the need to ask Hewlett-Packard for the same narrow permission implementation by implementation. It did not remove the perimeter around that permission—or the switch that could end it.
History
The Packet That Could Not Be Decrypted: RFC 1969’s Cross-Packet Chain
A lost encrypted packet in RFC 1969 did more than remove its own contents. It also took away the input needed to decrypt the next packet—yet the ciphertext of that unreadable successor carried enough state to let the receiver continue after it. This peculiar two-packet shadow…
IETF
The watts fell. The proof did not: RFC 9845 and the green-network control loop
A power graph can move down while the network’s carbon cost, workload allocation and service risk remain unknown. RFC 9845 makes visibility useful; it does not let one meter speak for the whole system.
History
The Uncompressed Packet That Changed the Dictionary: RFC 1967
An LZS-DCP packet can arrive with its data plainly uncompressed and still alter the shared state needed to decode the next compressed packet. RFC 1967 made that choice explicit, split state into numbered histories, and carried recovery signals inside later data packets. The…
IETF
CMIS Revision 04 Adds Control Handover but Leaves the Last Write Unsettled
Imagine a remote optical controller starting a three-register tuning sequence. Before the final write lands, the host removes that CMIS page from the remote-write allowlist and restores its own configuration. Which system owns the half-finished state? Revision 04 of a new IETF…
IETF
Revision 04 Promises UUID Identity, but Its Energy Schema Still Points to a Local Name
A data model can be syntactically valid and still give readers two different answers to the same governance question. Revision 04 of the IETF GREEN power-and-energy YANG draft says its component reference is bound to a globally unique UUID. The module printed a few pages later…