A method, apparatus and medium for managing system service components

Abstract

This application discloses a system service component management method, apparatus, and medium, belonging to the field of data routing technology. The method includes: determining the starting point of a service node and the Manhattan distance inflection point; connecting the starting point of the service node with the Manhattan distance inflection point; moving the starting point of the service node according to the obstacles between service nodes, and formulating a rectangular tree graph relationship routing strategy; improving the heuristic routing algorithm in Manhattan intelligent routing through the rectangular tree graph relationship routing strategy to obtain and display the target routing trajectory between service nodes; determining the call or dependency relationship between service nodes based on the target routing trajectory between service nodes; and analyzing the system service component architecture and locating faults through the call or dependency relationship between service nodes. This application can improve the clarity of expressing system dependencies, quickly locate critical service links, and assist in system architecture analysis and fault location.

Description

Technical Field

[0001] This application relates to the field of data routing technology, and in particular to a system service component management method, apparatus and medium. Background Technology

[0002] As the scale of data such as network social relationships, call chains, and architectural topologies grows, node visualization has become relatively mature. However, the visual clutter caused by a large number of edge connections is the main bottleneck in node visualization, affecting the efficiency of reading graphs and the discovery of insights. In system architecture visualization or microservice governance platforms, system service components are usually presented in the form of rectangular service nodes, and there are call or dependency relationships between nodes.

[0003] For example, the asynchronous message relationship between service node A and service node B, and the upstream and downstream dependencies in the service chain result in a large number of service nodes and complex relationship paths. It is difficult to express the node call direction, level or priority through simple connections, and the link display has poor readability in high-density scenarios. Summary of the Invention

[0004] To overcome the aforementioned technical deficiencies, the purpose of this application is to provide a system service component management method, apparatus, and medium. The method includes: displaying system service components as rectangular service nodes; determining the service node start point and service node end point, and generating a Manhattan distance inflection point between the service node start point and the service node end point; connecting the service node start point and the Manhattan distance inflection point to form a routing trajectory line, and determining whether the routing trajectory line passes through an obstacle; in response to the routing trajectory line not passing through an obstacle, moving the service node start point to the Manhattan distance inflection point; in response to the routing trajectory line passing through an obstacle, moving the service node start point to the side endpoint of the obstacle; formulating a rectangular tree graph relationship routing strategy based on the routing trajectory line from the service node start point to the service node end point; improving the heuristic routing algorithm in Manhattan intelligent routing through the rectangular tree graph relationship routing strategy to obtain and display the target routing trajectories between service nodes; determining the call or dependency relationships between service nodes based on the target routing trajectories between service nodes; and analyzing and locating faults in the system service component architecture through the call or dependency relationships between service nodes. This application can improve the clarity of expressing system dependencies, quickly locate critical service links, and assist in system architecture analysis and fault location.

[0005] The specific technical solutions provided in this application are as follows: In a first aspect, this application provides a system service component management method, the method comprising: The system service components are displayed as rectangular service nodes; Determine the start point and end point of the service node, and generate a Manhattan distance inflection point between the start point and the end point of the service node; Connect the starting point of the service node with the Manhattan distance inflection point to form a routing trajectory line, and determine whether the routing trajectory line passes through an obstacle; If the routing trajectory does not pass through an obstacle, the starting point of the service node is moved to the Manhattan distance inflection point; In response to the routing trajectory line passing through an obstacle, the starting point of the service node is moved to the side endpoint of the obstacle; Based on the routing trajectory line from the starting point of the service node to the ending point of the service node, formulate a rectangular tree diagram relationship routing strategy; The heuristic routing algorithm in Manhattan Smart Routing is improved by using the rectangular tree graph relationship routing strategy to obtain and display the target routing trajectories between service nodes; The call or dependency relationships between service nodes are determined based on the target routing trajectories between the service nodes; The system service component architecture is analyzed and faults are located by analyzing the calls or dependencies between service nodes.

[0006] Secondly, this application also provides a system service component management device, the device comprising: The display module is used to display system service components in the form of rectangular service nodes; The first determining module is used to determine the starting point and ending point of the service node, and generate a Manhattan distance inflection point between the starting point and the ending point of the service node; A routing module is used to connect the starting point of the service node to the Manhattan distance inflection point to form a routing trajectory line, and to determine whether the routing trajectory line passes through an obstacle; if the routing trajectory line does not pass through an obstacle, the starting point of the service node is moved to the Manhattan distance inflection point; if the routing trajectory line passes through an obstacle, the starting point of the service node is moved to the side endpoint of the obstacle; and a rectangular tree diagram relationship routing strategy is formulated based on the routing trajectory line from the starting point of the service node to the ending point of the service node. The calculation module is used to improve the heuristic routing algorithm in Manhattan Smart Routing through the rectangular tree graph relationship routing strategy, obtain the target routing trajectory between service nodes and display it; The second determining module is used to determine the calling or dependency relationship between service nodes based on the target routing trajectory between the service nodes; The management module is used to analyze the architecture of the system service components and locate faults through the calls or dependencies between service nodes.

[0007] Thirdly, a system service component management device is also provided, including: One or more processors; Storage device for storing one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement the system service component management method as described in any of the first aspects.

[0008] Fourthly, this application also provides a computer device, the device comprising: A memory, a processor, and a computer program stored on the memory, wherein the processor executes the computer program to implement the steps of the system service component management method as described in any of the first aspects.

[0009] Fifthly, this application also provides a computer program product, including a computer program that, when executed by a processor, implements the steps of the system service component management method described in any of the first aspects.

[0010] Sixthly, this application also provides a computer storage medium, the medium comprising: It stores a computer program that, when executed by a processor, implements the steps of the system service component management method described in any of the first aspects.

[0011] Compared with the prior art, the method of the technical solution provided in this application includes: displaying system service components in the form of rectangular service nodes; determining the starting point and ending point of the service nodes, and generating a Manhattan distance inflection point between the starting point and the ending point; connecting the starting point and the Manhattan distance inflection point to form a routing trajectory line, and determining whether the routing trajectory line passes through an obstacle; in response to the routing trajectory line not passing through an obstacle, moving the starting point of the service node to the Manhattan distance inflection point; in response to the routing trajectory line passing through an obstacle, moving the starting point of the service node to the side endpoint of the obstacle; formulating a rectangular tree graph relationship routing strategy based on the routing trajectory line from the starting point to the ending point of the service node; improving the heuristic routing algorithm in Manhattan intelligent routing through the rectangular tree graph relationship routing strategy to obtain and display the target routing trajectory between service nodes; determining the call or dependency relationship between service nodes based on the target routing trajectory between service nodes; and analyzing and locating the system service component architecture through the call or dependency relationship between service nodes. This application can improve the clarity of expressing system dependencies, quickly locate critical service links, assist in system architecture analysis and fault location, and enhance system maintainability.

[0012] The technical solution provided in this application embodiment can support the drawing of relationship lines under a large number of service nodes in a rectangular tree diagram, support intelligent node avoidance, and avoid routing lines from obscuring node content. Compared with Manhattan intelligent routing, it significantly improves the efficiency of line drawing. From service node A to service node B, the number of loop trajectories is reduced from 4683 times to 6 times, and the trajectory calculation time is reduced from 18710ms to 26ms, resulting in a significant improvement in trajectory efficiency. Attached Figure Description

