Systems and methods are disclosed for determining shared risk link group (SRLG) disjoint paths in a communications network. An original graph representing the communications network can be obtained. The original graph can include vertices and edges corresponding to nodes and communication links in the communication network. The vertices can include a source vertex and a target vertex and each edge can be associated with a set of SRLGs A reduced graph can be generated from the original graph. Generation of the reduced graph can include identification of a first edge of the edges as a dominating edge and removal of the first edge. Two SRLG-disjoint paths can then be identified on the reduced graph.

Network pathways are identified to transfer packets between a pair of regional virtual traffic hubs of a provider network. At a first hub of the pair, a first action is performed, resulting in a transmission of a packet received from a first isolated network to the second hub along a pathway selected using dynamic routing parameters. At the second hub, a second action is performed, resulting in the transmission of the packet to a destination within a second isolated network.

Disclosed is a method for selecting a path in a communication network. The method comprises transmitting, through a device connected to a target node, a beacon, to one or more nodes in the communication network. The beacon comprises a set of informative parameters. The method comprises calculating, by each node, a selective score towards one more paths to be selected for reaching the target node in the communication network. The method further comprises identifying, by each node, a target path from the one or more path. The target path is a path having a highest value of the selective score as compared to selective score for other paths in the one or more paths. The method further comprises selecting, by each node, the target path from the one or more paths for reaching the target node.

A system of nodes configured to form a network comprising virtual links in an overlay network provisioned over an underlay network including servers of a public network. The system includes virtual routers (VRs) at each node. Each VR is coupled to the network and to a tenant of the node, and configured to form in the network a set of virtual links corresponding to the tenant. One or more VRs includes a feedback control system comprising an objective function that characterizes the network. The VR is configured to receive link state data of the set of virtual links and control routing of a tenant traffic flow of each tenant according to a best route of the network determined by the objective function using the link state data.

A constrained communication system may receive from a first user a plurality of constraints for a first constrained communication. A first constrained communication record is created based on the plurality of constraints. A first communication is generated based on the first constrained communication record. The first communication is provided to a second user. The second user provides response data and the underlying constrained communication is updated based on the response data.

Network devices that (a) test that GPS-clock enabled network devices have synchronized clocks, (b) identify non-GPS-clock enabled network devices with symmetric latencies as likely to be synchronized to GPS-clock enabled neighbor devices, (c) determine clock skews of remaining network devices not identified in (a) or (b) against the network devices identified in (a) and (b), and re-evaluate latencies of the GPS-clock enabled network devices, the non-GPS-clock enabled network devices, and the remaining devices based on the results of (a)-(c).

A method of securely transmitting a message from a sending entity to a receiving entity via a network. A Processing String Engine is communicatively coupled to the sending and receiving entities. The sending entity requests the Processing String Engine to provide a network routing path for message transmission from the sending entity to the receiving entity and to provide a processing string for the message transmission. The Processing String Engine identifies a network path and generates a processing string. The sending entity appends the processing string to the message and sends the message to the receiving entity. The message is unreadable while the processing string is appended thereto. Upon receipt of the message with the appended processing string, the receiving entity requests removal the processing string. Upon successful verification of the receiving entity, the processing string is removed, and the message is returned to the receiving entity.

In one aspect, a computerized method includes the step of providing process monitor in a Gateway. The method includes the step of, with the process monitor, launching a Gateway Daemon (GWD). The GWD runs a GWD process that implements a Network Address Translation (NAT) process. The NAT process includes receiving a set of data packets from one or more Edge devices and forwarding the set of data packets to a public Internet. The method includes the step of receiving another set of data packets from the public Internet and forwarding the other set of data packets to the one or more Edge devices. The method includes the step of launching a Network Address Translation daemon (NATD). The method includes the step of detecting that the GWD process is interrupted; moving the NAT process to the NATD.

The present disclosure discloses a routing distribution method, a controller, an information routing method, and a network node device. The method is applied to the controller, and the controller stores node detection information sent by each network node device and user detection information sent by each client. The method includes: responding to a first access request directed from a first client points to a second client; planning an optimal path between the first client and the second client based on the node detection information and the user detection information, and generating a routing strategy corresponding to the optimal path; and distributing the routing strategy to the network node device and/or the client in the optimal path.

A method for autonomously routing data using in a peer-to-peer computer network is disclosed. The method includes identifying multiple paths from a source node to a destination node, wherein each of the multiple paths includes two or more routing segments each comprising a sending node and a receiving node. The receiving node is selected among a plurality of nodes in the peer-to-peer computer network based on round-trip times measured between the sending node and the plurality of nodes. Path packages are sent along the multiple paths from the source node to the destination node. Total one-way latencies (OWLs) associated with the multiple paths are measured using path packages from the source node to the destination node. A relayed data path is selected from the multiple paths at least in part based on the total OWLs respectively associated with the multiple paths from the source node to the destination node.