Cross resource allocation method and device, equipment and medium

Abstract

A cross resource allocation method, apparatus, device and medium, relating to the technical field of OSU, the cross resource allocation method comprising: according to configuration information of OSU service carried by each cross disk, obtaining current load of each cross disk, and further determining each current load weight; obtaining historical adjustment data and residual bandwidth of each cross disk to obtain a fragment risk factor of each cross disk, and further determining a risk weight of each fragment; calculating each predicted bandwidth according to each current load so as to obtain each predicted bandwidth weight; and according to the current load weight, the fragment risk weight and the predicted bandwidth weight of each cross disk, calculating the current comprehensive weight of each cross disk, and distributing the OSU service to the current cross disk with the highest comprehensive weight. According to the invention, overload of the link channel between the service disk and the cross disk can be effectively avoided, fragmentation caused by frequent adjustment or insufficient residual bandwidth is reduced, and the problem of insufficient resources during traffic burst is reduced.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of OSU, in particular to a cross resource allocation method, device, equipment and medium. BACKGROUND

[0002] OSU (Optical Service Unit) technology is derived from the structural challenges faced by optical communication networks in the era of intelligence. Its core goal is to address the shortcomings of traditional OTN (Optical Transport Network) in small particle service carrying efficiency, latency control, and resource flexibility, in order to support the differentiated needs of emerging scenarios such as government enterprise private lines, 5G backhaul, and industrial internet. The introduction of OSU technology is a key milestone in the transition of optical communication networks from "large particle carrying" to "fine-grained operation". Through fine-grained hard pipes, low-latency architecture, flexible bandwidth, and open ecosystem, OSU not only solves the capability gap of traditional optical networks, but also opens up the value reconstruction of government enterprise private lines, 5G, and industrial internet scenarios. With the acceleration of standardization and the maturation of the industry chain, OSU will become one of the core infrastructure technologies supporting the development of the digital economy.

[0003] Therefore, OSU small particle lossless bandwidth adjustment is widely used, and the existing cross bandwidth allocation adopts a polling allocation strategy to allocate services in a fixed order, which cannot perceive the OSU service bandwidth, and the load allocation of the cross disk is different, which can easily lead to overload of the link channel between the service disk and the cross disk. In addition, since the OSU bandwidth is at least 2M and at most 100G, there is a problem of bandwidth resource fragmentation. SUMMARY

[0004] The present application provides a cross resource allocation method, device, equipment and medium, which can solve the technical problems of load imbalance and resource fragmentation in the prior art.

[0005] In a first aspect, the present application provides a cross resource allocation method, the method comprising: According to the configuration information of the OSU service carried by each cross disk, the current load of each cross disk is obtained, and then the current load weight of each cross disk is determined; Obtain the historical adjustment data and the remaining bandwidth of each cross disk to obtain the fragmentation risk factor of each cross disk, and then determine the fragmentation risk weight of each cross disk; According to each of the above current load, the predicted bandwidth of each is calculated, and then the predicted bandwidth weight of each is obtained; According to the current load weight, the fragmentation risk weight and the predicted bandwidth weight of each cross disk, the current comprehensive weight of each cross disk is calculated, and the OSU service is allocated to the cross disk with the highest current comprehensive weight.

[0006] With reference to the first aspect, in an implementation, after each allocation of the OSU service, the method further comprises: updating configuration information of the cross disk to which the OSU service is allocated, and updating the current load weight, the fragmentation risk weight and the predicted bandwidth weight of the cross disk.

[0007] With reference to the first aspect, in an implementation, the current comprehensive weight of the cross disk is calculated according to the current load weight, the fragmentation risk weight and the predicted bandwidth weight of the cross disk, and specifically comprises: multiplying the current load weight, the fragmentation risk weight and the predicted bandwidth weight of the cross disk to obtain the current comprehensive weight of the cross disk.

[0008] With reference to the first aspect, in an implementation, the historical adjustment data comprises a bandwidth historical adjustment number and a bandwidth historical adjustment total amplitude; the current comprehensive weight of the jth cross disk is:

[0009] wherein, the current load weight is, the current load is; the fragmentation risk weight is a fragmentation risk factor , the bandwidth historical adjustment total amplitude is, the bandwidth historical adjustment number is, the remaining bandwidth is; the predicted bandwidth weight is, the predicted bandwidth is; the small positive number is a small positive number to avoid division by zero.

[0010] With reference to the first aspect, in an implementation, the predicted bandwidth at the tth moment is :

[0011] wherein, the current load at the t-1th moment is, the predicted bandwidth at the t-1th moment is, the smoothing coefficient is.

