16 results about "Shortest path computation" patented technology

The invention relates to a resource allocation method and system for dynamic load balancing of a data center elastic optical network, and belongs to the technical field of communication. Comprising the following steps: initializing data center elastic optical network parameters, and generating a connection request; judging whether the residual computing power resources of the source node and the destination node meet the request requirement or not, if so, calculating K working paths, selecting the shortest path, calculating the number of required spectrum slots, and judging whether the paths have residual spectrum resources or not; if yes, layered traffic grooming evaluation parameters are calculated, and the optimal spectrum layer is selected for grooming traffic; if not, selecting the highest-price modulation format; judging whether bandwidth and optical channel resources on the path are enough, if so, allocating spectrum resources, otherwise, returning to select the next shortest path; judging whether the spectrum resources meet constraint conditions or not, if yes, allocating computing power resources, and requesting successfully; if not, returning to reselect the path; and after success, updating the network transmission path weight. According to the invention, the network resource waste and blocking rate are effectively reduced, and the optical network energy consumption is reduced.

The invention discloses a fault positioning method and device, equipment, a storage medium and a program product, and the method comprises the steps: obtaining key index information of a node, a container group and a service which are involved when a target cluster breaks down; performing knowledge graph construction based on the nodes, the container groups and the key index information of the services to obtain a cluster topological graph; performing fault analysis and positioning on the cluster topological graph by adopting a target analysis algorithm to obtain one or more of a fault node, a fault container group and a fault service in the cluster topological graph and fault causes of one or more of the fault node, the fault container group and the fault service; wherein the target analysis algorithm is used for performing connectivity analysis or shortest path calculation or centrality analysis on the cluster topological graph.

The invention provides an unmanned aerial vehicle route planning method and system based on control points, and the method comprises the steps: 1, obtaining the terrain information of a task region, and determining the flight environment of an unmanned aerial vehicle; step 2, setting a plurality of control points in the task area, and establishing connection lines among the control points to form an air route network; 3, setting a corresponding optimization objective function according to the task requirements and the actual situation of the task area, and establishing a mathematical model; step 4, carrying out shortest path calculation on the air route network to obtain an optimal air route planning scheme; 5, training an intelligent agent to intelligently manage opening and closing of the control points, optimizing the utilization rate of the control points by the multiple unmanned aerial vehicles, reducing the air waiting time of the multiple unmanned aerial vehicles, and improving the route planning efficiency of the multiple unmanned aerial vehicles; the unmanned aerial vehicle can be restrained to be always in the control range of the ground station in the flight process by setting the positions of the control points, and the flight path planning efficiency and the control precision of the unmanned aerial vehicle are improved.

Systems and methods for diversifying k-shortest path computation results for multiple vertices as destination or as inclusion constraint include receiving a request for k paths, in a network from a source port at a source node to a node, wherein the node includes a plurality of ports; representing the network as a graph with vertices representing ports, edges representing connections between the ports, and with weights assigned to each of the edges; assigning a dummy destination vertex to connect to each of the plurality of ports and associated edges between each of the plurality of ports and the dummy destination vertex having a same weight; determining up to the k paths between the source port and the dummy destination vertex, and, subsequent to the determining each of the k paths, assigning a corresponding edge of the associated edges in each of the k paths a predetermined value.

The invention discloses a data processing method and device, equipment and a storage medium. Comprising the steps that a target relation graph is obtained, and the target relation graph is formed by connecting a plurality of relation nodes and edges between the relation nodes; searching an intra-graph neighbor node of each relation node in the target relation graph; based on each relation node and the intra-graph neighbor node corresponding to each relation node, determining the intra-graph neighbor relation of each relation node in the target relation graph; according to the intra-graph neighbor relation of each relation node, calculating the node relation importance degree of each relation node, and according to the shortest path of each relation node pair in the target relation graph, calculating the node position importance degree of each relation node; and based on the node relation importance and the node position importance corresponding to each relation node, determining a target key node in the target relation graph. According to the method, the recognition speed and expansibility of the key nodes in different application scenes are improved.

