CN115563310A

CN115563310A - Method, device, equipment and medium for determining key service node

Info

Publication number: CN115563310A
Application number: CN202211294678.6A
Authority: CN
Inventors: 王兆强; 刘一阳; 张峰颖; 郭咏持; 赵博汉; 武兴叶
Original assignee: Agricultural Bank of China
Current assignee: Agricultural Bank of China
Priority date: 2022-10-21
Filing date: 2022-10-21
Publication date: 2023-01-03

Abstract

The invention discloses a method, a device, equipment and a medium for determining a key service node. Wherein the method comprises the following steps: determining at least one service link from the target starting node to the target terminating node from the service relationship network; the service relation network is determined according to the flow direction of service data among the service nodes; determining a target link from the service links; the total running time of the target link is longest; determining key service nodes in the target link according to the characteristic information of each service node in the target link; the characteristic information includes at least one of a webpage ranking value, a K-kernel value, and a runtime. By executing the scheme, the key service nodes on the local service link can be efficiently and accurately determined, so that the link containing the key service nodes is facilitated to be optimized, and the running timeliness of the service relation network is improved.

Description

Method, device, equipment and medium for determining key service node

Technical Field

The present invention relates to the field of financial technologies, and in particular, to a method, an apparatus, a device, and a medium for determining a key service node.

Background

Financial services are various in types and are intersected with each other, a service relationship network aiming at each service can be formed based on each service data, and nodes influencing the performance of a certain type of service exist in the service relationship network and are called as key service nodes.

In the related art, the key service nodes are determined by analyzing each service node of the whole service relationship network and considering factors influencing service performance in an actual service scene, so that the calculated amount is large and the determination of the key service nodes is inaccurate.

Disclosure of Invention

The invention provides a method, a device, equipment and a medium for determining key service nodes, which can realize the efficient and accurate determination of the key service nodes on local service links, further contribute to the optimization of links containing the key service nodes and improve the timeliness of the operation of a service relationship network.

According to an aspect of the present invention, there is provided a method for determining a key service node, the method including:

determining at least one service link from the target starting node to the target terminating node from the service relationship network; the service relation network is determined according to the flow direction of service data among the service nodes;

determining a target link from the traffic links; the total running time of the target link is longest;

determining key service nodes in the target link according to the characteristic information of each service node in the target link; the characteristic information includes at least one of a webpage ranking value, a K-kernel value, and a runtime.

According to another aspect of the present invention, there is provided a critical service node determining apparatus, including:

the service link determining module is used for determining at least one service link from the target starting node to the target terminating node from the service relation network; the service relation network is determined according to the flow direction of service data among the service nodes;

a target link determining module, configured to determine a target link from the service links; the total running time of the target link is longest;

a key service node determining module, configured to determine a key service node in the target link according to the feature information of each service node in the target link; the characteristic information includes at least one of a webpage ranking value, a K-kernel value, and a runtime.

According to another aspect of the present invention, there is provided an electronic apparatus including:

at least one processor; and

a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,

the memory stores a computer program executable by the at least one processor, the computer program being executable by the at least one processor to enable the at least one processor to perform the method for determining a critical service node according to any one of the embodiments of the present invention.

According to another aspect of the present invention, there is provided a computer-readable storage medium storing computer instructions for causing a processor to implement the method for determining a key service node according to any one of the embodiments of the present invention when executed.

The technical scheme of the embodiment of the invention determines at least one service link from a target starting node to a target terminating node from a service relationship network; the service relation network is determined according to the flow direction of service data among the service nodes; determining a target link from the service links; the total running time of the target link is longest; determining key service nodes in the target link according to the characteristic information of each service node in the target link; the characteristic information includes at least one of a webpage ranking value, a K-kernel value, and a runtime. By executing the technical scheme provided by the embodiment of the invention, the key service nodes on the local service link can be efficiently and accurately determined, thereby being beneficial to optimizing the link containing the key service nodes and improving the running timeliness of the service relation network.

It should be understood that the statements in this section are not intended to identify key or critical features of the embodiments of the present invention, nor are they intended to limit the scope of the invention. Other features of the present invention will become apparent from the following description.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings required to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the description below are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without creative efforts.

Fig. 1a is a flowchart of a method for determining a key service node according to an embodiment of the present invention;

fig. 1b is a schematic diagram of a service relationship network structure provided in an embodiment of the present invention;

fig. 2 is a schematic structural diagram of a determining apparatus of a key service node according to an embodiment of the present invention;

fig. 3 is a schematic structural diagram of an electronic device implementing the method for determining a key service node according to the embodiment of the present invention.