[0012] With reference to the first aspect, in an implementation, after the current comprehensive weights of the cross disks are calculated, the method further comprises: if the current comprehensive weights of the cross disks are the same and the highest, the OSU service is allocated to the cross disk with the highest current comprehensive weight and the smallest serial number.

[0013] With reference to the first aspect, in an implementation, before the OSU service is allocated, the method further comprises: ​Cross-connect disks with remaining bandwidth less than the service bandwidth of the aforementioned OSU services will be removed.

[0014] Secondly, this application provides a cross-resource allocation apparatus, the apparatus comprising: The first acquisition module is used to obtain the current load of each cross-connect disk based on the configuration information of the OSU services already carried by each cross-connect disk, and then determine the weight of each current load. The second acquisition module is used to acquire historical adjustment data and remaining bandwidth of each cross-disk to obtain the fragmentation risk factor of each cross-disk, and then determine the fragmentation risk weight. The third acquisition module is used to calculate each predicted bandwidth based on the current load mentioned above, and then obtain the weight of each predicted bandwidth. The allocation module is used to calculate the current comprehensive weight of each cross-connect based on the current load weight, fragmentation risk weight, and predicted bandwidth weight of each cross-connect, and allocate OSU services to the cross-connect with the highest current comprehensive weight.

[0015] Thirdly, this application provides a cross-resource allocation device, which includes a processor, a memory, and a cross-resource allocation program stored in the memory and executable by the processor, wherein when the cross-resource allocation program is executed by the processor, it implements the steps of the cross-resource allocation method as described above.

[0016] Fourthly, this application provides a computer-readable storage medium storing a cross-resource allocation program, wherein when the cross-resource allocation program is executed by a processor, it implements the steps of the cross-resource allocation method described above.

[0017] The beneficial effects of the technical solution provided in this application include: Based on the configuration information of the OSU services already carried by each cross-connect board, the current load of each cross-connect board is obtained, and then the current load weight is determined; the historical adjustment data and remaining bandwidth of each cross-connect board are obtained to obtain the fragmentation risk factor of each cross-connect board, and then the fragmentation risk weight is determined; the predicted bandwidth is calculated based on the current load, and then the predicted bandwidth weight is obtained; based on the current load weight, fragmentation risk weight and predicted bandwidth weight of each cross-connect board, the current comprehensive weight of each cross-connect board is calculated, and the OSU services are allocated to the cross-connect board with the highest current comprehensive weight.

[0018] By combining cross-connect load calculation, OSU fragmentation risk calculation, and OSU future service prediction, the OSU service allocation weight can be dynamically adjusted, which can effectively avoid overload of the link channel between the service board and the cross-connect board, reduce fragmentation caused by frequent adjustments or insufficient remaining bandwidth, and reduce resource shortage problems during sudden traffic. It is suitable for new network scenarios such as 5G, cloud computing, and industrial internet. Attached Figure Description

[0019] Figure 1 This is a flowchart illustrating an embodiment of the cross-resource allocation method of this application; Figure 2 This is a schematic diagram of the functional modules of an embodiment of the cross-resource allocation device of this application; Figure 3 This is a schematic diagram of the hardware structure of the cross-resource allocation device involved in the embodiments of this application. Detailed Implementation

[0020] To enable those skilled in the art to better understand the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present application, and not all embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of the present application.

[0021] Firstly, embodiments of this application provide a method for cross-resource allocation.

[0022] In one embodiment, reference is made to Figure 1 , Figure 1 This is a flowchart illustrating an embodiment of the cross-resource allocation method of this application. The cross-resource allocation method includes: S1. Based on the configuration information of the OSU services already carried by each cross-connect disk, obtain the current load of each cross-connect disk, and then determine the weight of each current load; S2. Obtain historical adjustment data and remaining bandwidth for each cross-disk to obtain the fragmentation risk factor for each cross-disk, and then determine the risk weight of each fragment. S3. Calculate each predicted bandwidth based on the current load mentioned above, and then obtain the weight of each predicted bandwidth; S4. Calculate the current comprehensive weight of each cross-connect based on the current load weight, fragmentation risk weight, and predicted bandwidth weight of each cross-connect, and allocate OSU services to the cross-connect with the highest current comprehensive weight.

