Device management

Abstract

Embodiments of the present disclosure relate to the technical field of cloud computing, and in particular to a device management method, a computing device, a storage medium, and a computer program product. The device management method comprises: receiving a service change operation for a plurality of network service devices; when it is determined that the service change operation satisfies a preset change condition, determining, in a target relationship graph corresponding to the plurality of network service devices, a set of changed nodes corresponding to the service change operation, wherein the target relationship graph is constructed by using the plurality of network service devices and network services provided by the plurality of network service devices as nodes, and using association relationships between the plurality of network service devices and the network services as connection edges; and managing the plurality of network service devices on the basis of the set of changed nodes.

Description

Equipment Management Technical Field

[0001] This disclosure relates to the field of cloud computing technology, and in particular to device management. Background Technology

[0002] In scenarios where dependencies exist between cloud network controllers or other large-scale data sets, there is a significant need to monitor changes in data or their dependencies in real time. For example, in the cloud network controller domain, a cloud network controller can configure and manage network services provided by multiple server cluster machines. When the configuration information of multiple server cluster machines changes, it is necessary to calculate the change information to update and manage the configurations of these multiple server cluster machines. However, since cloud network controllers typically manage a large number of server cluster machines that provide various network services, calculating change information requires frequent queries and calculations, resulting in significant data computation and data storage overhead. Therefore, an effective technical solution is urgently needed to address these issues. Summary of the Invention

[0003] In view of the above, embodiments of this disclosure provide a device management method. One or more embodiments of this disclosure also relate to a device management apparatus, a computing device, a computer-readable storage medium, and a computer program product.

[0004] According to a first aspect of the present disclosure, a device management method is provided, comprising: receiving a service change operation for a plurality of network service devices; determining, in a target relationship graph corresponding to the service change operation, a set of change nodes corresponding to the service change operation when it is determined that the service change operation meets preset change conditions, wherein the target relationship graph is constructed by using the plurality of network service devices, the network services provided by the plurality of network service devices as nodes, and the association relationships between the plurality of network service devices and the network services as connecting edges; and managing the plurality of network service devices according to the set of change nodes.

[0005] According to a second aspect of the present disclosure, a device management apparatus is provided, comprising: a receiving module configured to receive service change operations for a plurality of network service devices; a determining module configured to, when determining that the service change operation meets preset change conditions, determine a set of change nodes corresponding to the service change operation in a target relationship graph corresponding to the plurality of network service devices, wherein the target relationship graph is constructed by using the plurality of network service devices, the network services provided by the plurality of network service devices as nodes, and the association relationships between the plurality of network service devices and the network services as connecting edges; and a management module configured to manage the plurality of network service devices according to the set of change nodes.

[0006] According to a third aspect of the present disclosure, a computing device is provided, comprising: a memory and a processor; the memory is used to store computer programs / instructions, and the processor is used to execute the computer programs / instructions, wherein the computer programs / instructions, when executed by the processor, implement the steps of the above-described device management method.

[0007] According to a fourth aspect of the present disclosure, a computer-readable storage medium is provided that stores a computer program / instructions that, when executed by a processor, implement the steps of the device management method described above.

[0008] According to a fifth aspect of the present disclosure, a computer program product is provided, including a computer program / instructions that, when executed by a processor, implement the steps of the device management method described above.

[0009] One embodiment of this disclosure provides a device management method, including: receiving service change operations for multiple network service devices; when it is determined that the service change operation meets preset change conditions, determining a set of change nodes corresponding to the service change operation in a target relationship graph corresponding to the multiple network service devices, wherein the target relationship graph is constructed by using the multiple network service devices, the network services provided by the multiple network service devices as nodes, and the association relationships between the multiple network service devices and the network services as connecting edges; and managing the multiple network service devices according to the set of change nodes.

[0010] In the above method, management of multiple network service devices and the network services provided by multiple network service devices can be realized based on the target relationship graph. After receiving service change operations for multiple network service devices, if it is determined that the service change operation meets the preset change conditions, the set of change nodes corresponding to the service change operation in the target relationship graph corresponding to the multiple network service devices is determined. Based on the set of change nodes, the multiple network service devices are managed. By judging whether the service change operation meets the preset change conditions, the set of change nodes is calculated for the service change operations that meet the preset change conditions. It is not necessary to calculate the set of change nodes for all service change operations, thereby reducing the computational and storage overhead of calculating the set of change nodes. Attached Figure Description

[0011] Figure 1 is a schematic diagram of an application scenario of a device management method provided in an embodiment of this disclosure.

[0012] Figure 2 is a flowchart of a device management method provided in an embodiment of this disclosure.

[0013] Figure 3 is a schematic diagram of the target relationship in a device management method provided in an embodiment of this disclosure.

[0014] Figure 4 is a schematic diagram of the connection edge addition operation in a device management method provided in one embodiment of this disclosure.

[0015] Figure 5 is a schematic diagram of a node update operation in a device management method provided in one embodiment of this disclosure.

[0016] Figure 6 is a schematic diagram of the connection edge removal operation in a device management method provided in one embodiment of this disclosure.

[0017] Figure 7 is a schematic diagram of a main server and a backup server in a device management method provided in an embodiment of this disclosure.

[0018] Figure 8(a) is a schematic diagram of the calls between the main server and the backup server in a device management method provided in an embodiment of this disclosure.

[0019] Figure 8(b) is a schematic diagram of the switching between the master server and the backup server in a device management method provided in an embodiment of this disclosure.

[0020] Figure 9 is a process flowchart of a device management method provided in an embodiment of this disclosure.

[0021] Figure 10 is a schematic diagram of the structure of a device management apparatus provided in an embodiment of this disclosure.

[0022] Figure 11 is a structural block diagram of a computing device provided in an embodiment of this disclosure. Detailed Implementation

[0023] Numerous specific details are set forth in the following description to provide a full understanding of this disclosure. However, this disclosure can be implemented in many other ways than those described herein, and those skilled in the art can make similar extensions without departing from the spirit of this disclosure. Therefore, this disclosure is not limited to the specific implementations disclosed below.

[0024] The terminology used in one or more embodiments of this disclosure is for the purpose of describing particular embodiments only and is not intended to be limiting of the one or more embodiments of this disclosure. The singular forms “a,” “the,” and “the” as used in one or more embodiments of this disclosure and the appended claims are also intended to include the plural forms unless the context clearly indicates otherwise. It should also be understood that the term “and / or” as used in one or more embodiments of this disclosure refers to and includes any or all possible combinations of one or more associated listed items.

