A method, system and electronic device for recovering topological resources

Abstract

A method for recovering topological resources includes the following steps: prioritizing services according to preset rules, reading out a service for path calculation; if the service path calculation is successful, allocating and modifying topological resources; if the service path calculation fails, backtracking operations are performed to recover the modified topological resources. The present invention also provides a topological resource recovery system, which can provide concise and efficient topological resource storage, modification, reading and recovery operations, reduces storage space and implementation complexity, is more efficient, has better reliability, and is easy to modify, expand and maintain.

Description

Technical Field

[0001] The present invention relates to the field of communication technology, and in particular to a method, system and electronic device for fast topological resource access and recovery during routing calculation and resource allocation in an automatic switching optical network. Background Art

[0002] With the continuous development of Automatically Switched Optical Network (ASON) technology and Software Defined Network (SDN), more and more service providers are beginning to use optical network equipment to build networks, and to implement automatic call path calculation and connection establishment at the control layer to complete the planning and calculation functions of the entire call path.

[0003] Under certain demand conditions, it is necessary to calculate paths for a group of services at the same time. The usual path calculation method is to first determine the order of calculation of a service, and then calculate the path of a single service in turn and allocate path resources (such as OA port, internal link, wavelength, OEP port, relay, etc.). The service path calculated later is calculated on the basis of the resources pre-allocated on the path calculated earlier. If the path calculation fails or the resource allocation fails, it is necessary to backtrack, that is, to restore all the allocated resources on the path of the previous service, and then replace the suboptimal path for an attempt. If successful, continue to calculate the next service. If failed, continue to backtrack to the previous service until all service path calculations and resource allocations are successful.

[0004] There are usually two ways to achieve resource recovery. The first is to clone and back up the entire topology resources at the beginning of each business path calculation. When the path calculation or resource allocation fails and needs to be backtracked, the cloned backup topology resources are used for recovery. This method is simple to implement, but it wastes a lot of storage space and is inefficient. The second method is to record the allocated resources one by one after each business path calculation, and perform reverse resource recovery operations when the path calculation or resource allocation fails and needs to be backtracked and recovered. Although this method is more efficient, it is complex to implement. When the topology resource storage structure needs to be adjusted, the recording and recovery operations need to be modified synchronously, which is extremely difficult to maintain and prone to errors, resulting in inconsistency of topology resources. Summary of the invention

[0005] The purpose of the embodiments of this specification is to provide a method, system and electronic device for recovering topological resources, which reduce storage space and implementation complexity, are more efficient, more reliable, and are easy to modify, expand and maintain.

[0006] To solve the above technical problems, the embodiments of this specification are implemented as follows:

[0007] In a first aspect, a method for recovering topological resources is proposed, comprising the following steps:

[0008] Prioritize the services according to preset rules and read out a service for path calculation;

[0009] If the service path calculation is successful, the topology resources are allocated and modified;

[0010] If the service path calculation fails, a backtracking operation is performed to restore the modified topology resources.

[0011] Secondly, a topology resource recovery system is proposed, including a path calculation module and a topology resource module.

[0012] in:

[0013] The path calculation module is used to perform read and write operations on the topology resource module;

[0014] The topology resource module is used to store topology resources.

[0015] In a third aspect, an electronic device is provided, comprising:

[0016] Processor; and

[0017] A memory arranged to store computer executable instructions, which when executed cause the processor to perform the operations described in the first aspect.

[0018] In a fourth aspect, a computer-readable storage medium is proposed, which stores one or more programs. When the one or more programs are executed by an electronic device including multiple application programs, the electronic device performs the operations described in the first aspect.

[0019] It can be seen from the technical solutions provided in the embodiments of the present specification that the present invention provides concise and efficient topological resource storage, modification, reading and recovery operations for path calculation. When the topology is modified, only a small amount of modified information needs to be stored, saving a large amount of storage resources; when reading the modified topological resources, a simple and efficient reading method is provided; when recovering the topological resources, it is so simple that only some topological layers need to be directly deleted. The storage space and implementation complexity are reduced, the efficiency is higher, the reliability is better, and it is easy to modify, expand and maintain. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] In order to more clearly illustrate the embodiments of this specification or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments recorded in this specification. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative labor.