[0013] To more clearly illustrate the technical solutions in the embodiments of this application, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0014] Figure 1 The Manhattan intelligent routing diagram provided for embodiments of this application; Figure 2 The Manhattan Smart Router First Trajectory Map provided in this application embodiment; Figure 3 The Manhattan Smart Router Second Trajectory Map provided in this application embodiment; Figure 4 The Manhattan Smart Router Third Trajectory Map provided in this application embodiment; Figure 5 The fourth trajectory map of Manhattan Smart Router provided in this application embodiment; Figure 6 A first flowchart for system service component management provided in this application embodiment; Figure 7 The improved Manhattan Smart Router first trajectory map provided in the embodiments of this application; Figure 8 The improved Manhattan Smart Router Second Trajectory Map provided for embodiments of this application; Figure 9 The first optimized trajectory map of the routing algorithm boundary provided in the embodiments of this application; Figure 10 The second optimized trajectory map of the routing algorithm boundary provided in the embodiments of this application; Figure 11 The third optimized trajectory map of the routing algorithm boundary provided in the embodiments of this application; Figure 12 The fourth optimized trajectory map of the routing algorithm boundary provided in the embodiments of this application; Figure 13 The corrected grid and evenly divided grid table diagrams provided in the embodiments of this application; Figure 14The first sub-graph of the detailed flowchart of the rectangular tree diagram relationship routing provided in the embodiments of this application; Figure 15 The second sub-graph is a detailed flowchart of the rectangular tree diagram relationship routing provided in the embodiments of this application; Figure 16 The third sub-graph is a detailed flowchart of the rectangular tree diagram relationship routing provided in the embodiments of this application; Figure 17 This is an overall flowchart of the rectangular tree diagram relationship routing provided in the embodiments of this application; Figure 18 A structural diagram of the system service component management device provided in the embodiments of this application; Figure 19 The exemplary systems provided for embodiments of this application can be used to implement the various embodiments described in this application. Detailed Implementation

[0015] To make the objectives, technical solutions, and advantages of this application clearer, the technical solutions in the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. Based on the embodiments in this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0016] It should be noted that, unless the context explicitly requires it, the words "comprising," "including," and similar terms in the entire specification and claims should be interpreted as encompassing rather than being exclusive or exhaustive; that is, meaning "including but not limited to."

[0017] Furthermore, in the description of this application, unless otherwise stated, "a plurality of" means two or more.

[0018] Relational routing falls under the intersection of graph visualization or graph drawing and information visualization, specifically addressing the question of "how to present vertices (service nodes) and edges (relationships) on a flat screen in a readable and low-obfuscation manner." Here, it is listed in the order of "classical methods → combinatorial / optimization methods → recent trends": Among them, graph visualization is a technique and method that presents the abstract graph structure composed of nodes and edges in a graphical way in two-dimensional or three-dimensional space, enabling intuitive understanding of the relationships, structures and patterns between data. Classic layout and routing framework: Force-directed layouts, combined with basic straight lines or multi-segment lines, are suitable for large-scale, undirected relational graphs. They disperse nodes through physical analogies (repulsion / attraction), and offer numerous improvements for acceleration and stability. Hierarchical (Sugiyama) or directed hierarchical layout: It is very suitable for directed flow topology structures, and edge routing is often combined with orthogonal polyline strategy.

[0019] Orthogonal routing: Edges consist of horizontal or vertical segments, which is helpful for viewing "flowchart" diagrams (such as UML / circuit diagrams), but it is difficult to implement in complex port label scenarios; mature libraries (OGDF, Graphviz) already implement orthogonal routing and planarization strategies. Polyline or polyline routing and splines: achieve smoother and more aesthetically pleasing routing, but are more difficult to track start and end points; Shortest cost minimization routing: Model the routing problem as finding the shortest or optimal multi-segment path among obstacles (node ​​rectangles) (using grid / visibility graph / optimization methods).

[0020] Edge bundling: Visually "bundles" edges with similar orientations together to reduce clutter (force-directed bundling, geometry-based bundling, and hierarchical bundling have different implementations). Here, as shown in Table 1 below, the X6 graph editing engine has the following built-in routes: Table 1 However, the relational routing provided by the graph editing engine (antv) has the following disadvantages when used in a rectangular tree diagram: 1) In a rectangular tree diagram, default routes, orthogonal routes, restricted orthogonal routes, intelligent subway routes, and entity relationship routes all have the problem of relationship route lines passing through nodes. When there are a large number of nodes and relationship lines, the relationship drawing becomes messy and it is not easy to analyze the relationship between nodes. 2) Manhattan intelligent routing is only suitable for scenarios with a small number of nodes and relationship lines. For scenarios with a large number of nodes and relationship lines, the calculation will fail and fall back to orthogonal routing. like Figure 1As shown, Manhattan routing uses the A* path planning algorithm: F(n) = G(n) + H(n), where the heuristic function H(n) uses Manhattan distance to calculate the path cost: H(n) = D * (abs ( nx – goal.x ) + abs( ny – goal.y ) ), with a default pathfinding step size of 10px, a path polling calculation limit of 2000 times, and 90 direction changes. It is suitable for scenarios with relatively close and uncomplicated obstacles, but for large-scale architecture graphs with complex obstacles and distant node relationships, it cannot calculate a specific path.

[0021] Example 1 This application provides a system service component management method, such as... Figure 1 As shown, the method includes: The system service components are displayed as rectangular service nodes; Determine the start point and end point of the service node, and generate a Manhattan distance inflection point between the start point and the end point of the service node; Connect the starting point of the service node with the Manhattan distance inflection point to form a routing trajectory line, and determine whether the routing trajectory line passes through an obstacle; If the routing trajectory does not pass through an obstacle, the starting point of the service node is moved to the Manhattan distance inflection point; In response to the routing trajectory line passing through an obstacle, the starting point of the service node is moved to the side endpoint of the obstacle; Based on the routing trajectory line from the starting point of the service node to the ending point of the service node, formulate a rectangular tree diagram relationship routing strategy; The heuristic routing algorithm in Manhattan Smart Routing is improved by using the rectangular tree graph relationship routing strategy to obtain and display the target routing trajectories between service nodes; The call or dependency relationships between service nodes are determined based on the target routing trajectories between the service nodes; The system service component architecture is analyzed and faults are located by analyzing the calls or dependencies between service nodes.

[0022] Specifically, the technical solution of this application is implemented by improving the heuristic function in the A* routing planning algorithm. Instead of moving a fixed distance up, down, left, and right, it is adjusted to connect the starting point with the Manhattan distance inflection point. When there are no obstacles, it moves directly to the Manhattan distance inflection point, and when there are obstacles, it moves to the two ends of the obstacle, so as to improve the efficiency of path planning.

[0023] The technical solution of this application is applicable to the drawing requirements of a large number of nodes and relationship lines in a rectangular tree diagram; The original Manhattan routing technology is a grid-based pathfinding method, which is prone to computational performance issues when drawing a large number of node relationships. After improving the prediction model in the A* heuristic routing algorithm of Manhattan Smart Routing, it can quickly find paths across grids, reduce the computational loss of invalid pathfinding, and enable fast movement based on obstacle endpoints combined with Manhattan distance.

[0024] It is understood that the technical solution of this application adopts the rectangular tree graph relationship routing method to automatically calculate the optimal routing trajectory between service nodes; the routing trajectory is generated along the rectangular boundary or a unified rule channel to maintain a consistent path style; it supports interactive operations such as link highlighting and path backtracking; it improves the clarity of the expression of system dependencies, quickly locates key service links, and assists in system architecture analysis and fault location.

