Patent classifications
H04L45/124
Routing data in wireless network that coexists with interfering wireless networks
A node device for forming a multi-hop network is provided. The node device is configured to avoid interference from coexisting interfering networks and includes a transceiver configured to receive and transmit data with respect to a Destination Oriented Directed Acyclic Graph (DODAG) Information Object message (DIO message), a memory configured to store computer executable programs including an interfered-node count (IC), single-rate link count (SLC), multi-rate link count (MLC), hop count (HP), path communication latency (PCL) and an interference efficient and multi-rate supported routing program CoM-RPL, and a processor configured to perform steps of the computer executable programs. The steps include determining if the received DIO message indicates a new DODAG or an existing DODAG. In this case, if a determined result in the determining indicates the new DODAG and no single-rate link and no interfered node on a path of multi-hop network, the node device joins DODAG network and the processor selects a sender of the DIO message as a default parent, computes a rank for itself, updates DIO message with its rank, IC, SLC, TRM, HP, PCL and transmits scheduled DIO messages based on transmission rate mode.
System and method for selecting a path in a communication 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.
TELEMETRY DISTRIBUTION IN AN OVERLAY NETWORK
Systems including at least one processor and a memory storing instructions that, when executed by the at least one processor, result in the system collecting real-time telemetry measurements for packets received at each hop of an overlay network, and the system injecting the measurements into a variable-length trailers of the packets.
Tree structure-based smart inter-computing routing model
Systems and methods are disclosed for retrieving, from a database, over a network, historical routing data for multiple attributes and determining, for each attribute, based on its respective historical routing data, whether processing volume and processing error rates for each attribute exceed respective threshold. If both processing volume and error rate exceed their respective thresholds, the systems and methods describe herein calculate, for each qualifying attribute, a degree to which routing for each attribute can be improved. The systems and methods described herein output a ranking for each qualifying attribute based on their respective degrees to which routing can be improved for the respective attributes.
MANAGING CHANGES TO INTERDEPENDENT NETWORK ELEMENTS
The technologies described herein are generally directed to modeling radio wave propagation in a fifth generation (5G) network or other next generation networks. For example, a method described herein can include, facilitating receiving a disabling request for a first time period and applicable to a first service element in a first service path of first service elements to provide a service. The method can further include identifying, by the configuration equipment, and scheduled change data, a second service element from a combined group of the first and second service elements of a second service path for the provision of the service. Further, based on a first determination that the second service element is to be disabled during the first time period, facilitating disabling the first service element during a second time period where the second service element is not disabled.
Inter-mesh networks routing protocol
A computer-implemented method determines a routing cost for routing data over a routing path between a first device in a first network and a second device, wherein the routing path has a path segment between a gateway device of the first network and a device in a second network, the gateway device being configured to establish a connection between the first and second networks. This method may include determining a routing cost for the path segment, the routing cost for the path segment having a default routing cost value that is based on capabilities of the gateway device and/or the communication technology; and determining the routing cost for the routing path based on the routing cost for the path segment. The invention furthermore relates to determining a route based on the routing cost, and to routing a data packet based on the route.
Heuristic-based SD-WAN route reconfiguration
An example network orchestrator includes processing circuitry and a memory. The memory includes instructions that cause the network orchestrator to receive network probe information including delay times of network probes associated with a set of flows between devices. The instructions further cause the network orchestrator to generate a correlation matrix including correlations representing shared congested links between pairs of flows. The instructions further cause the network orchestrator to for each flow of the set of flows, determine a routing solution optimized for the each flow and select a total minimum cost solution from the determined routing solutions.
ROUTING OF OPTICAL SIGNALS
A method may include obtaining a topology of an optical network. The topology may indicate multiple optical links within the optical network. The method may also include obtaining a routing metric for each of the optical links. The routing metric may be used in selecting routes through the optical network along the multiple optical links. The method may further include obtaining a signal noise tolerance of an optical signal to be routed through the optical network and adjusting routing metrics of one or more of the multiple optical links based on the signal noise tolerance of the optical signal. The method may also include after the routing metrics of the one or more of the multiple optical links are adjusted, determining a route for the optical signal through the optical network along two or more of the multiple optical links based on the routing metrics of the multiple optical links.
ROUTING OF OPTICAL SIGNALS
A method may include obtaining a topology of an optical network. The topology may indicate multiple optical links within the optical network. The method may also include determining a signal noise tolerance for each of multiple optical signal types supported by the optical network and obtaining an optical noise for each of the multiple optical links. The method may also include determining a number of the multiple optical signal types that each of the multiple optical links is able to support based on the optical noise for each of the optical links and the signal noise tolerance for each of the multiple optical signal types and ranking the multiple optical links based on the number of the multiple optical signal types that each of the optical links is able to support.
Utility and governance for secure, reliable, sustainable, and distributed data routing over the Internet
A method is disclosed for autonomously discovering and utilizing low-latency routing paths in a distributed data routing network. The method includes automatically measuring one-way latencies between a plurality of nodes, and automatically calculating relay health scores of potential relayed data routing paths in the distributed network. A relayed data routing path is automatically selected based on the one-way latencies and relay health scores of potential relayed data routing paths. A relay health score for a potential relayed data routing path is based on uptimes of the potential relay node, or bandwidths, jitters, data package losses, or amount of data routed through the routing segments in the potential relayed data routing path. The selected relayed routing path has a routing health score that meets a pre-determined criterion. The selected relayed data routing path has a total one-way latency smaller than a one-way latency associated with in a direct path.