H04L45/14

Systems and methods for constrained path computation in networks with connectivity and resource availability rules
11582135 · 2023-02-14 · ·

Systems and methods for constrained path computation in networks with connectivity and resource availability rules build the necessary constraints directly into the routing graph so that all paths found are by construction satisfying of all the constraints. This is in contrast to the conventional approach of finding multiple paths and then applying the constraints. The present disclosure efficiently addresses the necessary constraints in the routing graph. Path Computation Engine (PCE) performance in terms of time to return acceptable paths to the user generically degrades as network scale (typically expressed through length and number of paths) increases. The present disclosure keeps the input graph small even though the graphs have expanded functionality to address constraints.

Graph-based node classification based on connectivity and topology
11595291 · 2023-02-28 · ·

Techniques are disclosed for determining predictions from a graph of a network dataset. The graph of the network dataset may include nodes describing entities and edges describing connections or links between the entities. Predictions may be made using a dual-path convolution network that considers both node connectivity and node topology. Node topology includes assessment of similarities in topology roles between nodes in the graph, even nodes that reside in different parts of the graph. The node connectivity and node topology in the dual-path convolution may be aligned using a multi-head attention network. Outputs from previous layers of the multi-head attention network may be provided as inputs to subsequent layers of the dual-path convolution to mutually reinforce the convolutions determining node connectivity and node topology toward alignment.

SYSTEM AND APPARATUS OF A SOFTWARE-SERVICE-DEFINED-NETWORK (SSDN)
20180006929 · 2018-01-04 ·

A network apparatus for a network software service layer (NSSL) service bus. The network apparatus includes a memory storing executable instructions and a processor coupled to the memory, the processor executing the executable instructions, where the processor is configured to receive a service description comprising a named service and a network identifier identifying a network node associated with the named service, select a service description according to the named service, and transmit a named service request to the network node according to the service description selected.

USING VIRTUAL NETWORKING DEVICES TO MANAGE ROUTING INFORMATION

Techniques are described for providing managed virtual computer networks that have a configured logical network topology with virtual networking devices, such as by a network-accessible configurable network service, with corresponding networking functionality provided for communications between multiple computing nodes of the virtual computer network by emulating functionality that would be provided by the virtual networking devices if they were physically present. In some situations, the networking functionality provided for a managed computer network of a client includes receiving routing communications directed to the virtual networking devices and using included routing cost information to update the configuration of the managed computer network, and/or includes determining actual cost information corresponding to use of an underlying substrate network and providing routing cost information to the client that reflects the determined actual cost information, so as to enable the client to modify the configuration of the managed computer network accordingly.

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.

COMMUNICATION GENERATION IN COMPLEX COMPUTING NETWORKS

This disclosure is directed to communication generation by traversing routes of a graph in a complex computing network. The communication generation is used for determining whether certain input data has certain desired data attributes.

Database protocol for exchanging forwarding state with hardware switches

Some embodiments provide a set of one or more network controllers that communicates with a wide range of devices, ranging from switches to appliances such as firewalls, load balancers, etc. The set of network controllers communicates with such devices to connect them to its managed virtual networks. The set of network controllers can define each virtual network through software switches and/or software appliances. To extend the control beyond software network elements, some embodiments implement a database server on each dedicated hardware. The set of network controllers accesses the database server to send management data. The hardware then translates the management data to connect to a managed virtual network.

Method and UE for performing rid update in UE in wireless communication network

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.

MULTICAST ROUTING METHOD, INTERCONNECTION DEVICE, MESH NETWORK SYSTEM AND CONFIGURATION METHOD THEREOF

A multicast routing method and an interconnection device for a mesh network system, a mesh network system and a configuration method thereof are provided. The method includes, at each internal interconnection device among multiple interconnection devices of each processing subsystem: in response to receiving a multicast access request to a destination memory, determining a shortest path from each internal interconnection device to the destination memory based on a topology structure of the mesh network system; where the internal interconnection device has no link connected to an external processing subsystem; in response to determining that the number of the shortest path is equal to one, routing the multicast access request to the destination memory along the shortest path; in response to determining that the number of the shortest path is greater than one, determining a next-hop interconnection device for the multicast access request based on a second static routing policy.

Routing Messages Between Cloud Service Providers
20230224363 · 2023-07-13 ·

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.