[0023] In this embodiment, based on the configuration information of the OSU services already carried by each cross-connect board, the current load of each cross-connect board is obtained, and then the weight of each current load is determined; the historical adjustment data and remaining bandwidth of each cross-connect board are obtained to obtain the fragmentation risk factor of each cross-connect board, and then the weight of each fragmentation risk is determined; each predicted bandwidth is calculated based on each current load, and then the weight of each predicted bandwidth is obtained; based on the current load weight, fragmentation risk weight and predicted bandwidth weight of each cross-connect board, the current comprehensive weight of each cross-connect board is calculated, and the OSU services are allocated to the cross-connect board with the highest current comprehensive weight.

[0024] By combining cross-disk load calculation, OSU fragmentation risk calculation and OSU future traffic prediction, the OSU traffic distribution weight is dynamically adjusted, which can effectively avoid the link channel overload between the service disk and the cross disk, reduce the fragmentation caused by frequent adjustment or insufficient remaining bandwidth, and reduce the resource shortage problem during burst traffic. It is suitable for new network scenarios such as 5G, cloud computing, industrial internet, and has high reusability.

[0025] Specifically, it can be understood that the OSU traffic has the characteristics of large fluctuation, large variability and burstiness. By dynamically calculating the cross-disk OSU traffic capacity in real time, if the cross-disk OSU traffic capacity is large, the weight of the allocated OSU new bandwidth is low; otherwise, the cross-disk bandwidth is evenly distributed by dynamically adjusting the weight.

[0026] In order to solve the problem of OSU bandwidth resource fragmentation, the fragmentation risk calculation is introduced. For the cross disk with high fragmentation, the weight of the allocated OSU new bandwidth is low, so as to preferentially allocate the service to the cross disk with low fragmentation rate and reduce the bandwidth fragmentation.

[0027] By analyzing the historical adjustment data and the remaining bandwidth of the OSU cross disk, the following principles are introduced. Fragmentation principle 1: the historical adjustment amplitude of a certain cross disk is large, which indicates that the cross-disk OSU adjustment bandwidth is frequent and easy to form fragmentation. Fragmentation principle 2: the remaining bandwidth of a certain cross disk is small, which indicates that the remaining bandwidth of the cross disk is difficult to be allocated to the OSU service, and is easy to form fragmentation. Therefore, the OSU bandwidth allocation principle based on fragmentation risk is: for the cross disk with high fragmentation rate, the weight of the allocated OSU new bandwidth is low.

[0028] In order to cope with the OSU burst traffic and avoid the situation that there is no cross resource available, the future traffic prediction is introduced to predict the future OSU traffic capacity of the cross disk in real time, so as to avoid the cross disk with high load in the future and reserve bandwidth to cope with the burst OSU traffic. The OSU bandwidth allocation principle based on predicted bandwidth: the cross disk with high predicted bandwidth is allocated with low weight of OSU new bandwidth.

[0029] On the basis of the above embodiment, in an embodiment, after each OSU service allocation, the following steps are further included: updating the configuration information of the cross disk allocated with the OSU service, and further updating the current load weight, fragmentation risk weight and predicted bandwidth weight of the cross disk.

[0030] In this embodiment, the load .

[0031] In the embodiment, after each OSU service is allocated, the configuration information of the crossboard carrying the OSU service is updated, and then the current load weight, the fragmentation risk weight and the predicted bandwidth weight of the crossboard are updated, so that when a new OSU task is allocated, the current comprehensive weight of the crossboard can be updated according to the updated current load weight, the fragmentation risk weight and the predicted bandwidth weight of the crossboard, and the new OSU service is allocated.

[0032] Further, in an embodiment, the current comprehensive weight of a crossboard is calculated according to the current load weight, the fragmentation risk weight and the predicted bandwidth weight of the crossboard, and specifically includes: The current load weight, the fragmentation risk weight and the predicted bandwidth weight of the crossboard are multiplied to obtain the current comprehensive weight of the crossboard.

[0033] Further, in the embodiment, the historical adjustment data includes the bandwidth historical adjustment times and the bandwidth historical adjustment total amplitude.

[0034] The current comprehensive weight of the jth crossboard is is:

[0035] wherein, is the current load weight, is the current load; is the fragmentation risk weight, and the fragmentation risk factor , is the bandwidth historical adjustment total amplitude, is the bandwidth historical adjustment times, is the remaining bandwidth; is the predicted bandwidth weight, is the predicted bandwidth; is a small positive number to avoid division by zero.

[0036] Optionally, the current load weight of a crossboard is determined, and specifically includes: S11, according to the configuration information of the OSU service carried by the crossboard, obtaining the current load of the crossboard; Wherein, the crossboard carries the OSU service, and the OSU bandwidth of each service is calculated according to the configuration information of the backplane system port, the physical port, the mapping type and the like. The crossboard carries a plurality of OSU services, and the total bandwidth C of the carried services can be calculated, that is, the current load of the crossboard is C.

