YANG model tree improvement method and device, equipment and storage medium
By transforming the YANG model tree structure shared between processes and copy-on-write, the YANG model tree loading and replication bottleneck is solved, and the efficiency of ONU management and configuration is improved.
Patent Information
- Application Number
- CN202510730608.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-06-03
- Publication Date
- 2025-08-29
AI Technical Summary
In the prior art, the YANG model tree has loading bottlenecks and replication bottlenecks during ONU management and configuration, resulting in too long configuration and affecting the user experience.
By transforming the private run YANG model tree between processes, the shared run YANG model tree between processes and the private alternative YANG model tree between processes is realized, and the copy-on-write and differential content submission methods are adopted to avoid repeated loading of data between multiple processes and copying of the entire tree.
It greatly improves database loading performance, reduces configuration time, and improves ONU management and configuration efficiency.
Smart Images
Figure CN120560874A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of communication technology, and in particular to a YANG model tree improvement method, device, equipment and storage medium. Background Art
[0002] When managing and configuring ONUs (Optical Network Units), data from the YANG model database is required. Currently, the mainstream open-source YANG model database is the sysrepo version, which uses shared memory database plugins such as JSON, Redis, and Mongo to share data between multiple processes. However, this version suffers from two performance bottlenecks: 1. YANG model tree loading bottleneck. That is, each time a configuration operation is performed, the data in the shared memory DB plug-in needs to be parsed and loaded into the process's private memory YANG model tree item by item. 2. YANG model tree replication bottleneck. That is, since the ONU configuration cannot be modified directly in the running YANG model tree, it is necessary to copy the running YANG model tree to the backup YANG model tree and then make modifications based on the copied data. Therefore, to avoid incomplete ONU configuration modification and affecting the currently running services, the process-private running YANG model tree and the backup YANG model tree need to traverse the entire tree when copying.
[0003] The existence of these two performance bottlenecks means that the larger the ONU scale, the longer it takes to manage and configure the ONU. As a result, in a scenario with 1,000 authorized ONUs, the time required to configure a single ONU is close to minutes, which greatly affects the user experience in the configuration scenario. Summary of the Invention
[0004] The present invention provides a YANG model tree improvement method, device, equipment and storage medium, which can solve the technical problem in the prior art that it takes a long time to manage and configure an ONU by calling data from a YANG model database.
[0005] To achieve the above object, the present invention provides the following technical solutions: In a first aspect, an embodiment of the present invention provides a YANG model tree improvement method, the method comprising: The private running YANG model tree between processes is transformed to obtain the running YANG model tree shared between processes and the private alternative YANG model tree between processes; Upon receiving a data modification instruction for executing the YANG model tree, executing the data modification instruction based on the inter-process private candidate YANG model tree to obtain a modified inter-process private candidate YANG model tree; Get the difference between the private alternative YANG model tree before and after modification between processes; When a differential submission instruction is received, the differential content is written into the running YANG model tree shared between processes.
[0006] In a second aspect, an embodiment of the present invention provides a YANG model tree improvement device, the device comprising: An address mapping module is configured to transform the inter-process private running YANG model tree to obtain the inter-process shared running YANG model tree and the inter-process private alternative YANG model tree; A first data modification module is configured to, upon receiving a data modification instruction for executing a YANG model tree, execute the data modification instruction based on the inter-process private candidate YANG model tree to obtain a modified inter-process private candidate YANG model tree; The differential data acquisition module is configured to obtain the differential content before and after the modification of the private candidate YANG model tree between processes; The second data modification module is configured to write the differential content into the running YANG model tree shared between processes after receiving the differential submission instruction.
[0007] In a third aspect, an embodiment of the present invention further provides an electronic device, comprising: a memory and a processor; the processor is configured to read and execute a computer program stored in the memory to implement the steps of the aforementioned YANG model tree improvement method.
[0008] In a fourth aspect, an embodiment of the present invention further provides a computer storage medium, wherein the computer storage medium stores computer executable instructions, and when the computer executable instructions are executed, the steps of the aforementioned YANG model tree improvement method are implemented.
[0009] The beneficial effects brought about by the technical solution provided by the embodiment of the present invention include: On the one hand, the inter-process private running YANG model tree is transformed into an inter-process shared running YANG model tree. Data is directly shared between multiple processes, eliminating the need for copying and loading from a database plug-in, greatly improving database loading performance. On the other hand, the inter-process private alternative YANG model tree utilizes copy-on-write and differential content commit features to achieve lightweight replication of physical pages compared to full tree replication. This invention eliminates the need to parse and load data from a shared memory database plug-in item by item into a process-private in-memory YANG model tree, nor does it require traversing the entire inter-process private running YANG model tree and the inter-process private alternative YANG model tree for replication. This solves the bottlenecks in YANG model tree loading and replication in the prior art. BRIEF DESCRIPTION OF THE DRAWINGS
[0010] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.
[0011] Figure 1 This is a flow chart of an embodiment of a YANG model tree improvement method according to the present invention; Figure 2 This is a diagram of the existing YANG model tree structure; Figure 3 Schematic diagram of the YANG model tree structure of the present invention; Figure 4 Schematic diagram of the storage structure of the running YANG model tree shared between processes of the present invention; Figure 5 Schematic diagram of the copy-on-write flow of the alternative YANG model tree privately owned between processes of the present invention; Figure 6 Schematic diagram of the process of submitting the private alternative YANG model tree difference between processes of the present invention; Figure 7 This is a schematic diagram of the functional modules of an embodiment of a YANG model tree improvement device of the present invention; Figure 8 The figure is a schematic structural diagram of an electronic device according to an embodiment of the present invention. DETAILED DESCRIPTION
[0012] The following will clearly and completely describe the technical solutions in the embodiments of the present invention in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of the present invention.
[0013] To make the objectives, technical solutions and advantages of the present invention more clear, embodiments of the present invention will be described in detail below with reference to the accompanying drawings.
[0014] In a first aspect, an embodiment of the present invention provides a YANG model tree improvement method.
[0015] In one embodiment, referring to Figure 1 , Figure 1 This is a flow chart of an embodiment of the YANG model tree improvement method of the present invention. Figure 1 As shown in the figure, the YANG model tree improvement methods include: Step S10, transforming the inter-process private running YANG model tree to obtain the inter-process shared running YANG model tree and the inter-process private candidate YANG model tree; In this embodiment, the private running YANG model tree of a process is transformed into a running YANG model tree shared between processes, without the need for a database plug-in (e.g. Figure 2 By copying and loading the data in the YANG model tree between multiple processes, the data in the YANG model tree can be shared among multiple processes. This solves the loading performance bottleneck of the existing technology that requires data in the shared memory db plug-in to be parsed and loaded item by item into the process's private running YANG model tree in order to share data among multiple processes.
[0016] The running YANG model tree shared between processes is mapped into a private alternative YANG model tree between processes. The private alternative YANG model tree between processes is linked to the running YANG model tree shared between processes through a copy-on-write mechanism, eliminating the need to traverse the entire tree for replication, thus solving the YANG model tree replication bottleneck.
[0017] It should be noted that the memory space structure of the modified inter-process private alternative YANG model tree and the inter-process shared running YANG model tree is the same. The memory space structure of the inter-process private running YANG model tree and the inter-process private alternative YANG model tree before the modification is consistent in the YANG model part, except that the context is added.
[0018] Reference Figure 2 , Figure 2 This is a diagram of the existing YANG model tree structure. Figure 2 The inter-process communication sharing (IP share) includes multiple plug-ins, including ds_json, a JSON plug-in based on shared memory files; ds_redis, a plug-in based on the open source in-memory database Redis; and ds_mongo, a plug-in based on the open source distributed database Mongo. Processes include libyang, an open source library for processing and managing YANG model data. Netopeer2 is an independent NETCONF agent process; HSWA is the control process for the OLT master control board. The NETCONF agent process Netopeer2 and the OLT master control process HSWA share YANG model tree data through a shared memory database plug-in. The running YANG model tree in the YANG model tree refers to the YANG model currently running on the device, while the alternative YANG model tree is a candidate for data modification. This prevents incomplete data modifications from impacting ongoing services. Before data is modified, a copy of the running YANG model tree is created as the alternative YANG model tree. The modified data is then applied to the alternative YANG model tree. After the modification is complete, the modified data in the alternative YANG model tree is submitted to the running YANG model tree for validation, achieving a one-time submission of all modified data.
[0019] Step S20, upon receiving a data modification instruction for running the YANG model tree, executing the data modification instruction based on the inter-process private candidate YANG model tree to obtain a modified inter-process private candidate YANG model tree; In this embodiment, refer to Figure 3 , Figure 3 Schematic diagram of the YANG model tree structure of the present invention. Figure 3 The ds_yang plugin is a shared memory database plugin for sharing YANG model data, supporting copy-on-write. libyang is an open-source library for processing and managing YANG model repositories. libsysrepo is an open-source YANG model database encapsulated based on Libyang. Netopeer2 is an open-source NETCONF handler. HSWA is the YANG model service validation process.
[0020] Transform the process-private running YANG model tree into a running YANG model tree shared between processes, corresponding to Figure 3 The inter-process YANG tree enables data to be shared directly between multiple processes without the need to copy and load from the database plug-in, thus resolving the performance bottleneck of database loading.
[0021] An alternative YANG model tree private between processes, corresponding to Figure 3The alternative YANG model tree supports copy-on-write capabilities. The alternative YANG model tree private to processes supports copy-on-write functionality. That is, upon receiving a data modification instruction for the running YANG model tree, before the data in the alternative YANG model tree is modified, the physical memory page where the modified data is located is copied, and then the data modification instruction is executed to obtain the modified alternative YANG model tree private to the processes. Compared to copying the entire tree, copying only the physical memory page where the modified data is located has a lower performance overhead. This enables lightweight copying from the running YANG model tree to the alternative YANG model tree, solving the problem in existing technologies of traversing the entire tree for copying, resulting in a long time-consuming configuration of an ONU. The YANG model tree copy bottleneck is particularly prominent when calling data in the YANG model database to manage and configure batches of ONUs (Optical Network Units).
[0022] Step S30, obtaining the difference between the private candidate YANG model tree before and after modification between processes; In this embodiment, continue to refer to Figure 3 The alternative YANG model tree supports differential submission. That is, after the modification of the private alternative YANG model tree between processes is completed, the differential content before and after the modification of the private alternative YANG model tree between processes is obtained, that is, the differential content before and after the modification of the physical memory page where the modified data is located is obtained, so that the differential content can be submitted to the running YANG model tree shared between processes to take effect.
[0023] Step S40: After receiving the difference submission instruction, the difference content is written into the running YANG model tree shared between processes.
[0024] In this embodiment, continue to refer to Figure 3 The data in the inter-process private candidate YANG model tree includes running data and modified data. The Page (for example, 4K) corresponding to the changed column is the physical memory page where the modified data is located. Running indicates that the data has not been modified. The Candidate obtained by combining the Page corresponding to the changed column with Running is the data in the inter-process private candidate YANG model tree.
[0025] After receiving the differential commit instruction, the inter-process private alternative YANG model tree writes the differential content before and after the modification of the inter-process private alternative YANG model tree into the inter-process shared running YANG model tree. Therefore, when managing and configuring the ONU (Optical Network Unit), the data in the YANG model database can be directly called. There is no need to parse the data in the shared memory DB plug-in item by item and load it into the process-private memory YANG model tree, nor is there any need to traverse the entire inter-process private running YANG model tree and the inter-process private alternative YANG model tree to copy. This solves the bottlenecks of YANG model tree loading and YANG model tree copying in the existing technology.
[0026] The inter-process private running YANG model tree is modified to obtain the inter-process shared running YANG model tree and the inter-process private alternative YANG model tree; upon receiving a data modification instruction for the running YANG model tree, the data modification instruction is executed based on the inter-process private alternative YANG model tree to obtain a modified inter-process private alternative YANG model tree; the difference between the inter-process private alternative YANG model tree before and after the modification is obtained; and upon receiving a difference commit instruction, the difference is written into the inter-process shared running YANG model tree.
[0027] This embodiment transforms the inter-process private running YANG model tree into a shared running YANG model tree. Data is directly shared between multiple processes, eliminating the need for copying and loading from the database plugin, significantly improving database loading performance. Furthermore, the copy-on-write and differential content commit features of the inter-process private alternative YANG model tree enable lightweight physical page replication compared to full tree replication. This embodiment eliminates the need to parse and load data from the shared memory database plugin item by item into the process-private in-memory YANG model tree, nor does it require traversing the entire inter-process private running YANG model tree and the inter-process private alternative YANG model tree for replication. This resolves the bottlenecks in YANG model tree loading and replication in the prior art.
[0028] Optionally, in one embodiment, step S10 includes: Based on the first fixed address allocated by the mmap segment of the Linux process space, the private running YANG model tree between processes is mapped to obtain the running YANG model tree shared between processes; Based on the second fixed address allocated by the mmap segment of the Linux process space, the running YANG model tree shared between processes is mapped to obtain the alternative YANG model tree private to the processes.
[0029] In this embodiment, due to address isolation using process virtual memory technology, the same physical address is typically mapped to different addresses in different processes. Because the shared YANG model tree storage structure stores YANG model node pointer addresses, mmap is required to allocate fixed addresses so that processes can reserve fixed address space for the shared YANG model storage structure. Without fixed address allocation, for example, 16MB of space is preallocated starting at 0x58900000. The physical address of the shared YANG model stored at 0x58900004 is mapped to virtual address 0x69000012 in process A and to virtual address 0x79000012 in process B. The data accessed through virtual addresses in processes A and B is not the shared data at physical address 0x58900004. After enabling fixed address allocation, the physical address 0x58900004 stored in the shared YANG model tree is mapped to the virtual address 0x58900004 in process A and process B. In this way, shared data access can be achieved through the virtual address 0x58900004 in process A and process B.
[0030] Reference Figure 4 , Figure 4 The arrows in the middle indicate spatial inclusion relationships, including the following: The memory space of the YANG model tree shared between processes is determined based on the first fixed address allocated by the mmap segment (Memory Mapping Segment) of the Linux process space. That is, the private running YANG model tree between processes is mapped to the memory space corresponding to the first fixed address allocated by the mmap segment of the Linux process space, thereby obtaining the running YANG model tree shared between processes.
[0031] The memory space of the inter-process private candidate YANG model tree is determined based on the second fixed address allocated by the mmap segment (Memory Mapping Segment) of the Linux process space. That is, the running YANG model tree shared by the inter-processes is mapped to the memory space corresponding to the second fixed address allocated by the mmap segment of the Linux process space to obtain the inter-process private candidate YANG model tree.
[0032] Through the first fixed address and the second fixed address allocated by the mmap segment of the Linux process space, shared data access is achieved between the inter-process private running YANG model tree, the inter-process shared running YANG model tree and the inter-process private alternative YANG model tree.
[0033] Optionally, in one embodiment, the YANG model tree includes: a context and a memory pool; The context includes the starting address of the memory pool, the ending address of the memory pool, a flag indicating whether the memory pool is initialized, and a hash table.
[0034] In this embodiment, continue to refer to Figure 4 The memory space context of the running YANG model tree shared between processes includes two parts: context and memory pool.
[0035] The context consists of four parts: Pool Start, Pool End, isInit, and Yang Trees HashTable. Pool Start indicates the starting address of the memory pool, Pool End indicates the ending address of the memory pool, isInit indicates whether the memory pool is initialized, and Yang Trees Hash Table is a HASH fast lookup table used to quickly retrieve the address of the corresponding YANG model tree.
[0036] Among them, in the table entries of the HASH quick lookup table: Key is the keyword of the table entry, used for quick lookup of the table entry; Name represents the YANG model tree name, such as ietf-interfaces and ietf-hardware; Last modify time represents the latest modification time of the YANG model tree; Tree represents the YANG model tree address, such as ptr1, ptr2, ..., ptrn.
[0037] In the memory pool part, address space management is achieved by transforming the existing memory pool to support fixed address allocation, such as rpmalloc.
[0038] Furthermore, Figure 4 In the example, MemPool represents the modified memory pool. Before the modification, the address space of the memory pool was automatically allocated by the operating system. After the modification, the address space of the memory pool is a fixed address space specified by the application, such as the Poolstart address in the context. The Memory Mapping Segment is a memory-mapped segment. Contex and Mempool allocate space from the memory-mapped segment. Contex and Mempool are subordinate to the Memory Mapping Segment.
[0039] Kernel space is kernel space; Environments Variables are environment variables; Command-linearguments are command line parameters; Stack is a stack, which is a linear table with limited operations; Heap generally refers to heap memory, which is another memory area different from the stack area, global data area and code area; Bss Segment (BlockStarted by symbol) usually refers to a memory area used to store uninitialized global variables in the program; Data Segment is the area in the program memory used to store global variables and static variables. Its core function is to provide persistent data storage during program execution; Text Segment: Code segment, also known as text segment, is a memory space used to store instructions and run code.
[0040] Optionally, in one embodiment, executing the data modification instruction based on the inter-process private candidate YANG model tree to obtain a modified inter-process private candidate YANG model tree includes: querying a physical memory page of data corresponding to the data modification instruction in an alternative YANG model tree private between processes, and copying the physical memory page; Based on the copied physical memory page, the data modification instruction is executed to obtain a modified inter-process private alternative YANG model tree.
[0041] In this embodiment, refer to Figure 5 , the operating process, such as Netopeer2, links to the shared physical memory context in private mode through the second fixed address 0x58900000 allocated by mmap. By default, the 16M space starting from the address 0x58900000 of the operating process is directly mapped to the shared physical memory without copying any data. In this way, the loaded memory is a link to the shared physical memory, which saves the overhead of copying the shared running YANG model tree. At the same time, due to the private mode, when the operating process executes a data modification instruction to modify the alternative YANG model tree, the physical memory page where the data corresponding to the data modification instruction is located is copied to the new physical page, such as Figure 5 Based on the data modification instruction, the data in the copied physical memory page is modified and automatically replaced to obtain the modified inter-process private alternative YANG model tree, thereby realizing the write-time copy capability of the inter-process private alternative YANG model tree.
[0042] Optionally, in one embodiment, the candidate YANG model tree includes a parent process, a global data pool, and a child process, and writing the differential content into a running YANG model tree shared between processes includes: Writing the differential content into the global data pool through the parent process; The differential content in the global data pool is obtained through the child process, and the differential content is written into the inter-process shared running YANG model tree corresponding to the second fixed address.
[0043] In this embodiment, refer to Figure 6 ,The alternative YANG model tree includes the parent process, the global data pool, and the child processes. Figure 6 In the figure, the arrows indicate the timing relationship.
[0044] Regarding writing the differential content into the running YANG model tree shared between processes, specifically, the parent process (Parent-Process) writes the differential content into the global data pool (DiffYang Data) shared by the parent and child processes of the alternative YANG model tree, and starts the child process. Then, the child process obtains the differential content in the global data pool, and then links the running YANG model tree shared between processes in shared mode through the second fixed address 0x58900000 allocated by mmap, thereby writing the differential content into the running YANG model tree shared between processes and completing the submission of the differential content.
[0045] In a second aspect, an embodiment of the present invention further provides a YANG model tree improvement device.
[0046] In one embodiment, referring to Figure 7 , Figure 7 This is a functional module diagram of an embodiment of the YANG model tree improvement device of the present invention. Figure 7 As shown, the YANG model tree improvement device includes: The address mapping module 10 is configured to transform the inter-process private running YANG model tree to obtain the inter-process shared running YANG model tree and the inter-process private alternative YANG model tree; The first data modification module 20 is configured to, upon receiving a data modification instruction for executing a YANG model tree, execute the data modification instruction based on the inter-process private candidate YANG model tree to obtain a modified inter-process private candidate YANG model tree; The differential data acquisition module 30 is configured to obtain the differential content before and after the modification of the private candidate YANG model tree between processes; The second data modification module 40 is configured to write the difference content into the running YANG model tree shared between processes after receiving the difference submission instruction.
[0047] Optionally, in one embodiment, the address mapping module 10 is specifically configured to: Based on the first fixed address allocated by the mmap segment of the Linux process space, the private running YANG model tree between processes is mapped to obtain the running YANG model tree shared between processes; Based on the second fixed address allocated by the mmap segment of the Linux process space, the running YANG model tree shared between processes is mapped to obtain the alternative YANG model tree private to the processes.
[0048] Optionally, in one embodiment, the YANG model tree includes: a context and a memory pool; The context includes the starting address of the memory pool, the ending address of the memory pool, a flag indicating whether the memory pool is initialized, and a hash table.
[0049] Optionally, in one embodiment, the hash table includes a table entry keyword, a YANG model tree name, a latest modification time of the YANG model tree, and a YANG model tree address.
[0050] Optionally, in one embodiment, the second data modification module 40 is configured to: Writing the differential content into the global data pool through the parent process; The differential content in the global data pool is obtained through the child process, and the differential content is written into the inter-process shared running YANG model tree corresponding to the second fixed address.
[0051] Optionally, in one embodiment, the first data modification module 20 is specifically configured to: querying a physical memory page of data corresponding to the data modification instruction in an alternative YANG model tree private between processes, and copying the physical memory page; Based on the copied physical memory page, the data modification instruction is executed to obtain a modified inter-process private alternative YANG model tree.
[0052] The functional implementation of each module in the above-mentioned YANG model tree improvement device corresponds to each step in the above-mentioned YANG model tree improvement method embodiment, and their functions and implementation processes are not repeated here one by one.
[0053] In a third aspect, an embodiment of the present invention further provides an electronic device, the structure of which is as follows: Figure 8 As shown, it includes: a memory and a processor, wherein the processor is used to read and execute the computer program stored in the memory to implement the aforementioned YANG model tree improvement method.
[0054] In a fourth aspect, an embodiment of the present invention further provides a computer-readable storage medium, wherein the computer-readable storage medium stores computer-executable instructions, and when the computer-executable instructions are executed, the aforementioned YANG model tree improvement method is implemented.
[0055] Finally, it should be noted that some of the processes described in the embodiments of the present invention include multiple operations or steps that appear in a specific order. However, it should be understood that these operations or steps may not be executed in the order in which they appear in the embodiments of the present invention, or may be executed in parallel. The sequence numbers of the operations are only used to distinguish different operations and do not represent any order of execution. In addition, these processes may include more or fewer operations, and these operations or steps may be executed sequentially or in parallel, and these operations or steps may be combined.
[0056] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art can still modify the technical solutions described in the aforementioned embodiments or replace some of the technical features therein with equivalents. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principles of the present invention should be included in the scope of protection of the present invention.
Claims
1. A YANG model tree improvement method, characterized in that: The method comprises: The private running YANG model tree between processes is transformed to obtain the running YANG model tree shared between processes and the private alternative YANG model tree between processes; Upon receiving a data modification instruction for executing the YANG model tree, executing the data modification instruction based on the inter-process private candidate YANG model tree to obtain a modified inter-process private candidate YANG model tree; Get the difference between the private alternative YANG model tree before and after modification between processes; When a differential submission instruction is received, the differential content is written into the running YANG model tree shared between processes.
2. The YANG model tree improvement method according to claim 1, characterized in that: The step of transforming the inter-process private running YANG model tree to obtain the inter-process shared running YANG model tree and the inter-process private alternative YANG model tree includes: Based on the first fixed address allocated by the mmap segment of the Linux process space, the private running YANG model tree between processes is mapped to obtain the running YANG model tree shared between processes; Based on the second fixed address allocated by the mmap segment of the Linux process space, the running YANG model tree shared between processes is mapped to obtain the alternative YANG model tree private to the processes.
3. The YANG model tree improvement method according to claim 1 or 2, characterized in that: The YANG model tree includes: context and memory pool; The context includes the starting address of the memory pool, the ending address of the memory pool, a flag indicating whether the memory pool is initialized, and a hash table.
4. The YANG model tree improvement method according to claim 3, characterized in that: The hash table includes a table entry keyword, a YANG model tree name, a latest modification time of the YANG model tree, and a YANG model tree address.
5. The YANG model tree improvement method according to claim 2, characterized in that: The candidate YANG model tree includes a parent process, a global data pool, and a child process, and writing the differential content into a running YANG model tree shared between processes includes: Writing the differential content into the global data pool through the parent process; The differential content in the global data pool is obtained through the child process, and the differential content is written into the inter-process shared running YANG model tree corresponding to the second fixed address.
6. The YANG model tree improvement method according to claim 1, characterized in that: The step of executing the data modification instruction based on the inter-process private candidate YANG model tree to obtain a modified inter-process private candidate YANG model tree includes: querying a physical memory page of data corresponding to the data modification instruction in an alternative YANG model tree private between processes, and copying the physical memory page; Based on the copied physical memory page, the data modification instruction is executed to obtain a modified inter-process private alternative YANG model tree.
7. A YANG model tree improvement device, characterized in that: The device comprises: An address mapping module is configured to transform the inter-process private running YANG model tree to obtain the inter-process shared running YANG model tree and the inter-process private alternative YANG model tree; A first data modification module is configured to, upon receiving a data modification instruction for executing a YANG model tree, execute the data modification instruction based on the inter-process private candidate YANG model tree to obtain a modified inter-process private candidate YANG model tree; The differential data acquisition module is configured to obtain the differential content before and after the modification of the private candidate YANG model tree between processes; The second data modification module is configured to write the differential content into the running YANG model tree shared between processes after receiving the differential submission instruction.
8. The YANG model tree improvement device according to claim 7, characterized in that: The address mapping module is specifically configured to: Based on the first fixed address allocated by the mmap segment of the Linux process space, the private running YANG model tree between processes is mapped to obtain the running YANG model tree shared between processes; Based on the second fixed address allocated by the mmap segment of the Linux process space, the running YANG model tree shared between processes is mapped to obtain the alternative YANG model tree private to the processes.
9. An electronic device, characterized in that: include: memory and processor; The processor is configured to read and execute the computer program stored in the memory to implement the steps of the YANG model tree improvement method according to any one of claims 1 to 6.
10. A computer-readable storage medium, characterized in that The computer-readable storage medium stores computer-executable instructions, and when the computer-executable instructions are executed, the steps of the YANG model tree improvement method according to any one of claims 1 to 6 are implemented.