[0025] Among them, the rectangular tree diagram is a type of graph used for hierarchical data visualization. Each node is represented by a rectangle, the area of ​​which is proportional to a certain numerical attribute, and the hierarchy is expressed through nested rectangles.

[0026] Service node: The basic unit in a graph structure, representing an object, entity, or data item; nodes can contain attributes (such as name, type, weight), and are usually represented by points, rectangles, or icons in the graph.

[0027] Relationship line: A line segment connecting two service nodes, used to represent the relationship, dependency, or interaction between the nodes.

[0028] Relationship routing: In graph visualization, it is a technique for determining the specific paths of relationship lines (edges) between nodes in order to reduce intersections, avoid occlusions, and improve readability and aesthetics.

[0029] The beneficial effects of the technical solutions provided in this application are: This application can improve the clarity of expressing system dependencies, quickly locate critical service links, assist in system architecture analysis and fault location, and enhance system maintainability.

[0030] The technical solution provided in this application embodiment can support the drawing of relationship lines under a large number of service nodes in a rectangular tree diagram, support intelligent node avoidance, and avoid routing lines from obscuring node content. Compared with Manhattan intelligent routing, it significantly improves the efficiency of line drawing. From service node A to service node B, the number of loop trajectories is reduced from 4683 times to 6 times, and the trajectory calculation time is reduced from 18710ms to 26ms, resulting in a significant improvement in trajectory efficiency.

[0031] Example 2 This application provides a system service component management method, such as... Figure 6 As shown, the method includes: The closest related technology is Manhattan Smart Router (an automatic routing strategy for graphical connectors): like Figure 2 As shown, move the distance in the four directions (up, down, left, right) by a distance of step. like Figure 3 As shown, select the point with the smallest distance from the endpoint Manhattan in option 1. Since there is an obstacle above, the only options are to move the step distance to the right or downward. like Figure 4 As shown, select the point with the smallest distance from the endpoint Manhattan in option 1. There are obstacles to the right and up, so the only option is to move down by step. like Figure 5 As shown, select the point with the smallest distance from the endpoint Manhattan in option 2. The point to the left is the point that has already been moved, so the only options are to move to the right and down by step distance.

[0032] In permission systems or rule engines, rule units and permission objects typically exist as independent rectangular nodes, which are interconnected through logical relationships. These logical relationships include rule triggering relationships, permission inheritance or constraint relationships, and policy dependency relationships. However, the problem now is that rule relationships are complex and difficult to present as a whole; traditional tree structures cannot accurately express non-hierarchical relationships between nodes; and messy paths affect rule understanding and configuration. This application utilizes a rectangular tree graph relationship routing method to calculate relationship routing trajectories without changing the service node layout; supports simultaneous display of multiple rule relationships while maintaining clear paths; provides visualization support for rule debugging and analysis; improves the interpretability of the rule system; reduces the rule configuration error rate; and enhances system maintainability.

[0033] Step S01: Display the system service components as rectangular service nodes; Determine the start point and end point of the service node, and generate a Manhattan distance inflection point between the start point and the end point of the service node.

[0034] Manhattan distance refers to the distance between two points when only horizontal and vertical movement is allowed, and it is equal to the sum of the absolute values ​​of the differences in the point coordinates.

[0035] Step S02, as follows Figure 7 As shown, a route trajectory line is formed by connecting the starting point of the service node with the Manhattan distance inflection point, and it is determined whether the route trajectory line passes through an obstacle; If the routing trajectory does not pass through an obstacle, the starting point of the service node is moved to the Manhattan distance inflection point; In response to the routing trajectory line passing through an obstacle, the starting point of the service node is moved to the side endpoint of the obstacle; Based on the routing trajectory line from the starting point of the service node to the ending point of the service node, formulate a rectangular tree diagram relationship routing strategy; The heuristic routing algorithm in Manhattan Smart Routing is improved by using the rectangular tree graph relationship routing strategy to obtain and display the target routing trajectories between service nodes.

[0036] Specifically, such as Figure 8 As shown, by improving the heuristic function in the A* path planning algorithm, the starting point is connected to the Manhattan distance inflection point. When there are no obstacles, the path moves directly to the Manhattan distance inflection point; when there are obstacles, the path moves to the endpoints on either side of the obstacle.

[0037] Among them, the A* routing algorithm is a path planning algorithm based on heuristic search, used to find the minimum cost path from the starting point to the destination in a graph or grid.

[0038] Step S021: Obtain the coordinate information of the start and end rectangle service nodes; Obtain the anchor point information of the start and end rectangle service nodes; The minimum trajectory movement grid cell distance is obtained by evenly dividing the service node coordinate information by the service node anchor point information; Calculate the Manhattan distance between the current start and end points based on the coordinate information of the start and end rectangle service nodes; Based on the Manhattan distance between the current starting and ending points, several (two) Manhattan inflection points are calculated for the starting and ending points; Determine whether a number of Manhattan inflection points coincide with the endpoint; If several Manhattan turning points do not coincide with the endpoint, then determine whether there are obstacles between the starting point and the Manhattan turning points; In response to the presence of an obstacle between the starting point and the Manhattan inflection point, the intersection of the line connecting the starting point to the Manhattan inflection point and the obstacle is calculated. Several obstacle inflection points are calculated based on the distance between the intersection points and the minimum trajectory moving grid cell. The starting point and the endpoint are calculated based on the relational route trajectory obtained from the several obstacle inflection points. If there are no obstacles between the starting point and the Manhattan inflection point, the starting point and the endpoint are calculated based on the relational routing trajectory obtained from several Manhattan inflection points. The target route trajectory is obtained and displayed by calculating the starting point and ending point of the relational route trajectory, drawing the service node relational route connection line, and drawing the starting point and ending point.

[0039] Step S0211: Calculate the intersection of the line connecting the starting point to the first Manhattan turning point or the second Manhattan turning point with the obstacle; The intersection point closest to the starting point is taken as the first intersection point between the line and the obstacle; The point at which the distance from the first intersection point to the starting point is the minimum trajectory movement grid cell distance is calculated, and this point is taken as the first obstacle inflection point from the starting point to the obstacle; Calculate several (two) endpoints of the edge containing the first intersection point; The second obstacle inflection point is calculated based on the distance between several endpoints of the edge where the first intersection point is located and the minimum trajectory moving grid cell. The starting point and ending point of the relational route trajectory are obtained based on the second obstacle inflection point. The step of calculating the second obstacle inflection point based on the distance between several endpoints of the edge where the first intersection point is located and the minimum trajectory moving grid cell, and obtaining the starting point and endpoint of the relational route trajectory calculation based on the second obstacle inflection point, includes: In response to determining the first endpoint of the side where the first intersection point is located, the offset point of the first endpoint of the obstacle rectangle is calculated to be the distance of the minimum trajectory movement grid cell. This offset point is used as the second obstacle inflection point from the starting point to the first endpoint. The first obstacle inflection point and the second obstacle inflection point in the direction of the first endpoint are recorded as two trajectory points under the current branch of the current trajectory link. The second obstacle inflection point in the direction of the first endpoint is set as the trajectory calculation starting point and the ending point is the position ending point. In response to determining the second endpoint of the side where the first intersection point is located, the offset point of the second endpoint of the obstacle rectangle is calculated to be the distance of the minimum trajectory movement grid cell. This offset point is taken as the second obstacle inflection point from the starting point to the second obstacle in the direction of the second endpoint. The first obstacle inflection point and the second obstacle inflection point in the direction of the second endpoint are recorded as two trajectory points under the current branch of the current trajectory link. The second obstacle inflection point in the direction of the second endpoint is set as the trajectory calculation starting point and the ending point is the position ending point.