[0025] It should be understood that although the terms first, second, etc., may be used to describe various information in one or more embodiments of this disclosure, such information should not be limited to these terms. These terms are only used to distinguish information of the same type from one another. For example, first may also be referred to as second without departing from the scope of one or more embodiments of this disclosure, and similarly, second may also be referred to as first. Depending on the context, the word “if” as used herein may be interpreted as “when”, “in response to a determination”, or “when…”.

[0026] Furthermore, it should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved in one or more embodiments of this disclosure are all information and data authorized by the user or fully authorized by all parties. Moreover, the collection, use and processing of related data must comply with the relevant laws, regulations and standards of the relevant countries and regions, and corresponding operation entry points are provided for users to choose to authorize or refuse.

[0027] First, the terms and concepts involved in one or more embodiments of this disclosure will be explained.

[0028] A Directed Acyclic Graph (DAG) is a special graph structure consisting of a set of vertices and a set of edges. The edges are directed, and any path formed by any two edges will not form a closed loop. That is, starting from any vertex and moving along a directed edge, it is impossible to return to the original starting point.

[0029] Change Set: A set of changed nodes. When a change is performed in a directed acyclic graph (in this invention, changes include operations such as adding nodes, adding edges, deleting nodes, deleting edges, and updating node content), from the perspective of a certain root node, it is a list of child nodes that have changed before and after the change. The list includes the change action (add, delete, update), node ID, node version, etc.

[0030] Graph databases are data management systems that store relationships between entities. They use graph theory to organize, represent, and manage data. In a graph database, data is stored as vertices or nodes, and relationships between nodes are represented by edges. Each node can have attributes that provide additional information. Edges can have directionality and can also have labels and attributes to describe the type of relationship and other information.

[0031] In practical applications, scenarios involving large-scale data with dependencies present numerous needs requiring real-time monitoring of changes in data or their dependencies. Taking cloud networks as an example, the controller manages a large number of servers and numerous heterogeneous network devices, including but not limited to load balancers, hardware and software firewalls, and routers. The cloud network controller receives configuration commands, such as those issued by tenants and cloud service providers via software and APIs, and distributes these commands to the underlying network elements for execution, thereby enabling rapid configuration and elastic scaling of the cloud network. In this scenario, data is represented by configuration entries, and these entries have data dependencies. These data dependencies refer to two different types of data entities, where one requires the existence of the other to have any practical meaning. For example, in a cloud network, a virtual port must depend on a virtual machine to function. The summary description of these dependent data changes is called a data change set, which is a summary of records of data additions, modifications, deletions, and other change operations. It typically includes elements such as the time, object, and content of the change operation.

[0032] In cloud networks, controllers issue configuration commands by creating, modifying, and deleting network element entries. These entries contain device information, configuration rules, and more. Underlying network elements or monitoring systems need to obtain real-time updates to these entries and their dependencies to quickly modify device configurations or verify that entries and dependencies match the intent of the upper-layer commands. For example, if a group of devices are connected to the same virtual switch and virtual router, then the entries related to routing information within that group will be identical. When the controller creates, modifies, or deletes an entry, other related entries and network devices must be updated accordingly to ensure the proper functioning of the network devices.

[0033] In cloud network scenarios, the number of table entries is extremely large, and their dependencies are highly complex. The change sets of these table entries need to be calculated in real time to support the subsequent distribution, modification, and verification of these configuration data across massive cloud network devices. Simultaneously, cloud service providers must ensure that tenant applications running in the cloud network are not affected by the computational, storage, and network communication overhead caused by monitoring changes in large-scale table entries and their dependencies. Similar challenges exist in real-time calculation of large-scale data change sets in other scenarios with complex data relationships. However, the industry typically stores controller configuration data in relational databases or key-value databases. This makes the representation of data dependencies extremely complex, and calculating change sets requires frequent queries and calculations, resulting in significant computational and storage overhead.

[0034] This disclosure provides a device management method, and also relates to a device management apparatus, a computing device, a computer-readable storage medium, and a computer program product, which will be described in detail in the following embodiments.

[0035] Referring to Figure 1, Figure 1 shows a schematic diagram of an application scenario of a device management method according to an embodiment of the present disclosure. The specific steps are as follows.

[0036] The system receives service change operations for multiple network service devices; when the service change operation meets preset change conditions, it determines a set of change nodes corresponding to the service change operation in the target relationship graph corresponding to the multiple network service devices, wherein the target relationship graph is constructed by using the multiple network service devices, the network services provided by the multiple network service devices as nodes, and the association between the multiple network service devices and the network services as connecting edges; and manages the multiple network service devices according to the set of change nodes.

[0037] Specifically, Figure 1 includes a network controller 102, which manages multiple network service devices 104. In practice, the network controller 102 receives service change operations for the multiple network service devices 104. If the service change operation meets preset change conditions, it determines the set of change nodes corresponding to the service change operation in the target relationship diagram corresponding to the multiple network service devices 104, and manages the service changes of the multiple network service devices 104 based on the set of change nodes.

[0038] Referring to Figure 2, Figure 2 shows a flowchart of a device management method provided according to an embodiment of the present disclosure, which specifically includes the following steps.

[0039] Step 202: Receive service change operations for multiple network service devices.

[0040] Specifically, the device management method provided in this disclosure can be applied to a cloud network controller. A cloud network controller can be understood as a device or software used in a network infrastructure to manage and control various devices and traffic in the network. Multiple network service devices can be understood as devices managed by the cloud network controller. Network service devices can be used to provide network services, such as load balancing services. Therefore, a service change operation can be understood as a service change operation targeting one or more network service devices. This service change operation can be a service configuration change operation for the network service devices, or a change operation to the dependencies between the network service devices.

[0041] In specific implementation, before receiving the service change operation for multiple network service devices, the method further includes: constructing a target relationship graph corresponding to the multiple network service devices, using the multiple network service devices and the network services provided by the multiple network service devices as nodes, and using the association relationship between the multiple network service devices and the network services as connection edges.

[0042] The target relationship graph can be understood as a directed acyclic graph.

[0043] Specifically, when managing multiple network service devices, the multiple network service devices and the network services they provide can be used as nodes, and the relationships between the multiple network service devices and between the multiple network service devices and network services can be used as connecting edges to construct a directed acyclic graph corresponding to the multiple network service devices.

