Link optimization method and apparatus

Abstract

The present disclosure provides a link optimization method and device. The link optimization method comprises: establishing a topology model of an IP network; determining a plurality of minimal cut sets of the IP network according to the topology model of the IP network; determining an optimized link in each minimal cut set based on network reliability; determining an optimized link between a source node and a destination node in the IP network according to the optimized link in each minimal cut set; and performing an optimization process on the optimized link between the source node and the destination node. The present disclosure can effectively improve the performance of the IP network.

Description

Technical Field

[0001] This disclosure relates to the field of network technology, and in particular to a link optimization method and apparatus. Background Technology

[0002] With the continuous development of IP network technology, people's reliance on IP networks is increasing daily, and related new data services are also emerging. The emergence and development of these new data services have led to a sharp increase in communication traffic, placing higher demands on IP network construction. IP network link optimization and capacity expansion is an essential part of IP network construction. By optimizing and expanding IP network links, performance requirements can be improved, thereby achieving comprehensive IP network support and enhancing user experience.

[0003] Currently, the common solution for IP network link optimization is to select bottleneck links and expand their capacity. The challenge lies in effectively and cost-efficiently locating bottleneck links in IP networks with hundreds of links. Locating links requiring optimization and expansion based on traffic prediction models is a primary method for existing IP network link optimization. This technology first uses artificial intelligence algorithms to learn about changes in IP network traffic data, extracting traffic data characteristics and predicting future traffic growth trends. Then, based on the captured future IP network traffic trends, it selects links whose traffic predictions exceed expansion warning levels for optimization and expansion, achieving an intelligent solution to the IP network link optimization and expansion problem. Summary of the Invention

[0004] The inventors noted that in related technologies, the method of locating IP network optimization links based on traffic prediction models only considers IP network traffic factors and fails to fully consider the reliability issues of IP networks, thus failing to effectively improve the performance of IP networks.

[0005] Accordingly, this disclosure provides a link optimization scheme that selects IP network links that need to be optimized based on network reliability, thereby effectively improving the performance of IP networks.

[0006] According to a first aspect of the present disclosure, a link optimization method is provided, comprising: establishing a topology model of an IP network; determining a plurality of minimum cut sets of the IP network based on the topology model of the IP network; determining an optimized link in each minimum cut set based on network reliability; determining an optimized link between a source node and a destination node in the IP network based on the optimized link in each minimum cut set; and performing optimization processing on the optimized link between the source node and the destination node.

[0007] In some embodiments, determining the optimized links in each minimum cut set based on network reliability includes: sorting the links in the j-th minimum cut set in ascending order of their maximum capacity, wherein... , p is the total number of minimum cut sets; optimize and expand the k-th link in the j-th minimum cut set, and calculate the connectivity reliability of the k-th link based on the optimization and expansion results, where g represents the total number of links; the link corresponding to the highest connectivity reliability is selected as the optimized link in the j-th minimum cut set.

[0008] In some embodiments, determining the optimal link between the source node and the destination node in the IP network based on the optimal links in each minimum cut set includes: concatenating the optimal links in the m-th minimum cut set with the optimal links in the n-th minimum cut set based on the nodes corresponding to the optimal links in the m-th minimum cut set, thereby obtaining multiple candidate links between the source node and the destination node in the IP network. , Based on the connectivity reliability of the optimized links included in each candidate link, the connectivity reliability of each candidate link is determined; the candidate link with the highest connectivity reliability is selected as the optimized link between the source node and the destination node in the IP network.

[0009] In some embodiments, determining multiple minimal cut sets of the IP network based on the topology model of the IP network includes: processing the topology model of the IP network based on the maximum flow minimum cut theorem to obtain multiple minimal cut sets of the IP network.

[0010] In some embodiments, obtaining multiple minimal cut sets of the IP network includes: obtaining a maximum flow max(f) in the IP network using a maximum flow algorithm; calculating a residual network of the IP network relative to the maximum flow max(f); in the residual network, forming a first node set by nodes reachable from the source node and their respective source nodes, and forming a second node set by nodes in the IP network not included in the first node set; processing the first node set and the second node set respectively to obtain multiple corresponding cut sets; and extracting a minimal cut set from the multiple corresponding cut sets.