The invention discloses a method, a device, equipment and a storage medium for dynamically planning the use quantity and the relocation path of a drilling machine. The method comprises the following steps of: counting well position coordinate data of a to-be-drilled well in a well site in a research range; performing clustering analysis on the well location coordinate data of the to-be-drilled well according to a K-means algorithm; obtaining a plurality of blocks according to a clustering analysis result; the ant colony algorithm is adopted to calculate the dynamic scheduling paths of the initial number of drilling machines in the block, and the shortest paths of the initial number of drilling machines for the multiple to-be-drilled wells in the block at the same time are obtained; according to the shortest path, the total development period of the multiple to-be-drilled wells in the block is calculated; judging whether the total development period exceeds a preset period or not; according to the shortest path obtained through calculation of the number of the drilling machines increased last time, the drilling machine using number and a drilling machine moving path dynamic planning graph are determined. According to the method, the K-means algorithm and the ant colony algorithm are combined, the running track of the drilling machine is reasonably planned, and the method has the advantages of being higher in timeliness and higher in data processing capacity.

The invention relates to the technical field of artificial intelligence, and discloses a book recommendation system and method based on artificial intelligence, and the system comprises a relation confidence calculation module which obtains the relation confidence of node embedding and edges; the target translation screening module is used for screening to obtain a target translation set; the cross-layer shortest path calculation module is used for calculating and obtaining the cost of the cross-layer shortest borrowed path; the cross-layer cost calculation module is used for calculating to obtain candidate cross-layer cost; the recommendation list generation module is used for generating a recommendation list; and the online updating module is used for updating the learnable parameters. According to the method, a knowledge graph multi-level association model is constructed, so that a user work layer demand is accurately mapped to a version and copy layer; meanwhile, real business constraints such as a borrowing state, authorization limitation and geographical allocation cost are fused, and through cross-layer path cost quantification and reachability gradient calculation, it is ensured that a recommendation result stably points to a target translation expected by a user and can be borrowed at present.

The invention relates to a cost-minimized cross-regional traffic scheduling method, and belongs to the technical field of communication. The invention aims to solve the technical problems of high traffic scheduling cost, low resource utilization rate and large service blocking rate caused by electricity price difference of different regions and elastic optical network spectrum resource constraint in the existing cross-region computing power network. According to the technical scheme, a traffic scheduling problem is modeled into a mixed integer linear programming model, and an approximate solution algorithm is designed; comprising the steps of searching for a shortest path from a source node to a data center node for each service request, calculating energy consumption cost, screening candidate nodes, constructing a service request-data center bipartite graph to carry out minimum cost and maximum flow matching, dynamically evaluating a spectrum state, allocating resources and the like, and minimizing the total transmission and calculation cost. According to the invention, the operation cost can be effectively reduced, the network resource utilization efficiency is improved, and service congestion is reduced.

A kind of multi-source shortest path method based on bidirectional SPFA, comprising: according to the traffic road network map of obtained construction directed weighted graph;Obtain multi-source shortest path query request;Select specific node as pre-processing starting point, calculate the shortest distance of pre-processing starting point to all other nodes using shortest path fast algorithm, construct and initialize the evaluation function array;For each shortest path query request, empty the node scheduling queue for storing pending node and reset each auxiliary array;Based on the evaluation function array dynamic optimization node scheduling queue, calculate the shortest distance in combination with shortest path fast algorithm;Iterative processing all shortest path query requests and return query result.The present application can effectively process the directed graph containing negative weight edge but not containing negative weight ring, and is suitable for large-scale network environment under traffic road network map efficient shortest path calculation.

This invention proposes a method for extracting the curve skeleton line of a three-dimensional tubular body model based on a hierarchical graph. The method includes: inputting three-dimensional tubular body model data; preprocessing and extracting endpoints; calculating the shortest path, calculating the geometric features between different paths, and constructing initial discrete skeleton points; calculating the distance and angle of the paths to determine the positions of candidate bifurcation points; segmenting the original data; applying spherical B-splines for fitting and optimization to obtain skeleton line data; outputting the skeleton line data, estimating the position of bifurcation points by tracking the shortest path, and using an elastic ball collision movement algorithm to obtain the precise position of the bifurcation points; and using a dynamic ball expansion algorithm with the bifurcation points as the sphere centers to divide the data model into multiple branches, laying the foundation for subsequent hierarchical graph construction and parallel computation.