[0044] For example, referring to Figure 3, Figure 3 shows a schematic diagram of a target relationship diagram in a device management method according to an embodiment of the present disclosure. As shown in Figure 3, the target relationship diagram includes nodes 302, 304, 306, 308, 310, and 312. Node 302, as the root node, can be a physical bearer server group. Node 304 can be the load balancing service provided by the physical bearer server group. Node 306 can be a server group in the physical bearer server group that provides load balancing services. Node 308 can be one of the servers in the server group. Node 310 can be one of the servers in the server group. Node 312 can be other servers related to the load balancing service.

[0045] In summary, by constructing a target relationship graph corresponding to multiple network service devices, data management of multiple network service devices can be achieved through the target relationship graph.

[0046] Step 204: If it is determined that the service change operation meets the preset change conditions, in the target relationship graph corresponding to the multiple network service devices, determine the set of change nodes corresponding to the service change operation. The target relationship graph is constructed by taking the multiple network service devices and the network services provided by the multiple network service devices as nodes and the association between the multiple network service devices and the network services as connecting edges.

[0047] Specifically, after receiving service change operations for multiple network service devices, the service change operation can be judged. If the judgment result determines that the service change operation meets the preset change conditions, the set of change nodes corresponding to the service change operation in the target relationship graph can be determined according to the target relationship graph corresponding to the multiple network service devices.

[0048] In specific implementation, when it is determined that the service change operation meets the preset change conditions, determining the set of change nodes corresponding to the service change operation in the target relationship graph corresponding to the multiple network service devices includes: determining the change type of the service change operation; determining that the service change operation meets the preset change conditions when the change type of the service change operation meets the preset change type; and determining the set of change nodes corresponding to the service change operation in the target relationship graph according to the target relationship graph corresponding to the multiple network service devices.

[0049] The change type of a service change operation can be understood as the type of change that the service change operation makes to the target relationship graph. This change type can include adding nodes, deleting nodes, updating nodes, adding relationships between nodes (i.e., adding connecting edges between nodes), deleting relationships between nodes (i.e., deleting connecting edges between nodes), and setting a node as a marker node, etc. A preset change type can be understood as the change type among multiple change types that requires the generation of a set of changed nodes.

[0050] Specifically, the change type of the service change operation can be determined. If the change type of the service change operation belongs to the preset change type, it can be determined that the service change operation meets the preset change conditions. Based on the target relationship diagram corresponding to multiple network service devices, the set of change nodes corresponding to the service change operation in the target relationship diagram can be determined.

[0051] In practical applications, the target relationship graph may include nodes, unidirectional connecting edges, and marker nodes. Nodes may include node attributes and content, supporting creation, deletion, and update operations. Each update operation corresponds to an update of the node's version number. Connecting edges can be understood as unidirectional edges pointing from the current node (i.e., the parent node) to its child node, supporting addition and removal operations. Marker nodes can be understood as subscribed nodes that are marked; changes in the direction of these marker nodes are recorded in the set of changed nodes. It can be understood that if a marker node exists in the root direction of the initial changed node corresponding to a service change operation, a set of changed nodes corresponding to that service change operation will be generated. Optionally, the marker node can be the root node or other marked nodes; this disclosure does not limit this.

[0052] Service change operations are reflected in the target relationship graph. Change types can include five atomic operations: node creation, node update, node deletion, edge addition, and edge removal. A node creation operation creates a node in the target relationship graph. A node update operation updates the content of an existing node in the target relationship graph. During the update process, if a marker node exists in the direction of the node's root node, a set of changed nodes corresponding to this node update operation is generated. A node deletion operation deletes an existing node in the target relationship graph. It's understood that nodes with parent or child nodes cannot be deleted; the association between the node and its parent or child node must be removed before deletion. An edge addition operation adds a connecting edge to the target relationship graph, pointing from the current node to a child node. If a marker node exists in the direction of the current node's root node, then after adding the connecting edge, the child node is also added to that marker node. That is, a marker node also exists in the direction of the child node's root node, resulting in a set of changed nodes corresponding to this edge addition operation. Understandably, due to multiple path dependencies in the target relationship graph, if a child node is already referenced by another path, there's no need to generate a change node set. The edge removal operation can be understood as removing an edge from the target relationship graph, pointing from the current node to a child node. If a marker node exists in the direction of the root node of the current node, then after removing the edge, the path between the child node and that marker node is removed, and a change node set corresponding to this edge removal operation can be generated. Understandably, due to multiple path dependencies in the target relationship graph, if the edge corresponding to a child node is removed but is still referenced by another path, there's no need to generate a change node set. Therefore, the preset change types can include node update operations, edge addition operations, and edge removal operations.

[0053] In summary, by determining the change type of a service change operation and generating a set of change nodes for service change operations whose change type matches the preset change type, it is possible to reduce the consumption of computing resources while managing network service devices.

[0054] Further, determining the set of change nodes corresponding to the service change operation in the target relationship graph corresponding to the plurality of network service devices includes: determining the initial change node corresponding to the service change operation in the target relationship graph according to the target relationship graph corresponding to the plurality of network service devices; and determining the set of change nodes corresponding to the service change operation according to the node attribute information and node association relationship of the initial change node.

[0055] In this context, the initial change node corresponding to a service change operation can be understood as the node directly involved in the service change operation in the target relationship graph. For example, if the service change operation adds a connecting edge between node 1 and node 2, then node 1 and node 2 are the initial change nodes corresponding to this service change operation. Node relationships can be understood as the relationships between the initial change node and other nodes. For example, if there is a connecting edge between initial change node 1 and node 3, then there is a relationship between initial change node 1 and node 3. Therefore, the set of change nodes can include both nodes directly and indirectly involved in the service change operation.

[0056] Specifically, the initial change node directly involved in the service change operation can be determined from the target relationship diagram corresponding to multiple network service devices, and the set of change nodes corresponding to the service change operation can be determined based on the node attribute information and node association relationship of the initial change node.

[0057] In summary, by calculating the set of changed nodes based on the node attribute information and node associations of the initial changed nodes, the management of multiple network service devices can be further guaranteed.

[0058] In one embodiment of this disclosure, the node attribute information of the initial change node includes: the number of tag nodes associated with the direct parent node of the initial change node, and the tag node information of the tag node.

