US 11,689,442 B2 · Routing in fat tree networks using negative disaggregation advertisements

Abstract

A particular fat tree network node stores default routing information indicating that the particular fat tree network node can reach a plurality of parent fat tree network nodes of the particular fat tree network node. The particular fat tree network node obtains, from a first parent fat tree network node of the plurality of parent fat tree network nodes, a negative disaggregation advertisement indicating that the first parent fat tree network node cannot reach a specific destination. The particular fat tree network node determines whether the first parent fat tree network node is the only parent fat tree network node of the plurality of parent fat tree network nodes that cannot reach the specific destination. If so, the particular fat tree network node installs supplemental routing information indicating that every parent fat tree network node except the first parent fat tree network node can reach the specific destination.

Claims20

Dependent claims

A method comprising:

obtaining a negative disaggregation advertisement indicating that a first parent tree network node cannot reach a specific destination;
determining that the first parent tree network node is an only parent tree network node of a plurality of parent tree network nodes that cannot reach the specific destination;
and
in response to determining that the first parent tree network node is the only parent tree network node of the plurality of parent tree network nodes that cannot reach the specific destination, installing supplemental routing information indicating that every parent tree network node except the first parent tree network node can reach the specific destination.

1 more element

An apparatus comprising:

a memory;
and
one or more processors coupled to the memory, wherein the one or more processors are configured to:
obtain a negative disaggregation advertisement indicating that a first parent tree network node cannot reach a specific destination;
determine whether the first parent tree network node is an only parent tree network node of a plurality of parent tree network nodes that cannot reach the specific destination;
and
if it is determined that the first parent tree network node is the only parent tree network node of the plurality of parent tree network nodes that cannot reach the specific destination, install supplemental routing information indicating that every parent tree network node except the first parent tree network node can reach the specific destination.

4 more elements

One or more non-transitory computer readable storage media encoded with instructions that, when executed by a processor, cause the processor to:

obtain a negative disaggregation advertisement indicating that a first parent tree network node cannot reach a specific destination;
determine whether the first parent tree network node is an only parent tree network node of a plurality of parent tree network nodes that cannot reach the specific destination;
and
if it is determined that the first parent tree network node is the only parent tree network node of the plurality of parent tree network nodes that cannot reach the specific destination, install supplemental routing information indicating that every parent tree network node except the first parent tree network node can reach the specific destination.

1 more element

Dependencies are inferred from the claim text.

Routing in fat tree networks using negative disaggregation advertisements

Life of this patent

Routing in fat tree networks using negative disaggregation advertisements

Life of this patent

Abstract

Claims20