[0040] Specifically, calculate the intersection of the line connecting the starting point to the inflection point a / b with the obstacle, and take the intersection point closest to the starting point as the first intersection point x of the line with the obstacle; calculate the point with a distance d from the first intersection point to the starting point as the first inflection point x1 from the starting point to the obstacle; calculate the two endpoints m1 and m2 of the side where the intersection point x is located. Calculate the offset point of the obstacle rectangle m1 at a distance d from the outer edge, and use it as the second inflection point y1 from the starting point to the obstacle in the direction of m1; record the inflection points x1 and y1 as the next two trajectory points of the current trajectory link (a or b), with the inflection point y1 as the trajectory calculation start point and the end point as the position end point; Calculate the offset point of the obstacle rectangle m2 at a distance d from the outer circle. This offset point is used as the second inflection point y2 from the starting point to the obstacle in the direction of m2. Record the inflection points x1 and y2 as the next two trajectory points of the current trajectory link (the current branch a or b). The inflection point y2 is the starting point of the trajectory calculation, and the end point is the endpoint.

[0041] Step S0212: In response to the absence of obstacles between the starting point and the first Manhattan inflection point, the first Manhattan inflection point is recorded as the next trajectory point of the first branch of the current trajectory link; the first Manhattan inflection point is set as the trajectory calculation starting point and the ending point is the position end point. If there are no obstacles between the starting point and the second Manhattan inflection point, the second Manhattan inflection point is recorded as the next trajectory point of the second branch of the current trajectory link; the second Manhattan inflection point is set as the starting point of trajectory calculation, and the ending point is set as the endpoint.

[0042] Specifically, inflection point a is recorded as the next trajectory point of the current trajectory link a branch, inflection point a is the starting point of trajectory calculation and end point is the end point; inflection point b is recorded as the next trajectory point of the current trajectory link b branch, inflection point b is the starting point of trajectory calculation and end point is the end point.

[0043] Step S0213: In response to the coincidence of several Manhattan inflection points and the endpoint, when the first Manhattan inflection point coincides with the endpoint, the total trajectory distance from the start point to the end point under the branch trajectory link is calculated according to the first branch of the multi-level trajectory. If the sum of the trajectory distances from the start point to the end point under the first branch link of the multi-level trajectory is smaller than the sum of the trajectory distances calculated by other trajectories, then this branch trajectory link is taken as the current first target trajectory link. When the second Manhattan inflection point coincides with the endpoint, the total trajectory distance from the start point to the end point under the branch trajectory link is calculated based on the second branch of the multi-level trajectory. If the sum of the trajectory distances from the start point to the end point under the second branch link of the multi-level trajectory is smaller than the sum of the trajectory distances calculated by other trajectories, then this branch trajectory link is taken as the current second target trajectory link.

[0044] Specifically, the sum of the trajectory distances from the start point to the end point under the branch calculation link composed of multi-level trajectory branches (a, x1, y1(y2)) is smaller than that calculated by other trajectories, and is taken as the current optimal solution; The multi-level trajectory branches (b, x1, y1(y2)) calculate the total trajectory distance from the start point to the end point under the link. If it is smaller than the distance calculated by other trajectories, it is taken as the current optimal solution.

[0045] Step S0214, as follows Figure 9 As shown, when the intersection of the line connecting the starting point of the current traversed service node and the Manhattan inflection point with the obstacle is consistent with the starting point of the current traversed service node, it is determined whether the service node is a visited point. In response to the fact that the service node has been visited in the open set, this path branch is skipped, and the next point of the path planning is the endpoint. like Figure 10As shown, when a path segment intersects with any obstacle, if several endpoints of the intersection point of the path segment and the obstacle are all located inside the obstacle, then the several endpoints are determined to be invalid path points. like Figure 11 As shown, when the direction guided by any inflection point in the current path is opposite to the trend of the path, the parent node of the inflection point C is adjusted to the starting node A of the current path. like Figure 12 , Figure 13 As shown, when any obstacle inflection point intersects with an obstacle, it is determined whether the obstacle inflection point is an endpoint of the obstacle's border. If the obstacle inflection point is an endpoint of the obstacle border (i.e., point D is exactly the endpoint of another obstacle and is not a valid trajectory point), then the obstacle inflection point is deleted and / or the number of obstacle inflection points is reduced by using a dynamic grid table that aligns the start and end coordinates by default, instead of using a correction grid adjusted according to the start and end points.

[0046] Step S0215: In response to a change in the location of a service node or the relationship between service nodes, the starting point of the service node is reconnected to the Manhattan distance inflection point; the starting point of the service node is moved according to the obstacles between service nodes, and a rectangular tree graph relationship routing strategy is formulated; the heuristic routing algorithm in Manhattan intelligent routing is improved by the rectangular tree graph relationship routing strategy to obtain and display the target routing trajectory between service nodes.

[0047] Step S03: Determine the calling or dependency relationships between service nodes based on the target routing trajectories between the service nodes; The system service component architecture is analyzed and faults are located by analyzing the calls or dependencies between service nodes.

[0048] like Figure 14 , Figure 15 , Figure 16As shown, the technical solution of this application obtains the coordinate information of the service nodes of the start and end rectangles; obtains the anchor point information of the service nodes of the start and end rectangles; divides the coordinate information of the service nodes equally using the anchor point information to obtain the minimum trajectory movement grid cell distance; calculates the Manhattan distance between the current start and end points based on the coordinate information of the service nodes of the start and end rectangles; calculates several Manhattan inflection points of the start and end points based on the Manhattan distance between the current start and end points; determines whether the several Manhattan inflection points coincide with the end point; if the several Manhattan inflection points do not coincide with the end point, determines whether there is an obstacle between the start point and the Manhattan inflection point; if there is an obstacle between the start point and the Manhattan inflection point, calculates the intersection point of the line connecting the start point to the Manhattan inflection point and the obstacle, calculates several obstacle inflection points based on the intersection point and the minimum trajectory movement grid cell distance, and calculates the start point and the endpoint of the relational routing trajectory based on the several obstacle inflection points; if there is no obstacle between the start point and the Manhattan inflection point, calculates the start point and the endpoint of the relational routing trajectory based on the several Manhattan inflection points; draws the service node relational routing connection line based on the calculated start point and endpoint of the relational routing trajectory to obtain the target routing trajectory and displays it.

[0049] like Figure 17 As shown, in response to changes in the location or relationship between service nodes, the starting point of the service node is reconnected to the Manhattan distance inflection point; the starting point of the service node is moved according to the obstacles between service nodes, and a rectangular tree graph relationship routing strategy is formulated; the heuristic routing algorithm in Manhattan intelligent routing is improved by the rectangular tree graph relationship routing strategy to obtain and display the target route trajectory between service nodes.

[0050] The system service component management method provided in this application embodiment can be improved and optimized in several ways without departing from the technical solution of this application, and these improvements and optimizations should also be considered within the protection scope of this application.

[0051] The beneficial effects of the technical solutions provided in this application are: This application can improve the clarity of expressing system dependencies, quickly locate critical service links, assist in system architecture analysis and fault location, and enhance system maintainability.

[0052] The technical solution provided in this application embodiment can support the drawing of relationship lines under a large number of service nodes in a rectangular tree diagram, support intelligent node avoidance, and avoid routing lines from obscuring node content. Compared with Manhattan intelligent routing, it significantly improves the efficiency of line drawing. From service node A to service node B, the number of loop trajectories is reduced from 4683 times to 6 times, and the trajectory calculation time is reduced from 18710ms to 26ms, resulting in a significant improvement in trajectory efficiency.