[0059] In this context, the direct parent node of the initial changed node can be understood as the node that points to the initial changed node. For example, if there is a connecting edge between node 1 and node 2, and node 1 points to node 2, then node 1 is the direct parent node of node 2. The tag node information of the tag node can be understood as the unique identification information of the tag node.

[0060] In practical applications, each node in the target relationship graph stores node attribute information. This attribute information includes the status information of the marker nodes pointing to the node in the direction of the root node. Specifically, it can include the node name of the marker node in the direction of the root node and the number of direct parent nodes of the node that contain the same marker node. Taking the nodes in Figure 3 as an example, node 302 is a marker node. If the initial change node is node 306, then the direct parent node of the initial change node 306 is node 304. The root node of node 304 is node 302, which is a marker node. That is, the initial change node 306 has a marker node in the direction of the root node. Therefore, the number of direct parent nodes of the initial change node 306 that contain the same marker node is 1. The marker node information can be the node name of the marker node. Therefore, the node attribute information of node 304 is: the marker node name is 302, and the number is 1. The node attribute information of node 306 is: the marker node name is 302, and the number is 1. Understandably, in Figure 3, the node attribute information for each node except node 302 is: the node name of the marker node is 302, and the number is 1.

[0061] Specifically, determining the set of change nodes corresponding to the service change operation based on the node attribute information and node association of the initial change node includes: if it is determined that the initial change node has associated change nodes based on the node association of the initial change node, determining the node attribute information of the associated change nodes based on the node attribute information of the initial change node; and generating the set of change nodes corresponding to the service change operation based on the node attribute information of the initial change node and the node attribute information of the associated change nodes.

[0062] In this context, associated change nodes can be understood as child nodes of the initial change node, that is, the nodes that the initial change node points to. For example, if node 1 points to node 2, then node 2 is a child node of node 1.

[0063] Specifically, if it is determined that the initial change node has associated change nodes based on the node association relationship of the initial change node, the node attributes of the initial change node can be passed to the associated change node to determine the node attribute information of the associated change node. Based on the node attribute information of the initial change node and the node attribute information of the associated change node, a set of change nodes corresponding to the service change operation can be generated.

[0064] In summary, the calculation of the set of changed nodes is achieved by passing node attribute information from the initial changed node to the associated changed nodes.

[0065] Furthermore, determining the set of change nodes corresponding to the service change operation based on the node attribute information and node association of the initial change node further includes: if it is determined based on the node association of the initial change node that the initial change node does not have any associated change nodes, generating the set of change nodes corresponding to the service change operation based on the node attribute information of the initial change node.

[0066] Specifically, if it is determined that the initial change node does not have any associated change nodes based on the node association relationships of the initial change node, the set of change nodes corresponding to the service change operation can be generated directly based on the node attribute information of the initial change node.

[0067] In practical applications, when generating the set of change nodes corresponding to a service change operation, the set of change nodes can be generated when the actual numerical value of the number contained in the node attribute information of the initial change node or associated change node changes changes from 0 to 1 or from 1 to 0. The process of generating the above-mentioned set of change nodes can be explained using the service change operations of adding a connection edge, updating a node, and removing a connection edge as examples.

[0068] Referring to Figure 4, which illustrates a schematic diagram of a connection edge addition operation in a device management method according to an embodiment of this disclosure, node 402 is a marker node. The connection edge addition operation adds a connection edge between node 404 and node 406. The node attribute information of node 404 can be read as: Marker node name: 402; Marker node count: 1. This indicates that node 404 has a marker node named 402 in the root node direction. Node 404 serves as the initial change node, and node 406 serves as the associated change node. The node attribute information of node 404 is superimposed on the node attribute information of node 406. At this time, the node attribute information of node 406 is: Marker node name: 402; Marker node count: 1. Based on this, the connection edge addition operation adds a marker node reference in the root node direction to node 406. Based on this, the change node set corresponding to the connection edge addition operation is generated as "BloomedNode". <402> The expression `C:406; v=1` indicates that node 406 is created on the BloomedNode 402, where C is the node name and v is the number of marked nodes. Since the number of marked nodes changes from 0 to 1 during the processing of node 406, this attribute information needs to be passed to its child nodes (nodes 408 and 410). Therefore, `C:408; v=1`, `C:410; v=1` can be added to the current set of changed nodes. Since nodes 408 and 410 have no child nodes, the change ends, and the resulting set of changed nodes is `BloomedNode`. <402> ;C,406;v=1,`C:408;v=1`,`C:410;v=1`".

[0069] Referring to Figure 5, which illustrates a node update operation in a device management method according to an embodiment of this disclosure, the service change operation is a node update operation for node 512. Nodes 502 and 504 are marked nodes. Since the direct parents of node 512 are nodes 506, 508, and 510, and there is a marked node 502 in the root direction of node 506, and the same marked node 504 in the root direction of nodes 508 and 510, the number of direct parents of node 512 with the same marked node is two: nodes 508 and 510. Therefore, the node attribute information of node 512 is read as follows: marked node 502, quantity 1; marked node 504, quantity 2. Based on this node attribute information, a change node set "BloomedNode" can be generated. <502> ;U: 512; v=1, BloomedNode <504> ;U:512;v=2”, where U is the node name.

[0070] Referring to Figure 6, which illustrates a schematic diagram of a connection edge removal operation in a device management method according to an embodiment of the present disclosure, Figure 6 includes nodes 602, 604, 606, 608, 610, 612, 614, and 616. The connection edges between nodes are used to represent the pointing relationship between nodes, such as node 602 pointing to node 606, node 606 pointing to node 612, etc. As shown in Figure 6, nodes 602 and 604 are marked nodes. The connection edge removal operation involves removing the connection edge between nodes 612 and 616. The node attribute information of node 612 before removal is read as follows: the marked node is 602. The quantity of the node is 1, and the number of the marker node is 604. The attribute information of this node is passed to the child node 616 of node 612, and the quantity changes from 2 to 1. That is to say, the part of the current node 612 is subtracted from node 616. After removal, the quantity of the marker node 602 changes from 1 to 0, indicating that the root dependency between node 616 and the marker node 602 has been removed. However, since there are two paths between node 616 and the marker node 604, this removal only removes one path. Based on this, the quantity of the marker node 604 changes from 2 to 1. Therefore, the set of changed nodes corresponding to this connection edge removal operation is only generated on the marker node 602, which is "BloomedNode". <602> D: 616; v = 1.

[0071] In summary, by calculating the set of changing nodes based on node attribute information, computational efficiency and speed are further improved, simplifying the design and development of network controllers.

