Provided is a Routing Early Warning System (“REWS”) that preemptively detects and corrects network issues based on control plane messaging. REWS receives control plane messages for network paths to a source node, groups the control plane messages to different bins based on time, detects an anomaly based on a number of a first set of control plane messages grouped to a particular bin differing, by a threshold amount, from a steady state number of control plane messages grouped to at least one other bin, and isolates a cause of the anomaly based on a number of updated paths and addressing of one or more nodes specified in the first set of control plane messages. REWS modifies routing of the source node data plane traffic before the anomaly significant impacts the data plane in response to detecting the anomaly and isolating the anomaly cause using the control plane messages.

A method for routing requests to a plurality of server clusters is disclosed. The method comprises establishing a first server cluster responding to requests concerning a first software via a first version of that software and to requests concerning a second software via a first version of that software, and a second server cluster responding to requests concerning the first software via a second version of that software and to requests concerning the second software via a second version of that software. A gateway router initially routes requests concerning the first and second software by default to the first server cluster. Upon receiving a request to change default routing of requests, a configuration of the gateway router is updated. Subsequent requests concerning the first software are routed to the second server cluster while subsequent request concerning the second software remain routed to the first server cluster.

Packet transmission rate and packet drop rate for discrete network devices in a network are used to estimate end-to-end traffic demand and loss in the network. Data regarding the packet transmission rate and drop rate are passively collected for each network device and transmitted to a network monitoring unit. The network monitoring unit compiles the data and generates a series of simultaneous equations that represent traffic demand and loss between the discrete network devices along the paths connecting respective source-destination pairs. By determining an optimal solution to the simultaneous equations, an estimate of end-to-end traffic loss and corresponding traffic demand, which takes into account packet loss at each network device, can be generated for each source-destination pair. The optimal solution can be formed as a traffic matrix, which aggregates source-to-destination traffic demands, and a loss matrix, which aggregates source-to-destination traffic losses.

Packet transmission rate and packet drop rate for discrete network devices in a network are used to estimate end-to-end traffic demand and loss in the network. Data regarding the packet transmission rate and drop rate are passively collected for each network device and transmitted to a network monitoring unit. The network monitoring unit compiles the data and generates a series of simultaneous equations that represent traffic demand and loss between the discrete network devices along the paths connecting respective source-destination pairs. By determining an optimal solution to the simultaneous equations, an estimate of end-to-end traffic loss and corresponding traffic demand, which takes into account packet loss at each network device, can be generated for each source-destination pair. The optimal solution can be formed as a traffic matrix, which aggregates source-to-destination traffic demands, and a loss matrix, which aggregates source-to-destination traffic losses.

Provided is a method for creating an inter-domain bidirectional tunnel. The method includes: receiving, by a node, a path creation message sent by a path computation element, the path creation message including mapping path information for creating an inter-domain label switched path (LSP), and bidirectional tunnel instruction information, and obtaining, by the node, an actual transmission path, which is used for data transmission between intra-domain or inter-domain nodes, based on the mapping path information and the bidirectional tunnel instruction information. The present disclosure further provides a communication method, a communication device, and a computer-readable storage medium.

Provided is a method for creating an inter-domain bidirectional tunnel. The method includes: receiving, by a node, a path creation message sent by a path computation element, the path creation message including mapping path information for creating an inter-domain label switched path (LSP), and bidirectional tunnel instruction information, and obtaining, by the node, an actual transmission path, which is used for data transmission between intra-domain or inter-domain nodes, based on the mapping path information and the bidirectional tunnel instruction information. The present disclosure further provides a communication method, a communication device, and a computer-readable storage medium.

The technologies described herein are generally directed toward shedding processing loads associated with route updates. According to an embodiment, a system can comprise a processor and a memory that can enable operations facilitating performance of operations including facilitating receiving, from a second routing device, a route update for a routing table of the first routing device, wherein the route update is associated with a route. The operations can further comprise evaluating a value of the route update, resulting in an evaluated value of the route update. The operations can further comprise updating an entry of the routing table based on the route update and the evaluated value of the route update.

Improving distribution of traffic from clients to servers is provided. A device intermediary to a plurality of clients and a plurality of servers can receive a request from a client of the plurality of clients to access one of the plurality of servers. The device can determine a hash value based on at least a portion of the request received from the client. The device can identify an index of a plurality of indices listing the plurality of servers repeated a plurality of times in a deterministic shuffled order. The device can apply a cache array routing protocol (CARP) algorithm to a second plurality of servers listed in a subset of the plurality of indices around the index. The device can select a server from the second plurality of servers with a highest hash value based on the application of the CARP algorithm.

Improving distribution of traffic from clients to servers is provided. A device intermediary to a plurality of clients and a plurality of servers can receive a request from a client of the plurality of clients to access one of the plurality of servers. The device can determine a hash value based on at least a portion of the request received from the client. The device can identify an index of a plurality of indices listing the plurality of servers repeated a plurality of times in a deterministic shuffled order. The device can apply a cache array routing protocol (CARP) algorithm to a second plurality of servers listed in a subset of the plurality of indices around the index. The device can select a server from the second plurality of servers with a highest hash value based on the application of the CARP algorithm.

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.