[0011] In some embodiments, the sum of the maximum capacity of the links included in the minimum cut set is equal to the maximum traffic of the IP network.

[0012] According to a second aspect of the present disclosure, a link optimization apparatus is provided, comprising: a first processing module configured to establish a topology model of an IP network; a second processing module configured to determine a plurality of minimal cut sets of the IP network based on the topology model of the IP network; a third processing module configured to determine an optimized link in each minimal cut set based on network reliability; a fourth processing module configured to determine an optimized link between a source node and a destination node in the IP network based on the optimized link in each minimal cut set; and a fifth processing module configured to perform optimization processing on the optimized link between the source node and the destination node.

[0013] In some embodiments, the third processing module is configured to sort the links in the j-th minimum cut set in ascending order of their maximum capacity, wherein... Let p be the total number of minimum cut sets. The k-th link in the j-th minimum cut set is optimized and expanded, and the connectivity reliability of the k-th link is calculated based on the optimization and expansion results. g represents the total number of links, and the link corresponding to the highest connectivity reliability is selected as the optimized link in the j-th minimum cut set.

[0014] In some embodiments, the fourth processing module is configured to concatenate the optimized links in the m-th minimum cut set with the optimized links in the n-th minimum cut set based on the nodes corresponding to the optimized links in the m-th minimum cut set, thereby obtaining multiple candidate links between the source node and the destination node in the IP network. , Based on the connectivity reliability of the optimized links included in each candidate link, the connectivity reliability of each candidate link is determined, and the candidate link with the highest connectivity reliability is selected as the optimized link between the source node and the destination node in the IP network.

[0015] In some embodiments, the second processing module is configured to process the topology model of the IP network based on the network maximum flow minimum cut theorem to obtain multiple minimum cut sets of the IP network.

[0016] In some embodiments, the second processing module is configured to obtain a maximum flow max(f) in the IP network using the maximum flow algorithm, calculate a residual network of the IP network relative to the maximum flow max(f), in the residual network, form a first node set by nodes reachable from the source node and their respective source nodes, form a second node set by nodes in the IP network not included in the first node set, process the first node set and the second node set respectively to obtain multiple corresponding cut sets; and extract the minimum cut set from the multiple corresponding cut sets.

[0017] In some embodiments, the sum of the maximum capacity of the links included in the minimum cut set is equal to the maximum traffic of the IP network.

[0018] According to a third aspect of the present disclosure, a link optimization apparatus is provided, comprising: a memory configured to store instructions; and a processor coupled to the memory, the processor being configured to execute instructions stored in the memory to implement the method as described in any of the above embodiments.

[0019] According to a fourth aspect of the present disclosure, a computer-readable storage medium is provided, wherein the computer-readable storage medium stores computer instructions that, when executed by a processor, implement the method as described in any of the above embodiments.

[0020] Other features and advantages of this disclosure will become clear from the following detailed description of exemplary embodiments with reference to the accompanying drawings. Attached Figure Description

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

[0022] Figure 1 This is a flowchart illustrating a link optimization method according to an embodiment of the present disclosure;

[0023] Figure 2 This is a schematic diagram of the structure of a link optimization device according to an embodiment of the present disclosure;

[0024] Figure 3 This is a schematic diagram of the structure of a link optimization device according to another embodiment of the present disclosure. Detailed Implementation

[0025] The technical solutions of the embodiments of this disclosure will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this disclosure, and not all embodiments. The following description of at least one exemplary embodiment is merely illustrative and is in no way intended to limit this disclosure or its application or use. All other embodiments obtained by those skilled in the art based on the embodiments of this disclosure without creative effort are within the scope of protection of this disclosure.

[0026] Unless otherwise specifically stated, the relative arrangement, numerical expressions, and values ​​of the components and steps set forth in these embodiments do not limit the scope of this disclosure.

[0027] At the same time, it should be understood that, for ease of description, the dimensions of the various parts shown in the accompanying drawings are not drawn according to actual scale.

[0028] Techniques, methods, and equipment known to those skilled in the art may not be discussed in detail, but where appropriate, such techniques, methods, and equipment should be considered part of the specification.

[0029] In all examples shown and discussed herein, any specific values ​​should be interpreted as merely exemplary and not as limitations. Therefore, other examples of exemplary embodiments may have different values.