[0072] In practical applications, when it is determined that the service change operation meets the preset change conditions, determining the set of change nodes corresponding to the service change operation in the target relationship diagram based on the target relationship diagram corresponding to the multiple network service devices includes: determining the object to be changed corresponding to the service change operation in the target relationship diagram; inputting the object to be changed to the main server; and using the main server, when it is determined that the service change operation meets the preset change conditions, determining and outputting the set of change nodes corresponding to the service change operation in the target relationship diagram based on the target relationship diagram corresponding to the multiple network service devices.

[0073] Furthermore, service change operations and objects to be changed can be input to the main server.

[0074] In this context, the object to be changed in the target relationship graph corresponding to the service change operation can be understood as the node and / or connection edge that the service change operation needs to operate on in the target relationship graph.

[0075] In practical applications, a master server and a backup server can be used to calculate the set of changed nodes. Specifically, the master server can receive service change requests, which correspond to service change operations. These requests are used to add nodes and / or connecting edges to the target relationship graph, resulting in the calculated set of changed nodes. Alternatively, a list of nodes and / or connecting edges corresponding to the service change request can be input into the master server to obtain the set of changed nodes output by the master server.

[0076] Referring to Figure 7, Figure 7 illustrates a schematic diagram of a master server and a backup server in a device management method according to an embodiment of this disclosure. As shown in Figure 7, the master server or backup server includes Nodes & Relations (i.e., nodes and connections), Transactions (i.e., change operation transactions), T-LOG (i.e., change operation transaction log), Locks (i.e., locks), and SNAPSHOT (i.e., storage snapshots of nodes and connections). Nodes & Relations are the nodes and connections of the directed acyclic graph stored in memory in an efficient manner, along with related computational data. Locks are locks temporarily stored in memory during processing. Transactions are change operation transactions created in memory after locking is completed, representing the complete process of a change request. The data generated during this process is stored in the memory of the master server or backup server. T-LOG is the representation of Transactions in a file. There is a one-to-one correspondence between Transactions in memory and T-LOG in the file. The T-LOG processed by the master server is copied to the slave server (i.e., backup server) through the network synchronization interface between the master and slave servers to achieve data synchronization between the master and slave servers. T-LOG stores the contents of Transactions in a file. SNAPSHOT stores a snapshot of the Node & Relations portion of the file after the Transactions have been processed. SNAPSHOT + T-LOG contains the latest data.

[0077] Furthermore, before determining and outputting the set of change nodes corresponding to the service change operation in the target relationship diagram based on the target relationship diagram corresponding to the multiple network service devices, using the main server, after determining that the service change operation meets the preset change conditions, the method further includes: using the main server to lock the object to be changed in the target relationship diagram; after determining and outputting the set of change nodes corresponding to the service change operation in the target relationship diagram based on the target relationship diagram corresponding to the multiple network service devices, using the main server, the method further includes: unlocking the object to be changed in the target relationship diagram.

[0078] The objects to be changed may include the nodes and / or connecting edges to be changed.

[0079] In practical applications, refer to Figure 8(a), which illustrates a schematic diagram of the calls between the master server and the backup server in a device management method according to an embodiment of this disclosure. As shown in Figure 8(a), the master server locks the relevant nodes and connections that need to be changed based on the content of the received service change request to avoid concurrent computation. After locking, a Transaction is generated and synchronized to the SLAVE (i.e., file). First, the replication interface of the slave server (i.e., the backup server) is called to write the corresponding T-LOG to the file on the slave server, write it to the Transaction queue of the master server, and write it to the T-LOG file on the local machine to achieve synchronization of T-LOG data. The change node set calculation is performed in memory, and the result of the change node set calculation is directly updated in memory, and the change node set is obtained and returned to the requester. The locked nodes and connections are then released. Furthermore, the master server or the slave server can periodically initiate asynchronous tasks at preset time intervals, which will not be chained in the service change request process. Specifically, the master or slave server can periodically store the changed node set in MEM Node Relation (that is, the storage of nodes and connecting edges in memory) and periodically write it to SNAPSHOT (that is, a snapshot of nodes and connecting edges in a local file), so as to periodically update the relevant data of nodes and connecting edges in memory to the file in the form of snapshots.

[0080] In one embodiment of this disclosure, when the main server is determined to be abnormal, a backup server is used to perform the step of determining and outputting the set of change nodes corresponding to the service change operation in the target relationship graph based on the target relationship graph corresponding to the multiple network service devices, when it is determined that the service change operation meets the preset change conditions.

[0081] In practical applications, refer to Figure 8(b), which illustrates a schematic diagram of the switching between the master server and backup server in a device management method according to an embodiment of this disclosure. As shown in Figure 8(b), in the event of an anomaly in the master server, such as a master server crash, a negotiation process will occur among the master server, the slave server, and the caller. The caller will be unable to send the service change request to the master server and will instead send the service change request to the slave server, which will then take over the service change request. The slave server will perform a calculation of the set of change nodes for residual transactions in the Transactions queue. After completing the calculation of the set of change nodes for residual transactions, the slave server will take over the request. If the master server has not yet started, a single-point calculation method (skipping the mechanism of synchronizing T-LOG to the slave server) will be used. At this time, the service provided by the master server will be restored.

[0082] In one embodiment of this disclosure, if it is determined that the master server has abnormally recovered, a backup server is recreated.

[0083] In practical applications, after the master server recovers or another slave server is created, a backup server can be re-established. The backup server can connect to the master server, copy the latest SNAPSHOT, and start synchronizing T-LOG. When the T-LOG is synchronized to the latest timestamp, the master server recovers from single-point mode and joins the process of copying T-LOG to the slave server. The newly established slave server (i.e., the backup server) restores the SNAPSHOT to memory and consumes the T-LOG in sequence until the T-LOG queue is consumed. At this point, the system returns to a normal master-slave operation.

[0084] Step 206: Manage the multiple network service devices according to the set of changed nodes.

[0085] Specifically, after obtaining the set of changed nodes, multiple network service devices can be managed based on the set of changed nodes. In particular, service configuration information can be changed based on the set of changed nodes to realize service changes.

[0086] In summary, the above method can manage multiple network service devices and the network services they provide based on a target relationship graph. Furthermore, upon receiving service change operations for multiple network service devices, and after determining that the service change operations meet preset change conditions, the method determines the set of change nodes corresponding to the service change operations in the target relationship graph corresponding to the multiple network service devices. Based on this set of change nodes, the method manages the multiple network service devices. By determining whether the service change operations meet the preset change conditions, the method calculates the set of change nodes for service change operations that meet the preset change conditions, thereby reducing the computational and storage overhead of calculating the set of change nodes.

