Southbound resource management method and device, computer equipment, readable storage medium and program product
By managing southbound resources using a big-top-heap data structure, the problem of inaccurate resource forwarding in cloud networks is solved, achieving accurate and orderly resource management and improving the accuracy and timeliness of resource acquisition.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-12-05
- Publication Date
- 2026-03-13
AI Technical Summary
In the southbound resource management of cloud networks, there is a problem of inaccurate resource forwarding, and existing technologies cannot guarantee the accuracy and orderliness of resources.
A max-heap data structure is used to manage southbound resources. Resource configuration nodes are identified by resource tags, and southbound resources are added, sorted, and deleted in the max-heap to ensure the accuracy and orderliness of resources.
It has enabled accurate and orderly management of southbound resources, ensuring that resources are distributed to the forwarding surface in the correct order, and improving the accuracy and timeliness of resource acquisition.
Smart Images
Figure CN121664641A_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of computer technology, and in particular to a southbound resource management method, apparatus, computer equipment, computer-readable storage medium, and computer program product. Background Technology
[0002] As a crucial component of cloud computing infrastructure, cloud networks are experiencing increasingly complex forwarding plane configuration management. In cloud network architectures, the forwarding plane is typically configured by the southbound controller to enable flexible scheduling and efficient management of network resources.
[0003] In related technologies, cloud network southbound controllers typically use graph data structures to maintain the correspondence between southbound resources and the forwarding plane, maintaining forwarding plane resources as nodes in the graph and resource relationships as edges. This approach can effectively handle dependencies between resources and ensure that resources are delivered to the forwarding plane in the correct dependency order.
[0004] However, the methods used in related technologies can easily lead to inaccuracies in the forwarding of southbound resources. Summary of the Invention
[0005] Therefore, it is necessary to provide a method, apparatus, computer equipment, computer-readable storage medium, and computer program product that can accurately manage southbound resources in order to address the above-mentioned technical problems.
[0006] Firstly, this application provides a southbound resource management method, including:
[0007] Obtain the southbound resources to be processed, and obtain the first forwarding plane label corresponding to the southbound resources to be processed;
[0008] The resource configuration node is determined based on the first forwarding plane label, and the corresponding max-heap is obtained.
[0009] When the max heap contains resource tags for southbound resources to be processed, the southbound resources to be processed are added to the max heap.
[0010] In one embodiment, adding a southbound resource to be processed to a max heap includes: determining the location information of the southbound resource to be processed in the max heap based on the resource tag of the southbound resource to be processed, and adding the southbound resource to be processed to the location information.
[0011] In one embodiment, after the southbound resources to be processed are added to the location information, the southbound resource management method includes: obtaining the timestamps of each southbound resource in the top heap, and sorting the southbound resources in the top heap according to the order of the timestamps.
[0012] In an optional embodiment, after determining the resource configuration node based on the first forwarding plane label and obtaining the top heap corresponding to the resource configuration node, the southbound resource management method includes: when the top heap does not contain the resource label of the southbound resource to be processed, adding the southbound resource to be processed as top-level data to the top heap; obtaining the time label of each southbound resource in the top heap, and sorting each southbound data in the top heap according to the order of the time labels.
[0013] In an exemplary embodiment, after adding the southbound resource to be processed to the max heap, the southbound resource management method includes: obtaining a southbound resource deletion instruction, the southbound resource deletion instruction including a southbound resource label to be deleted and a second forwarding plane label; when the max heap includes the second forwarding plane label, deleting the southbound resource to be deleted from the max heap according to the resource label of the southbound resource to be deleted.
[0014] In one embodiment, deleting a southbound resource from a max-heap based on its resource tag includes: determining a target southbound resource included in the max-heap based on its resource tag; setting the time tag corresponding to the target southbound resource to a preset target value so that when the target southbound resource is sorted using the time tag of the preset target value, the target southbound resource is at the bottom of the max-heap; and deleting the target southbound resource at the bottom.
[0015] In one embodiment, the southbound resource management method further includes: when there are no southbound resources in the max-heap corresponding to the resource configuration node, the resource configuration node is deleted from the resource configuration structure tree.
[0016] In one embodiment, after deleting the bottom-most target southbound resource, the southbound resource management method includes: obtaining the remaining southbound resources in the max-heap after deleting the target southbound resource, and obtaining the timestamps of the remaining southbound resources; and reordering the remaining southbound resources according to the timestamps of the remaining southbound resources.
[0017] In one embodiment, the southbound resource management method further includes: determining the associated resource list corresponding to the resource configuration node; when there are existing southbound resources in the resource configuration node, including the associated resource list, the existing southbound resources are sent to the forwarding plane.
[0018] In an optional embodiment, after determining the associated resource list corresponding to the resource configuration node, the southbound resource management method further includes: when the existing southbound resources in the resource configuration node do not include the associated resource list, the existing southbound resources are set to a suspended state until the existing southbound resources in the resource configuration node include the associated resource list, at which point the corresponding existing southbound resources are set from the suspended state to a forwardable state.
[0019] In one embodiment, the resource tag includes a forwarding plane tag, a network resource type tag, and a network resource instance tag.
[0020] Secondly, this application also provides a southbound resource management device, comprising:
[0021] The first acquisition module is used to acquire the southbound resources to be processed and to acquire the first forwarding plane label corresponding to the southbound resources to be processed.
[0022] The max-heap acquisition module is used to determine the resource configuration node based on the first forwarding plane label and to acquire the max-heap corresponding to the resource configuration node.
[0023] The resource addition module is used to add the southbound resource to be processed to the max heap when the max heap contains a resource tag for the southbound resource to be processed.
[0024] Thirdly, this application also provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the steps of the above-described method embodiments.
[0025] Fourthly, this application also provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the above-described method embodiments.
[0026] Fifthly, this application also provides a computer program product, including a computer program that, when executed by a processor, implements the steps of the above-described method embodiments.
[0027] The aforementioned southbound resource management method, apparatus, computer equipment, computer-readable storage medium, and computer program product determine resource configuration nodes based on forwarding plane tags, obtain the top heap corresponding to the resource configuration nodes, and add the southbound resources to the top heap when the top heap includes resource tags of southbound resources to be processed. By using the top heap to manage southbound resources, the orderliness of southbound resources can be guaranteed, thereby ensuring the accuracy of southbound resource acquisition. Attached Figure Description
[0028] To more clearly illustrate the technical solutions in the embodiments of this application or related technologies, the drawings used in the description of the embodiments of this application or related technologies will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other related drawings can be obtained based on these drawings without creative effort.
[0029] Figure 1 This is a flowchart illustrating a southbound resource management method in one embodiment;
[0030] Figure 2 This is a schematic diagram of a top-heap in one embodiment;
[0031] Figure 3 This is a schematic diagram of a large top heap in another embodiment;
[0032] Figure 4 This is a schematic diagram of a large top heap in another embodiment;
[0033] Figure 5 This is a schematic diagram of a large top heap in yet another embodiment;
[0034] Figure 6 A schematic diagram of a large top heap in another embodiment;
[0035] Figure 7 This is a schematic diagram of a large top heap in yet another embodiment;
[0036] Figure 8 This is a schematic diagram of a large top heap in yet another embodiment;
[0037] Figure 9 This is a flowchart illustrating the southbound resource management method in another embodiment;
[0038] Figure 10 This is a flowchart illustrating the southbound resource management method in another embodiment;
[0039] Figure 11 This is a structural block diagram of a southbound resource management device in one embodiment;
[0040] Figure 12 This is an internal structural diagram of a computer device in one embodiment. Detailed Implementation
[0041] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the scope of this application.
[0042] In one embodiment, such as Figure 1 As shown, a southbound resource management method is provided. This embodiment illustrates the method by applying it to a server. It is understood that this method can also be applied to terminals, and further to systems including terminals and servers, and is implemented through interaction between the terminal and the server. In this embodiment, the method includes the following steps:
[0043] Step 102: Obtain the southbound resources to be processed and obtain the first forwarding plane label corresponding to the southbound resources to be processed.
[0044] Southbound resources are used to characterize the data structure for sending resource data to the forwarding plane. Optionally, the southbound controller includes southbound resources.
[0045] The southbound controller is a type of network management software used in SDN (Software-Defined Networking) networks to configure, monitor, and schedule traffic on the forwarding plane.
[0046] The forwarding plane is used to characterize the components in an SDN network that are responsible for packet processing and forwarding.
[0047] In one embodiment, southbound resources can be derived from northbound resources.
[0048] Among them, Northbound Resources are used to represent a set of upper-layer resources that can be invoked by the Northbound Interface (NBI).
[0049] In one embodiment, the southbound resource includes a resource tag. The resource tag is used to uniquely identify the southbound resource.
[0050] Optionally, resource tags include forwarding plane tags, network resource type tags, and network resource instance tags.
[0051] The forwarding plane label is used to uniquely identify the forwarding plane.
[0052] The network resource type tag is used to identify the product type of a network product. Adding a network resource instance tag to the resource tag distinguishes different types of network resources, reducing interference from southbound resources during network resource conversion when network resources of different product types correspond to the same southbound resource, and preventing data anomalies caused by abnormal deletion or modification of forwarding plane resources.
[0053] The network resource instance tag is used to identify instances of network products. Adding a network resource instance tag to the resource tag can distinguish different instances, reduce interference from southbound resources during network resource conversion when different network resource instances correspond to the same southbound resource, and prevent data anomalies caused by abnormal deletion or modification of forwarding plane resources.
[0054] In one embodiment, after obtaining the southbound resource to be processed, the forwarding plane label can be obtained from the resource label of the southbound resource to be processed.
[0055] Step 104: Determine the resource configuration node based on the first forwarding plane label, and obtain the max heap corresponding to the resource configuration node.
[0056] In one embodiment, a resource configuration structure tree can be used to display network resource configurations.
[0057] Optionally, network resource configuration may include, but is not limited to, the correspondence between southbound resources and the forwarding plane, and the association between southbound resources.
[0058] In one embodiment, the resource configuration structure tree includes multiple resource configuration nodes.
[0059] In an alternative embodiment, a resource configuration node can characterize a forwarding plane. For example, forwarding plane labels can be used to identify different resource configuration nodes.
[0060] In one embodiment, after obtaining the first forwarding plane label, the resource configuration tree is traversed using the first forwarding plane label to determine the resource configuration node.
[0061] For example, the first forwarding plane label is matched with the forwarding plane label corresponding to the resource configuration node. If the match is successful, the resource configuration node that is successfully matched is the target resource configuration node.
[0062] Among them, the large top stack is used to realize southbound resource storage.
[0063] In one embodiment, a max-heap is configured in relation to a forwarding face.
[0064] In an alternative embodiment, the resource labels of the big top heap and the southbound resources are configured to correspond.
[0065] Optionally, after determining the resource configuration node using the first forwarding plane label and obtaining the max heap corresponding to the resource configuration node, the resource label of the southbound resource to be processed can be used to determine whether there is a max heap corresponding to the label of the southbound resource to be processed.
[0066] Step 106: When the max heap contains a resource tag for a southbound resource to be processed, add the southbound resource to be processed to the max heap.
[0067] In one embodiment, the resource label of a southbound resource may further include label information for a northbound resource, wherein the northbound resource is network resource data that converts the resource into a southbound resource. It is understood that adding northbound resource label information to the resource label of a southbound resource can distinguish different sources of the southbound resource, thus differentiating different southbound resources.
[0068] In one embodiment, after determining the max heap, the max heap is traversed using the resource tags of the southbound resources to determine whether there is a target southbound resource in the max heap that matches the resource tag of the southbound resource.
[0069] Optionally, the resource tags of each southbound resource in the top heap are obtained, and the resource tags of the southbound resource to be processed are matched with the resource tags of each southbound resource in the top heap. If the resource tags of the southbound resource to be processed match the resource tags of each southbound resource in the top heap, then the southbound resource in the top heap at the time of matching is identified as the target southbound resource.
[0070] Optionally, if the resource label of the southbound resource to be processed does not match the resource labels of each southbound resource in the max heap, then it is assumed that the southbound resource to be processed does not exist in the max heap.
[0071] In an optional embodiment, if the max heap includes resource tags for southbound resources to be processed, adding the southbound resources to the max heap may include: determining the location information of the southbound resources to be processed in the max heap based on the resource tags of the southbound resources to be processed, and adding the southbound resources to be processed to the location information.
[0072] For example, such as Figure 2 As shown, assuming that the resource tags of the southbound resources to be processed are used to determine the max-heap as follows: Figure 2 In the context of the resource-B heap, if the resource label of the southbound resource to be processed is rb-2, then this label rb-2 can be used to determine the corresponding target southbound resource with the resource label id=rb-2. For example... Figure 2 The second line in the text.
[0073] Optionally, after determining the target southbound resource, the label of the southbound resource to be processed can be filled into the second row. This can be done by directly replacing the data, or by moving the original data in the second row down or up by one row.
[0074] For example, if a sunken line method is used, it can be like this: Figure 3 As shown, Figure 3 The second row of the right-hand side of the graph represents the southbound resources to be processed, while the third row contains the original data from the second row.
[0075] For example, if a floating line method is used, it can be like this: Figure 4 As shown, Figure 4 In the right-hand diagram, the second row remains the original second row, while the third row contains southbound resources to be processed.
[0076] For example, if a direct replacement method is used, then as follows: Figure 5 As shown, Figure 5 The second row in the right-hand diagram shows southbound resources to be processed.
[0077] In an optional embodiment, to improve the orderliness of southbound resources so that the latest southbound resources can be forwarded when resources need to be forwarded to the forwarding plane, the southbound resources in the max heap can be sorted. For example, this may include: obtaining the timestamps of each southbound resource in the max heap and sorting the southbound resources in the max heap according to the order of the timestamps.
[0078] The timestamp is used to represent the time information of the southbound resource generation. For example, the timestamp can be a cookie field.
[0079] In one embodiment, the sorting step may include: obtaining the timestamps of each southbound resource in the max-heap, performing sorting processing on the timestamps of each southbound resource, so that the southbound resources in the max-heap are sorted in the max-heap according to the order of their timestamps.
[0080] In one optional embodiment, the sorting step may include: adding the southbound resource to be processed to the corresponding location information, obtaining the time tag of the southbound resource to be processed and the previous layer southbound resource, and if the time tag of the southbound resource to be processed is greater than or equal to the time tag of the previous layer southbound resource, then moving the southbound resource to be processed to the next layer, repeating the above steps until the time tag of the southbound resource to be processed is less than the time tag of the previous layer southbound resource.
[0081] For example, such as Figure 6 As shown in the left-hand diagram, the second row contains southbound resources to be processed, with a corresponding timestamp of Cookie=11. The timestamp for retrieving the southbound resource from the previous layer is Cookie10. Since Cookie=11 is greater than Cookie10, the second row needs to be moved up to the first row. Figure 6 As shown in the diagram on the right.
[0082] In one embodiment, if there is still a southbound resource in the previous layer after floating up, the time stamps between the southbound resource to be processed and the southbound resource in the previous layer are compared again. If the time stamp of the southbound resource to be processed is greater than or equal to the time stamp of the southbound resource in the previous layer, the floating continues until the time stamp of the southbound resource to be processed is less than the time stamp of the southbound resource in the previous layer, or the southbound resource to be processed has floated up to the top layer of the big top stack.
[0083] In one embodiment, if the time tag of the southbound resource to be processed is less than the time tag of the southbound resource in the previous layer when it is added to the location information, then the time tag of the southbound resource in the next layer is obtained. If the time tag of the southbound resource to be processed is less than the time tag of the southbound resource in the next layer, then the southbound resource to be processed is moved down one layer.
[0084] Optionally, after sinking one layer, the time tag of the next layer of southbound resources to be processed can be obtained. The time tag of the southbound resources to be processed is compared with the time tag of the next layer of southbound resources. If it is less than the time tag, the southbound resources continue to sink until the time tag of the southbound resources is greater than or equal to the time tag of the next layer of southbound resources, or the southbound resources have sunk to the bottom of the top stack.
[0085] In one embodiment, when the max heap does not include the resource tag of the southbound resource to be processed, the southbound resource to be processed can be added to the max heap as top-level data to achieve the addition of the southbound resource to be processed.
[0086] For example, such as Figure 7 As shown, the resource tag for the southbound resource to be processed can include rb-4. If, after traversing the max-heap using resource tags, it is determined that the southbound resource does not exist in the max-heap, it is added to the top layer of the max-heap, as shown below. Figure 7 The top-level data in the right-hand plot.
[0087] In one embodiment, after adding the southbound resources to be processed to the top layer of the max heap, the timestamps of each southbound resource in the max heap can be obtained, and the southbound data in the max heap can be sorted according to the order of the timestamps.
[0088] In one embodiment, the method for sorting the southbound data may include: obtaining the timestamps of each southbound resource in the max-heap, sorting the southbound resources according to the timestamps, so that the timestamps of the southbound resources in the max-heap are ordered in chronological order, and the latest southbound resource can be placed at the top of the max-heap.
[0089] In one embodiment, the time tag of the southbound resource to be processed and the time tag of the southbound resource in the next layer can also be obtained. The time tag of the southbound resource to be processed and the time tag of the southbound resource in the next layer are compared and processed. If the time tag of the southbound resource to be processed is less than the time tag of the southbound resource in the next layer, the southbound resource to be processed is moved down one layer.
[0090] Optionally, after sinking the southbound resource to be processed to one layer, the time tag of the next layer of southbound resources to be processed can be obtained, and the time tag of the southbound resource to be processed can be compared with the time tag of the next layer of southbound resources. If the time tag of the southbound resource to be processed is smaller than the time tag of the next layer of southbound resources, the southbound resource to be processed can continue to sink until the time tag of the southbound resource to be processed is greater than or equal to the time tag of the next layer of southbound resources, or until the southbound resource to be processed has been sunk to the bottom layer of the big top heap.
[0091] For example, such as Figure 8As shown, after adding the southbound resources to be processed to the top layer of the big top heap, the following is obtained: Figure 8 In the left-hand diagram, if the time tag of the southbound resource in the first row is less than the time tag of the southbound resource in the next layer, then the top-level data to be processed will be moved down to the second layer, and the original second-layer data will be moved up to the top layer. Figure 8 The diagram on the right is shown.
[0092] In one embodiment, southbound resources can also be deleted when needed. For example, the deletion step may include: if a southbound resource deletion instruction is received, obtaining the southbound resource label to be deleted and the second forwarding plane label from the southbound resource deletion instruction; if the big heap includes the second forwarding plane label, deleting the southbound resource to be deleted from the big heap according to the resource label of the southbound resource to be deleted.
[0093] In one embodiment, after receiving a southbound resource deletion instruction, the resource tag of the southbound resource can be obtained from the southbound resource deletion instruction, and the target southbound resource can be obtained and deleted based on the obtained resource tag of the southbound resource to be deleted.
[0094] Optionally, deleting the southbound resource to be deleted from the max-heap may include: determining the target southbound resource included in the max-heap based on the resource tag of the southbound resource to be deleted; setting the time tag corresponding to the target southbound resource to a preset target value so that when the target southbound resource is sorted using the time tag of the preset target value, the target southbound resource is at the bottom of the max-heap; and deleting the target southbound resource at the bottom.
[0095] In one embodiment, the max-heap can be determined based on the second forwarding surface label.
[0096] Alternatively, the maximum heap corresponding to the southbound resource to be deleted can be determined based on the resource tag of the southbound resource to be deleted.
[0097] In one embodiment, after obtaining the max heap, the target southbound resource can be further obtained from the max heap using the resource tag of the southbound resource.
[0098] For example, the forwarding plane label, network resource type label, and network resource instance label included in the resource label of the southbound resource to be deleted can be used to determine the max heap, and the label of the northbound resource in the resource label of the southbound resource to be deleted can be used to determine the target southbound resource in the max heap.
[0099] In one embodiment, after acquiring the target southbound resource, a time tag is obtained from the resource tag of the target southbound resource, and the time tag of the target southbound resource can be set to a preset target value. Optionally, the preset target value can be zero.
[0100] Optionally, after setting the time tag of the target southward resource to a preset target value, the target time tag of the next layer of southward resources can be matched with the preset target value to sink the target southward resource until it sinks to the bottom of the top stack.
[0101] For example, a preset target value is matched with the time tag of the next layer of southbound resources. If the preset target value is less than the time tag of the next layer of southbound resources, the target southbound resource is moved down one layer.
[0102] Optionally, after sinking the target southward resource to a lower level, the next level of southward resources is obtained, and the preset target value is compared with the time tag of the next level of southward resources. If the preset target value is still less than the time tag of the next level of southward resources, the target southward resource is sinked to a lower level.
[0103] Optionally, the process can continue to acquire the next layer of southbound resources, compare the preset target value with the time stamp of the next layer of southbound resources, and determine whether to sink the target southbound resource based on the comparison result. For example, if the target southbound resource has already sunk to the bottom layer, the above steps will not be executed; or, if the preset target value of the target southbound resource is greater than or equal to the time stamp of the next layer of southbound resources, the above steps will not be executed.
[0104] In an optional embodiment, after deleting the target southbound resource, the remaining southbound resources in the max-heap are obtained, and the timestamps of the remaining southbound resources are obtained. The remaining southbound resources are then reordered based on the timestamps of the remaining southbound resources.
[0105] For example, during the process of deleting the target southbound resource, there may be newly added southbound resources. In this case, after deleting the target southbound resource, the southbound resources existing in the max-heap can be reordered to ensure the orderliness of the southbound data in the max-heap.
[0106] Optionally, the reordering steps can be found in step 106, and will not be repeated here.
[0107] In the above embodiments, the deletion of southbound resources to be deleted is achieved by using forwarding plane tags and resource tags of southbound resources. This can realize the deletion of outdated southbound resources and ensure the timeliness and accuracy of southbound resources forwarded to the forwarding plane.
[0108] In an optional embodiment, an associated resource list corresponding to a resource configuration node is determined. If the existing southbound resources in the resource configuration node include the associated resource list, the existing southbound resources are sent to the forwarding plane.
[0109] The associated resource list is used to record the relationships between southbound resources.
[0110] In an alternative embodiment, the list of associated resources may be set to correspond to southbound resources.
[0111] For example, after obtaining the required southbound resources using the resource tags of southbound resources, the associated resource list can be determined based on the correspondence between the southbound resources and the associated resource list.
[0112] In one embodiment, the top heap corresponding to the southbound resource can be traversed to see if it still includes the southbound resources involved in the associated resource list. If the top heap still includes each southbound resource included in the associated resource list, then each southbound resource is sent to the corresponding forwarding plane.
[0113] Optionally, if the existing southbound resources in the resource configuration node do not include the associated resource list, the existing southbound resources are set to a suspended state until the existing southbound resources in the resource configuration node include the associated resource list, at which point the corresponding existing southbound resources are set from the suspended state to the sendable state.
[0114] The suspended state indicates that southbound resources cannot be sent.
[0115] The sendable status is used to indicate that the southbound resource section has been sent.
[0116] In the above embodiments, when sending resources to the forwarding plane, all southbound resources with related relationships are sent together, effectively ensuring the accuracy of the resources sent to the forwarding plane.
[0117] In the aforementioned southbound resource management method, resource configuration nodes are determined based on forwarding plane labels. A top-heap corresponding to each resource configuration node is obtained. When the top-heap contains resource labels for southbound resources to be processed, the southbound resources are added to the top-heap. Using the top-heap to manage southbound resources ensures their orderliness and thus guarantees the accuracy of southbound resource acquisition. Furthermore, in the above embodiments, the southbound resources added to the top-heap are sorted by time labels, ensuring that the most recent southbound resources are at the top, guaranteeing that the southbound resources sent to the forwarding plane are the latest and improving resource timeliness. Moreover, in the above embodiments, the resource labels for southbound resources include forwarding plane labels, network resource type labels, and network resource instance labels. Using these resource labels ensures the uniqueness of southbound resources, reduces interference between southbound resources, and effectively improves the accuracy of resource acquisition and forwarding.
[0118] In one embodiment, such as Figure 9As shown, a southbound resource management method is provided. This embodiment illustrates the method by applying it to a server. It is understood that this method can also be applied to servers, and further to systems including terminals and servers, and implemented through interaction between the terminal and the server. In this embodiment, the method includes the following steps:
[0119] Step 902: Obtain the southbound resources to be processed and obtain the first forwarding plane label corresponding to the southbound resources to be processed.
[0120] Step 904: Determine the resource configuration node based on the first forwarding plane label, and obtain the max heap corresponding to the resource configuration node.
[0121] Step 906: Determine whether the max heap contains the resource tag of the southbound resource to be processed. If yes, proceed to step 908; otherwise, proceed to step 914.
[0122] Step 908: Add the southbound resources to be processed to the big top heap.
[0123] Step 910: Based on the resource tag of the southbound resource to be processed, determine the location information of the southbound resource to be processed in the big top heap, and add the southbound resource to be processed to the location information.
[0124] Step 912: Obtain the timestamps of each southbound resource in the max-heap, and sort the southbound resources in the max-heap according to the order of their timestamps.
[0125] Step 914: Add the southbound resources to be processed as top-level data to the max heap.
[0126] Step 916: Obtain the timestamps of each southbound resource in the max-heap, and sort the southbound data in the max-heap according to the order of the timestamps.
[0127] In the above embodiments, southbound resources added to the max-heap are sorted by time tags, ensuring that the most recent southbound resources are placed at the top, guaranteeing that the southbound resources sent to the forwarding plane are the latest and improving resource timeliness. Furthermore, in the above embodiments, the resource tags for southbound resources include forwarding plane tags, network resource type tags, and network resource instance tags. Using these resource tags ensures the uniqueness of southbound resources, reduces interference between them, and effectively improves the accuracy of resource acquisition and forwarding.
[0128] In one embodiment, such as Figure 10 As shown, a southbound resource management method is provided. This embodiment illustrates the method by applying it to a server. It is understood that this method can also be applied to servers, and further to systems including terminals and servers, and implemented through interaction between the terminal and the server. In this embodiment, the method includes the following steps:
[0129] Step 1002: Obtain the southbound resource deletion instruction, which includes the southbound resource label to be deleted and the second forwarding plane label.
[0130] Step 1004: Determine whether the max-heap includes the second forwarding plane label. If yes, proceed to step 1006; otherwise, proceed to step 1020.
[0131] Step 1006: Based on the resource tags of the southbound resources to be deleted, determine the target southbound resources included in the big top heap.
[0132] Step 1008: Set the time tag corresponding to the target southbound resource to a preset target value so that when sorting the target southbound resource using the time tag of the preset target value, the target southbound resource is at the bottom of the max heap.
[0133] Step 1010: Delete the lowest-level target southbound resource.
[0134] Step 1012: Obtain the remaining southbound resources in the max-heap after deleting the target southbound resources, and obtain the timestamps of the remaining southbound resources.
[0135] Step 1014: Reorder the remaining southbound resources according to their time tags.
[0136] Step 1016: Determine whether there are no southbound resources in the max-heap corresponding to the resource configuration node. If yes, proceed to step 1018; otherwise, proceed to step 1020.
[0137] Step 1018: Remove the resource configuration node from the resource configuration structure tree.
[0138] Step 1020: Do not perform the deletion operation.
[0139] In the above embodiments, the deletion of southbound resources to be deleted is achieved by using forwarding plane tags and resource tags of southbound resources. This can realize the deletion of outdated southbound resources and ensure the timeliness and accuracy of southbound resources forwarded to the forwarding plane.
[0140] It should be understood that although the steps in the flowcharts of the above embodiments are shown sequentially according to the arrows, these steps are not necessarily executed in the order indicated by the arrows. Unless explicitly stated herein, there is no strict order restriction on the execution of these steps, and they can be executed in other orders. Moreover, at least some steps in the flowcharts of the above embodiments may include multiple steps or multiple stages. These steps or stages are not necessarily completed at the same time, but can be executed at different times. The execution order of these steps or stages is not necessarily sequential, but can be performed alternately or in turn with other steps or at least some of the steps or stages of other steps.
[0141] Based on the same inventive concept, this application also provides a southbound resource management device for implementing the southbound resource management method described above. The solution provided by this device is similar to the solution described in the above method; therefore, the specific limitations in one or more southbound resource management device embodiments provided below can be found in the limitations of the southbound resource management method described above, and will not be repeated here.
[0142] In one exemplary embodiment, such as Figure 4 As shown, a southbound resource management device 1100 is provided, including: a first acquisition module 1102, a max-heap acquisition module 1104, and a resource addition module 1106, wherein:
[0143] The first acquisition module 1102 is used to acquire the southbound resources to be processed and to acquire the first forwarding plane label corresponding to the southbound resources to be processed.
[0144] The max-heap acquisition module 1104 is used to determine the resource configuration node based on the first forwarding plane label and acquire the max-heap corresponding to the resource configuration node.
[0145] The resource addition module 1106 is used to add the southbound resource to be processed to the max heap when the max heap contains a resource tag for the southbound resource to be processed.
[0146] In one embodiment, the resource adding module is further configured to determine the location information of the southbound resource to be processed in the big top heap based on the resource tag of the southbound resource to be processed, and add the southbound resource to be processed to the location information.
[0147] In one embodiment, the southbound resource management device includes a southbound resource sorting module, which is used to obtain the time tags of each southbound resource in the big top heap and sort the southbound resources in the big top heap according to the order of the time tags.
[0148] In one embodiment, the resource adding module is further configured to add the southbound resource to be processed as top-level data to the max heap when the max heap does not contain the resource tag of the southbound resource to be processed; the southbound resource sorting module is further configured to obtain the time tag of each southbound resource in the max heap and sort each southbound data in the max heap according to the order of the time tag.
[0149] In an optional embodiment, the southbound resource management device includes a southbound resource deletion module for obtaining a southbound resource deletion instruction, which includes a southbound resource tag to be deleted and a second forwarding plane tag; when the big top heap includes the second forwarding plane tag, the southbound resource to be deleted is deleted from the big top heap according to the resource tag of the southbound resource to be deleted.
[0150] In one exemplary embodiment, the southbound resource deletion module is further configured to determine the target southbound resource included in the max-heap based on the resource tag of the southbound resource to be deleted; set the time tag corresponding to the target southbound resource to a preset target value so that when the target southbound resource is sorted using the time tag of the preset target value, the target southbound resource is at the bottom of the max-heap; and delete the target southbound resource at the bottom.
[0151] In one exemplary embodiment, the southbound resource deletion module is further configured to delete the resource configuration node from the resource configuration structure tree when there are no southbound resources in the max-heap corresponding to the resource configuration node.
[0152] In one embodiment, the southbound resource sorting module is used to obtain the remaining southbound resources in the max-heap after deleting the target southbound resource at the bottom layer, and obtain the timestamps of the remaining southbound resources; and reorder the remaining southbound resources according to the timestamps of the remaining southbound resources.
[0153] In one embodiment, the southbound resource management device includes a southbound resource forwarding module, which is used to determine the associated resource list corresponding to the resource configuration node; when there are existing southbound resources in the resource configuration node, including the associated resource list, the existing southbound resources are sent to the forwarding plane.
[0154] In an optional embodiment, the southbound resource forwarding module is configured to set the existing southbound resources in the resource configuration node to a suspended state when the existing southbound resources in the resource configuration node do not include the associated resource list, until the existing southbound resources in the resource configuration node include the associated resource list, at which point the corresponding existing southbound resources are set from the suspended state to the sendable state.
[0155] Each module in the aforementioned southbound resource management device can be implemented entirely or partially through software, hardware, or a combination thereof. These modules can be embedded in or independent of the processor in a computer device, or stored in the memory of a computer device as software, so that the processor can call and execute the corresponding operations of each module.
[0156] In one exemplary embodiment, a computer device is provided, which may be a server, and its internal structure diagram may be as follows: Figure 12 As shown, this computer device includes a processor, memory, input / output (I / O) interfaces, and a communication interface. The processor, memory, and I / O interfaces are connected via a system bus, and the communication interface is also connected to the system bus via the I / O interfaces. The processor provides computing and control capabilities. The memory includes non-volatile storage media and internal memory. The non-volatile storage media stores the operating system, computer programs, and a database. The internal memory provides the environment for the operation of the operating system and computer programs stored in the non-volatile storage media. The database stores data. The I / O interfaces are used for exchanging information between the processor and external devices. The communication interface is used for communicating with external terminals via a network connection. When executed by the processor, the computer program implements a southbound resource management method.
[0157] Those skilled in the art will understand that Figure 12 The structure shown is merely a block diagram of a portion of the structure related to the present application and does not constitute a limitation on the computer device to which the present application is applied. Specific computer devices may include more or fewer components than those shown in the figure, or combine certain components, or have different component arrangements.
[0158] In one exemplary embodiment, a computer device is provided, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the steps of the above-described method embodiments.
[0159] In one embodiment, a computer-readable storage medium is provided having a computer program stored thereon, which, when executed by a processor, implements the steps of the above-described method embodiments.
[0160] In one embodiment, a computer program product is provided, including a computer program that, when executed by a processor, implements the steps of the above-described method embodiments.
[0161] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, data stored, data displayed, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of the relevant data must comply with relevant regulations.
[0162] Those skilled in the art will understand that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium. When executed, the computer program can include the processes of the embodiments of the above methods. Any references to memory, databases, or other media used in the embodiments provided in this application can include at least one of non-volatile memory and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM). The databases involved in the embodiments provided in this application may include at least one type of relational database and non-relational database. Non-relational databases may include, but are not limited to, blockchain-based distributed databases. The processors involved in the embodiments provided in this application may be general-purpose processors, central processing units, graphics processing units, digital signal processors, programmable logic devices, quantum computing-based data processing logic devices, artificial intelligence (AI) processors, etc., and are not limited to these.
[0163] The technical features of the above embodiments can be combined in any way. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this application.
[0164] The above embodiments are merely illustrative of several implementation methods of this application, and their descriptions are relatively specific and detailed. However, they should not be construed as limiting the scope of this application. It should be noted that those skilled in the art can make various modifications and improvements without departing from the concept of this application, and these all fall within the protection scope of this application. Therefore, the protection scope of this application should be determined by the appended claims.
Claims
1. A method for managing southbound resources, characterized in that, The method includes: Obtain the southbound resources to be processed, and obtain the first forwarding plane label corresponding to the southbound resources to be processed; The resource configuration node is determined based on the first forwarding plane label, and the max heap corresponding to the resource configuration node is obtained; When the max heap includes the resource tag of the southbound resource to be processed, the southbound resource to be processed is added to the max heap.
2. The method according to claim 1, characterized in that, Adding the southbound resource to be processed to the max heap includes: Based on the resource tag of the southbound resource to be processed, determine the location information of the southbound resource to be processed in the big top heap, and add the southbound resource to be processed to the location information.
3. The method according to claim 2, characterized in that, After adding the southbound resource to be processed to the location information, the method includes: Obtain the time tags of each southbound resource in the top heap, and sort the southbound resources in the top heap according to the order of the time tags.
4. The method according to claim 1, characterized in that, After determining the resource configuration node based on the first forwarding plane label and obtaining the max-heap corresponding to the resource configuration node, the method includes: When the top-level heap does not include the resource tag of the southbound resource to be processed, the southbound resource to be processed is added to the top-level heap as top-level data. Obtain the time tags of each southbound resource in the max heap, and sort the southbound data in the max heap according to the order of the time tags.
5. The method according to claim 1, characterized in that, After adding the southbound resource to be processed to the max-heap, the method includes: Obtain a southbound resource deletion instruction, wherein the southbound resource deletion instruction includes the resource tag and the second forwarding plane tag of the southbound resource to be deleted; When the max heap includes the second forwarding plane label, the southbound resource to be deleted is removed from the max heap according to the resource label of the southbound resource to be deleted.
6. The method according to claim 5, characterized in that, The step of deleting the southbound resource from the max-heap based on its resource tag includes: Based on the resource tags of the southbound resources to be deleted, determine the target southbound resources included in the top heap; Set the time tag corresponding to the target southbound resource to a preset target value so that when the target southbound resource is sorted using the time tag of the preset target value, the target southbound resource is at the bottom of the top layer of the top heap. Delete the target southbound resource at the lowest level.
7. The method according to claim 6, characterized in that, The method further includes: If there are no southbound resources in the max-heap corresponding to the resource configuration node, then the resource configuration node is deleted from the resource configuration structure tree.
8. The method according to claim 6, characterized in that, After deleting the lowest-level target southbound resource, the method includes: After deleting the target southbound resource, obtain the remaining southbound resources in the max heap, and obtain the timestamp of the remaining southbound resources; The remaining southbound resources are reordered based on their time tags.
9. The method according to claim 1, characterized in that, The method further includes: Determine the list of associated resources corresponding to the resource configuration node; If there are existing southbound resources in the resource configuration node, including the associated resource list, then the existing southbound resources will be sent to the forwarding plane.
10. The method according to claim 9, characterized in that, After determining the associated resource list corresponding to the resource configuration node, the method further includes: If the existing southbound resources in the resource configuration node do not include the associated resource list, the existing southbound resources are set to a suspended state until the existing southbound resources in the resource configuration node include the associated resource list, at which point the corresponding existing southbound resources are set from the suspended state to the sendable state.
11. The method according to any one of claims 1-10, characterized in that, The resource tags include forwarding plane tags, network resource type tags, and network resource instance tags.
12. A southbound resource management device, characterized in that, The device includes: The first acquisition module is used to acquire the southbound resource to be processed and acquire the first forwarding plane label corresponding to the southbound resource to be processed; The max-heap acquisition module is used to determine the resource configuration node based on the first forwarding plane label and acquire the max-heap corresponding to the resource configuration node. The resource adding module is used to add the southbound resource to be processed to the max heap when the max heap includes the resource tag of the southbound resource to be processed.
13. A computer device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that, When the processor executes the computer program, it implements the steps of the method according to any one of claims 1 to 11.
14. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1 to 11.
15. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1 to 11.