[0021] Figure 1 It is a schematic diagram of the steps of a method for recovering topological resources provided by an embodiment of this specification.

[0022] Figure 2 This is a schematic diagram of topological resource storage provided by an embodiment of this specification.

[0023] Figure 3 This is a schematic diagram of topological resource reading provided by an embodiment of this specification.

[0024] Figure 4 This is a schematic diagram of topology resource backtracking provided by an embodiment of this specification.

[0025] Figure 5 This is a schematic diagram of topology resource merging provided by an embodiment of this specification.

[0026] Figure 6 This is a schematic diagram of the final merging of topological resources provided by an embodiment of this specification.

[0027] Figure 7 This is a topology resource recovery system architecture diagram provided by an embodiment of this specification.

[0028] Figure 8 It is a schematic diagram of the module structure in a topology resource recovery system provided by an embodiment of this specification.

[0029] Fig. 9 It is a schematic diagram of the structure of an electronic device provided by an embodiment of this specification. DETAILED DESCRIPTION

[0030] In order to enable those skilled in the art to better understand the technical solutions in this specification, the technical solutions in the embodiments of this specification will be clearly and completely described below in conjunction with the drawings in the embodiments of this specification. Obviously, the described embodiments are only part of the embodiments of this specification, not all of the embodiments. Based on the embodiments in this specification, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of this specification.

[0031] Reference Figure 1FIG. 1 is a schematic diagram of a method for recovering topological resources provided in an embodiment of this specification. The method may include the following steps:

[0032] Step 101: Sort the services according to certain rules.

[0033] Optionally, the services are sorted according to certain rules, including the following operations:

[0034] Storing topological resources: Topological resources are stored in layers, and the original topological resources are saved separately as a storage layer.

[0035] Further, refer to Figure 2 As shown, a schematic diagram of topological resource storage in an embodiment of the present specification is shown. In this scenario, when topological resources are stored, they are stored in layers, and the original topology is saved in the L(0) layer, where the topological resources are represented by R(i){1≤i≤k}. When the path calculation module calculates a path and modifies the topological resources, such as modifying the R(k-3) resources, a layer L(1) is added above the topological L(0) layer. Only the modified content of the R(k-3) resources is saved in L(1), and other resources transparently access the lower layer, i.e., the L(0) layer resources. This process is repeated until n paths are calculated and the topology is modified n times, forming an n+1 layer topology.

[0036] Step 102: Determine whether all services have been calculated.

[0037] Step 103: If yes, then return success.

[0038] Optionally, when it is determined that all services have been successfully calculated, step 103 may be specifically performed as follows:

[0039] When the business path is calculated and there is no need to trace back resources, it is traversed from the bottom layer to the top layer, and the upper layer topology resource information is merged and modified to the lower layer in turn, and finally merged into one layer.

[0040] Further, refer to Figure 5 As shown in the figure, the schematic diagram of topological resource merging in the embodiment of this specification, in this scenario, when the path calculation is successful and no backtracking recovery operation is required, the topological layers can be merged, and the resource modification status of all layers except the L(0) layer can be overwritten and replaced to the L(0) layer along the direction of the arrow, and then the other layers except the L(0) layer can be deleted. Figure 6 As shown, this is a schematic diagram of the final merging of topological resources in an embodiment of this specification, and the topology after the final merging has only the L(0) layer.

[0041] Step 104: If no, then a service is sequentially taken out to perform path calculation.

[0042] Optionally, a service is taken out for path calculation, which specifically includes the following operations:

[0043] Calculate path operation: read topology resources.

[0044] Furthermore, the operation of reading topology resources can be specifically performed as follows:

[0045] When topology resource information needs to be read, the topology resource information is read through the interface provided by the topology resource at the top layer. For the part that is not stored at the top layer, the corresponding information of the next layer is transparently read. If the next layer is not stored either, the next layer is transparently read until the information is read. Therefore, the topology resource information read at this time is the topology resource information after the last modification.