[0087] The following description, in conjunction with Figure 9, uses the application of the device management method provided in this disclosure in a network controller as an example to further illustrate the device management method. Figure 9 shows a flowchart of the processing procedure of a device management method according to an embodiment of this disclosure, specifically including the following steps.

[0088] Step 902: Construct a target relationship graph corresponding to multiple network service devices by taking multiple network service devices, the network services provided by multiple network service devices as nodes, and the association relationships between multiple network service devices and network services as connecting edges.

[0089] Step 904: Receive service change operations for multiple network service devices.

[0090] Step 906: Determine the change type for the service change operation.

[0091] Step 908: If the change type of the service change operation is determined to be in accordance with the preset change type, then the service change operation is determined to meet the preset change conditions.

[0092] Step 910: Based on the target relationship diagram corresponding to multiple network service devices, determine the initial change node corresponding to the service change operation in the target relationship diagram.

[0093] Step 912: If it is determined that the initial change node has associated change nodes based on the node association relationship of the initial change node, determine the node attribute information of the associated change nodes based on the node attribute information of the initial change node.

[0094] Step 914: Generate a set of change nodes corresponding to the service change operation based on the node attribute information of the initial change node and the node attribute information of the associated change nodes.

[0095] Step 916: If it is determined that the initial change node does not have any associated change nodes based on the node association relationship of the initial change node, generate a set of change nodes corresponding to the service change operation based on the node attribute information of the initial change node.

[0096] Step 918: Manage multiple network service devices based on the set of changed nodes.

[0097] In the above method, management of multiple network service devices and the network services provided by multiple network service devices can be realized based on the target relationship graph. After receiving service change operations for multiple network service devices, if it is determined that the service change operation meets the preset change conditions, the set of change nodes corresponding to the service change operation in the target relationship graph corresponding to the multiple network service devices is determined. Based on the set of change nodes, the multiple network service devices are managed. By judging whether the service change operation meets the preset change conditions, the set of change nodes for service change operations that meet the preset change conditions is calculated, thereby reducing the computational and storage overhead of calculating the set of change nodes.

[0098] Corresponding to the above method embodiments, this disclosure also provides an embodiment of a device management apparatus. Figure 10 shows a schematic diagram of the structure of a device management apparatus provided in one embodiment of this disclosure. As shown in Figure 10, the apparatus includes: a receiving module 1002, configured to receive service change operations for multiple network service devices; a determining module 1004, configured to, when determining that the service change operation meets preset change conditions, determine a set of change nodes corresponding to the service change operation in a target relationship graph corresponding to the multiple network service devices, wherein the target relationship graph is constructed by using the multiple network service devices, the network services provided by the multiple network service devices as nodes, and the association relationships between the multiple network service devices and the network services as connecting edges; and a management module 1006, configured to manage the multiple network service devices according to the set of change nodes.

[0099] In an optional embodiment, the determining module 1004 is further configured to: determine the initial change node corresponding to the service change operation in the target relationship diagram according to the target relationship diagram corresponding to the plurality of network service devices; and determine the set of change nodes corresponding to the service change operation according to the node attribute information and node association relationship of the initial change node.

[0100] In an optional embodiment, the determining module 1004 is further configured to: when it is determined that the initial change node has associated change nodes based on the node association relationship of the initial change node, determine the node attribute information of the associated change nodes based on the node attribute information of the initial change node; and generate a set of change nodes corresponding to the service change operation based on the node attribute information of the initial change node and the node attribute information of the associated change nodes.

[0101] In an optional embodiment, the determining module 1004 is further configured to: when it is determined, based on the node association relationship of the initial change node, that the initial change node does not have any associated change nodes, generate a set of change nodes corresponding to the service change operation based on the node attribute information of the initial change node.

[0102] In one optional embodiment, the node attribute information of the initial change node includes: the number of tag nodes associated with the direct parent node of the initial change node, and the tag node information of the tag node.

[0103] In an optional embodiment, the determining module 1004 is further configured to: determine the change type of the service change operation; if the change type of the service change operation conforms to a preset change type, determine that the service change operation satisfies the preset change condition; and determine the set of change nodes corresponding to the service change operation in the target relationship diagram according to the target relationship diagram corresponding to the plurality of network service devices.

[0104] In an optional embodiment, the determining module 1004 is further configured to: determine the object to be changed corresponding to the service change operation in the target relationship diagram; input the object to be changed to the main server; and, using the main server, if it is determined that the service change operation meets the preset change conditions, determine and output the set of change nodes corresponding to the service change operation in the target relationship diagram according to the target relationship diagram corresponding to the multiple network service devices.

[0105] In an optional embodiment, the determining module 1004 is further configured to: use the main server to lock the object to be changed in the target relationship graph; and unlock the object to be changed in the target relationship graph.

[0106] In an optional embodiment, the determining module 1004 is further configured to: when the main server is determined to be abnormal, execute the following steps using a backup server: when the service change operation is determined to meet preset change conditions, determine and output the set of change nodes corresponding to the service change operation in the target relationship diagram based on the target relationship diagram corresponding to the multiple network service devices.

[0107] In an optional embodiment, the apparatus further includes a backup module, which is further configured to: recreate a backup server if it is determined that the primary server has abnormally recovered.

[0108] In an optional embodiment, the apparatus further includes a construction module, which is further configured to: construct a target relationship graph corresponding to the multiple network service devices, using multiple network service devices, the network services provided by the multiple network service devices as nodes, and the association relationships between the multiple network service devices and the network services as connection edges.

[0109] In the aforementioned device, management of multiple network service devices and the network services provided by these devices can be achieved based on a target relationship graph. Furthermore, upon receiving service change operations for multiple network service devices, and after determining that the service change operations meet preset change conditions, the device determines the set of change nodes corresponding to the service change operations in the target relationship graph corresponding to the multiple network service devices. Based on this set of change nodes, the device manages the multiple network service devices. By determining whether the service change operations meet the preset change conditions, the device calculates the set of change nodes for service change operations that meet the preset change conditions, thereby reducing the computational and storage overhead of calculating the set of change nodes.