[0037] S12, determining the current load weight according to the current load; Where OSU IDX and new ODU are bound so that OSU traffic can be transmitted through multiple paths. Each OSU traffic needs to be allocated cross-disk bandwidth, and the current load of the jth cross-disk is The current load weight of the cross-disk is defined as Where is a small positive number (0.001) to avoid division by zero error.

[0038] Optionally, the fragmentation risk weight of a certain cross-disk is determined, specifically including: S21, the number of historical bandwidth adjustments of the OSU and the total amplitude of the historical bandwidth adjustments are counted, wherein the number of historical bandwidth adjustments of the jth cross-disk is , and the total amplitude of the historical bandwidth adjustments is .

[0039] S22, the remaining bandwidth is calculated according to the current load, wherein the current load is , and the remaining bandwidth is .

[0040] S23, the fragmentation risk factor and the fragmentation risk weight are calculated according to the number of historical bandwidth adjustments of the OSU, the total amplitude of the historical bandwidth adjustments, and the remaining bandwidth.

[0041] Where the fragmentation risk factor is defined as , wherein is a small positive number (0.001) to avoid division by zero error.

[0042] represents the total amplitude of the historical bandwidth adjustments divided by the number of times, and the higher the value, the more frequently the cross-disk adjusts the bandwidth; as the reserved OSU bandwidth, the smaller the value, the more difficult it is to allocate the remaining bandwidth of the cross-disk. Therefore, divided by is larger, indicating that the fragmentation risk factor is higher, and the weight allocated to the cross-disk should be smaller.

[0043] The weight allocation can be calculated by an exponential function, and the reasons are as follows: 1. The fragmentation risk weight monotonically decreases with the increase of the fragmentation risk factor, which is consistent with the fragmentation risk; 2. The exponential function is nonlinear, and the authority of the high fragmentation risk factor allocation decreases steeply, and the authority of the low fragmentation risk factor allocation increases gently.

[0044] In this embodiment, the service allocation is optimized through historical learning, which can effectively avoid the fragmentation of the remaining bandwidth of the cross-disk.

[0045] Further, in this embodiment, the predicted bandwidth at the tth moment is​ :

[0046] wherein, is the current load at the t-1 time, is the predicted bandwidth at the t-1 time, is a smoothing coefficient.

[0047] Further, in an embodiment, after calculating the current comprehensive weight of each cross disk, the method further comprises: if the current comprehensive weights of the plurality of cross disks are the same and the highest, the OSU service is allocated to the cross disk with the highest current comprehensive weight and the smallest serial number.

[0048] In the embodiment, determining the predicted bandwidth weight of a cross disk specifically comprises: S31, calculating each predicted bandwidth according to the current load; The embodiment is suitable for embedded real-time operation, and the current load is , then the predicted bandwidth is:

[0049] wherein, the above formula derivation is expanded as follows: 1st time:

[0050] 2nd time:

[0051]

[0052]

[0053] 3rd time:

[0054]

[0055]

[0056] S32, calculating the predicted bandwidth weight according to the predicted bandwidth; wherein, the greater the predicted bandwidth is, the lower the weight of allocating the OSU new bandwidth is.

[0057] In other embodiments, after obtaining the current comprehensive weight of each cross disk, the weight of the OSU service allocated to each cross disk can also be calculated, wherein the weight of the ith OSU service allocated to the jth cross disk is: .

[0058] Further, in one embodiment, before calculating the OSU service distribution, further comprising: Eliminating the cross disk whose residual bandwidth is less than the service bandwidth of the above-mentioned OSU service.

[0059] In some embodiments, taking 10 service disks and 5 cross disks as an example, the following definitions are made: Wherein, L represents the service amount of each cross disk, and the service amount of each service disk generated by randomly distributing 1220 services to 10 service disks is shown in Table 1.

[0060] Table 1

[0061] When only the current load weight is used for cross resource distribution, first, when the first flow of the first service disk is distributed, the current load weight of each cross disk is calculated, wherein the smaller the current load of the cross disk, the greater the current load weight of the cross disk. When the first distribution is made, the current load is 0 by default, and the current load weight of all cross disks is 1.0 / 0+0.001 = 1000.0.

[0062] At this time, since the current load weight of each cross disk is the same and the maximum, the service is distributed to the first cross disk. The traffic of this service is generated by random number. The cross capacity of the first cross disk is updated.

