A packet processor of a network device repeatedly determines a fill level of a forwarding table that is populated with associations between network addresses and network interfaces of, or coupled to, the network device. The packet processor adjusts, based on the fill level of the forwarding table, a maximum rate according to which the packet processor is permitted to send messages to a central processing unit (CPU) coupled to the packet processor, the messages indicating network addresses that are to be stored in the forwarding table by the CPU. The packet processor of the network device receives packets via network links coupled to the network device; identifies new network addresses of the packets that are not in the forwarding table; and sends messages to the CPU at a rate that does not exceed the maximum rate, the messages indicating the new network addresses are to be added to the forwarding table.

The present invention is directed to a system and a method for facilitating the consistent update of routing tables across the routers of a routing layer in a distributed messaging system. The routers are configured to send together with the outbound message the routing table version used to route the outbound message, which is compared, at the level of the enqueue layer, with the latest deployed routing table version and/or the latest routing table version used to route messages to the requested message queue. If the routing table version of the outbound message is older than the latest deployed routing table version and/or the latest routing table version used to route messages to the requested message queue, then the outbound message is rejected, otherwise, the message is enqueued to the requested message queue.

The present invention is directed to a system and a method for facilitating the consistent update of routing tables across the routers of a routing layer in a distributed messaging system. The routers are configured to send together with the outbound message the routing table version used to route the outbound message, which is compared, at the level of the enqueue layer, with the latest deployed routing table version and/or the latest routing table version used to route messages to the requested message queue. If the routing table version of the outbound message is older than the latest deployed routing table version and/or the latest routing table version used to route messages to the requested message queue, then the outbound message is rejected, otherwise, the message is enqueued to the requested message queue.

Systems and methods for micro-loop avoidance include detecting a remote link failure in a network and identifying an associated Point of Local Repair (PLR); determining destinations in the network that are impacted due to the remote link failure; and installing of a temporary tunnel to the PLR. The steps can further include sending traffic destined for nodes impacted by the remote link failure via the temporary tunnel to the PLR. The temporary tunnel can be implemented by a node Segment Identifier (SID) for the PLR.

Systems and methods for micro-loop avoidance include detecting a remote link failure in a network and identifying an associated Point of Local Repair (PLR); determining destinations in the network that are impacted due to the remote link failure; and installing of a temporary tunnel to the PLR. The steps can further include sending traffic destined for nodes impacted by the remote link failure via the temporary tunnel to the PLR. The temporary tunnel can be implemented by a node Segment Identifier (SID) for the PLR.

A method and apparatus for managing network status information in a network, such as a satellite mesh network. A network node receives a network status update, indicative of a change in network conditions, from another node, e.g. via flooding. Based on a direction of travel of the update, content of at least one counter field of the network status update is adjusted. The update is then propagated, or not, based on the counter fields. A counter field may be increased in response to the update travelling in one direction and decreased in response to the update travelling in an opposite direction. Different counter fields may be adjusted in response to the update travelling in different, e.g. orthogonal, directions. The direction can be determined based on which of plural directional communication interfaces received the update.

The techniques disclosed herein enable systems to perform ordered reconvergence operations following a change to a topology of a communications network. To perform ordered reconvergence, a system detects a change to network topology such as a link failure or node addition. In response, the system determines a global delay based on a maximum distance between two nodes within the network, a local delay for each node within the network, and an ordered delay for each node based on the global delay and the local delay. Upon detecting that the ordered delay for a node has elapsed, the system can then update a routing table for the node. After updating routing tables for every node, the system can route data in the changed network topology using the updated routing tables.

In general, techniques are described for atomically installing and withdrawing host routes along paths connecting network routers to attenuate packet loss for mobile nodes migrating among wireless LAN access networks and a mobile network. In some examples, whenever the mobile node moves from one attachment point to the next, it triggers the distribution of its host route from the new attachment point toward the service provider network hub provider edge (PE) router that anchors the mobile node on a service provider network. Routers participating in the Mobile VPN install the host route “atomically” from the attachment point to the mobile gateway so as to ensure convergence of the network forwarding plane with the host route toward the new attachment point prior to transitioning mobile node connectivity from a previous attachment point.

A first device may determine an Internet Protocol version R (IPvR) interface address associated with a second device, where R is greater than or equal to four. The first device and the second device may be associated with an external border gateway protocol peering session. The first device may generate an Internet Protocol version S (IPvS) interface address based on the IPvR interface address associated with the second device, where S is greater than or equal to six and different than R. The first device may store the IPvS interface address in a routing table. The first device may receive, from the second device, a service route that includes the IPvS interface address, and may provide the service route to a third device. The first device may provide a labeled route to the third device. The labeled route may include a label associated with the IPvS interface address.

An apparatus which transfers information addressed to a master node, comprises a generation unit configured to generate an assessment value representing logical proximity to the master node; a transmit unit that sends/receives the assessment value to/from other apparatuses; and a communication unit that, when this apparatus is an apparatus that is logically closest to the master node within a communication range, receive information addressed to the master node from other apparatuses, otherwise, transmit information addressed to the master node to the logically closest apparatus, wherein the communication unit is configured to generate a delay time based on the assessment value when transferring the information received from the other apparatuses to yet another apparatus.