[0110] The above is an illustrative scheme of an equipment management device according to this embodiment. It should be noted that the technical solution of this equipment management device and the technical solution of the equipment management method described above belong to the same concept. For details not described in detail in the technical solution of the equipment management device, please refer to the description of the technical solution of the equipment management method described above.

[0111] Figure 11 shows a structural block diagram of a computing device 1100 according to an embodiment of the present disclosure. The components of the computing device 1100 include, but are not limited to, a memory 1110 and a processor 1120. The processor 1120 is connected to the memory 1110 via a bus 1130, and a database 1150 is used to store data.

[0112] The computing device 1100 also includes an access device 1140, which enables the computing device 1100 to communicate via one or more networks 1160. Examples of these networks include Public Switched Telephone Network (PSTN), Local Area Network (LAN), Wide Area Network (WAN), Personal Area Network (PAN), or combinations of communication networks such as the Internet. The access device 1140 may include one or more of any type of wired or wireless network interface (e.g., a network interface controller (NIC)), such as an IEEE 802.11 Wireless Local Area Network (WLAN) interface, a Wi-MAX (Worldwide Interoperability for Microwave Access) interface, an Ethernet interface, a Universal Serial Bus (USB) interface, a cellular network interface, a Bluetooth interface, a Near Field Communication (NFC) interface, and so on.

[0113] In one embodiment of this application, the aforementioned components of the computing device 1100, as well as other components not shown in FIG11, may be interconnected, for example, via a bus. It should be understood that the computing device block diagram shown in FIG11 is merely for illustrative purposes and is not intended to limit the scope of this application. Those skilled in the art can add or replace other components as needed.

[0114] The computing device 1100 can be any type of stationary or mobile computing device, including mobile computers or mobile computing devices (e.g., tablet computers, personal digital assistants, laptop computers, notebook computers, netbooks, etc.), mobile phones (e.g., smartphones), wearable computing devices (e.g., smartwatches, smart glasses, etc.) or other types of mobile devices, or stationary computing devices such as desktop computers or personal computers (PCs). The computing device 1100 can also be a mobile or stationary server.

[0115] The processor 1120 is used to execute the following computer program / instructions, which, when executed by the processor, implement the steps of the above-described device management method.

[0116] The various embodiments in this disclosure are described in a progressive manner. Similar or identical parts between embodiments can be referred to mutually. Each embodiment focuses on describing the differences from other embodiments. In particular, the computing device embodiments are basically similar to the device management method embodiments, so the description is relatively simple; relevant parts can be referred to in the description of the device management method embodiments.

[0117] An embodiment of this disclosure also provides a computer-readable storage medium storing a computer program / instructions that, when executed by a processor, implement the steps of the above-described device management method.

[0118] The various embodiments in this disclosure are described in a progressive manner. Similar or identical parts between embodiments can be referred to mutually. Each embodiment focuses on describing the differences from other embodiments. In particular, the computer-readable storage medium embodiments are basically similar to the device management method embodiments, so the description is relatively simple; relevant parts can be referred to in the description of the device management method embodiments.

[0119] An embodiment of this disclosure also provides a computer program product, including a computer program / instructions that, when executed by a processor, implement the steps of the above-described device management method.

[0120] The above is an illustrative scheme of a computer program product according to this embodiment. It should be noted that the technical solution of this computer program product and the technical solution of the above-described device management method belong to the same concept. For details not described in detail in the technical solution of the computer program product, please refer to the description of the technical solution of the above-described device management method.

[0121] The foregoing has described specific embodiments of this disclosure. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps recited in the claims may be performed in a different order than that shown in the embodiments and may still achieve the desired results. Furthermore, the processes depicted in the drawings do not necessarily require the specific or sequential order shown to achieve the desired results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0122] The computer instructions include computer program code, which may be in the form of source code, object code, executable file, or certain intermediate forms. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording media, USB flash drive, portable hard drive, magnetic disk, optical disk, computer memory, read-only memory (ROM), random access memory (RAM), electrical carrier signals, telecommunication signals, and software distribution media, etc. It should be noted that the content included in the computer-readable medium may be appropriately added or removed according to the requirements of patent practice. For example, in some regions, according to patent practice, computer-readable media may not include electrical carrier signals and telecommunication signals.

[0123] It should be noted that, for the sake of simplicity, the foregoing method embodiments are all described as a series of actions. However, those skilled in the art should understand that the embodiments of this disclosure are not limited to the described order of actions, because according to the embodiments of this disclosure, some steps can be performed in other orders or simultaneously. Furthermore, those skilled in the art should also understand that the embodiments described in the specification are all preferred embodiments, and the actions and modules involved are not necessarily essential to the embodiments of this disclosure.

[0124] In the above embodiments, the descriptions of each embodiment have different focuses. For parts not described in detail in a certain embodiment, please refer to the relevant descriptions of other embodiments.

[0125] The preferred embodiments disclosed above are merely illustrative of this disclosure. The optional embodiments do not exhaustively describe all details, nor do they limit the invention to the specific implementations described. Clearly, many modifications and variations can be made based on the embodiments of this disclosure. These embodiments are selected and specifically described in this disclosure to better explain the principles and practical applications of the embodiments of this disclosure, thereby enabling those skilled in the art to better understand and utilize this disclosure. This disclosure is limited only by the claims and their full scope and equivalents.

Claims

1. A method for managing equipment, comprising: Receive service change operations for multiple network service devices; If the service change operation meets the preset change conditions, in the target relationship graph corresponding to the multiple network service devices, the set of change nodes corresponding to the service change operation is determined. The target relationship graph is constructed by taking the multiple network service devices and the network services provided by the multiple network service devices as nodes and the association between the multiple network service devices and the network services as connecting edges. The multiple network service devices are managed based on the set of changed nodes.

2. The method according to claim 1, wherein determining the set of change nodes corresponding to the service change operation in the target relationship graph corresponding to the plurality of network service devices includes: Based on the target relationship diagram corresponding to the multiple network service devices, determine the initial change node corresponding to the service change operation in the target relationship diagram; Based on the node attribute information and node associations of the initial change node, the set of change nodes corresponding to the service change operation is determined.

3. The method according to claim 2, wherein determining the set of change nodes corresponding to the service change operation based on the node attribute information and node association relationships of the initial change node includes: If, based on the node association relationship of the initial change node, it is determined that the initial change node has associated change nodes, then the node attribute information of the associated change nodes is determined based on the node attribute information of the initial change node. Based on the node attribute information of the initial change node and the node attribute information of the associated change node, a set of change nodes corresponding to the service change operation is generated.