[0046] Further, refer to Figure 3 As shown in the schematic diagram of topological resource reading in the embodiment of this specification, in this scenario, when reading the topological resource, refer to Figure 3 In the direction of the arrow, the topological resource read operation is performed from the read interface provided by the topmost layer, i.e., the nth layer. The resources not stored in the current layer are realized by transparently reading the resource data of the lower layers in sequence. That is, the L(n) layer does not have R(1), so the R(1) of the next layer L(n-1) is transparently read. Since L(n-1) does not have R(1) either, the R(1) of the next layer L(n-2) is transparently read, and finally the R(1) of the L(0) layer is read; the L(n) layer has R(2), so R(2) is used directly. The current latest status of the entire topological resource finally read is R(2) and R(k-1) of the L(n) layer, R(3) of the L(n-2) layer, ..., R(k-3) of the L(1) layer, and other resources are from the L(0) layer.

[0047] Step 105: Calculate the next optimal path for the service.

[0048] Step 106: Determine whether the path calculation is successful.

[0049] Step 107: If the path calculation fails and the service is the first service, the path calculation fails.

[0050] Step 108: If the path calculation fails and it is not the first service, a backtracking operation is performed to restore the topological resources that have been modified by the previous service, and then go to step 105.

[0051] Optionally, when performing a backtracking operation to restore the topology resources that have been modified in the previous service, step 108 may be specifically performed as follows:

[0052] If it is necessary to backtrack one step, the topological resources of the top n layers are discarded, so that the n-1 layer becomes the top layer; if it is necessary to backtrack m steps, the topological resources of the top m layers are discarded, so that the nm layer becomes the top layer.

[0053] Further, refer to Figure 4 As shown, the topological resource backtracking diagram in the embodiment of this specification, in this scenario, the topological resources are backtracked 2 steps, the top two layers L(n) and L(n-1) are deleted, and the topological resource state at the L(n-2) layer can be restored.

[0054] Step 109: If the path calculation is successful, the topology resources are allocated and modified.

[0055] Optionally, when allocating and modifying topology resources, step 109 may be specifically performed as follows:

[0056] Each time a modification is made to the original topology resources, the modification is used as a new storage layer and superimposed on the original layer. The new storage layer only needs to allocate space to store the modified part, and the unmodified part provides direct transparent access to the lower-layer topology resource interface. After that, each modification generates a new storage layer and superimposes it on the previous storage layer.

[0057] Step 110: Determine whether resource allocation is successful. If topology resource allocation fails, continue to calculate the next optimal path for the service and go to step 105; if topology resource allocation is successful, go to step 102.

[0058] in, Figure 1 The specific implementation of each step shown can refer to the interactive system solution provided in Example 1, and will not be described in detail here.

[0059] It should be noted that, in some specific demand situations of optical network path calculation, it is necessary to calculate paths for a group of multiple services at the same time. If multiple services can successfully calculate paths and allocate resources, the path calculation of this group of services is successful. If one or more of the path calculations fail, the path calculation of this group of services fails. To achieve this path calculation requirement, the usual path calculation method is to first determine the calculation order of multiple services, and then calculate the paths of the single services in turn and allocate path resources (such as OA ports, internal links, wavelengths, OEP ports, relays, etc.). After the path calculation is successful, the service path calculated first allocates resources in the topology, and the service path calculated later is calculated based on this topological resource. If the path calculation fails or the resource allocation fails, it is necessary to backtrack the topological resources, that is, to restore all the allocated resources on the path of the previous service, and then replace the suboptimal path and try again. If successful, continue to calculate the next service. If failed, continue to backtrack to the previous service until all services are successfully calculated and resource allocated.

[0060] Through the above technical scheme, a fast and efficient topology resource recovery method in an automatic switched optical network or a software defined network is proposed. By modifying the storage and reading methods of the original topology resource data structure (such as a topology adjacency matrix or an adjacency table), when performing group service routing calculations, a very small storage cost is used to conveniently and efficiently perform recovery operations on the allocated (modified) resources. At the same time, a merge and sorting operation is provided to solidify the successfully modified resources into the topology storage structure.

