Some embodiments provide a method for maintaining a virtual network that spans at least one cloud datacenter separate from multi-machine edge nodes of an entity. This method configures a gateway in the cloud datacenter to establish secure connections with several edge devices at several multi-machine edge nodes (e.g., branch offices, datacenters, etc.) in order to establish the virtual network. The method configures the gateway to assess quality of connection links with different edge devices, and to terminate a secure connection with a particular edge device for a duration of time after the assessed quality of the connection link to the particular edge device is worse than a threshold value. In some embodiments, the gateway is configured to distribute routes to edge devices at the edge nodes, and to forgo distributing any route to the particular edge device along the connection link for the duration of time when the assessed quality of the connection link is worse than (e.g., less than) a threshold value. In different embodiments, the gateway assesses the quality of the connection link based on different factors or different combinations of factors. Examples of such factors in some embodiments include the following attributes of a connection link: packet loss, latency, signal jitter, etc. Also, the routes that the gateway distributes in some embodiments include routes that the edge devices distribute to the gateway, as well as routes that the gateway learns on its own.

A system and method for FIB aggregation. FIB Aggregation with Quick Selections (FAQS) is a FIB aggregation algorithm that leverages compact data structures and three unique optimization techniques to quickly and incrementally select next hops when handling route updates. As a result, FAQS can run up to 2.53 and 1.75 times faster for IPv4 and IPv6, respectively, than the optimal FIB aggregation algorithm while achieving a near-optimal aggregation ratio. Meanwhile, it consumes much less memory and generates much smaller number of FIB changes when carrying out frequent updates. The performance enhancement of the new algorithm addresses many concerns from ISPs regarding performance issues, and enhances the probability to push FIB aggregation techniques further to the level of production adoption by the industry.

A system and method for FIB aggregation. FIB Aggregation with Quick Selections (FAQS) is a FIB aggregation algorithm that leverages compact data structures and three unique optimization techniques to quickly and incrementally select next hops when handling route updates. As a result, FAQS can run up to 2.53 and 1.75 times faster for IPv4 and IPv6, respectively, than the optimal FIB aggregation algorithm while achieving a near-optimal aggregation ratio. Meanwhile, it consumes much less memory and generates much smaller number of FIB changes when carrying out frequent updates. The performance enhancement of the new algorithm addresses many concerns from ISPs regarding performance issues, and enhances the probability to push FIB aggregation techniques further to the level of production adoption by the industry.

System and techniques for base station assisted Information Centric Network (ICN) are described herein. A mobile network base station receives an ICN packet from a user equipment (UE). The mobile network base station identifies an aggregate packet data unit (PDU) session with a user plane function (UPF) ICN gateway (ICN-GW) hosted in a mobile network core network (CN) for the ICN packet. Then, the mobile network base station transmits the ICN packet via the aggregate PDU session.

System and techniques for base station assisted Information Centric Network (ICN) are described herein. A mobile network base station receives an ICN packet from a user equipment (UE). The mobile network base station identifies an aggregate packet data unit (PDU) session with a user plane function (UPF) ICN gateway (ICN-GW) hosted in a mobile network core network (CN) for the ICN packet. Then, the mobile network base station transmits the ICN packet via the aggregate PDU session.

A method for execution by a processor of a host having an external interface for connection to at least one other network element of a packet-based data network, the host storing a routing table and implementing a container connected to a bridge, the container being addressable by an internal address on a bridge network associated with the bridge. The method includes obtaining an indication of a request for the container to join a multicast group. In response to the obtaining, a request is sent via the external interface for the host to join the multicast group. The routing table may be modified so as to make the bridge a next hop for future packets obtained from the external interface and destined for the multicast group. The routing table may also be modified so as to make the external interface a next hop for future packets that are obtained from the bridge, whose source address is the internal address of the container and that are destined for the multicast group. The method also includes setting up an expiry parameter increase for such future packets.

A method for execution by a processor of a host having an external interface for connection to at least one other network element of a packet-based data network, the host storing a routing table and implementing a container connected to a bridge, the container being addressable by an internal address on a bridge network associated with the bridge. The method includes obtaining an indication of a request for the container to join a multicast group. In response to the obtaining, a request is sent via the external interface for the host to join the multicast group. The routing table may be modified so as to make the bridge a next hop for future packets obtained from the external interface and destined for the multicast group. The routing table may also be modified so as to make the external interface a next hop for future packets that are obtained from the bridge, whose source address is the internal address of the container and that are destined for the multicast group. The method also includes setting up an expiry parameter increase for such future packets.

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.

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.

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.