[0053] Example 3 This application provides a system service component management device, such as... Figure 18 As shown, the device includes: The display module is used to display system service components in the form of rectangular service nodes; The first determining module is used to determine the starting point and ending point of the service node, and generate a Manhattan distance inflection point between the starting point and the ending point of the service node; A routing module is used to connect the starting point of the service node to the Manhattan distance inflection point to form a routing trajectory line, and to determine whether the routing trajectory line passes through an obstacle; if the routing trajectory line does not pass through an obstacle, the starting point of the service node is moved to the Manhattan distance inflection point; if the routing trajectory line passes through an obstacle, the starting point of the service node is moved to the side endpoint of the obstacle; and a rectangular tree diagram relationship routing strategy is formulated based on the routing trajectory line from the starting point of the service node to the ending point of the service node. The calculation module is used to improve the heuristic routing algorithm in Manhattan Smart Routing through the rectangular tree graph relationship routing strategy, obtain the target routing trajectory between service nodes and display it; The second determining module is used to determine the calling or dependency relationship between service nodes based on the target routing trajectory between the service nodes; The management module is used to analyze the architecture of the system service components and locate faults through the calls or dependencies between service nodes.

[0054] In this embodiment, the calculation module is used to obtain the coordinate information of the start and end rectangle service nodes; Obtain the anchor point information of the start and end rectangle service nodes; The minimum trajectory movement grid cell distance is obtained by evenly dividing the service node coordinate information by the service node anchor point information; Calculate the Manhattan distance between the current start and end points based on the coordinate information of the start and end rectangle service nodes; Several Manhattan inflection points are calculated based on the Manhattan distance between the current starting and ending points. Determine whether a number of Manhattan inflection points coincide with the endpoint; If several Manhattan turning points do not coincide with the endpoint, then determine whether there are obstacles between the starting point and the Manhattan turning points; In response to the presence of an obstacle between the starting point and the Manhattan inflection point, the intersection of the line connecting the starting point to the Manhattan inflection point and the obstacle is calculated. Several obstacle inflection points are calculated based on the distance between the intersection points and the minimum trajectory moving grid cell. The starting point and the endpoint are calculated based on the relational route trajectory obtained from the several obstacle inflection points. If there are no obstacles between the starting point and the Manhattan inflection point, the starting point and the endpoint are calculated based on the relational routing trajectory obtained from several Manhattan inflection points. The target route trajectory is obtained and displayed by calculating the starting point and ending point of the relational route trajectory, drawing the service node relational route connection line, and drawing the starting point and ending point.

[0055] In this embodiment, the calculation module is used to calculate the intersection point of the line connecting the starting point to the first Manhattan turning point or the second Manhattan turning point and the obstacle; The intersection point closest to the starting point is taken as the first intersection point between the line and the obstacle; The point at which the distance from the first intersection point to the starting point is the minimum trajectory movement grid cell distance is calculated, and this point is taken as the first obstacle inflection point from the starting point to the obstacle; Calculate the endpoints of the edge containing the first intersection point; The second obstacle inflection point is calculated based on the distance between several endpoints of the edge where the first intersection point is located and the minimum trajectory moving grid cell. The starting point and ending point of the relational route trajectory are then obtained based on the second obstacle inflection point.

[0056] In one embodiment, the calculation module is used to calculate the offset point of the first endpoint of the first intersection point after determining the first endpoint of the first intersection point. The offset point is the distance of the minimum trajectory movement grid cell from the first endpoint of the obstacle rectangle to the outer circle. The offset point is used as the second obstacle inflection point from the starting point to the first endpoint. The first obstacle inflection point and the second obstacle inflection point in the direction of the first endpoint are recorded as two trajectory points under the current branch of the current trajectory link. The second obstacle inflection point in the direction of the first endpoint is set as the trajectory calculation starting point and the ending point is the position ending point. In response to determining the second endpoint of the side where the first intersection point is located, the offset point of the second endpoint of the obstacle rectangle is calculated to be the distance of the minimum trajectory movement grid cell. This offset point is taken as the second obstacle inflection point from the starting point to the second obstacle in the direction of the second endpoint. The first obstacle inflection point and the second obstacle inflection point in the direction of the second endpoint are recorded as two trajectory points under the current branch of the current trajectory link. The second obstacle inflection point in the direction of the second endpoint is set as the trajectory calculation starting point and the ending point is the position ending point.

[0057] In one embodiment, the calculation module is used to record the first Manhattan inflection point as the next trajectory point of the first branch of the current trajectory link if there is no obstacle between the starting point and the first Manhattan inflection point; and to set the first Manhattan inflection point as the trajectory calculation starting point and the ending point as the position ending point. If there are no obstacles between the starting point and the second Manhattan inflection point, the second Manhattan inflection point is recorded as the next trajectory point of the second branch of the current trajectory link; the second Manhattan inflection point is set as the starting point of trajectory calculation, and the ending point is set as the endpoint.

[0058] In one embodiment, the calculation module is used to respond to a plurality of Manhattan inflection points coinciding with the endpoint, such that when the first Manhattan inflection point coincides with the endpoint, the total trajectory distance from the start point to the end point under the branch trajectory link is calculated according to the first branch of the multi-level trajectory; If the sum of the trajectory distances from the start point to the end point under the first branch link of the multi-level trajectory is smaller than the sum of the trajectory distances calculated by other trajectories, then this branch trajectory link is taken as the current first target trajectory link. When the second Manhattan inflection point coincides with the endpoint, the total trajectory distance from the start point to the end point under the branch trajectory link is calculated based on the second branch of the multi-level trajectory. If the sum of the trajectory distances from the start point to the end point under the second branch link of the multi-level trajectory is smaller than the sum of the trajectory distances calculated by other trajectories, then this branch trajectory link is taken as the current second target trajectory link.

[0059] In one embodiment, the calculation module is used to determine whether the service node is a visited point when the intersection of the line connecting the starting point of the current traversed service node and the Manhattan inflection point with the obstacle is consistent with the starting point of the current traversed service node. If the service node has been visited in the open set, the path branch is skipped and the next point of the path planning is the endpoint. When a path segment intersects with any obstacle, if several endpoints of the intersection point of the path segment and the obstacle are all located inside the obstacle, then the several endpoints are determined to be invalid path points. If any inflection point in the current path leads in a direction opposite to the trend of the path, then the parent node of that inflection point is adjusted to the starting node of the current path. When any obstacle inflection point intersects with another obstacle, determine whether that inflection point is an endpoint of the obstacle's boundary. If the obstacle inflection point is an endpoint of the obstacle border, then the obstacle inflection point is deleted and / or the number of obstacle inflection points is reduced by aligning the dynamic mesh with the start and end coordinates.

[0060] In one embodiment, the calculation module is used to respond to changes in the location of service nodes or service node relationships by reconnecting the starting point of the service node with the Manhattan distance inflection point; moving the starting point of the service node according to the obstacles between service nodes, formulating a rectangular tree graph relationship routing strategy; and improving the heuristic routing algorithm in Manhattan intelligent routing through the rectangular tree graph relationship routing strategy to obtain and display the target routing trajectory between service nodes.

[0061] The beneficial effects of the technical solutions provided in this application are: This application can improve the clarity of expressing system dependencies, quickly locate critical service links, assist in system architecture analysis and fault location, and enhance system maintainability.