[0061] Figure 7 This is a structural block diagram of a topology resource recovery system provided by an embodiment of this specification, referring to Figure 7 As shown, the topology resource recovery system in the embodiment of this specification can be applied to the scenario of dialogue interaction between the path calculation module 10 and the topology resource module 20. Among them, the path calculation module 10 is shown to perform read and write operations on the topology resource module 20. In fact, the topology resource recovery system is not limited to including the above modules, and can also include other functional modules that assist in realizing the recovery of topology resources in the optical network, which will not be described one by one here.

[0062] <Path calculation module>

[0063] The path calculation module 10 is used to perform read and write operations on the topology resource module 20 .

[0064] Reference Figure 8 As shown, the path calculation module 10 may include at least one or a combination of the following units: a modification unit 11, a reading unit 12, and a backtracking unit 13; wherein,

[0065] The modification unit 11 is used to modify the original topology resources in the topology resource module 20. For example, each time a modification is required on the original topology resources, the modification is used as a new storage layer and is superimposed on the original layer. The new storage layer only needs to allocate space to store the modified part, and the unmodified part provides direct transparent access to the lower layer topology resource interface. Afterwards, each modification generates a new storage layer and is superimposed on the previous storage layer.

[0066] The reading unit 12 is used to read the information of the topological resources in the topological resource module 20. For example, when it is necessary to read the topological resource information, the topological resource information is read through the interface provided by the topological resource of the top layer. For the part not stored in the top layer, the corresponding information of the next layer is transparently read. If the next layer is not stored either, the next layer is transparently read until the information is read. The topological resource information read at this time is the topological resource information after the last modification.

[0067] The backtracking unit 13 is used to backtrack the topological resources and restore the topological resources modified by the previous service. For example, when the topological resources need to be backtracked to restore the previous topology, if it is necessary to backtrack one step, the top n-1 layer topological resources are simply discarded to make the n-1 layer the topmost layer; if it is necessary to backtrack m steps, the top m-layer topological resources are discarded to make the nm-th layer the topmost layer.

[0068] Through these units included in the path calculation module, paths can be calculated and resources can be allocated to a group of multiple services at the same time under some specific demand conditions for optical network path calculation.

[0069] <Topology resource module>

[0070] The topology resource module is used to store topology resources.

[0071] Reference Figure 8 As shown, the topology resource module 20 may include at least one or a combination of the following units: a storage unit 21, a merging unit 22; wherein.

[0072] The storage unit 21 is used to store topological resources in layers. For example, when storing topological resources, the storage is performed according to the idea of ​​layered storage, and the original topological resources are stored separately as a storage layer.

[0073] The merging unit 22 is used to merge topological resources. For example, when the service path is calculated and no backtracking resources are needed, the topological resource information of the upper layer is merged and modified in turn to the lower layer, and finally merged into one layer.

[0074] Through the above technical solution, the storage and reading methods of the original topological resource data structure (such as the topological adjacency matrix or adjacency table) are modified. When performing group business routing calculations, the allocated (modified) resources can be easily and efficiently restored with extremely low storage costs. At the same time, merging and sorting operations are provided to solidify the successfully modified resources into the topological storage structure.

[0075] It should be understood that in the embodiments of this specification, based on a hierarchical storage and reading method of topological resources, the original topological resources are stored as a read-only layer. Any modification to the original topological resources will superimpose a layer of modification on the read-only layer. This layer only stores the modified part, and the unmodified part provides a transparent reading method for the next read-only layer. This is continuously superimposed. When the topological resources need to be restored to a certain state, it is only necessary to discard all storage layers above the storage layer corresponding to a certain state. After the calculation of the path is completed, all storage layers are merged once, and only one layer of modified topological resource state is retained. This method is simple and reliable, easy to implement, easy to maintain, and extremely time and space efficient.

[0076] It should be noted that the present invention can be applied to SDOTN software-defined optical networks, SDN software-defined networks, ASON automatic switching optical networks, and can also be applied to all scenarios based on topology and centralized routing, such as map GIS, satellite navigation and other fields.

