Networks comprising multiple non-overlapping communication topologies are presented. The networks can include a fabric of interconnected network nodes capable of providing multiple communication paths among edge devices. A topology manager constructs communication topologies according to restriction criteria based on required security levels (e.g., top secret, secret, unclassified, etc.). Established topologies do not have overlapping networking infrastructure to within the bounds of the restriction criteria as allowed by the security levels.

A path calculation method, apparatus, and device, to implement network slicing. The path calculation method includes: obtaining an algorithm constraint supported by each of a plurality of network devices, where the algorithm constraint is a constraint of a forwarding path algorithm, and the forwarding path algorithm is used to calculate, for the network device, a forwarding path that meets the algorithm constraint; performing network topology division on the plurality of network devices, where network devices in a same network topology support a same algorithm constraint; and calculating a forwarding path between network devices in each network topology based on the algorithm constraint, of the forwarding path algorithm, corresponding to the network topology.

In one embodiment, an apparatus includes one or more processors and one or more computer-readable non-transitory storage media coupled to the one or more processors. The one or more computer-readable non-transitory storage media include instructions that, when executed by the one or more processors, cause the apparatus to perform operations including receiving a first type-length-value (TLV) associated with a winning flexible algorithm definition (FAD) from a first element of a network. The operations also include determining a security level for the winning FAD based on the TLV. The operations further include determining a data transmission route through a plurality of elements of the network based on the security level for the winning FAD.

A system (1) for controlling message routing within a wireless network, which comprises a plurality of nodes (1,11-15), is configured to determine a first subset of the plurality of nodes. The first subset comprises one or more devices (12,15) that are assigned a radio frequency-based presence and/or location detection function. The system is further configured to determine a plurality of routes from a source node (1) to a destination node (12). At least one of the plurality of routes comprises one or more intermediate nodes (11,13,14,15). The system is further configured to select one of the plurality of routes based on how many of the intermediate nodes of each of the plurality of routes are part of the first subset of the plurality of nodes and transmit one or more messages to cause the wireless network to perform message routing according to the selected route.

A device receives topology data and path data associated with a network that includes network devices. The device determines planned bandwidths for new paths through the network based on the topology data and the path data, and ranks the new paths, based on the planned bandwidths, to generate a ranked list. The device selects information identifying a first new path from the ranked list, wherein the first new path includes a first planned bandwidth. The device determines whether the first new path can be provided via a single route through the network based on the first planned bandwidth, and identifies two or more routes through the network for the first new path when the first new path cannot be provided via the single route. The device causes the first planned bandwidth to be reserved by two or more of the network devices for the two or more routes.

Disclosed are systems, methods, and non-transitory computer-readable media for message routing optimization. The message routing optimization system receives requests to transmit messages to recipient devices. The message routing optimization system determines whether to allocate the messages to an optimal routing provider or a secondary routing provider. The message routing optimization ranks the set of routing providers based on a conversion rate index and determines the optimal routing and secondary routing providers based on the ranking. The message routing optimization system allocates messages to the selected routing providers to be delivered to their intended recipients.

The technology of this application relates to a method and apparatus for sending route calculation information, a device, and a storage medium. The method relates to the field of communications technologies. The method includes receiving route calculation information, where the route calculation information includes computing capability information of a computing container, and the computing capability information indicates a computing capability corresponding to the computing container. The method further includes obtaining a shortest path tree, where the shortest path tree includes a shortest path from a router to each other router in a routing domain, and sending the route calculation information to each other router in a network based on the shortest path tree.

Systems and methods are disclosed for configuring a communications network. In disclosed embodiments, a set of permissible service link decompositions and a set of basic service links may be obtained for the communications network. A spanning subset of service links for the communications may be generated. Generation of the spanning subset may include selecting a decomposition of a first service link from a set of permissible service link decompositions; updating the set of permissible service link decompositions based on the selected decomposition; and updating the set of basic service links using the updated set of permissible service link decompositions. In some embodiments, obtaining the set of permissible service link decompositions can include generating a set of permissible service link decompositions by traversing decomposition graphs generated for each of the service links. In some embodiments, the communications network can be configured to satisfy network demands using the spanning subset.

A list-type detection unit (220) performs list-type detection on communication data so as to detect a fraudulent communication. A machine-learning-type detection unit (230) performs machine-learning-type detection on communication data so as to detect a fraudulent communication. A communication acceptance unit (210) receives communication data from a network, and allocates the received communication data to at least one of the list-type detection unit and the machine-learning-type detection unit, using an allocation filter. A filter setting unit (250) determines a parameter value based on a load status of the list-type detection unit and a load status of the machine-learning-type detection unit, and sets the determined parameter value in the allocation filter.

A framework for joint computation, caching, and request forwarding in data-centric computing-based networks comprises a virtual control plane, which operates on request counters for computations and data, and an actual plane, which handles computation requests, data requests, data objects and computation results in the physical network. A throughput optimal policy, implemented in the virtual plane, provides a basis for adaptive and distributed computation, caching, and request forwarding in the actual plane. The framework provides superior performance in terms of request satisfaction delay as compared with several baseline policies over multiple network topologies.