Detailed Description

In order to make the technical solutions of the present invention better understood, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be obtained by a person skilled in the art without making any creative effort based on the embodiments in the present invention, shall fall within the protection scope of the present invention.

It should be noted that the terms "first," "second," and the like in the description and claims of the present invention and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are capable of operation in sequences other than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.

It should be understood that, before the technical solutions disclosed in the embodiments of the present disclosure are used, the type, the applicable scope, the usage scenario, etc. of the personal information related to the present disclosure should be informed to the user and authorized by the user in a proper manner according to the relevant laws and regulations.

Data marts consist of a series of data models that are grouped by application for efficient management and organization. The grouped data model corresponds to a service node, so that the scheduling system can conveniently carry out service configuration and monitoring. The service nodes have a dependency relationship, the service node executed first is a father node, and after the father node is executed, the child node is executed again.

With the increasing demand of business development, the number of jobs of the data model is increasing, and each business party pays more attention to the timeliness of the data service, so that the timeliness of the jobs paid attention to by each business needs to be optimized, for example, by reducing the relation hierarchy among business nodes and shortening the running time of a key business link, the timeliness of the data service is improved. Therefore, how to determine the key service node is the key to improve the operation timeliness.

Fig. 1a is a flowchart of a method for determining a key service node according to an embodiment of the present invention, where this embodiment is applicable to a case of determining a key service node in a local service link, and the method may be executed by a determining apparatus of a key service node, where the determining apparatus of a key service node may be implemented in a form of hardware and/or software, and the determining apparatus of a key service node may be configured in an electronic device for determining a key service node. As shown in fig. 1a, the method comprises:

at least one traffic link from the target originating node to the target terminating node is determined from the traffic relationship network S110.

And the service relation network is determined according to the flow direction of service data among the service nodes.

For example, as shown in fig. 1b, in the present solution, service links may be constructed according to the execution sequence between the service nodes and the service data flow direction between the service nodes, each service link corresponds to a service type, and each service link is combined to form a service relationship network. In fig. 1b, a directed relationship network is established with service IDs as nodes, dependency relationships between service nodes as edges, and operation time of a parent node as an edge (optional) attribute, where a service node from which an arrow starts is a parent node, and a service node to which the arrow points is a child node. The target start node may be set according to actual needs, for example, the target start node may be a service node that does not include a parent node in the service relationship network, or may be an intermediate service node in the service relationship network. The target termination node may be set according to actual needs, for example, the target termination node may be a service node that does not include a child node in the service relationship network, or may be an intermediate service node in the service relationship network. For example, the present solution may determine at least one traffic link from the service node 5 to the service node 10 from the traffic relationship network, which is (5, 6, 10), (5, 8, 10), (5, 7,8, 10) and (5, 7,9, 10) respectively, with the service node 5 as a target originating node and the service node 10 as a target terminating node.

In this embodiment, optionally, the determining at least one service link from the target originating node to the target terminating node from the service relationship network includes: and processing the service relation network based on a Bellman-ford algorithm, and determining at least one service link from the target starting node to the target terminating node.

According to the scheme, the ID of the designated service node can be used as a target starting node, and all service links from the service node to the target terminating node in the service relationship network are searched by adopting a Bellman-ford algorithm from the forward direction or the reverse direction. It may be achieved that a reliable data source is provided for determining the critical traffic links.

And S120, determining a target link from the service links.

The total running time of the target link is longest.

The method and the device can respectively determine the total running time of each service link, and then take the service link with the longest total running time as a target link.

In this embodiment, optionally, before determining the target link from the service links, the method further includes: respectively determining the total operation time of the service links; determining a target link from the traffic links, comprising: and taking the service link with the longest total operation time as a target link.

For example, the present solution may determine the total running time of each service link for each service link determined in the foregoing step, sort all the total running times, and use the service link with the longest total running time in the sorting result as the target link. For example, the total operation time of the service links (5, 6, 10), (5, 8, 10), (5, 7,8, 10) and (5, 7,9, 10) from the service node 5 to the service node 10 is 158s, 189s, 268s and 262s, respectively, and the service link (5, 7,8, 10) having the longest total operation time can be used as the target link.

Therefore, by taking the service link with the longest total operation time as the target link, reliable data sources can be provided for the subsequent determination of the key service node.

In a possible embodiment, optionally, determining the total operation time of the service link includes: determining an operation log of each service node in the service link; determining the operation time of the service node according to the operation log; and taking the sum of the running time of each service node as the total running time of the service link.