[0077] Fig. 9 This is a schematic diagram of the structure of an electronic device according to an embodiment of this specification. Fig. 9 At the hardware level, the electronic device includes a processor, and optionally also includes an internal bus, a network interface, and a memory. The memory may include a memory, such as a high-speed random access memory (RAM), and may also include a non-volatile memory (non-volatile memory), such as at least one disk storage. Of course, the electronic device may also include hardware required for other services.

[0078] The processor, network interface and memory can be interconnected through an internal bus, which can be an ISA (Industry Standard Architecture) bus, a PCI (Peripheral Component Interconnect) bus or an EISA (Extended Industry Standard Architecture) bus. The bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Fig. 9Only one bidirectional arrow is used in the diagram, but this does not mean that there is only one bus or only one type of bus.

[0079] The memory is used to store the program. Specifically, the program may include a program code, and the program code includes a computer operation instruction. The memory may include a memory and a non-volatile memory, and provides instructions and data to the processor.

[0080] The processor reads the corresponding computer program from the non-volatile memory into the memory and then runs it, forming a shared resource access control device at the logical level. The processor executes the program stored in the memory and is specifically used to perform the following operations:

[0081] Prioritize the services according to preset rules and read out a service for path calculation;

[0082] If the service path calculation is successful, the topology resources are allocated and modified;

[0083] If the service path calculation fails, a backtracking operation is performed to restore the modified topology resources.

[0084] The method executed by the topological resource recovery system disclosed in the above-mentioned embodiment as shown in the figure of this specification can be applied to a processor or implemented by a processor. The processor may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method can be completed by an integrated logic circuit of hardware in the processor or an instruction in the form of software. The above-mentioned processor can be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it can also be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The various methods, steps and logic block diagrams disclosed in the embodiments of this specification can be implemented or executed. The general-purpose processor can be a microprocessor or the processor can also be any conventional processor, etc. The steps of the method disclosed in the embodiments of this specification can be directly embodied as a hardware decoding processor for execution, or a combination of hardware and software modules in the decoding processor for execution. The software module can be located in a storage medium mature in the art such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory, or an electrically erasable programmable memory, a register, etc. The storage medium is located in the memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware.

[0085] The electronic device can also execute the method in the accompanying drawings and realize the functions of the topology resource recovery system in the embodiment shown in the accompanying drawings, and the embodiments of this specification will not be described in detail here.

[0086] Of course, in addition to software implementation, the electronic device of the embodiments of this specification does not exclude other implementation methods, such as logic devices or a combination of software and hardware, etc., that is to say, the execution subject of the following processing flow is not limited to each logic unit, but can also be hardware or logic devices.

[0087] Through the above technical solution, the storage and reading methods of the original topological resource data structure (such as the topological adjacency matrix or adjacency table) are modified. When performing group business routing calculations, the allocated (modified) resources can be easily and efficiently restored with extremely low storage costs. At the same time, merging and sorting operations are provided to solidify the successfully modified resources into the topological storage structure.

[0088] The embodiments of this specification also provide a computer-readable storage medium, which stores one or more programs, and the one or more programs include instructions. When the instructions are executed by a portable electronic device including multiple application programs, the portable electronic device can execute the method of the embodiment shown in the accompanying drawings, and is specifically used to execute the following method:

[0089] Prioritize the services according to preset rules and read out a service for path calculation;

[0090] If the service path calculation is successful, the topology resources are allocated and modified;

[0091] If the service path calculation fails, a backtracking operation is performed to restore the modified topology resources.

[0092] Through the above technical solution, the storage and reading methods of the original topological resource data structure (such as the topological adjacency matrix or adjacency table) are modified. When performing group business routing calculations, the allocated (modified) resources can be easily and efficiently restored with extremely low storage costs. At the same time, merging and sorting operations are provided to solidify the successfully modified resources into the topological storage structure.

[0093] In short, the above description is only a preferred embodiment of this specification and is not intended to limit the protection scope of this specification. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of this specification shall be included in the protection scope of this specification.

[0094] The systems, devices, modules or units described in the above embodiments may be implemented by computer chips or entities, or by products with certain functions. A typical implementation device is a computer. Specifically, the computer may be, for example, a personal computer, a laptop computer, a cellular phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.