4. The method according to claim 2, wherein determining the set of change nodes corresponding to the service change operation based on the node attribute information and node association relationships of the initial change node includes: If, based on the node association relationships of the initial change node, it is determined that the initial change node does not have any associated change nodes, a set of change nodes corresponding to the service change operation is generated based on the node attribute information of the initial change node.

5. The method according to any one of claims 2-4, wherein the node attribute information of the initial change node includes: The number of tag nodes associated with the direct parent node of the initial change node, and the tag node information of the tag nodes.

6. The method according to any one of claims 1-4, wherein, when it is determined that the service change operation meets preset change conditions, determining the set of change nodes corresponding to the service change operation in the target relationship diagram according to the target relationship diagram corresponding to the plurality of network service devices includes: Determine the type of change in the service change operation; If it is determined that the change type of the service change operation conforms to the preset change type, it is determined that the service change operation satisfies the preset change condition; Based on the target relationship diagram corresponding to the multiple network service devices, determine the set of change nodes corresponding to the service change operation in the target relationship diagram.

7. The method according to any one of claims 1-4, wherein, when it is determined that the service change operation meets preset change conditions, determining the set of change nodes corresponding to the service change operation in the target relationship diagram according to the target relationship diagram corresponding to the plurality of network service devices includes: Identify the object to be changed in the target relationship graph corresponding to the service change operation; The object to be changed is input to the main server. Using the main server, if it is determined that the service change operation meets the preset change conditions, the set of change nodes corresponding to the service change operation in the target relationship diagram is determined and output according to the target relationship diagram corresponding to the multiple network service devices.

8. The method according to claim 7, further comprising, before determining and outputting the set of change nodes corresponding to the service change operation in the target relationship diagram based on the target relationship diagram corresponding to the plurality of network service devices, using the master server, when it is determined that the service change operation meets the preset change conditions, the method includes: Using the main server, the objects to be changed in the target relationship graph are locked; After determining and outputting the set of change nodes corresponding to the service change operation in the target relationship graph corresponding to the multiple network service devices, based on the target relationship graph corresponding to the multiple network service devices, the method further includes: Unlock the object to be changed in the target relationship graph.

9. The method according to claim 7, further comprising: If the main server is found to be abnormal, the backup server performs the following steps: if the service change operation meets the preset change conditions, the backup server determines and outputs the set of change nodes corresponding to the service change operation in the target relationship graph corresponding to the multiple network service devices.

10. The method of claim 9, further comprising: If the primary server is confirmed to have recovered abnormally, the backup server will be recreated.

11. A computing device, comprising: Memory and processor; The memory is used to store computer programs / instructions, and the processor is used to execute the computer programs / instructions, which perform the following operations when executed by the processor: Receive service change operations for multiple network service devices; If the service change operation meets the preset change conditions, in the target relationship graph corresponding to the multiple network service devices, the set of change nodes corresponding to the service change operation is determined. The target relationship graph is constructed by taking the multiple network service devices and the network services provided by the multiple network service devices as nodes and the association between the multiple network service devices and the network services as connecting edges. The multiple network service devices are managed based on the set of changed nodes.

12. The computing device according to claim 11, wherein determining the set of change nodes corresponding to the service change operation in the target relationship graph corresponding to the plurality of network service devices includes: Based on the target relationship diagram corresponding to the multiple network service devices, determine the initial change node corresponding to the service change operation in the target relationship diagram; Based on the node attribute information and node associations of the initial change node, the set of change nodes corresponding to the service change operation is determined.

13. The computing device according to claim 12, wherein determining the set of change nodes corresponding to the service change operation based on the node attribute information and node association relationships of the initial change node includes: If, based on the node association relationship of the initial change node, it is determined that the initial change node has associated change nodes, then the node attribute information of the associated change nodes is determined based on the node attribute information of the initial change node. Based on the node attribute information of the initial change node and the node attribute information of the associated change node, a set of change nodes corresponding to the service change operation is generated.

14. The computing device according to claim 12, wherein determining the set of change nodes corresponding to the service change operation based on the node attribute information and node association relationships of the initial change node includes: If, based on the node association relationships of the initial change node, it is determined that the initial change node does not have any associated change nodes, a set of change nodes corresponding to the service change operation is generated based on the node attribute information of the initial change node.

15. The computing device according to any one of claims 12-14, wherein the node attribute information of the initial change node includes: The number of tag nodes associated with the direct parent node of the initial change node, and the tag node information of the tag nodes.

16. The computing device according to any one of claims 11-14, wherein, when it is determined that the service change operation meets preset change conditions, determining the set of change nodes corresponding to the service change operation in the target relationship graph according to the target relationship graph corresponding to the plurality of network service devices includes: Determine the type of change in the service change operation; If it is determined that the change type of the service change operation conforms to the preset change type, it is determined that the service change operation satisfies the preset change condition; Based on the target relationship diagram corresponding to the multiple network service devices, determine the set of change nodes corresponding to the service change operation in the target relationship diagram.

17. The computing device according to any one of claims 11-14, wherein, when it is determined that the service change operation meets preset change conditions, determining the set of change nodes corresponding to the service change operation in the target relationship graph according to the target relationship graph corresponding to the plurality of network service devices includes: Identify the object to be changed in the target relationship graph corresponding to the service change operation; The object to be changed is input to the main server. Using the main server, if it is determined that the service change operation meets the preset change conditions, the set of change nodes corresponding to the service change operation in the target relationship diagram is determined and output according to the target relationship diagram corresponding to the multiple network service devices.

18. The computing device according to claim 17, wherein before determining and outputting the set of change nodes corresponding to the service change operation in the target relationship diagram according to the target relationship diagram corresponding to the plurality of network service devices, using the main server after determining that the service change operation meets the preset change conditions, the operation further includes: Using the main server, the objects to be changed in the target relationship graph are locked; After determining and outputting the set of change nodes corresponding to the service change operation in the target relationship graph corresponding to the multiple network service devices, based on the target relationship graph corresponding to the multiple network service devices, the operation further includes: Unlock the object to be changed in the target relationship graph.

19. A computer-readable storage medium storing a computer program / instructions that, when executed by a processor, implement the steps of the method according to any one of claims 1 to 10.

20. A computer program product comprising a computer program / instructions that, when executed by a processor, implement the steps of the method according to any one of claims 1 to 10.

Images