For example, the present solution may determine the running time of the corresponding service node according to the running log of each service node in the service link, and then use the sum of the running times of each service node as the total running time of the service link. For example, the runtime Trun of the service nodes 1-10 in the service relationship network shown in fig. 1b is shown in table 1:

TABLE 1

Node point	PR	K_Core	Trun
				1	0.093904974	2	20
2	0.120893993	2	47
				3	0.068170204	2	45
4	0.066541028	2	82
				5	0.119440931	2	36
6	0.096986952	2	28
				7	0.176010548	2	79
8	0.092949677	2	59
				9	0.0675687	2	53
0	0.097532994	2	94

Therefore, the operation logs of all service nodes in the service link are determined; determining the operation time of the service node according to the operation log; and taking the sum of the running time of each service node as the total running time of the service link. It may be implemented to provide a reliable source of data for determining critical links.

S130, determining key service nodes in the target link according to the characteristic information of each service node in the target link.

The characteristic information includes at least one of a webpage ranking value, a K-kernel value, and a runtime.

The webpage ranking value can be determined through a PageRank algorithm, and the PageRank algorithm is widely applied to positioning of key nodes in a complex network and has certain representativeness. If a web page is pointed to by a web page of great importance, indicating that it is generally recognized and trusted by numerous web pages, and the web page will correspondingly obtain a high importance value, then its web page rank is high, so PageRank is particularly suitable for situations where ranking is desired.

And removing all nodes with the value of K and edges connected with the nodes in the relation network according to the K core value, namely the K-core of the network, wherein the nodes with the value of K and the edges connected with the nodes are removed, and repeating the operation until no node with the value of i exists in the network. All nodes removed in this round and the edges between them are called the K-shell of the network. By analogy, shells with higher indexes can be further obtained until each node in the network is finally divided into corresponding K-shells, and the node union of all the K-shells is called as K-Core (K-Core) of the network. The method can be used for network layering, and nodes with the same K-Core have certain network similarity.

The running time can be determined by a running log of the service node, and is s.

In a possible implementation manner, optionally, determining the key service node in the target link according to the feature information of each service node in the target link includes: weighting and summing the webpage ranking value, the K core value and the running time of the service node to determine an importance index value of the service node; and sequencing the importance index values, and determining the service node associated with the maximum value of the importance index values in the sequencing result as a key service node.

Exemplarily, the present solution may perform quantization sequencing on importance index values of service nodes on a target link, and the importance index values may perform flexible linear combination according to service requirements: qi = f (Trun, PR, K _ Core).

The Qi is an importance index value of the service node i, and may be determined by performing weighted summation according to Trun, PR, and K _ Core, and the weight may be determined according to actual needs. The larger Qi indicates the higher importance of the service node. For example, the importance index values for each service node on the target link (5, 7,8, 10) are shown in Table 2:

TABLE 2

Serial number	Node point	K_Core	PR	Trun	Qi
						1	7	2	0.176010548	79	35
2	5	2	0.119440931	36	30
						3	10	2	0.097532994	94	29
4	8	2	0.092949677	59	28

As can be seen from table 2, the importance index value of the service node 7 in the target link is the largest, and therefore, the service node 7 can be used as a key service node.

Therefore, the importance index value of the service node is determined by weighted summation of the webpage ranking value, the K core value and the running time of the service node; and sequencing the importance index values, and determining the service node associated with the maximum value of the importance index values in the sequencing result as a key service node. More accurate key service nodes can be determined according to a plurality of influence factors in an actual service scene.

In another possible implementation manner, optionally, after determining the key service node in the target link according to the characteristic information of each service node in the target link, the method further includes: and optimizing the business data associated with the key business nodes so as to reduce the running time of the key business nodes.

After the key service node is determined to be completed, the scheme can optimize the service data or the data model associated with the service node so as to reduce the running time of the key service node, thereby directly improving the timeliness of the key service node and indirectly improving the timeliness of the operation of the whole service relationship network.

In another possible embodiment, optionally, after determining the key service node in the target link according to the characteristic information of each service node in the target link, the method further includes: determining an upstream node and a downstream node associated with the key service node to determine a key link containing the key service node.

Illustratively, taking the traffic relation network shown in fig. 1b as an example, the present solution may determine a forward critical link from the critical traffic node 7 to its downstream traffic node: (7,8,10), (7,8), (7,9). And may determine the reverse critical link of the critical service node 7 to its upstream service node: (7,5,2,1), (7,5,2), (7,4), (7,5).

Therefore, after determining the key service node in the target link according to the characteristic information of each service node in the target link, the method further comprises the following steps: and determining an upstream node and a downstream node associated with the key service node so as to determine a key link containing the key service node. The method can realize the determination of the service node influencing the key service node and the service node influenced by the key service node, can realize the identification of the key link by supporting a forward mode and a reverse mode, has certain flexibility, and macroscopically supervises the service link comprising the associated service node.

