The present disclosure relates to apparatus and methods for route invalidation. In one example method, a common ancestor node of a network determines switching of a parent node of a node based on an update message received from the node using a new routing path established based on the switching of the parent node. The common ancestor node generates a No-Path message based on the update message. The No-Path message is for invalidating a previous routing path associated with the node on the switching of the parent node. The update message comprises at least one bit authorizing generation of the No-Path message by the common ancestor node. The at least one bit is placed in a transit information option in the update message.

A router policy server may include a policy engine. The policy engine may receive, from a first router, a request for whether to accept or reject routing information received from a second router and determine whether a policy, associated with the second router, allows the second router to advertise the routing information. The policy engine may further instruct the first router to accept the routing information when the policy allows the second router to advertise the routing information and may instruct the first router to reject the routing information when the policy does not allow the second router to advertise the routing information or when no policy exists for the second router in association with the policy engine.

Techniques for routing network traffic in a storage processor involve providing per-IP routing tables for each IP address of a virtual server and a per-server routing table. These per-IP and per-server routing tables specify its own interface(s) with external network(s). The storage processor assigns each outbound protocol data unit (PDU), generated by a particular virtual server, to either a per-IP routing table or a per-server routing table provided for that virtual server. The assignment of the routing table is based on source IP address or a connection mark associated with an outbound PDU. The per-IP or per-server routing table(s) identifies an interface through which the packet is routed to the destination IP address.

An information processing apparatus includes a first memory, a second memory, and a control circuit. The first memory stores a first table where entries, which indicate forwarding methods for packets, are stored at positions corresponding to hash values calculated from header information of the packets. The second memory stores a second table that is larger than the first table. The control circuit detects, when the first table is updated, a conflict state where there is conflict between storage positions of different entries in the first table. The control circuit moves entries stored in the first table to the second table in response to the detecting of the conflict state. The control circuit detects resolution of the conflict state when the second table is updated. In response to the detecting of the resolution, the control circuit moves the entries stored in the second table to the first table.

Examples of the present disclosure may provide a migration method. An emigration TR may receive a map notify message carrying a mapping relationship between an EID of the host and an RLOC of an immigration TR. The emigration TR may make a determination as to whether the RLOC of the immigration TR is same as an RLOC of the emigration TR. The emigration TR may search for an RLOC of a remote TR if the RLOC of the immigration TR is different from the RLOC of the emigration TR. The emigration TR may send an SMR message to the remote TR using the RLOC of the remote TR.

A method allows each individual node in the multi-node computing system to detect the topology of the computing system. Each individual node detects its own connections with neighboring nodes directly connected to the individual node, and sends out a topology packet on all of its interfaces with a local topology change indicator that increments with each topology packet sent out. Each individual node stores their own topology table with an entry for each node from which it has received a topology packet, including the local topology change number which enables the node to determine whether a received topology packet is more recent than data already stored in the topology table. Each node updates its topology table with new topology data, forwards new topology data, and sends back acknowledgements to a source node only upon receiving acknowledgements from all other nodes.

A process is implemented by a network device for enabling the provisioning of explicit trees in a network by reporting link aggregation group (LAG) configuration information to a path computation element (PCE). The network device implements a LAG module and an intermediate system-intermediate system (IS-IS) module that includes an IS-IS path control and reservation module (ISIS-PCR). The process includes reporting LAG configuration by the LAG module to the IS-IS module within the network device, sending a link state protocol data unit (PDU) (LSP) with the LAG configuration in a LAG sub type length value (TLV) by the ISIS-PCR, receiving, by the IS-IS module, an explicit tree that specifies at least one virtual local area network (VLAN) identifier (VID) to an aggregation link of the LAG assignment, and translating, by the ISIS-PCR module, the explicit tree into a LAG configuration, the LAG configuration specifying a conversation to aggregation link assignment.

A system for creating a session entry and forwarding an IP packet includes memories that store session and session template tables, and first and second processors in communication with the memories. When the first processor receives the IP packet, it determines whether the session table includes a session entry corresponding to the IP packet. If the session table does not include the session entry, the first processor determines whether the session template table includes a session template entry corresponding to the IP packet. The first processor generates the session entry using the session template entry and the IP packet. If the session template table does not include the session template entry, the first processor forwards the IP packet to the second processor, which generates the session template entry and the session entry.

In some embodiments, a first network device in a first site sets a first IP address for an interface of the first network device to a value of a second IP address of a second network device in a second site. Policies are added in a policy table to cover IP addresses used in the second site and a specific route for a third IP address associated with a first workload migrated from the second site to the first site is added into a routing table. The first workload is on a stretched network that is coupled via a layer 2 channel. The policy table configures the first network device to send a second packet from the first workload to a third workload in the second site via the layer 2 channel when an IP address for the third workload does not match an eligible route in the routing table.

In some embodiments, a first network device in a first site sets a first IP address for an interface of the first network device to a value of a second IP address of a second network device in a second site. Policies are added in a policy table to cover IP addresses used in the second site and a specific route for a third IP address associated with a first workload migrated from the second site to the first site is added into a routing table. The first workload is on a stretched network that is coupled via a layer 2 channel. The policy table configures the first network device to send a second packet from the first workload to a third workload in the second site via the layer 2 channel when an IP address for the third workload does not match an eligible route in the routing table.