In some embodiments, a method receives a control message from a second host. The control message includes a first address to use as a next hop to reach an active workload that has migrated to the second host from another host. The method reprograms a local route table to include a policy to send packets to check a liveness of the active workload with the next hop of the first address. A packet is sent from a standby workload to the active workload using the next hop of the first address to check the liveness of the active workload. The packet is encapsulated and sent between the first host and the second host using an overlay channel between a first endpoint of the overlay channel on the first host and a second endpoint of the channel on the second host.

In some embodiments, a method receives a control message from a second host. The control message includes a first address to use as a next hop to reach an active workload that has migrated to the second host from another host. The method reprograms a local route table to include a policy to send packets to check a liveness of the active workload with the next hop of the first address. A packet is sent from a standby workload to the active workload using the next hop of the first address to check the liveness of the active workload. The packet is encapsulated and sent between the first host and the second host using an overlay channel between a first endpoint of the overlay channel on the first host and a second endpoint of the channel on the second host.

There is disclosed in one example a method of a work node synchronously load balancing to a multi-node service having an expected maximum of n work nodes, including: provisioning a flow table having m bucket groups, m≥1, the bucket groups including n slots each; enumerating a static integer self-identification id.sub.0; initializing the flow table with id.sub.0 in each slot; performing a discovery iteration, including: discovering a peer device; enumerating a static integer identification id.sub.x for the peer device; assigning id.sub.x to each slot corresponding to a home position for the peer device; and load balancing slots not assigned to a home position according to a deterministic algorithm; and discovering additional nodes and performing discovery iteration for the additional nodes.

There is disclosed in one example a method of a work node synchronously load balancing to a multi-node service having an expected maximum of n work nodes, including: provisioning a flow table having m bucket groups, m≥1, the bucket groups including n slots each; enumerating a static integer self-identification id.sub.0; initializing the flow table with id.sub.0 in each slot; performing a discovery iteration, including: discovering a peer device; enumerating a static integer identification id.sub.x for the peer device; assigning id.sub.x to each slot corresponding to a home position for the peer device; and load balancing slots not assigned to a home position according to a deterministic algorithm; and discovering additional nodes and performing discovery iteration for the additional nodes.

In some example embodiments there is provided a method. The method may include detecting, by a router coupling a first mesh network to at least one other mesh network, a mesh packet having a destination node in the at least one other mesh network; receiving, at the router, an internet protocol address of at least one other router, wherein the internet protocol address is received in response to querying for the destination node; and sending, by the router, the mesh packet encapsulated with the internet protocol address of the at least one other router coupled to the at least one other mesh network including the destination node.

The disclosed computer-implemented method for improving forwarding capabilities during route convergence may include (1) identifying, at an upstream network device, a set of updated routes that define network paths that have each experienced at least one topology change since the upstream network device last converged with a downstream network device, (2) determining, at the upstream network device, levels of priority for the set of updated routes based at least in part on amounts of traffic that traverse the network paths defined by the set of updated routes, (3) arranging, at the upstream network device, the set of updated routes in a prioritized order in accordance with the levels of priority, and then (4) converging the upstream network device with the downstream network device by sending the set of updated routes in the prioritized order to the downstream network device. Various other methods, systems, and apparatuses are also disclosed.

An example of a distributed system partition can include a method for client service in a distributed switch. The method can include maintaining local and global connection state information between a primary and a secondary controlling fibre channel (FC) over Ethernet (FCoE) Forwarders (FCFs) or FC forwarder in a distributed switch. A partition in the distributed switch can be detected and service to subtended clients of the distributed switch can continued using local state information.

The disclosed computer-implemented method for forwarding network traffic using minimal Forwarding Information Bases (FIBS) may include (1) identifying a Routing Information Base (RIB) that includes a set of routes that define paths to destinations both inside and outside a network and then (2) creating a FIB that includes a subset of active routes whose size is below a size threshold by (A) importing, from the set of routes within the RIB, (I) internal routes that define paths to destinations inside the network, (II) high-traffic external routes that define paths to destinations outside the network, and (III) a default route that defines a path to a default node that facilitates resolution of traffic that does not match any of the internal or high-traffic external routes and (B) excluding, from the FIB, low-traffic external routes that define paths to destinations outside the network. Various other methods, systems, and apparatuses are also disclosed.

A router of a content centric network (CCN) can forward messages using anonymous identifiers. The router can receive an Interest via a first interface, and determines a first anonymous identifier (AID) that identifies a name-independent path to the Interest's source via the router. The router can identify a second interface for forwarding the Interest to a next-hop neighbor via CCN, and performs a bijective function on the first AID to obtain a second AID that is to be used by the next-hop neighbor to return a corresponding data packet to the router. The router updates the Interest to include the second AID, and forwards the Interest via the second interface toward the next-hop neighbor. When the router receives the data packet, the router performs a lookup operation in an anonymous routing table (ART), based on the AID, to determine an interface for forwarding the data packet toward the Interest's source.

A method for controlling a plurality of network interfaces of an electronic device includes: providing at least one table comprising information associated with a plurality of routing costs, wherein the routing costs correspond to at least paths between each of the network interfaces of the electronic device and the other electronic devices; and referring to the at least one table to select a specific network interface to transmit/receive data, and to disable at least one of the unused network interfaces.