[0063] Subsequently, when the second flow of the first service disk is distributed, the current load weight of each cross disk is calculated according to the above-mentioned current load weight calculation formula, and the following data {0.000364, 1000, 1000, 1000, 1000} is obtained. The second flow of the service disk is distributed to the second cross disk. The traffic of this service is generated by random number, and the cross capacity of the second cross disk is updated.

[0064] When the third flow of the first service disk is distributed, the current load weight of the five cross disks is calculated, and the following data {0.000364, 0.011264, 1000, 1000, 1000} is obtained. Similarly, the flow is distributed to the third cross disk. In succession, all services are distributed.

[0065] It can be understood that if the Round Robin allocation method is used, the static polling method is used for service allocation, that is, the first flow of the first service disk is allocated to the first cross disk, the second flow of the first service disk is allocated to the second cross disk, the third flow of the first service disk is allocated to the third cross disk, the fourth flow of the first service disk is allocated to the fourth cross disk, the fifth flow of the first service disk is allocated to the fifth cross disk, the sixth flow of the first service disk is allocated to the first cross disk, and the seventh flow of the first service disk is allocated to the second cross disk. The allocation is performed in this way.

[0066] By comparing the service allocation using the current load weight and the service allocation using the Round Robin allocation method, the capacity data of the five cross disks are shown in Table 2.

[0067] Table 2

[0068] It can be known by comparison that 10 service disks are randomly allocated to 1220 services, and each service generates the traffic of this service through a random number. The service allocation using the current load weight is better than the service allocation using the Round Robin allocation method in terms of balance.

[0069] Further, in the embodiment, five cross disks are also taken as an example, and the following definitions are made. And the following definitions are made: The total bandwidth of each cross disk TOTAL_BW is 1000 (M), the exponential smoothing coefficient is 0.5, the software simulates 24 hours of burst traffic, the OSU service traffic is higher from 8 am to 18 pm, and the service traffic is lower from 18 pm to 8 am. There are 100 random traffics per hour.

[0070] In the embodiment, the cross disk initialization default parameters are as follows: The remaining bandwidth remaining_bw = TOTAL_BW; The current load (number of connections) Load = 0; The bandwidth history adjustment times history_count = 0; The history adjustment total amplitude (M) history_sum = 0; The new predicted bandwidth field predicted_load = 0.

[0071] The allocation method of the embodiment specifically includes: First, the first OSU service (bandwidth 43) is newly created, and each cross disk judges that the current remaining bandwidth remaining_bw=1000 is greater than the OSU service bandwidth 43, and participates in the pre-judgment calculation. According to the current load: {0, 0, 0, 0, 0}, the current predicted bandwidth: {0, 0, 0, 0, 0}, the current comprehensive weight is calculated in real time: .

[0072] At this time, the first calculation obtains the current comprehensive weight of the five cross disks The result is as follows: {1000000.0, 1000000.0, 1000000.0, 1000000.0, 1000000.0}, at this time, the OSU service is allocated to the first cross disk. At the same time, the current load of the first cross disk is updated, and the corresponding current load weight, fragmentation risk weight and predicted bandwidth weight are updated.

[0073] Among them, the current load : {43, 0, 0, 0, 0}, the current predicted bandwidth : {0, 0, 0, 0, 0}, according to , the future OSU service predicted bandwidth is calculated. The first update of the predicted bandwidth The result is as follows: {21.5, 0, 0, 0, 0}.

[0074] Second, when the second OSU service (bandwidth 37) is newly created, the current remaining bandwidth remaining_bw of each cross disk is greater than the OSU service bandwidth 37, and participates in the pre-judgment calculation. According to the current load: {43, 0, 0, 0, 0}, the current predicted bandwidth: {21.5, 0, 0, 0, 0}, the current comprehensive weight is calculated in real time .

[0075] At this time, the second calculation obtains the current comprehensive weight of the five cross disks The result is as follows: {44.678541, 1000000.0, 1000000.0, 1000000.0, 1000000.0}, at this time, the OSU service is allocated to the second cross disk. At the same time, the current load of the second cross disk is updated, and the corresponding current load weight, fragmentation risk weight and predicted bandwidth weight are updated.

[0076] Among them, the current load : {43, 37, 0, 0, 0}, the current predicted bandwidth : {21.5, 0, 0, 0, 0}, in order to calculate the future OSU service predicted bandwidth. The second update of the predicted bandwidth The result is as follows: {10.75, 18.5, 0, 0, 0}.

