Patent classifications
H04L45/26
REGULATION METHOD INTENDED TO RESORB CONGESTION ON A MESH POWERLINE AND RADIO COMMUNICATION NETWORK
A regulation method and device intended to resorb congestion on a mesh communication network including a plurality of node devices using powerline communications, a route request being sent by a source node device and copies of the route request being relayed by gradual broadcasting by intermediate node devices. The intermediate node device is able to send messages on at least one frequency band by powerline and over a radio channel, and by means of the intermediate node device: detects a congestion situation, identifies route requests as being important, relays only copies of the important relay requests on a frequency band and over the radio channel, and relays copies of the non-important route requests on a frequency band or over the radio channel.
Autonomous data routing in a peer-to-peer computer network
A method is disclosed for autonomously routing data using in a peer-to-peer computer network includes automatically updating a peer-to-peer computer network. The method includes automatically sending pulse messages from a first node to neighbor nodes and candidate nodes, receiving return pulses by the first node from at least some of the neighbor nodes and the candidate nodes, calculating round-trip times (RTTs) between the first node and the neighbor nodes or the candidate nodes based on the pulse messages and the return pulses, sorting the nodes in the neighbor nodes and the candidate nodes into orbital bins based on RTTs, and automatically selecting and adding a node from one of the orbital bins based on the RTTs to updated neighbor nodes for the first node, and routing data from the first node to a second node via a relay node in the peer-to-peer computer network.
DYNAMIC AI-DRIVEN SPLIT TUNNELING POLICIES FOR REMOTE TELEWORKERS
In one embodiment, a device obtains path probe data between one or more end-user sites and an online application. The device makes, based on the path probe data, a prediction as to whether a direct Internet access path or a backhaul path would offer better application performance for the online application. The device generates, based on the prediction, a split tunnel policy for a particular end-user site. The device causes a particular end-user site to connect to the online application in accordance with the split tunnel policy.
Hybrid method for node organization and data routing in a peer-to-peer computer network
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.
Hybrid data-routing method in a peer-to-peer computer network
A method for autonomously routing data using in a peer-to-peer computer network, includes automatically updating a peer-to-peer computer network comprising a plurality of nodes and automatically relaying data from the first node to a second node by one of the neighbor nodes associated with the first node. The method further includes automatically sending pulse messages from a first node to neighbor nodes and candidate nodes, dynamically adjusting time intervals between the pulse messages, receiving return pulses by the first node from some of the neighbor nodes and the candidate nodes, calculating round-trip times (RTTs) between the first node and the neighbor nodes or the candidate nodes, sorting the nodes in the neighbor nodes and the candidate nodes into a plurality of orbital bins, and automatically selecting and assigning a node from the orbital bins to update neighbor nodes associated with the first node.
Autonomous data routing in a peer-to-peer computer network
A method is disclosed for autonomously routing data using in a peer-to-peer computer network includes identifying a destination node to receive a data transfer, storing IDs of neighbor nodes sorted into orbital bins according to round-trip times (RTTs) between a source node and the neighbor nodes, sending one or more path packages from the source node to the destination node in a first direct data path from the source node to the destination node, sending path packages from the source node to the neighbor nodes, sending one or more path packages comprising updated hop information from a first hop node to the destination node, calculating total one-way latencies and performance metrics respectively for the path packages received by the destination node, and selecting a relayed data path for the data transfer from the source node to the destination node.
FACILITATION OF SOFTWARE-DEFINED NETWORK SLICING FOR 5G OR OTHER NEXT GENERATION NETWORK
Software-defined networking (SDN) can be utilized with a wireless network platform to increase efficiencies and mitigate service lapses. Within an SDN enabled on-demand dynamic 5G network slice management architecture, the SDN can be utilized for on the-fly deployment of network slicing. For example, an SDN network slice broker (SNSB), can facilitate an on-demand allocation of network resources performing admission control, resource negotiation, and charging. Additionally, the system can comprise an SDN-enabled edge slice mobile edge computing (MEC) coordinator and a local slice MEC agent. Thus, the SDN facilitate on-demand alternate paths, by utilizing the SDN-enabled edge slice MEC coordinator and the local slice MEC agents at various slices.
Method of operating a communication network, corresponding communication network and devices
A communication network comprises a plurality of electronic devices coupled via a plurality of communication links. The communication links comprise links over a first physical medium and links over a second physical medium. A method of operating the network comprises issuing, at an originator device, a path request message directed towards a destination device, transmitting the path request message from the originator device to the destination device through a first set of intermediate devices via a forward sequence of links, issuing, at the destination device, a path reply message directed towards the originator device, and transmitting the path reply message from the destination device to the originator device through a second set of intermediate devices via a reverse sequence of links.
Method for propagating movement event message of network entity
A method for propagating a movement event message of a network entity, including: step 1) a network device maintaining a historical forwarded information list, wherein a network device capable of receiving a movement event message from an external system or device maintains an uplink port information table; step 2) after receiving the message, the network device performs matching using the table to obtain a forwarding port and forwarding information of the message, and constructs a movement event forwarding message using the information and forwards through the forwarding port; and step 3) after a device receives the message, searching for a matching forwarding port and forwarding information of the message in the information list, modifying the message using the forwarding information, and forwarding the modified message through the forwarding port. The method is able to propagate a movement event message to a network device responsible for related data transmission and forwarding.
LOGICAL OVERLAY TUNNEL SELECTION
Example methods and systems for logical overlay tunnel selection are described. One example may involve a first computer system generating and sending probe packets over multiple logical overlay tunnels and configuring routing information associated with a destination based on a comparison between tunnel state information measured using the probe packets and a desired state. In response to detecting an egress packet that is destined for the destination, the first computer system may select a first logical overlay tunnel that satisfies the desired state over a second logical overlay tunnel that does not satisfy the desired state. An encapsulated packet is then generated and sent over the first logical overlay tunnel to reach the destination. The encapsulated packet may include the egress packet and an outer header that is addressed from a first virtual tunnel endpoint (VTEP) on the first computer system and a second VTEP on a second computer system.