[0030] It should be noted that similar labels and letters in the following figures indicate similar items; therefore, once an item is defined in one figure, it does not need to be discussed further in subsequent figures.

[0031] Figure 1 This is a flowchart illustrating a link optimization method according to an embodiment of the present disclosure. In some embodiments, the following link optimization method is performed by a link optimization device.

[0032] In step 101, a topology model of the IP network is established.

[0033] Suppose that the IP network topology is a directed graph where the weights of each edge and each node represent their respective maximum passable capacity, and let... Characterize it. It is a finite set of n nodes, representing a routing node in an IP network; Let be a finite set of edges of m links, representing the interconnected links in an IP network. The set of nodes and edges is collectively referred to as a component set. , Represents components in an IP network . The set consisting of the maximum capacity of all components of an IP network, i.e. Representation of components Maximum capacity, Representation of components Maximum capacity. Establish as well as Representing components The multi-state set and its corresponding probability set, where , The meaning of is component. In state The probability is In a state The probability is And the probability set satisfies that the sum of the probability values ​​equals 1, that is...

[0034]

[0035] In step 102, multiple minimal cut sets of the IP network are determined based on the IP network topology model.

[0036] In some embodiments, the topology model of the IP network is processed based on the network maximum flow minimum cut theorem to obtain multiple minimum cut sets of the IP network.

[0037] It should be noted that since the maximum flow minimum cut theorem is not the inventive point of this disclosure, it will not be described in detail here.

[0038] In some embodiments, the steps of obtaining multiple minimal cut sets of an IP network include:

[0039] 1) Use the maximum flow algorithm to obtain a maximum flow max(f) in an IP network.

[0040] 2) Calculate the residual network of the IP network relative to the maximum traffic max(f).

[0041] 3) In the residual network, the first node set V1 is formed by the nodes that can be reached from the source node and their respective source nodes, and the second node set V2 is formed by the nodes in the IP network that are not included in the first node set.

[0042] 4) Process the first node set and the second node set respectively to obtain the corresponding multiple cut sets.

[0043] It should be noted that, according to the definition of a cut set, a cut set is a set of links. If the links are removed from the graph, the graph will be divided into two parts. First, let the cut set... For each link ,like , This indicates the two nodes of the link. They are located in different sets of nodes, at which point the link... Let an element of a cut set be... .

[0044] 5) Extract the minimum cut set from the corresponding multiple cut sets.

[0045] It should be noted that, according to the maximum flow minimum cut theorem, let the minimum cut set be set... Calculate each cut set If the sum of the maximum capacity of the links contained in a cut set equals the maximum network traffic, then the cut set is a minimal cut set. .

[0046] In step 103, the optimal links in each minimum cut set are determined based on network reliability.

[0047] In some embodiments, in the j-th minimum cut set, the links are arranged in ascending order of their maximum capacity, where p is the total number of minimum cut sets.

[0048] Next, the k-th link in the j-th minimum cut set is optimized and expanded, and the connectivity reliability of the k-th link is calculated based on the optimization and expansion results. g represents the total number of links.

[0049] In other words, in the j-th minimum cut set, each link is optimized and expanded in turn, and the connectivity reliability of the k-th link is calculated based on the optimization and expansion results.

[0050] Next, the link corresponding to the highest connectivity reliability will be selected as the optimized link in the j-th minimum cut set.

[0051] For example, a minimal cut set may contain four links. These four links are arranged in ascending order of their maximum capacity. Then, each link is optimized and expanded sequentially, and the connectivity reliability of each link is calculated based on the optimization results. If the second link has the highest connectivity reliability, then this second link is selected as the optimized link for the minimal cut set.

[0052] In some embodiments, the connectivity reliability of the k-th link can be obtained in the following ways.

[0053] S1: Input the status and probability table of each component of the IP network.

[0054] S2: Set the number of Monte Carlo simulations .

[0055] S3: Construct a component state sample dataset using a probability stratified sampling method.

[0056] S4: Construct the network state vector based on the component state sample dataset. .

