Summary

  • RFC 5311 lets a physical IS originate extra LSP sets through unique Additional system-ids, but restricts those sets so they cannot independently reshape the Shortest Path Tree.
  • Fragment zero, alias binding, originator reachability and precedence rules remain decisive: TLV 23 can describe a neighbor's attributes, yet cannot prove that the neighbor exists without TLV 22 in the Original LSP set.

Capacity was the problem, not a shortage of routers

Classic IS-IS gives a system at most 256 LSP fragments per level, with each fragment bounded by the 1492-byte originating buffer size. Multi-topology state, traffic-engineering attributes and router capabilities made that finite envelope feel smaller. RFC 5311's answer is not to pretend that another physical router has joined the network. It assigns the same Originating System an Additional system-id and lets it publish another Extended LSP set.

That distinction governs the whole design. The Additional system-id must be unique in the Level-1 area or Level-2 domain, but uniqueness does not make the Virtual IS an independent machine. It is a namespace used by the original router to gain another set of numbered fragments. The protocol therefore needs receipts for both allocation and parentage: who assigned the identifier, where uniqueness was checked, which Normal system-id owns it, and which fragment binds the two.

The binding sits in Extended LSP number zero. That fragment must contain IS Alias ID TLV 24 naming the Normal system-id. More importantly, if number zero with positive remaining lifetime is absent, none of the other fragments in that Extended set may be processed. A collector that displays fragment 17 while fragment zero is missing has observed bytes, not a valid set.

This is a useful model beyond routing. Increasing storage or message capacity does not automatically increase the authority of each new container. The new container inherits an origin, admission rules and a completeness condition.

The virtual identity is fenced away from SPF authority

RFC 5311's simplification over RFC 3786 comes from a strong restriction: Extended LSPs carry information that does not affect Shortest Path Tree construction. Legacy routers can see the Virtual IS as reachable only through the Originating System, while capable routers understand the alias relationship. Both arrive at compatible topology because the extra set is prevented from becoming a second topological speaker.

The fences are specific. ES Neighbors, Partition DIS and Prefix Neighbors TLVs must not appear. A capable receiver ignores those forbidden TLVs and should report the error, while processing the rest of the allowed content. OL, ATT and Partition Repair bits must be zero. An ATT bit on a Virtual IS could otherwise persuade an older router that the synthetic identity is an exit from the area when the physical originator is not.

Area addresses in Extended fragment zero must be a subset of those in the corresponding Normal fragment zero. Neighbor reachability inside the Extended set is confined to the Originating System, with a non-zero metric that should be MaxLinkMetric-1. The Original set advertises the reciprocal Virtual IS with metric zero. Those asymmetric values are deliberate scaffolding: they make the extra information reachable without granting it an independent route through the network.

Leaf prefixes are permitted, but their allowance is not casual. The required virtual-to-originator relationship must exist, and multi-topology fragment zero must enumerate every topology represented by leaf advertisements. The extra container may therefore affect forwarding updates, yet only through a tightly defined parent relationship.

An attribute record cannot create the relationship it describes

The sharpest authority rule concerns neighbor metadata. TE sub-TLVs can become too large for one reachability TLV. RFC 5311 creates IS Neighbor Attribute TLV 23 and MT IS Neighbor Attribute TLV 223 so attributes can live in Original or Extended LSPs without duplicating the reachability object inside SPF.

Their format resembles TLV 22 and TLV 222, but their authority is narrower. TLV 23 or 223 must not be used to infer that a neighbor relationship exists. The corresponding TLV 22 or 222 in the Original LSP set must first advertise the neighbor. The attribute container can say what a known link is like; it cannot make the link real.

Precedence makes that separation executable. Nonconflicting attributes across sets are additive. On conflict, a value in the Original LSP wins. If the Original set has no value, the Extended set with the lowest system-id wins. When TLV 22 and TLV 23 both carry the same neighbor/link/attribute, TLV 22 wins and TLV 23 is ignored; the same rule pairs 222 with 223.

An inventory system that flattens all TLVs into a single undifferentiated row destroys these rules. It can make stale secondary data look authoritative, turn a tie-break into consensus, or infer adjacency from metadata that the RFC explicitly denies that power. Provenance must survive parsing: system-id, set, fragment, TLV kind, parent originator, remaining lifetime and the reason one value prevailed.

Reachability withdraws the borrowed authority

Extended information must not outlive the physical system that generated it. When the Originating System is reachable and its Normal LSP is not overloaded, reachability to the Virtual IS tracks the parent. If the Originating System sets OL in the Normal LSP, capable routers must also treat its Virtual ISs as unreachable, matching what legacy routers already conclude.

That rule prevents leaf reachability from surviving in a way that could create loops. It also shows why a fresh checksum on an Extended fragment is insufficient evidence. The fragment can be internally valid while its parent is overloaded, its fragment zero has expired, its alias binding is absent, or a higher-authority Original value contradicts it.

Moving leaf information into Extended sets has a further cost. Those prefixes must be processed to update forwarding, and changes can increase the frequency of FIB updates across the network. RFC 5311 therefore recommends keeping leaf information in the Normal set when possible. More space is not free space: it changes failure and update surfaces.

Scope and uncertainty

RFC 5311 is a Standards Track specification from February 2009. It defines protocol behavior, not a census of current support or proof that a particular router allocates identifiers safely, reports forbidden TLVs, retains precedence provenance or installs forwarding correctly. Later uses of its TLVs, including segment-routing and flex-algorithm contexts, do not retroactively prove those outcomes.

RFC 5305's TE article asks whether advertised resources became commitments. This article asks a different prior question: which container had authority to describe the link at all? RFC 5303 addresses reciprocal adjacency state; here, attribute TLVs are forbidden from creating adjacency. RFC 9666's Area Proxy deliberately presents a summarized public identity; RFC 5311's Virtual IS is instead a constrained capacity device tied to one originator.

For a live claim, retain the identifier allocation record, uniqueness scan, Normal and Extended fragment-zero snapshots, alias TLV, remaining lifetimes, forbidden-field scan, originator OL state, original reachability TLV, all competing attribute values and the selected winner. Then inspect SPF input, RIB/FIB changes, packet observation and service result separately. Extra pages expand what can be said. They do not decide what is true.

Sources