[0062] The technical solution provided in this application embodiment can support the drawing of relationship lines under a large number of service nodes in a rectangular tree diagram, support intelligent node avoidance, and avoid routing lines from obscuring node content. Compared with Manhattan intelligent routing, it significantly improves the efficiency of line drawing. From service node A to service node B, the number of loop trajectories is reduced from 4683 times to 6 times, and the trajectory calculation time is reduced from 18710ms to 26ms, resulting in a significant improvement in trajectory efficiency.

[0063] Example 4 The present invention also provides a system service component management device, comprising: One or more processors; Storage device for storing one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors perform the following system service component management method: The system service components are displayed as rectangular service nodes; Determine the start point and end point of the service node, and generate a Manhattan distance inflection point between the start point and the end point of the service node; Connect the starting point of the service node with the Manhattan distance inflection point to form a routing trajectory line, and determine whether the routing trajectory line passes through an obstacle; If the routing trajectory does not pass through an obstacle, the starting point of the service node is moved to the Manhattan distance inflection point; In response to the routing trajectory line passing through an obstacle, the starting point of the service node is moved to the side endpoint of the obstacle; Based on the routing trajectory line from the starting point of the service node to the ending point of the service node, formulate a rectangular tree diagram relationship routing strategy; The heuristic routing algorithm in Manhattan Smart Routing is improved by using the rectangular tree graph relationship routing strategy to obtain and display the target routing trajectories between service nodes; The call or dependency relationships between service nodes are determined based on the target routing trajectories between the service nodes; The system service component architecture is analyzed and faults are located by analyzing the calls or dependencies between service nodes.

[0064] The beneficial effects of the technical solutions provided in this application are: This application can improve the clarity of expressing system dependencies, quickly locate critical service links, assist in system architecture analysis and fault location, and enhance system maintainability.

[0065] The technical solution provided in this application embodiment can support the drawing of relationship lines under a large number of service nodes in a rectangular tree diagram, support intelligent node avoidance, and avoid routing lines from obscuring node content. Compared with Manhattan intelligent routing, it significantly improves the efficiency of line drawing. From service node A to service node B, the number of loop trajectories is reduced from 4683 times to 6 times, and the trajectory calculation time is reduced from 18710ms to 26ms, resulting in a significant improvement in trajectory efficiency.

[0066] Example 5 This application provides a computer device, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it can perform the following method for managing system service components: The system service components are displayed as rectangular service nodes; Determine the start point and end point of the service node, and generate a Manhattan distance inflection point between the start point and the end point of the service node; Connect the starting point of the service node with the Manhattan distance inflection point to form a routing trajectory line, and determine whether the routing trajectory line passes through an obstacle; If the routing trajectory does not pass through an obstacle, the starting point of the service node is moved to the Manhattan distance inflection point; In response to the routing trajectory line passing through an obstacle, the starting point of the service node is moved to the side endpoint of the obstacle; Based on the routing trajectory line from the starting point of the service node to the ending point of the service node, formulate a rectangular tree diagram relationship routing strategy; The heuristic routing algorithm in Manhattan Smart Routing is improved by using the rectangular tree graph relationship routing strategy to obtain and display the target routing trajectories between service nodes; The call or dependency relationships between service nodes are determined based on the target routing trajectories between the service nodes; The system service component architecture is analyzed and faults are located by analyzing the calls or dependencies between service nodes.

[0067] The beneficial effects of the technical solutions provided in this application are: This application can improve the clarity of expressing system dependencies, quickly locate critical service links, assist in system architecture analysis and fault location, and enhance system maintainability.

[0068] The technical solution provided in this application embodiment can support the drawing of relationship lines under a large number of service nodes in a rectangular tree diagram, support intelligent node avoidance, and avoid routing lines from obscuring node content. Compared with Manhattan intelligent routing, it significantly improves the efficiency of line drawing. From service node A to service node B, the number of loop trajectories is reduced from 4683 times to 6 times, and the trajectory calculation time is reduced from 18710ms to 26ms, resulting in a significant improvement in trajectory efficiency.

[0069] Example 6 This application also provides a computer program product, including a computer program that, when executed by a processor, can implement a method for managing system service components as follows: The system service components are displayed as rectangular service nodes; Determine the start point and end point of the service node, and generate a Manhattan distance inflection point between the start point and the end point of the service node; Connect the starting point of the service node with the Manhattan distance inflection point to form a routing trajectory line, and determine whether the routing trajectory line passes through an obstacle; If the routing trajectory does not pass through an obstacle, the starting point of the service node is moved to the Manhattan distance inflection point; In response to the routing trajectory line passing through an obstacle, the starting point of the service node is moved to the side endpoint of the obstacle; Based on the routing trajectory line from the starting point of the service node to the ending point of the service node, formulate a rectangular tree diagram relationship routing strategy; The heuristic routing algorithm in Manhattan Smart Routing is improved by using the rectangular tree graph relationship routing strategy to obtain and display the target routing trajectories between service nodes; The call or dependency relationships between service nodes are determined based on the target routing trajectories between the service nodes; The system service component architecture is analyzed and faults are located by analyzing the calls or dependencies between service nodes.

[0070] The beneficial effects of the technical solutions provided in this application are: This application can improve the clarity of expressing system dependencies, quickly locate critical service links, assist in system architecture analysis and fault location, and enhance system maintainability.

[0071] The technical solution provided in this application embodiment can support the drawing of relationship lines under a large number of service nodes in a rectangular tree diagram, support intelligent node avoidance, and avoid routing lines from obscuring node content. Compared with Manhattan intelligent routing, it significantly improves the efficiency of line drawing. From service node A to service node B, the number of loop trajectories is reduced from 4683 times to 6 times, and the trajectory calculation time is reduced from 18710ms to 26ms, resulting in a significant improvement in trajectory efficiency.

[0072] Example 7 This application provides a computer storage medium, including a memory, a processor, and a computer program stored on the memory and executable on the processor. When the processor executes the computer program, it performs the following steps: The system service components are displayed as rectangular service nodes; Determine the start point and end point of the service node, and generate a Manhattan distance inflection point between the start point and the end point of the service node; Connect the starting point of the service node with the Manhattan distance inflection point to form a routing trajectory line, and determine whether the routing trajectory line passes through an obstacle; If the routing trajectory does not pass through an obstacle, the starting point of the service node is moved to the Manhattan distance inflection point; In response to the routing trajectory line passing through an obstacle, the starting point of the service node is moved to the side endpoint of the obstacle; Based on the routing trajectory line from the starting point of the service node to the ending point of the service node, formulate a rectangular tree diagram relationship routing strategy; The heuristic routing algorithm in Manhattan Smart Routing is improved by using the rectangular tree graph relationship routing strategy to obtain and display the target routing trajectories between service nodes; The call or dependency relationships between service nodes are determined based on the target routing trajectories between the service nodes; The system service component architecture is analyzed and faults are located by analyzing the calls or dependencies between service nodes.

