H04L45/021

Congruent bidirectional Segment Routing tunnels
20220368620 · 2022-11-17 ·

Systems and methods provide congruent bidirectional Segment Routing (SR) tunnels, namely congruent and fate-shared traffic forwarding for bidirectional SR tunnels. A bidirectional SR tunnel, as described herein, includes two unidirectional SR tunnels where the forward and reverse traffic directions follow the same path through the network when forwarded based on prefix and adjacency Segment Identifiers (SIDs). The term “congruent” is used herein to refer to the fact that the two unidirectional SR tunnels, i.e., the forward and reverse traffic directions, follow the same path through the network but in opposite directions. The guarantee of congruency is based on modification of the Segment Identifier (SID) configuration at the source nodes of each tunnel. Accordingly, the present disclosure maintains compatibility with existing Segment Routing configurations with the modifications solely at the source nodes.

Congruent bidirectional Segment Routing tunnels
20220368620 · 2022-11-17 ·

Systems and methods provide congruent bidirectional Segment Routing (SR) tunnels, namely congruent and fate-shared traffic forwarding for bidirectional SR tunnels. A bidirectional SR tunnel, as described herein, includes two unidirectional SR tunnels where the forward and reverse traffic directions follow the same path through the network when forwarded based on prefix and adjacency Segment Identifiers (SIDs). The term “congruent” is used herein to refer to the fact that the two unidirectional SR tunnels, i.e., the forward and reverse traffic directions, follow the same path through the network but in opposite directions. The guarantee of congruency is based on modification of the Segment Identifier (SID) configuration at the source nodes of each tunnel. Accordingly, the present disclosure maintains compatibility with existing Segment Routing configurations with the modifications solely at the source nodes.

Die-stacked device with partitioned multi-hop network

An electronic assembly includes horizontally-stacked die disposed at an interposer, and may also include vertically-stacked die. The stacked die are interconnected via a multi-hop communication network that is partitioned into a link partition and a router partition. The link partition is at least partially implemented in the metal layers of the interposer for horizontally-stacked die. The link partition may also be implemented in part by the intra-die interconnects in a single die and by the inter-die interconnects connecting vertically-stacked sets of die. The router partition is implemented at some or all of the die disposed at the interposer and comprises the logic that supports the functions that route packets among the components of the processing system via the interconnects of the link partition. The router partition may implement fixed routing, or alternatively may be configurable using programmable routing tables or configurable logic blocks.

EFFICIENT ALGORITHM TO ELIMINATE REDUNDANT SPECIFIC PREFIXES IN FORWARDING INFORMATION BASE USING TRIE

A network element and method for programming a network element that includes detecting an update to a first route in a routing information base (RIB) is disclosed. The method includes locating a first route network prefix associated with the first route within a network prefix trie (NPT); determining that, prior to the update, a first parent network prefix and the first route network prefix were reachable using a pair of different next hops connected to the network element; and determining that, after the update, the first parent network prefix and the first route network prefix are reachable using a first common next hop connected to the network element. The method also includes removing an existing forwarding information base (FIB) entry in the FIB associated with the first route network prefix.

PLUG AND PLAY IN A CONTROLLER BASED NETWORK

In an example, there is disclosed an example of a system and method for plug and play in a controller based network. Aspects of the embodiments are directed to a network switch of a fabric network, the network switch configured to detect a connection of a device to the network switch, the device compliant with a remote integrated services engine (RISE) protocol; receive, from the device, a programming instruction for switching compliant with the RISE protocol; and distribute the programming instruction to one or more other network switches of the fabric network.

METHOD FOR CONFIGURING STREAM COMMUNICATION PATH IN NETWORK
20170331719 · 2017-11-16 ·

A method for configuring a communication path comprises: receiving a first frame requesting to configure a communication path through which a stream is transmitted; configuring a table of the first communication node based on information included in the first frame, when a second frame having a same stream identifier as a stream identifier of the first frame is not received; increasing a hop count of the first frame; and transmitting the first frame including the increased hop count.

RESILIENT ACTIVE-ACTIVE DATA LINK LAYER GATEWAY CLUSTER
20170331742 · 2017-11-16 ·

In an approach for achieving resilience and load balancing control over layer 2 gateways in a cluster, a processor forms a cluster, wherein the cluster includes one or more layer 2 gateways. A processor registers endpoints for a tenant system attached to a virtual network through a bridge network to add to an endpoint database used to associate a destination MAC address with the cluster. A processor distributes flow of data.

DATA PLANE INTEGRATION

In an example, a system and method for data plane integration is described. Aspects of the embodiments are directed to a service application connected to a switch of a network fabric and a method of data plane integration performed at a service appliance, the service appliance providing firewall functionality. The service appliance can receive a data packet from a network location; determine a flow owner of the data packet based on a hashing table; and transmit the data packet based on the determined flow owner of the data packet.

SYSTEM AND METHOD FOR FACILITATING DATA-DRIVEN INTELLIGENT NETWORK WITH INGRESS PORT INJECTION LIMITS

Data-driven intelligent networking systems and methods are provided. The system can accommodate dynamic traffic while applying injection limits to different traffic classes at an ingress edge port. The system can maintain state information of individual packet flows, which can be set up or released dynamically based on injected data. Each flow can be provided with a flow-specific input queue upon arriving at a switch. Packets of a respective flow can be acknowledged after reaching the egress point of the network, and the acknowledgement packets can be sent back to the ingress point of the flow along the same data path. Furthermore, an edge switch can dynamically allocate the ingress port bandwidth among the traffic classes that are active at a given moment.

METHOD FOR QUICK RECONFIGURATION OF ROUTING IN THE EVENT OF A FAULT IN A PORT OF A SWITCH
20170317923 · 2017-11-02 ·

A method for quick reconfiguration of routing in the event of a fault in a port of a switch including a plurality of ports, persistent memory for maintaining data corresponding to a routing table, and working memory for working on data corresponding to a routing table, includes: transmitting a first message to indicate a fault; independently updating the routing data only in the working memory by replacing an identifier of the port with the fault with an identifier of an operational port, the identifier of the operational port being selected locally; and transmitting a second message to indicate that the table was updated.