The technical scheme of the embodiment of the invention determines at least one service link from a target starting node to a target terminating node from a service relationship network; the service relation network is determined according to the flow direction of service data among the service nodes; determining a target link from the service links; the total running time of the target link is longest; determining key service nodes in the target link according to the characteristic information of each service node in the target link; the characteristic information includes at least one of a webpage ranking value, a K-kernel value, and a runtime. By executing the technical scheme provided by the embodiment of the invention, the key service node on the local service link can be efficiently and accurately determined, so that the link containing the key service node is optimized, and the running timeliness of the service relation network is improved.

Fig. 2 is a schematic structural diagram of a determining apparatus of a key service node according to an embodiment of the present invention. As shown in fig. 2, the apparatus includes:

a service link determining module 210, configured to determine at least one service link from the target originating node to the target terminating node from the service relationship network; the service relation network is determined according to the flow direction of service data among the service nodes;

a target link determining module 220, configured to determine a target link from the service links; the total running time of the target link is longest;

a key service node determining module 230, configured to determine a key service node in the target link according to the feature information of each service node in the target link; the characteristic information includes at least one of a webpage ranking value, a K-kernel value, and a runtime.

Optionally, the service link determining module 210 is specifically configured to process the service relationship network based on a Bellman-ford algorithm, and determine at least one service link from the target start node to the target end node.

Optionally, the apparatus further includes a total operation time determination module, configured to determine total operation times of the service links respectively before determining a target link from the service links; the target link determining module 220 is specifically configured to use the service link with the longest total running time as the target link.

Optionally, the total operation time determining module includes an operation log determining unit, configured to determine an operation log of each service node in the service link; the operation time determining unit is used for determining the operation time of the service node according to the operation log; and the total operation time determining unit is used for taking the sum of the operation times of all the service nodes as the total operation time of the service link.

Optionally, the key service node determining module 230 includes an importance index value determining unit, configured to determine an importance index value of the service node by weighted summation of the webpage ranking value, the K core value, and the running time of the service node; and the key service node determining unit is used for sequencing the importance index values and determining the service node associated with the maximum value of the importance index values in the sequencing result as the key service node.

Optionally, the apparatus further includes a key service node optimization module, configured to optimize service data associated with the key service node, so as to reduce the running time of the key service node.

Optionally, the apparatus further includes an upstream and downstream node determining module, configured to determine an upstream node and a downstream node associated with the key service node, so as to determine a key link including the key service node.

The determining device for the key service node provided by the embodiment of the invention can execute the determining method for the key service node provided by any embodiment of the invention, and has corresponding functional modules and beneficial effects of the executing method.

FIG. 3 illustrates a schematic diagram of an electronic device 40 that may be used to implement an embodiment of the invention. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device may also represent various forms of mobile devices, such as personal digital assistants, cellular phones, smart phones, wearable devices (e.g., helmets, glasses, watches, etc.), and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be exemplary only, and are not meant to limit implementations of the inventions described and/or claimed herein.

As shown in fig. 3, the electronic device 40 includes at least one processor 41, and a memory communicatively connected to the at least one processor 41, such as a Read Only Memory (ROM) 42, a Random Access Memory (RAM) 43, and the like, wherein the memory stores a computer program executable by the at least one processor, and the processor 41 may perform various suitable actions and processes according to the computer program stored in the Read Only Memory (ROM) 42 or the computer program loaded from the storage unit 48 into the Random Access Memory (RAM) 43. In the RAM 43, various programs and data necessary for the operation of the electronic apparatus 40 can also be stored. The processor 41, the ROM 42, and the RAM 43 are connected to each other via a bus 44. An input/output (I/O) interface 45 is also connected to bus 44.

A number of components in the electronic device 40 are connected to the I/O interface 45, including: an input unit 46 such as a keyboard, a mouse, or the like; an output unit 47 such as various types of displays, speakers, and the like; a storage unit 48 such as a magnetic disk, an optical disk, or the like; and a communication unit 49 such as a network card, modem, wireless communication transceiver, etc. The communication unit 49 allows the electronic device 40 to exchange information/data with other devices via a computer network such as the internet and/or various telecommunication networks.

Processor 41 may be a variety of general and/or special purpose processing components having processing and computing capabilities. Some examples of processor 41 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various dedicated Artificial Intelligence (AI) computing chips, various processors running machine learning model algorithms, a Digital Signal Processor (DSP), and any suitable processor, controller, microcontroller, and so forth. Processor 41 performs the various methods and processes described above, such as the determination of key service nodes.

