Summary

  • RFC 5311 expands the 256-LSP ceiling by letting one physical Originating System issue Extended LSP sets under unique Additional System IDs. Those Virtual IS identities are storage and compatibility constructs, not independent routers.
  • The safe unit is the whole association: live Extended LSP zero, IS Alias ID, area subset, zero-cost parent-to-virtual edge, non-zero virtual-to-parent edge, parent overload state, content restrictions and deterministic precedence. Seeing an Extended LSP fragment proves none of that chain by itself.

The new node was a capacity instrument

The link-state database appeared to discover another router. It had a system ID, an LSP set and information that could be flooded and aged like ordinary state. Yet no rack gained a chassis, no maintenance team acquired another failure domain and no independent process assumed authority. One physical IS had been assigned another identifier so it could publish beyond the normal fragment ceiling.

That distinction is the heart of RFC 5311. IS-IS gives an LSP set 256 possible LSP numbers, and the document cites a maximum LSP value of 1492 bytes. Traffic-engineering attributes, multi-topology reachability and capability information can exhaust that bounded carrying space. Additional System IDs create more sets. The design succeeds only if every receiver continues to understand the synthetic identity as an appendage of the physical origin.

The temptation is to persist the Virtual IS as another ordinary node. That makes queries easy and the graph visually tidy. It also invents authority. Capacity identity, physical identity, topology identity and current reachability are different facts. RFC 5311 spends most of its mechanism keeping them from collapsing.

LSP zero is the admission ticket for the whole set

Extended LSPs follow the usual update rules for generation, flooding and purge. One condition is exceptional in its consequence: if Extended LSP number zero with remaining lifetime greater than zero is absent for an Additional System ID, none of the other LSPs in that Extended set is processed.

Fragment zero is therefore not merely the first page of a larger record. It is the live admission ticket for every other fragment under that synthetic origin. A collector that retains fragments 1 through 255 after zero has expired can display authentic bytes that receivers are no longer permitted to use.

Extended LSP zero must contain IS Alias ID TLV 24. The TLV identifies the normal system ID of the Originating System and supplies the parent link that the raw Additional System ID cannot express. LSP zero must also include Area Address information whose set is a subset of the corresponding normal LSP-zero set; syntactic identity is preferred. The useful object is thus not additional-system-id -> attributes. It is additional-system-id -> live zero -> alias -> normal origin -> applicable area and level.

Uniqueness belongs in the same receipt. An Additional System ID must be unique throughout a Level 1 area when used at Level 1, and throughout the domain when used at Level 2. A configuration system that checks uniqueness only per chassis can create two perfectly well-formed claims to the same virtual identity.

The two synthetic edges deliberately have different costs

The Original LSP set must advertise a neighbor to each associated Virtual IS. That edge uses metric zero. It makes the two-way connectivity check succeed and ensures the cost to reach the Virtual IS is the cost to reach its physical Originating System.

The Extended LSP set must advertise the reverse relationship back to the Originating System with a non-zero metric, preferably MaxLinkMetric-1. For multi-topology operation, both sides must include the corresponding neighbor advertisement for every topology represented in the Extended set.

These are not two observations of a physical cable. They are constrained graph scaffolding. The zero-cost direction attaches extra information capacity to the real node. The high-cost return prevents the virtual node from becoming a normal transit shortcut. A topology store that normalizes both edges into one undirected adjacency erases the compatibility proof.

RFC 5311 differs from RFC 3786 by restricting Extended LSP contents so they do not affect construction of the shortest-path tree. A legacy implementation sees a Virtual IS reachable only through its Originating System and sees no other system reachable through that Virtual IS. Its SPF result therefore remains consistent with the result of an extension-capable implementation without special operating modes or a logical merge during SPF.

The extra space is not permission to put every fact there

The standard forbids ES Neighbors TLV 3, Partition Designated Level 2 IS TLV 4 and Prefix Neighbors TLV 5 in Extended LSPs. A capable receiver must ignore any such prohibited TLV, should report an error and must continue processing the other permitted information in the set. The invalid field does not automatically invalidate the entire synthetic origin.

IS neighbor reachability is even narrower. In an Extended LSP it may identify only the Originating System. Ordinary neighbor relationships remain in the Original LSP set. TLV 23 and MT TLV 223 can move neighbor attributes into Original or Extended LSPs, but they cannot create the underlying adjacency. Without TLV 22 or TLV 222 in the Originating LSP set for that neighbor, the attributes must not be used to infer that a neighbor exists.