[0057] S5: Evaluate the network state vector based on the network's maximum flow. Let... This represents the calculated maximum network traffic, which is then compared with the required traffic. If a comparison is made, This indicates that the network state vector in this simulation is... If the required traffic can be successfully transmitted from the source node to the target node on the k-th link, then the network success count is updated. .

[0058] S6: Repeat S4 and S5 until the preset number of simulations is reached. At this point, the connectivity reliability of the k-th link is... .

[0059] In step 104, the optimal link between the source node and the destination node in the IP network is determined based on the optimal link in each minimum cut set.

[0060] In some embodiments, based on the nodes corresponding to the optimized links in the m-th minimum cut set and the n-th minimum cut set, the optimized links in the m-th minimum cut set are concatenated with the optimized links in the n-th minimum cut set to obtain multiple candidate links between the source node and the destination node in the IP network. , p is the total number of minimum cut sets.

[0061] Then, the connectivity reliability of each candidate link is determined based on the connectivity reliability of the optimized links included in each candidate link.

[0062] Next, the candidate link with the highest connectivity reliability will be selected as the optimized link between the source node and the destination node in the IP network.

[0063] In step 105, the optimized link between the source node and the destination node is optimized.

[0064] It should be noted that since the preferred processing is not the inventive point of this disclosure, it will not be described in detail here.

[0065] In the link optimization method provided in the above embodiments of this disclosure, the IP network link to be optimized is selected according to the network reliability, thereby effectively improving the performance of the IP network.

[0066] For example, an IP network has four minimal cut sets, each containing three links. The links in the first minimal cut set are located between Guangzhou and Shanghai, the links in the second minimal cut set are located between Guangzhou and Wuhan, the links in the third minimal cut set are located between Shanghai and Beijing, and the links in the fourth minimal cut set are located between Wuhan and Beijing.

[0067] Based on network reliability, the first link in the first minimum cut set is identified as the optimal link, the second link in the second minimum cut set is identified as the optimal link, the third link in the third minimum cut set is identified as the optimal link, and the third link in the fourth minimum cut set is identified as the optimal link.

[0068] Next, based on the first link in the first minimum cut set and the third link in the third minimum cut set, the first candidate link from Guangzhou through Shanghai to Beijing is determined. Based on the second link in the second minimum cut set and the third link in the fourth minimum cut set, the second candidate link from Guangzhou through Wuhan to Beijing is determined.

[0069] Next, the candidate link with the highest connectivity reliability is selected as the optimized link between Guangzhou and Beijing. For example, if the connectivity reliability of the second candidate link is greater than that of the first candidate link, then the second candidate link is selected as the optimized path from Guangzhou to Beijing, and this optimized path is then further optimized.

[0070] Figure 2 This is a schematic diagram of the structure of a link optimization device according to an embodiment of this disclosure. Figure 2 As shown, the link optimization device includes a first processing module 21, a second processing module 22, a third processing module 23, a fourth processing module 24, and a fifth processing module 25.

[0071] The first processing module 21 is configured to establish the topology model of the IP network.

[0072] The second processing module 22 is configured to determine multiple minimal cut sets of the IP network based on the topology model of the IP network.

[0073] In some embodiments, the second processing module 22 processes the topology model of the IP network based on the network maximum flow minimum cut theorem to obtain multiple minimum cut sets of the IP network.

[0074] It should be noted that since the maximum flow minimum cut theorem is not the inventive point of this disclosure, it will not be described in detail here.

[0075] In some embodiments, the second processing module 22 uses the maximum flow algorithm to obtain a maximum flow max(f) in the IP network, calculates the residual network of the IP network relative to the maximum flow max(f), and in the residual network, the nodes that can be reached from the source node and their respective source nodes constitute a first node set, and the nodes in the IP network that are not included in the first node set constitute a second node set. The first node set and the second node set are processed respectively to obtain multiple cut sets, and the minimum cut set is extracted from the multiple cut sets.

[0076] For example, the sum of the maximum capacity of the links included in the minimum cut set is equal to the maximum traffic of the IP network.

[0077] The third processing module 23 is configured to determine the optimal links in each minimum cut set based on network reliability.