[0073] In one embodiment, a rectangular tree graph relationship routing strategy is formulated by connecting the service node starting point with the Manhattan distance inflection point; moving the service node starting point according to the obstacles between service nodes; and improving the heuristic routing algorithm in Manhattan intelligent routing through the rectangular tree graph relationship routing strategy to obtain and display the target route trajectory between service nodes, including: Obtain the coordinate information of the start and end rectangle service nodes; Obtain the anchor point information of the start and end rectangle service nodes; The minimum trajectory movement grid cell distance is obtained by evenly dividing the service node coordinate information by the service node anchor point information; Calculate the Manhattan distance between the current start and end points based on the coordinate information of the start and end rectangle service nodes; Several Manhattan inflection points are calculated based on the Manhattan distance between the current starting and ending points. Determine whether a number of Manhattan inflection points coincide with the endpoint; If several Manhattan turning points do not coincide with the endpoint, then determine whether there are obstacles between the starting point and the Manhattan turning points; In response to the presence of an obstacle between the starting point and the Manhattan inflection point, the intersection of the line connecting the starting point to the Manhattan inflection point and the obstacle is calculated. Several obstacle inflection points are calculated based on the distance between the intersection points and the minimum trajectory moving grid cell. The starting point and the endpoint are calculated based on the relational route trajectory obtained from the several obstacle inflection points. If there are no obstacles between the starting point and the Manhattan inflection point, the starting point and the endpoint are calculated based on the relational routing trajectory obtained from several Manhattan inflection points. The target route trajectory is obtained and displayed by calculating the starting point and ending point of the relational route trajectory, drawing the service node relational route connection line, and drawing the starting point and ending point.

[0074] In one embodiment, the intersection of the line connecting the calculation starting point to the Manhattan inflection point and the obstacle is used to calculate several obstacle inflection points based on the distance between the intersection point and the minimum trajectory moving grid cell. The starting point and endpoint of the relational route trajectory calculation are then obtained based on these obstacle inflection points, including: Calculate the intersection of the line connecting the starting point to the first Manhattan turning point or the second Manhattan turning point with the obstacle; The intersection point closest to the starting point is taken as the first intersection point between the line and the obstacle; The point at which the distance from the first intersection point to the starting point is the minimum trajectory movement grid cell distance is calculated, and this point is taken as the first obstacle inflection point from the starting point to the obstacle; Calculate the endpoints of the edge containing the first intersection point; The second obstacle inflection point is calculated based on the distance between several endpoints of the edge where the first intersection point is located and the minimum trajectory moving grid cell. The starting point and ending point of the relational route trajectory are then obtained based on the second obstacle inflection point.

[0075] In one embodiment, the step of calculating the second obstacle inflection point based on the distance between several endpoints of the edge where the first intersection point is located and the minimum trajectory moving grid cell, and obtaining the starting point and endpoint of the relational route trajectory calculation based on the second obstacle inflection point, includes: In response to determining the first endpoint of the side where the first intersection point is located, the offset point of the first endpoint of the obstacle rectangle is calculated to be the distance of the minimum trajectory movement grid cell. This offset point is used as the second obstacle inflection point from the starting point to the first endpoint. The first obstacle inflection point and the second obstacle inflection point in the direction of the first endpoint are recorded as two trajectory points under the current branch of the current trajectory link. The second obstacle inflection point in the direction of the first endpoint is set as the trajectory calculation starting point and the ending point is the position ending point. In response to determining the second endpoint of the side where the first intersection point is located, the offset point of the second endpoint of the obstacle rectangle is calculated to be the distance of the minimum trajectory movement grid cell. This offset point is taken as the second obstacle inflection point from the starting point to the second obstacle in the direction of the second endpoint. The first obstacle inflection point and the second obstacle inflection point in the direction of the second endpoint are recorded as two trajectory points under the current branch of the current trajectory link. The second obstacle inflection point in the direction of the second endpoint is set as the trajectory calculation starting point and the ending point is the position ending point.

[0076] This application can improve the clarity of expressing system dependencies, quickly locate critical service links, assist in system architecture analysis and fault location, and enhance system maintainability.

[0077] The technical solution provided in this application embodiment can support the drawing of relationship lines under a large number of service nodes in a rectangular tree diagram, support intelligent node avoidance, and avoid routing lines from obscuring node content. Compared with Manhattan intelligent routing, it significantly improves the efficiency of line drawing. From service node A to service node B, the number of loop trajectories is reduced from 4683 times to 6 times, and the trajectory calculation time is reduced from 18710ms to 26ms, resulting in a significant improvement in trajectory efficiency.

[0078] Figure 19 This is an exemplary system provided for Embodiment Seven of this application, which can be used to implement the various embodiments described in this application; like Figure 19 As shown, in some embodiments, the system can function as any of the aforementioned devices for managing system service components in each of the various embodiments. In some embodiments, the system may include one or more computer-readable media (e.g., system memory or NVM / storage device) having a result, and one or more processors (e.g., one or more processors) coupled to the one or more computer-readable media and configured to execute the result to implement the module thereby performing the actions described in this application.

[0079] Those skilled in the art will understand that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium. When executed, the computer program can include the processes of the embodiments of the above methods. Any references to memory, storage, databases, or other media used in the embodiments provided in this application can include non-volatile and / or volatile memory. Non-volatile memory may include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), or flash memory. Volatile memory may include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), dual data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link DRAM (SLDRAM), RAMbus direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), etc.

[0080] The technical features of the above embodiments can be combined in any way. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0081] The embodiments described above are merely illustrative of several implementation methods of this application, and while the descriptions are relatively specific and detailed, they should not be construed as limiting the scope of the invention patent. It should be noted that those skilled in the art can make various modifications and improvements without departing from the concept of this application, and these all fall within the protection scope of this application. Therefore, the protection scope of this patent application should be determined by the appended claims.

Claims

1. A method for managing system service components, characterized in that, The method includes: The system service components are displayed as rectangular service nodes; Determine the start point and end point of the service node, and generate a Manhattan distance inflection point between the start point and the end point of the service node; Connect the starting point of the service node with the Manhattan distance inflection point to form a routing trajectory line, and determine whether the routing trajectory line passes through an obstacle; If the routing trajectory does not pass through an obstacle, the starting point of the service node is moved to the Manhattan distance inflection point; In response to the routing trajectory line passing through an obstacle, the starting point of the service node is moved to the side endpoint of the obstacle; Based on the routing trajectory line from the starting point of the service node to the ending point of the service node, formulate a rectangular tree diagram relationship routing strategy; The heuristic routing algorithm in Manhattan Smart Routing is improved by using the rectangular tree graph relationship routing strategy to obtain and display the target routing trajectories between service nodes; The call or dependency relationships between service nodes are determined based on the target routing trajectories between the service nodes; The system service component architecture is analyzed and faults are located by analyzing the calls or dependencies between service nodes.

2. The system service component management method according to claim 1, characterized in that, The process involves connecting the starting point of the service node with the Manhattan distance inflection point to form a routing trajectory line, and determining whether the routing trajectory line passes through an obstacle. If the routing trajectory does not pass through an obstacle, the starting point of the service node is moved to the Manhattan distance inflection point; In response to the routing trajectory line passing through an obstacle, the starting point of the service node is moved to the side endpoint of the obstacle; Based on the routing trajectory line from the starting point of the service node to the ending point of the service node, formulate a rectangular tree diagram relationship routing strategy; The heuristic routing algorithm in Manhattan Smart Routing is improved by using the rectangular tree graph relationship routing strategy to obtain and display the target route trajectories between service nodes, including: Obtain the coordinate information of the start and end rectangle service nodes; Obtain the anchor point information of the start and end rectangle service nodes; The minimum trajectory movement grid cell distance is obtained by evenly dividing the service node coordinate information by the service node anchor point information; Calculate the Manhattan distance between the current start and end points based on the coordinate information of the start and end rectangle service nodes; Several Manhattan inflection points are calculated based on the Manhattan distance between the current starting and ending points. Determine whether a number of Manhattan inflection points coincide with the endpoint; If several Manhattan turning points do not coincide with the endpoint, then determine whether there are obstacles between the starting point and the Manhattan turning points; In response to the presence of an obstacle between the starting point and the Manhattan inflection point, the intersection of the line connecting the starting point to the Manhattan inflection point and the obstacle is calculated. Several obstacle inflection points are calculated based on the distance between the intersection points and the minimum trajectory moving grid cell. The starting point and the endpoint are calculated based on the relational route trajectory obtained from the several obstacle inflection points. If there are no obstacles between the starting point and the Manhattan inflection point, the starting point and the endpoint are calculated based on the relational routing trajectory obtained from several Manhattan inflection points. The target route trajectory is obtained and displayed by calculating the starting point and ending point of the relational route trajectory, drawing the service node relational route connection line, and drawing the starting point and ending point.