[0077] Then, when a new OSU service (bandwidth 35) is created, the current remaining bandwidth remaining_bw of each cross disk is greater than the bandwidth 35 of the OSU service, and participates in the prediction calculation. According to the current load {43, 37, 0, 0, 0} and the current predicted bandwidth {10.75, 18.5, 0, 0, 0}, the real-time calculation is performed on the current comprehensive weight. .

[0078] At this time, the third calculation obtains the current comprehensive weight of the five cross disks The result is as follows: {56.112722, 181.879551, 1000000.0, 1000000.0, 1000000.0}, at this time, the OSU service is allocated to the third cross disk. At the same time, the current load of the third cross disk is updated, and the corresponding current load weight, fragmentation risk weight and predicted bandwidth weight are updated.

[0079] Among them, the current load : {43, 37, 35, 0, 0}, the current predicted bandwidth : {10.75, 18.5, 0, 0, 0}, and the future OSU service predicted bandwidth is calculated. The third update of the predicted bandwidth The result is as follows: {5.375, 9.25, 17.5, 0, 0}.

[0080] By analogy, the bandwidth is allocated in turn. As described above, 100 OSU service streams per hour for 24 hours. The allocation method of the embodiment is compared with the method of only using the current load weight for allocation, and the maximum continuous bandwidth block and the allocation failure rate are calculated, as shown in Table 3 below. The allocation method of the embodiment can effectively improve the allocation failure rate, and the reserved continuous bandwidth can better cope with the OSU service burst situation.

[0081] Table 3

[0082] The method of the embodiment solves the problems of resource fragmentation, poor burst traffic adaptability, and unbalanced load in the OSU system through the synergistic optimization of fragmentation risk perception, dynamic load balancing and predictive allocation, reduces the device development and maintenance cost, has the characteristics of high scalability and flexibility, is suitable for the POTN / OSU field, and has wide application prospect and commercial value.

[0083] In a second aspect, the embodiment of the present application also provides a cross resource allocation device.

[0084] In one embodiment, reference is made to Figure 2 , Figure 2 This is a functional block diagram of an embodiment of the cross-resource allocation device of this application. The cross-resource allocation device includes a first acquisition module, a second acquisition module, a third acquisition module, and an allocation module.

[0085] The first acquisition module mentioned above is used to obtain the current load of each cross-connect disk based on the configuration information of the OSU services already carried by each cross-connect disk, and then determine the weight of each current load. The second acquisition module mentioned above is used to acquire historical adjustment data and remaining bandwidth of each cross-disk to obtain the fragmentation risk factor of each cross-disk, and then determine the fragmentation risk weight; The third acquisition module mentioned above is used to calculate each predicted bandwidth based on the current load, and then obtain the weight of each predicted bandwidth. The aforementioned allocation module is used to calculate the current comprehensive weight of each cross-connect based on its current load weight, fragmentation risk weight, and predicted bandwidth weight, and to allocate OSU services to the cross-connect with the highest current comprehensive weight.

[0086] Furthermore, in one embodiment, after each OSU service allocation, the first acquisition module is further used to update the configuration information of the cross-connect disk that allocated the OSU service, thereby updating the current load weight of the cross-connect disk; the second acquisition module is further used to update the fragmentation risk weight of the cross-connect disk; and the third acquisition module is further used to update the predicted bandwidth weight of the cross-connect disk.

[0087] Furthermore, in one embodiment, the allocation module is used to multiply the current load weight, fragmentation risk weight, and predicted bandwidth weight of the cross-connect disk to obtain the current comprehensive weight of the cross-connect disk.

[0088] Furthermore, in one embodiment, the historical adjustment data includes the number of historical bandwidth adjustments and the total historical bandwidth adjustment magnitude.

[0089] The current composite weight of the j-th cross disk for:

[0090] in, As the current load weight, Current load; For fragmented risk weights, fragmented risk factors , This represents the total historical bandwidth adjustment range. For the number of historical bandwidth adjustments, This represents the remaining bandwidth. To predict bandwidth weights, For predicting bandwidth; To avoid small positive numbers except zero.

[0091] Further, in an embodiment, the predicted bandwidth at the t th moment is :

[0092] wherein, is the current load at the (t-1) th moment, is the predicted bandwidth at the (t-1) th moment, is a smoothing coefficient.

[0093] Further, in an embodiment, the allocation module is further configured to: After calculating the current comprehensive weights of the cross-boards, if the current comprehensive weights of the cross-boards are the same and the highest, the OSU service is allocated to the cross-board with the highest current comprehensive weight and the smallest serial number.