[0078] In some embodiments, the third processing module 23 sorts the links in the j-th minimum cut set in ascending order of their maximum capacity, wherein... Let p be the total number of minimum cut sets. Optimize and expand the k-th link in the j-th minimum cut set, and calculate the connectivity reliability of the k-th link based on the optimization results. g represents the total number of links, and the link corresponding to the highest connectivity reliability is selected as the optimized link in the j-th minimum cut set.

[0079] For example, a minimal cut set may contain four links. These four links are arranged in ascending order of their maximum capacity. Then, each link is optimized and expanded sequentially, and the connectivity reliability of each link is calculated based on the optimization results. If the second link has the highest connectivity reliability, then this second link is selected as the optimized link for the minimal cut set.

[0080] The fourth processing module 24 is configured to determine the optimal link between the source node and the destination node in the IP network based on the optimal link in each minimum cut set.

[0081] In some embodiments, the fourth processing module 24, based on the nodes corresponding to the optimized links in the m-th minimum cut set and the n-th minimum cut set, concatenates the optimized links in the m-th minimum cut set with the optimized links in the n-th minimum cut set, thereby obtaining multiple candidate links between the source node and the destination node in the IP network. , Based on the connectivity reliability of the optimized links included in each candidate link, the connectivity reliability of each candidate link is determined, and the candidate link with the highest connectivity reliability is selected as the optimized link between the source node and the destination node in the IP network.

[0082] The fifth processing module is configured to optimize the link between the source node and the destination node.

[0083] Figure 3 This is a schematic diagram of the structure of a link optimization device according to another embodiment of this disclosure. Figure 3 As shown, the link optimization device includes a memory 31 and a processor 32.

[0084] Memory 31 is used to store instructions, and processor 32 is coupled to memory 31. Processor 32 is configured to execute instructions based on memory storage, as shown in the example. Figure 1 The method involved in any of the embodiments.

[0085] like Figure 3As shown, the link optimization device also includes a communication interface 33 for exchanging information with other devices. Additionally, the link optimization device includes a bus 34, through which the processor 32, communication interface 33, and memory 31 communicate with each other.

[0086] The memory 31 may include high-speed RAM, and may also include non-volatile memory, such as at least one disk storage device. The memory 31 may also be a memory array. The memory 31 may also be divided into blocks, and the blocks may be combined into virtual volumes according to certain rules.

[0087] Furthermore, processor 32 may be a central processing unit (CPU), an application-specific integrated circuit (ASIC), or one or more integrated circuits configured to implement embodiments of the present disclosure.

[0088] This disclosure also relates to a computer-readable storage medium storing computer instructions that, when executed by a processor, implement... Figure 1 The method involved in any of the embodiments.

[0089] This disclosure utilizes the maximum flow minimum cut theorem to effectively identify and determine bottleneck links that restrict the maximum flow of IP networks, and prioritizes expanding the capacity of bottleneck links. By assessing network reliability, the optimal link optimization scheme is obtained, which not only solves the link optimization problem of IP networks but also further improves the reliability of IP networks.

[0090] In some embodiments, the functional units described above may be implemented as general-purpose processors, programmable logic controllers (PLCs), digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or any suitable combination thereof for performing the functions described herein.

[0091] Those skilled in the art will understand that all or part of the steps of the above embodiments can be implemented by hardware or by a program instructing related hardware. The program can be stored in a computer-readable storage medium, such as a read-only memory, a disk, or an optical disk.

[0092] The description in this disclosure is provided for illustrative and descriptive purposes only and is not intended to be exhaustive or to limit the disclosure to its forms. Many modifications and variations will be apparent to those skilled in the art. The embodiments were chosen and described in order to better illustrate the principles and practical application of this disclosure and to enable those skilled in the art to understand this disclosure and to design various embodiments with various modifications suitable for a particular purpose.

Claims

1. A link optimization method, comprising: Establish a topology model for the IP network; Based on the topology model of the IP network, determine multiple minimal cut sets of the IP network; The optimal links in each minimum cut set are determined based on network reliability; The optimal link between the source node and the destination node in the IP network is determined based on the optimal link in each minimum cut set; The optimized link between the source node and the destination node is optimized. The determination of the optimized links in each minimum cut set based on network reliability includes: Sort the links in the j-th minimum cut set in ascending order of their maximum capacity. p is the total number of minimum cut sets; The k-th link in the j-th minimum cut set is optimized and expanded, and the connectivity reliability of the k-th link is calculated based on the optimization and expansion results. g represents the total number of links; The link corresponding to the highest connectivity reliability is selected as the optimized link in the j-th minimum cut set.