3. The system service component management method according to claim 2, characterized in that, The intersection of the line connecting the calculation starting point to the Manhattan inflection point and the obstacle is used to calculate several obstacle inflection points based on the distance between the intersection point and the minimum trajectory moving grid cell. Based on these obstacle inflection points, the starting point and endpoint of the relational route trajectory calculation are obtained, including: Calculate the intersection of the line connecting the starting point to the first Manhattan turning point or the second Manhattan turning point with the obstacle; The intersection point closest to the starting point is taken as the first intersection point between the line and the obstacle; The point at which the distance from the first intersection point to the starting point is the minimum trajectory movement grid cell distance is calculated, and this point is taken as the first obstacle inflection point from the starting point to the obstacle; Calculate the endpoints of the edge containing the first intersection point; The second obstacle inflection point is calculated based on the distance between several endpoints of the edge where the first intersection point is located and the minimum trajectory moving grid cell. The starting point and ending point of the relational route trajectory are then obtained based on the second obstacle inflection point.

4. The system service component management method according to claim 3, characterized in that, The step of calculating the second obstacle inflection point based on the distance between several endpoints of the edge where the first intersection point is located and the minimum trajectory moving grid cell, and obtaining the starting point and endpoint of the relational route trajectory calculation based on the second obstacle inflection point, includes: In response to determining the first endpoint of the side where the first intersection point is located, the offset point of the first endpoint of the obstacle rectangle is calculated to be the distance of the minimum trajectory movement grid cell. This offset point is used as the second obstacle inflection point from the starting point to the first endpoint. The first obstacle inflection point and the second obstacle inflection point in the direction of the first endpoint are recorded as two trajectory points under the current branch of the current trajectory link. The second obstacle inflection point in the direction of the first endpoint is set as the trajectory calculation starting point and the ending point is the position ending point. In response to determining the second endpoint of the side where the first intersection point is located, the offset point of the second endpoint of the obstacle rectangle is calculated to be the distance of the minimum trajectory movement grid cell. This offset point is taken as the second obstacle inflection point from the starting point to the second obstacle in the direction of the second endpoint. The first obstacle inflection point and the second obstacle inflection point in the direction of the second endpoint are recorded as two trajectory points under the current branch of the current trajectory link. The second obstacle inflection point in the direction of the second endpoint is set as the trajectory calculation starting point and the ending point is the position ending point.

5. The system service component management method according to claim 2, characterized in that, The calculation of the starting and ending points of the relational routing trajectory based on several Manhattan inflection points includes: If there are no obstacles between the starting point and the first Manhattan inflection point, then the first Manhattan inflection point is recorded as the next trajectory point of the first branch of the current trajectory link; the first Manhattan inflection point is set as the starting point of the trajectory calculation, and the ending point is set as the endpoint. If there are no obstacles between the starting point and the second Manhattan inflection point, the second Manhattan inflection point is recorded as the next trajectory point of the second branch of the current trajectory link; the second Manhattan inflection point is set as the starting point of trajectory calculation, and the ending point is set as the endpoint.

6. The system service component management method according to claim 2, characterized in that, The method includes: In response to the coincidence of several Manhattan inflection points and the endpoint, when the first Manhattan inflection point coincides with the endpoint, the total trajectory distance from the start point to the end point under the branch trajectory link is calculated according to the first branch of the multi-level trajectory; If the sum of the trajectory distances from the start point to the end point under the first branch link of the multi-level trajectory is smaller than the sum of the trajectory distances calculated by other trajectories, then this branch trajectory link is taken as the current first target trajectory link. When the second Manhattan inflection point coincides with the endpoint, the total trajectory distance from the start point to the end point under the branch trajectory link is calculated based on the second branch of the multi-level trajectory. If the sum of the trajectory distances from the start point to the end point under the second branch link of the multi-level trajectory is smaller than the sum of the trajectory distances calculated by other trajectories, then this branch trajectory link is taken as the current second target trajectory link.

7. The system service component management method according to claim 2, characterized in that, Before calculating the starting and ending points of the service node relationship routing trajectory, drawing the service node relationship routing connection line to obtain the target routing trajectory and displaying it, the following steps are included: When the intersection of the line connecting the starting point of the current traversed service node and the Manhattan inflection point with the obstacle is consistent with the starting point of the current traversed service node, it is determined whether the service node is a visited point. If the service node has been visited in the open set, this path branch is skipped, and the next point of the path planning is the endpoint. When a path segment intersects with any obstacle, if several endpoints of the intersection point of the path segment and the obstacle are all located inside the obstacle, then the several endpoints are determined to be invalid path points. If any inflection point in the current path leads in a direction opposite to the trend of the path, then the parent node of that inflection point is adjusted to the starting node of the current path. When any obstacle inflection point intersects with another obstacle, determine whether that obstacle inflection point is an endpoint of the obstacle's boundary. If the obstacle inflection point is an endpoint of the obstacle border, then the obstacle inflection point is deleted and / or the number of obstacle inflection points is reduced by aligning the dynamic mesh with the start and end coordinates.

8. The system service component management method according to claim 2, characterized in that, The method further includes: In response to changes in the location of service nodes or their relationships, the starting point of the service node is reconnected to the Manhattan distance inflection point; the starting point of the service node is moved according to the obstacles between service nodes, and a rectangular tree graph relationship routing strategy is formulated; the heuristic routing algorithm in Manhattan intelligent routing is improved through the rectangular tree graph relationship routing strategy to obtain and display the target route trajectory between service nodes.

9. A system service component management device, characterized in that, The device includes: The display module is used to display system service components in the form of rectangular service nodes; The first determining module is used to determine the starting point and ending point of the service node, and generate a Manhattan distance inflection point between the starting point and the ending point of the service node; A routing module is used to connect the starting point of the service node to the Manhattan distance inflection point to form a routing trajectory line, and to determine whether the routing trajectory line passes through an obstacle; if the routing trajectory line does not pass through an obstacle, the starting point of the service node is moved to the Manhattan distance inflection point; if the routing trajectory line passes through an obstacle, the starting point of the service node is moved to the side endpoint of the obstacle; and a rectangular tree diagram relationship routing strategy is formulated based on the routing trajectory line from the starting point of the service node to the ending point of the service node. The calculation module is used to improve the heuristic routing algorithm in Manhattan Smart Routing through the rectangular tree graph relationship routing strategy, obtain the target routing trajectory between service nodes and display it; The second determining module is used to determine the calling or dependency relationship between service nodes based on the target routing trajectory between the service nodes; The management module is used to analyze the architecture of the system service components and locate faults through the calls or dependencies between service nodes.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by a processor, it implements the steps of the system service component management method according to any one of claims 1 to 8.

Images