[0094] Further, in an embodiment, the allocation module is further configured to exclude the cross-board with a remaining bandwidth less than the service bandwidth of the OSU service before allocating the OSU service.

[0095] The functions of each module in the cross-resource allocation apparatus correspond to the steps in the cross-resource allocation method, and the functions and implementation processes will not be repeated here.

[0096] In a third aspect, the embodiments of the present application provide a cross-resource allocation device, which can be an OTN device.

[0097] Referring to Figure 3 , Figure 3 is a schematic diagram of the hardware structure of the cross-resource allocation device involved in the embodiments of the present application. In the embodiments of the present application, the cross-resource allocation device can include a processor, a memory, a communication interface, and a communication bus.

[0098] The communication bus can be of any type, used to interconnect the processor, the memory, and the communication interface.

[0099] The communication interface includes an input / output (I / O) interface, a physical interface, and a logical interface, etc. used to realize the interconnection of devices inside the cross-resource allocation device, and interfaces used to realize the interconnection of the cross-resource allocation device and other devices (such as other computing devices or user devices). The physical interface can be an Ethernet interface, a fiber interface, an ATM interface, etc.; the user device can be a display (Display), a keyboard (Keyboard), etc.

[0100] The memory can be various types of storage media, such as random access memory (RAM), read-only memory (ROM), non-volatile RAM (NVRAM), flash memory, optical storage, hard disk, programmable ROM (PROM), erasable PROM (EPROM), electrically erasable PROM (EEPROM), and the like.

[0101] The processor can be a general-purpose processor, which can invoke a cross-resource allocation program stored in the memory and execute the cross-resource allocation method provided by the embodiments of the present application. For example, the general-purpose processor can be a central processing unit (CPU). The method executed when the cross-resource allocation program is invoked can refer to various embodiments of the cross-resource allocation method of the present application, and will not be described here.

[0102] Those skilled in the art can understand that the hardware structure shown in the above-mentioned embodiments is not a limitation of the present application, and can include more or less components than the illustrated components, or combine certain components, or different component arrangements. Figure 3

[0103] In a fourth aspect, the embodiments of the present application further provide a computer readable storage medium.

[0104] The computer readable storage medium of the present application stores a cross-resource allocation program, wherein the cross-resource allocation program is executed by the processor to implement the steps of the cross-resource allocation method as described above.

[0105] The method implemented when the cross-resource allocation program is executed can refer to various embodiments of the cross-resource allocation method of the present application, and will not be described here.

[0106] It should be noted that the above-mentioned sequence numbers of the embodiments of the present application are only for description, and do not represent the advantages and disadvantages of the embodiments.

[0107] ​The terms “include,” “comprise,” “have,” and any variations thereof, in the Specification and in the Claims of the present application, and the above-mentioned drawings, are intended to cover a non-exclusive inclusion. For example, a process, method, system, product, or device that includes a list of steps or units is not limited to the listed steps or units, but can optionally further include steps or units not listed, or can optionally further include other steps or units inherent to such processes, methods, products, or devices. The terms “first,” “second,” and “third” and the like descriptions are used to distinguish different objects, and do not represent a sequence or limit the types of “first,” “second,” and “third.”

[0108] In the description of the embodiments of the present application, “exemplary”, “for example”, or “for instance” is used to represent an example, an illustration, or a description. Any embodiment or design scheme described as “exemplary”, “for example”, or “for instance” in the embodiments of the present application should not be interpreted as more preferred or more advantageous than other embodiments or design schemes. Rather, the words “exemplary”, “for example”, or “for instance” are intended to present the relevant concept in a specific manner.

[0109] In the description of the embodiments of the present application, unless otherwise specified, “ / ” represents the meaning of or, for example, A / B can represent A or B; “and / or” in the text only represents a description of the relationship between the associated objects, which means that there can be three relationships, for example, A and / or B can represent the three cases of A alone, A and B together, and B alone. In addition, in the description of the embodiments of the present application, “multiple” means two or more than two.

[0110] In some of the processes described in the embodiments of the present application, a plurality of operations or steps are included in a specific order, but it should be understood that these operations or steps can be executed or performed in parallel or in an order different from that in which they appear in the embodiments of the present application. The serial number of the operation is only used to distinguish different operations, and the serial number itself does not represent any execution order. In addition, these processes can include more or fewer operations, and these operations or steps can be executed in sequence or in parallel, and these operations or steps can be combined.