2. The method according to claim 1, wherein, The step of determining the optimal link between the source node and the destination node in the IP network based on the optimal links in each minimum cut set includes: Based on the nodes corresponding to the optimized links in the m-th minimum cut set and the n-th minimum cut set, the optimized links in the m-th minimum cut set and the n-th minimum cut set are concatenated to obtain multiple candidate links between the source node and the destination node in the IP network. , ; The connectivity reliability of each candidate link is determined based on the connectivity reliability of the optimized links included in each candidate link. The candidate link with the highest connectivity reliability is selected as the optimized link between the source node and the destination node in the IP network.

3. The method according to claim 1, wherein, The process of determining multiple minimal cut sets of the IP network based on the IP network topology model includes: The IP network topology model is processed based on the maximum flow minimum cut theorem to obtain multiple minimum cut sets of the IP network.

4. The method according to claim 3, wherein, Obtaining multiple minimal cut sets of the IP network includes: The maximum flow algorithm is used to obtain a maximum flow max(f) in the IP network; Calculate the residual network of the IP network relative to the maximum traffic max(f); In the residual network, the nodes reachable from the source node and their respective source nodes constitute a first node set, and the nodes in the IP network not included in the first node set constitute a second node set. The first node set and the second node set are processed respectively to obtain multiple corresponding cut sets; Extract the minimum cut set from the corresponding multiple cut sets.

5. The method according to claim 4, wherein, The sum of the maximum capacity of the links included in the minimum cut set is equal to the maximum traffic of the IP network.

6. A link optimization device, comprising: The first processing module is configured to establish the topology model of the IP network; The second processing module is configured to determine multiple minimal cut sets of the IP network based on the topology model of the IP network; The third processing module is configured to determine the optimal links in each minimum cut set based on network reliability, wherein the links in the j-th minimum cut set are sorted in ascending order of maximum link capacity. Let p be the total number of minimum cut sets. The k-th link in the j-th minimum cut set is optimized and expanded, and the connectivity reliability of the k-th link is calculated based on the optimization and expansion results. g represents the total number of links, and the link corresponding to the highest connectivity reliability is selected as the optimized link in the j-th minimum cut set. The fourth processing module is configured to determine the optimal link between the source node and the destination node in the IP network based on the optimal links in each minimum cut set; The fifth processing module is configured to perform optimization processing on the optimized link between the source node and the destination node.

7. The apparatus according to claim 6, wherein, The fourth processing module is configured to concatenate the optimized links in the m-th and n-th minimum cut sets based on the nodes corresponding to the optimized links in the m-th and n-th minimum cut sets, thereby obtaining multiple candidate links between the source and destination nodes in the IP network. , Based on the connectivity reliability of the optimized links included in each candidate link, the connectivity reliability of each candidate link is determined, and the candidate link with the highest connectivity reliability is selected as the optimized link between the source node and the destination node in the IP network.

8. The apparatus according to claim 6, wherein, The second processing module is configured to process the topology model of the IP network based on the network maximum flow minimum cut theorem to obtain multiple minimum cut sets of the IP network.

9. The apparatus according to claim 8, wherein, The second processing module is configured to obtain a maximum flow max(f) in the IP network using the maximum flow algorithm, calculate the residual network of the IP network relative to the maximum flow max(f), in the residual network, form a first node set by nodes reachable from the source node and their respective source nodes, form a second node set by nodes in the IP network not included in the first node set, process the first node set and the second node set respectively to obtain multiple corresponding cut sets, and extract the minimum cut set from the multiple corresponding cut sets.

10. The apparatus according to claim 9, wherein, The sum of the maximum capacity of the links included in the minimum cut set is equal to the maximum traffic of the IP network.

11. A link optimization device, comprising: The memory is configured to store instructions; A processor, coupled to a memory, is configured to implement the method as described in any one of claims 1-5 based on memory-stored instruction execution.

12. A computer-readable storage medium, wherein, A computer-readable storage medium stores computer instructions that, when executed by a processor, implement the method as described in any one of claims 1-5.

Images