The application discloses a multi-link dynamic access method and system with precise network positioning capability. The method comprises the following steps: sending a link access request to a wireless link access control device; the wireless link assigns a communication interface IP and a corresponding gateway IP to a mobile terminal; the mobile terminal fills in a default link table according to the obtained information, performs shortest path calculation, and sends an access request to the wireless link access control device; and the wireless link access control device returns a planned host IP. The application realizes network switching without interrupting services through the hot backup access of heterogeneous network links, and can improve the mobile application service experience. When there are multiple network links, the application can select a suitable wireless access link according to the own demand, ensure the service safety, and improve the utilization efficiency of network link resources. The application realizes the comprehensive network positioning capability which is independent of the hardware capability of the mobile terminal by using the position information provided by multiple network resources, and improves the precision of public network positioning.

The invention discloses a CoT-MARL gate single-point root cause positioning method based on large model prior injection, and the method comprises the steps: writing all modal data into a cache on a unified time axis, carrying out the pulling of dimensions through an exclusive encoder, inputting the data into a double-fork coupling layer, generating a cross-domain vector, and transmitting the cross-domain vector to a hierarchical time memory stack to maintain a multi-scale feature; a scene semantic vector passes through a causal decoding chain, firstly, open line nodes are extracted by an explicit access control rule set, then dark line nodes are captured by a coupling feature miner, and a single event causal graph is fused; calculating the confidence coefficient of the shortest path capable of explaining the non-moving symptom of the door wing, and forming a root cause sequence and mapping a minimum action frame after combining with historical track distillation; the central scheduler schedules actions among the four agents according to the root cause confidence coefficient and the resource real-time load, the agents collect observed objects in an action life cycle and compare measured values with a threshold value, and the confidence coefficient is iteratively refreshed until a single root cause is advanced; a minimized field repair action is automatically generated and performed.

The application provides a multi-party graph shortest path query method based on differential privacy, mainly reducing the complexity and communication overhead in the existing privacy protection shortest path query method. The application constructs a mutual exclusion multi-party graph model, a server determines unified node identification and differential privacy budget epsilon of each participant, each client carries out privacy processing on local data by using a corresponding perturbation mechanism according to the allocated privacy budget, the client uploads the perturbed data to the server, the server aggregates sub-graphs to build a synthetic graph after receiving the data, finally, the server carries out global shortest path calculation on the synthetic graph based on the aggregation result by using the Floyd-Warshall algorithm, and finally obtains the shortest path query result meeting the differential privacy requirement.

The invention discloses a shortest path determination method and device, equipment and a storage medium. The method comprises the following steps: acquiring a start node and a stop node for path planning, and path structure information representing distribution of all paths between the start node and the stop node; and constructing a plurality of interval range containers according to node distances among path nodes in the path structure information. And determining to-be-expanded nodes corresponding to the starting node and node distances between the starting node and the to-be-expanded nodes, and updating the interval range containers according to the node distances corresponding to the to-be-expanded nodes. And after updating each interval range container, planning a shortest path between the starting node and the ending node according to the node to be expanded in the non-empty and minimum interval range container. According to the technical scheme, the overhead of node selection and updating can be remarkably reduced so as to adapt to efficient shortest path calculation in a mass data environment.

This invention discloses a service-aware NFV network routing method and apparatus, belonging to the field of communication network and network function virtualization technology. After acquiring network topology, link load / bandwidth, node intermediate box processing capacity and space resources, and flow request information, the method determines the dependencies of required intermediate boxes and configures a traffic change rate ratio for each intermediate box type. Under the constraint of dependency, the partial-order service set is converted into a full-order service chain based on the ratio. Then, based on the full-order service chain, the shortest path calculation is performed in stages to jointly determine the routing path and intermediate box service location. When the processing capacity of existing instances is insufficient, new instances are started based on the remaining space. Finally, the SDN controller issues flow tables to realize forwarding. This invention can effectively reduce end-to-end latency and packet loss rate, improve flow success rate, and achieve network load balancing.