[0111] From the above description of the embodiments, those skilled in the art can clearly understand that the above-mentioned embodiment method can be realized by means of software and a general hardware platform as required, of course, it can also be realized by hardware, but in many cases the former is a better embodiment. Based on such understanding, the technical solutions of the present application can be embodied in the form of a software product, which is stored in a storage medium (such as a ROM / RAM, a magnetic disk, an optical disk) as described above, and includes a plurality of instructions for causing a terminal device to execute the methods described in the embodiments of the present application.

[0112] The preferred embodiments of the present application have been described above with the illustrated embodiments, and are not intended to limit the scope of patent protection for the present application. Any equivalent structure or equivalent process variations, which directly or indirectly incorporate the contents of the specification and drawings of the present application, are also intended to be included within the scope of patent protection for the present application.

Claims

1. A method of cross resource allocation, the method comprising: The method comprises: According to the configuration information of each cross disk carrying OSU service, the current load of each cross disk is obtained, and then the current load weight of each cross disk is determined; The historical adjustment data and the remaining bandwidth of each cross disk are obtained to obtain the fragmentation risk factor of each cross disk, and then the fragmentation risk weight of each cross disk is determined; According to the current load of each cross disk, the predicted bandwidth of each cross disk is calculated, and then the predicted bandwidth weight of each cross disk is obtained; According to the current load weight, the fragmentation risk weight and the predicted bandwidth weight of each cross disk, the current comprehensive weight of each cross disk is calculated, and the OSU service is allocated to the cross disk with the highest current comprehensive weight.

2. The cross-resource allocation method of claim 1, wherein, After each OSU service allocation, it further comprises: The configuration information of the cross disk allocated with the OSU service is updated, and then the current load weight, the fragmentation risk weight and the predicted bandwidth weight of the cross disk are updated.

3. The cross-resource allocation method of claim 1, wherein, According to the current load weight, the fragmentation risk weight and the predicted bandwidth weight of a certain cross disk, the current comprehensive weight of the cross disk is calculated, which specifically comprises: The current load weight, the fragmentation risk weight and the predicted bandwidth weight of the cross disk are multiplied to obtain the current comprehensive weight of the cross disk.

4. The cross-resource allocation method of claim 1 or 3, wherein, The historical adjustment data comprises the historical adjustment times of bandwidth and the total amplitude of historical adjustment of bandwidth; the current aggregate weight of the jth cross-over disc is: wherein, is a current load weight, is a current load; is a fragmentation risk weight, a fragmentation risk factor , is a total bandwidth history adjustment magnitude, is a number of bandwidth history adjustments, is a remaining bandwidth; is a predicted bandwidth weight, is a predicted bandwidth; is a small positive number to avoid division by zero.

5. The cross-resource allocation method of claim 4, wherein, The predicted bandwidth at the t-th moment is: wherein, is the current load at time t-1, is the predicted bandwidth at time t-1, is a smoothing coefficient.

6. The cross-resource allocation method of claim 1, wherein, After calculating the current comprehensive weight of each cross disk, it further comprises: If the current comprehensive weights of multiple cross disks are the same and the highest, the OSU service is allocated to the cross disk with the highest current comprehensive weight and the smallest serial number.

7. The cross-resource allocation method of claim 1, wherein, Before the OSU service allocation, it further comprises: Cross disks with a remaining bandwidth smaller than the service bandwidth of the OSU service are excluded.

8. A cross resource allocation apparatus characterized by comprising: The device comprises: A first obtaining module is configured to obtain the current load of each cross disk according to the configuration information of each cross disk carrying OSU service, and then determine the current load weight of each cross disk; A second obtaining module is configured to obtain the historical adjustment data and the remaining bandwidth of each cross disk to obtain the fragmentation risk factor of each cross disk, and then determine the fragmentation risk weight of each cross disk; A third obtaining module is configured to calculate the predicted bandwidth of each cross disk according to the current load of each cross disk, and then obtain the predicted bandwidth weight of each cross disk; An allocation module is configured to calculate the current comprehensive weight of each cross disk according to the current load weight, the fragmentation risk weight and the predicted bandwidth weight of each cross disk, and allocate the OSU service to the cross disk with the highest current comprehensive weight.

9. A cross resource allocation apparatus, characterized by, The cross resource allocation device comprises a processor, a memory and a cross resource allocation program stored on the memory and executable by the processor, wherein when the cross resource allocation program is executed by the processor, the steps of the cross resource allocation method in any one of claims 1 to 7 are implemented.

10. A computer-readable storage medium, characterized in that, The cross resource allocation program is stored on the computer readable storage medium, wherein when the cross resource allocation program is executed by the processor, the steps of the cross resource allocation method in any one of claims 1 to 7 are implemented.

Images