In some embodiments, the critical service node determination method may be implemented as a computer program tangibly embodied in a computer-readable storage medium, such as storage unit 48. In some embodiments, part or all of the computer program may be loaded and/or installed onto the electronic device 40 via the ROM 42 and/or the communication unit 49. When the computer program is loaded into the RAM 43 and executed by the processor 41, one or more steps of the above described method of determining a critical service node may be performed. Alternatively, in other embodiments, the processor 41 may be configured by any other suitable means (e.g., by means of firmware) to perform the determination method of the critical service node.

Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuitry, field Programmable Gate Arrays (FPGAs), application Specific Integrated Circuits (ASICs), application Specific Standard Products (ASSPs), system on a chip (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs that are executable and/or interpretable on a programmable system including at least one programmable processor, which may be special or general purpose, receiving data and instructions from, and transmitting data and instructions to, a storage system, at least one input device, and at least one output device.

A computer program for implementing the methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus, such that the computer programs, when executed by the processor, cause the functions/acts specified in the flowchart and/or block diagram block or blocks to be performed. A computer program can execute entirely on a machine, partly on a machine, as a stand-alone software package partly on a machine and partly on a remote machine or entirely on a remote machine or server.

In the context of the present invention, a computer-readable storage medium may be a tangible medium that can contain, or store a computer program for use by or in connection with an instruction execution system, apparatus, or device. A computer readable storage medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. Alternatively, the computer readable storage medium may be a machine readable signal medium. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

To provide for interaction with an object, the systems and techniques described here can be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to an object; and a keyboard and a pointing device (e.g., a mouse or a trackball) by which objects can provide input to the electronic device. Other kinds of devices may also be used to provide for interaction with an object; for example, feedback provided to the subject can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the object can be received in any form, including acoustic, speech, or tactile input.

The systems and techniques described here can be implemented in a computing system that includes a back-end component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., an object computer having a graphical object interface or a web browser through which objects can interact with an implementation of the systems and techniques described here), or any combination of such back-end, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), wide Area Networks (WANs), blockchain networks, and the Internet.

The computing system may include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server can be a cloud server, also called a cloud computing server or a cloud host, and is a host product in a cloud computing service system, so that the defects of high management difficulty and weak service expansibility in the traditional physical host and VPS service are overcome.

It should be understood that various forms of the flows shown above may be used, with steps reordered, added, or deleted. For example, the steps described in the present invention may be executed in parallel, sequentially, or in different orders, and are not limited herein as long as the desired result of the technical solution of the present invention can be achieved.

The above-described embodiments should not be construed as limiting the scope of the invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may be made, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A method for determining a key service node, comprising:

2. The method of claim 1, wherein determining at least one traffic link from the target originating node to the target terminating node from the traffic relationship network comprises:

and processing the service relation network based on a Bellman-ford algorithm, and determining at least one service link from the target starting node to the target terminating node.

3. The method of claim 1, wherein prior to determining a target link from the traffic links, the method further comprises:

respectively determining the total operation time of the service links;

determining a target link from the traffic links, comprising:

and taking the service link with the longest total operation time as a target link.

4. The method of claim 3, wherein determining the total runtime of the traffic link comprises:

determining an operation log of each service node in the service link;

determining the operation time of the service node according to the operation log;

and taking the sum of the running time of each service node as the total running time of the service link.

5. The method of claim 1, wherein determining key service nodes in the target link according to the characteristic information of each service node in the target link comprises:

weighting and summing the webpage ranking value, the K core value and the running time of the service node to determine an importance index value of the service node;

and sequencing the importance index values, and determining the service node associated with the maximum value of the importance index values in the sequencing result as a key service node.

6. The method of claim 1, wherein after determining key service nodes in the target link according to the characteristic information of each service node in the target link, the method further comprises:

and optimizing the business data associated with the key business nodes so as to reduce the running time of the key business nodes.

7. The method of claim 5, after determining the key service node in the target link according to the characteristic information of each service node in the target link, further comprising:

and determining an upstream node and a downstream node associated with the key service node to determine a key link containing the key service node.

8. An apparatus for determining a critical service node, comprising:

9. An electronic device, characterized in that the electronic device comprises:

at least one processor; and

the memory stores a computer program executable by the at least one processor to enable the at least one processor to perform the method of determining a critical service node of any of claims 1-7.

10. A computer-readable storage medium, having stored thereon computer instructions for causing a processor to, when executed, implement the method of determining a critical service node of any of claims 1-7.