[0095] Computer readable media include permanent and non-permanent, removable and non-removable media that can be implemented by any method or technology to store information. Information can be computer readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computing device. As defined herein, computer readable media does not include temporary computer readable media (transitory media), such as modulated data signals and carrier waves.

[0096] It should also be noted that the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, commodity or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, commodity or device. In the absence of more restrictions, the elements defined by the sentence "comprises a ..." do not exclude the existence of other identical elements in the process, method, commodity or device including the elements.

[0097] Each embodiment in this specification is described in a progressive manner, and the same or similar parts between the embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the system embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment.

Claims

1. A method for recovering topological resources, characterized in that: The following steps are involved: Prioritize the services according to preset rules and read out a service for path calculation; If the service path calculation is successful, the topology resources are allocated and modified; If the service path calculation fails, a backtracking operation is performed to restore the modified topology resources; The method further comprises: storing the topology resources in layers, wherein the initial topology resources are stored separately as a storage layer; The reading out of a service to perform path calculation includes: reading topology resource information according to an interface provided by the topology resource of the top layer, transparently reading the corresponding information of the next layer for the part not stored in the top layer, until the topology resource information is read; The allocation and modification of topological resources include: allocating and modifying based on the initial topological resources, generating a new storage layer for each modification, superimposing on the initial storage layer, the new storage layer allocates space to store the modified part, and the unmodified part directly and transparently accesses the lower layer topological resources; The backtracking operation to restore the modified topology resources includes: determining whether the computing service is the first service, and if so, returning failure; otherwise, backtracking to the previous service resource.

2. The method for recovering topological resources according to claim 1, characterized in that: The steps of prioritizing the services according to preset rules and reading out a service for path calculation specifically include determining whether all services have been calculated, if not, sequentially taking out a service, calculating the next optimal path for the service, and determining whether the calculation of the next optimal path is successful.

3. The method for recovering topological resources according to claim 2, characterized in that: Further comprising: when all service paths are calculated, the upper layer topology resource information is merged and modified in turn to the lower layers to form one layer.

4. The method for recovering topological resources according to claim 1, characterized in that: The step of tracing back the previous business resource specifically includes: If you backtrack one step, the topological resources at the top level are discarded; If backtracking is m steps, the top m layers of topological resources are discarded.

5. A topology resource recovery system, characterized in that: It includes a path calculation module and a topology resource module, and the topology resource module includes a storage unit, wherein: The path calculation module is used to perform read and write operations on the topology resource module; The topology resource module is used to store topology resources; The storage unit is used to store topological resources, store the modified topological resources in layers, and save the original topological resources separately as a storage layer; The path calculation module specifically includes one or a combination of the following units: a modification unit, a reading unit, and a backtracking unit; wherein, The modification unit is used to modify the original topology resources in the topology resource module, and superimpose the modified resources as a new storage layer on the original layer, the new storage layer allocates space to store the modified parts, and the unmodified parts directly and transparently access the lower layer topology resources; The reading unit is used to read the topology resource information in the topology resource module, read the topology resource information from the topology resource interface of the top layer, and transparently read the corresponding information of the next layer for the part not stored in the top layer until the topology resource information is read; The backtracking unit is used to backtrack the topology resources, restore the topology resources modified by the previous service, and discard the topology resources of the corresponding layers according to the number of backtracking steps.

6. The topology resource recovery system according to claim 5, characterized in that: The topology resource module further includes: a merging unit; wherein, The merging unit is used to merge and modify the upper layer topology resource information to the lower layer in sequence to merge into one layer when the service path calculation is completed.

7. An electronic device comprising: processor; as well as A memory arranged to store computer executable instructions, wherein when the executable instructions are executed, the processor executes the steps of the method for recovering topological resources according to any one of claims 1 to 4.

8. A computer-readable storage medium storing one or more programs, which, when executed by an electronic device including a plurality of application programs, enable the electronic device to execute the steps of the topology resource recovery method according to any one of claims 1 to 4.

Images