Aspects of the present disclosure involve systems for providing multiple egress routes from a telecommunications network for a client of the network. In general, the system provides for a client of the network to receive intended packets of information through multiple connections to the network such that load balancing and failover services for traffic to the customer are provided. The process and system allow for telecommunications network to utilize a common next-hop value of announced border gateway protocol (BGP) routes to advertise multiple routes to reach a destination customer network or address. By utilizing a common next-hop value in the announced BGP information, the devices of the network may load balance communication packets to the destination customer or address among the multiple egress locations from the network, as well as providing fast failover to alternate routes when a failure at the network or customer occurs.

Systems and methods include receiving a request for a path from a source node to a destination node in a network with the request including N unordered inclusion nodes, N≥1; adding a virtual vertex in a graph with edges connected to each of the N inclusion nodes, wherein the graph includes the virtual vertex, vertices representing nodes in the network, and edges representing links; determining a shortest path from the source node to the virtual vertex and removing an edge from a first inclusion node, that is on the shortest path, from the virtual vertex; if N>1, determining a shortest path N times to find path segments between the N inclusion nodes, removing an edge from each of the N inclusion nodes from the virtual vertex when on a corresponding shortest path; and determining a shortest path from a last inclusion node to the destination node.

Systems and methods include receiving a request for a path from a source node to a destination node in a network with the request including N unordered inclusion nodes, N≥1; adding a virtual vertex in a graph with edges connected to each of the N inclusion nodes, wherein the graph includes the virtual vertex, vertices representing nodes in the network, and edges representing links; determining a shortest path from the source node to the virtual vertex and removing an edge from a first inclusion node, that is on the shortest path, from the virtual vertex; if N>1, determining a shortest path N times to find path segments between the N inclusion nodes, removing an edge from each of the N inclusion nodes from the virtual vertex when on a corresponding shortest path; and determining a shortest path from a last inclusion node to the destination node.

In a network having an edge server disposed therein, to appropriately construct a wireless communication route used in communication between the edge server and a user terminal, a processor of a network control device acquires group information related to grouped base stations in multiple base stations disposed in the network, acquires route information related to one or more wireless communication routes formed by multi-hop communication between the grouped base stations, and transmits the group information and the route information to an edge server connected to one of the base stations or to a user terminal.

In a network having an edge server disposed therein, to appropriately construct a wireless communication route used in communication between the edge server and a user terminal, a processor of a network control device acquires group information related to grouped base stations in multiple base stations disposed in the network, acquires route information related to one or more wireless communication routes formed by multi-hop communication between the grouped base stations, and transmits the group information and the route information to an edge server connected to one of the base stations or to a user terminal.

According to an embodiment, a node of a communication system includes a memory and one or more processors coupled to the memory. The one or more processors are configured to: determine, when receiving a packet including path information that indicates a parent-child relationship of transfer nodes included on a network topology from a source node to a destination node, whether at least one of its own node and a neighboring node is included in the path information as the transfer node; specify a distance between the own node and the destination node when at least one of the own node and the neighboring node is included in the path information; and transmit a confirmation response for the packet to the wireless multi-hop network after a waiting time corresponding to the distance, and transfer the packet when a confirmation response is not received from the neighboring node during the waiting time.

According to an embodiment, a node of a communication system includes a memory and one or more processors coupled to the memory. The one or more processors are configured to: determine, when receiving a packet including path information that indicates a parent-child relationship of transfer nodes included on a network topology from a source node to a destination node, whether at least one of its own node and a neighboring node is included in the path information as the transfer node; specify a distance between the own node and the destination node when at least one of the own node and the neighboring node is included in the path information; and transmit a confirmation response for the packet to the wireless multi-hop network after a waiting time corresponding to the distance, and transfer the packet when a confirmation response is not received from the neighboring node during the waiting time.

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.

A cloud-native architecture for containerized systems using consistent hashing routing is described. A reverse proxy server executing on a container-based cluster of compute nodes managed using a container orchestration service may determine a current data grid topology. The reverse proxy server may receive a first request from a first client device to retrieve first data from the container-based cluster of compute nodes. The request may be parsed to determine a key of a key-value pair and a hash value may be computed using the key. A consistent hashing algorithm may be executed to determine a node associated with the hash value. The first data may be retrieved from the node using the hash value. The first data may be sent to the first client device.