The distinction mirrors a durable authority boundary: attributes can describe a relationship; they do not create the relationship. Authentication can prove who originated those attribute bytes, but it cannot widen their normative role.

OL, ATT and Partition Repair bits must all be zero in Extended LSPs. The ATT restriction exposes the reason. A legacy system would interpret a set ATT bit normally and might use the Virtual IS as a default exit even though the physical Originating System was not attached to another area. A synthetic identity must not acquire routing authority that its parent does not hold.

Leaf information turns storage expansion into forwarding input

RFC 5311 allows leaf reachability in Extended LSPs: traditional internal and external IP reachability, extended IP reachability, multi-topology IP, IPv6 and multi-topology IPv6. When multiple topologies appear, MT TLV 229 must enumerate every topology represented by leaf advertisements.

Once leaf information moves into an Extended set, receivers must process it to update the forwarding plane. The RFC warns that this can increase the frequency of events that trigger forwarding updates and recommends keeping leaf information in the normal LSP set where possible. More database capacity has therefore crossed an operating boundary: some extra fragments are no longer descriptive inventory alone; they can cause RIB and FIB work.

The receipt has to identify which fragment and synthetic origin carried the leaf, which live LSP zero admitted it, which parent OL state applied, which topology contained it, and which RIB and FIB generation consumed it. Merely counting Extended LSPs hides the difference between non-SPF attributes and information required for packet forwarding.

The parent's overload state reaches every virtual child

Non-SPF information can become stale or leak after its origin is no longer reachable. RFC 5311 therefore makes physical-origin reachability part of the decision to use information attributed to a Virtual IS. While the Originating System does not set overload in its normal LSPs, reachability to its Virtual ISs is consistent with reachability to the parent.

When the parent sets OL, legacy routers see the associated Virtual ISs as unreachable and stop using their information. Extension-capable routers must reach the same conclusion. This alignment avoids potential loops when leaf information is carried in Extended LSPs.

The result is subtle. Extended LSPs themselves must keep their OL bit at zero, yet their usability is governed by OL on another identity's normal LSP. A database query that filters only on the synthetic record will report healthy-looking Extended LSPs at exactly the moment their parent has withdrawn them from useful reachability.

That is why the Virtual IS must not become a detached entity in observability. Its lifetime, alias, level, area, parent reachability and overload generation form one compound state.

Conflict resolution is provenance, not cleanup

Neighbor attributes may be distributed while a network migrates them between normal and Extended sets. Non-conflicting values are additive. When values conflict, information in the Original LSP wins. If the Original set has no value, the Extended LSP belonging to the lowest system ID wins.

There is another priority within the same context: TLV 22 overrides TLV 23, and TLV 222 overrides TLV 223 for the same multi-topology identifier. The attribute forms add carrying space without superseding the neighbor-reachability forms that establish the relationship.

A normalization layer that emits only the winning value destroys the reason it won. Keep every candidate, source LSP ID, normal or additional system ID, TLV type, MTID, sequence, lifetime and conflict rule. Otherwise a later change in one fragment looks like unexplained oscillation, and an operator cannot distinguish a legitimate precedence transition from stale information.

The RFC says later protocol extensions may place new TLVs in Extended LSPs, but legacy consumption of those facts will be limited. An implementation revised to understand the new TLV should also understand RFC 5311 so it can process the information in either normal or Extended space. Registry permission and byte recognition still do not prove fleet-wide interpretation.

A useful receipt follows the physical owner

A non-secret receipt can bind the physical Originating System and normal system ID; level and area; every Additional System ID and its uniqueness scope; Extended LSP-zero identity, sequence, lifetime and purge state; Alias TLV; Area Address subset; original-to-virtual zero-metric edge; virtual-to-original non-zero edge; per-topology membership; prohibited-TLV checks; OL/ATT/P checks; leaf and neighbor-attribute fragments; all competing attribute values and precedence; parent OL generation; RIB/FIB generations; packet observations; and rollback decision.

This record makes a category mistake visible. The database gained another origin because the protocol needed more numbered containers. The network did not gain another independent machine. Treating the symbol as the physical reality breaks the very compatibility model that made the symbol safe.

Sources