H04L45/14

PROGRESSIVE AUTOMATION WITH PREDICTIVE APPLICATION NETWORK ANALYTICS

In one embodiment, a device uses a classification model to determine whether implementation of a routing change suggested by a predictive routing engine for a network will result in a violation of one or more network policies. The device computes a trust score, based on performance metrics for the classification model. The device causes, based in part on the trust score, implementation of the routing change in the network, when the classification model determines that application of the routing change will not result in a violation of the one or more network policies.

SYSTEM AND METHOD FOR THE AUTOMATIC ROUTING OF INFORMATION IN DYNAMIC NETWORKS
20230129641 · 2023-04-27 · ·

Systems and methods for the automatic routing of data packets in dynamic networks, wherein at least a portion of a route for a data packet is modeled as a fluid dynamics potential flow characterized by an irrotational velocity field. Each data packet is the analogue of a flow particle, an originating node of the data packet is the analogue of a source, and a destination node of the data packet is the analogue of a sink. Each of one or more nodes intermediate to the originating node and the destination node for a data packet are defined as a stream function (Ψ) which adheres to the definition of irrotational and incompressible potential flow that independently represents a flow phenomenon that can influence the route of the data packet. A route for a data packet is calculated based on its current location and the aggregate stream function comprising the sum of each of the flow phenomena acting on the data packet.

Data management in an edge network

Generally discussed herein are systems, devices, and methods for data management in a reverse content data network (rCDN). A component of the rCDN may include a memory to hold content received from a first sensor device of a plurality of sensor devices of the rCDN and first attributes that describe properties of the content. The component may include processing circuitry to receive second content from a second sensor device of the plurality of sensor devices, the second content including a plurality of second attributes that describe properties of the second content, and forward, in response to a determination, based on the first and second attributes, that there is insufficient space to store the second content on the memory, the second content to a node of the rCDN that is fewer hops away from a backend cloud than the component.

DECENTRALIZED CONTENT FABRIC
20230064466 · 2023-03-02 ·

Disclosed are examples of systems, apparatus, devices, computer program products, and methods implementing aspects of a decentralized content fabric. In some implementations, one or more processors are configured to execute a software stack to define a fabric node of a plurality of fabric nodes of an overlay network situated in an application layer differentiated from an internet protocol layer. The defined fabric node is configured to: obtain a request for digital content from a client device; obtain, from one or more of the plurality of fabric nodes, a plurality of content object parts of a content object representing, in the overlay network, at least a portion of the digital content; generate consumable media using: raw data stored in the content object parts, metadata stored in the content object parts, and build instructions stored in the content object parts; and provide the consumable media to the client device. In some instances, the consumable media is further generated using a digital contract stored in a blockchain.

METHOD AND SYSTEM FOR GENERATING NETWORK CONFIGURATIONS USING GRAPH NEURAL NETWORK

A method, processing system and processor-readable medium for generating network configurations using a graph neural network (GNN) are provided. The method may include receiving a first matrix M generated based on a set of network requirements; storing a GNN having a plurality of nodes v and a plurality of edges; initializing the GNN based on a second matrix X.sub.v having a plurality of elements, each element corresponding to a node from a plurality of nodes v of the GNN; and generating an output matrix having a plurality of nodes labelled based on the first matrix M.

Route Configuration Method and Apparatus
20220330129 · 2022-10-13 ·

This application provides a route configuration method and an apparatus, and relates to the field of communications technologies. The method includes: After a first terminal moves out of a service scope of a UPF that currently provides a service for the first terminal, a first SMF inserts a first I-UPF into a user plane path of the first terminal, and configures, for the first I-UPF, a first routing rule corresponding to a second terminal. The first routing rule is used to send a packet whose destination address information is address information of the second terminal to a second A-UPF. Therefore, a packet whose destination address information is the address information of the second terminal can be directly forwarded by the first I-UPF to the first A-UPF, instead of being forwarded by the first I-UPF to the second A-UPF through the first A-UPF.

Routing information exchange between separate networks to improve end-to-end network performance for users

The system disclosed herein implements an improved end-to-end network performance for data transmissions that span multiple networks operated by different organizations. The improvements are achieved as a result of exchanging routing information. For instance, the exchanged routing information can be representative of network performance factors. When different operators of different networks agree to exchange routing information, an optimal end-to-end path between two endpoint devices can be identified and selected for data transmission. This benefits both network operators as the users served by the networks are more likely to be satisfied with the user experience (e.g., faster download and upload of data).

METHOD AND UE FOR PERFORMING RID UPDATE IN UE IN WIRELESS COMMUNICATION NETWORK
20230164061 · 2023-05-25 ·

The present disclosure relates to a communication method and system for converging a 5th-Generation (5G) communication system for supporting higher data rates beyond a 4th-Generation (4G) system with a technology for Internet of Things (IoT). The present disclosure may be applied to intelligent services based on the 5G communication technology and the IoT-related technology, such as smart home, smart building, smart city, smart car, connected car, health care, digital education, smart retail, security and safety services. Embodiments herein provide a method for performing a routing ID (RID) update in user equipment (UE) in a wireless communication network.

Routing messages between cloud service providers
11659035 · 2023-05-23 · ·

Technology is disclosed for bridging clouds of computing devices for compute and data storage. The technology can receive a virtual routing table (VRT), wherein the VRT indicates an association with a virtual local area network (VLAN) and defines neighbors for each route wherein at least one neighbor is defined for each of the two different cloud service providers, wherein the route definition creates a private transitive network between the neighbors; receive from a first node a first message destined for a second node; determine that the first message employs the route specified by the VRT; forward the first message to the second node; receive from a third node a second message destined for the second node; determine that the second message does not employ the route specified by the VRT; and fail to forward the second message to the second node.

Routing table creation method, electronic device, and network
11658896 · 2023-05-23 · ·

A routing table creation method, an electronic device, and a network are provided. The method includes: generating a first probe packet, where the first probe packet has a source address and a destination address; sending, from a source node corresponding to the source address, the first probe packet on a network including at least two nodes, until the first probe packet reaches a destination node corresponding to the destination address, and recording addresses of nodes through which the first probe packet passes, to form a first path; generating a second path according to the first path, where the second path is a reverse path of the first path; generating a first response packet, sending the first response packet along a second path until the first response packet reaches the source node; and creating a routing table entry according to the second path.