A resource scheduling method, device, electronic device, and storage medium

Abstract

The present application provides a resource scheduling method, apparatus, electronic device and storage medium, including: determining a target scheduling area corresponding to a target resource according to pre-acquired protocol information, where the target scheduling area includes at least one first storage node and at least one second storage node, and the quality of service of the first storage node is better than that of the second storage node; receiving a resource acquisition request for the target resource from a target user terminal; when the target user terminal is within the coverage range of the target scheduling area, allocating the resource acquisition request to the first storage node so that the first storage node returns the target resource to the target user terminal; when the target user terminal is not within the coverage range of the target scheduling area, allocating the resource acquisition request to the second storage node so that the second storage node returns the target resource to the target user terminal. In this way, the provided service can meet the needs of the user terminal as much as possible and achieve reasonable resource allocation.

Description

Technical Field

[0001] This application relates to the field of communication technologies, and in particular, to a resource scheduling method, apparatus, electronic device, and storage medium. Background Art

[0002] A CDN (Content Delivery Network) is an intelligent virtual network built on top of the existing network. Relying on edge servers deployed in various locations, through functional modules such as load balancing, content distribution, and scheduling on the central platform, users can obtain the required content nearby, reducing network congestion and improving the user access response speed and hit rate. Among them, scheduling refers to allocating user requests to different servers or IDCs (Internet Data Centers) for processing according to relevant information of users and the scheduled area to meet the service quality, commercial value, traffic control, etc. requirements of different services.

[0003] In the prior art, the scheduling strategy of the central platform is usually determined based on a traffic control algorithm, and user requests are scheduled to servers or IDCs with different traffic limits according to a predetermined ratio. For example, if there are two IDCs in the scheduled area, with traffic limits of 100G and 60G respectively, then user requests of the same type will be allocated to these two IDCs in a ratio of 5:3.

[0004] However, in a scheduled area, there are often IDCs with better service quality and IDCs with worse service quality. In the above scheme, the scheduling strategy does not consider the service quality of IDCs. Therefore, user requests are likely to be scheduled to IDCs with worse service quality, making it difficult to guarantee the service quality obtained by users and thus affecting the user experience. Summary of the Invention

[0005] To solve the above technical problems, this application discloses a resource scheduling method, apparatus, electronic device, and storage medium to at least solve the problem that the software logic of the controller in related technologies is relatively complex and consumes a large amount of power, thereby resulting in a poor customer experience. The technical solutions of the present disclosure are as follows.

[0006] In a first aspect, this application discloses a resource scheduling method, and the method includes:

[0007] Determine a target scheduling area corresponding to a target resource according to pre-acquired protocol information, where the target scheduling area includes at least one first storage node and at least one second storage node, and the service quality of the first storage node is better than that of the second storage node;

[0008] Receive a resource acquisition request for the target resource from a target user terminal;

[0009] When the target user terminal is within the coverage of the target scheduling area, allocate the resource acquisition request to the first storage node, so that the first storage node returns the target resource to the target user terminal;

[0010] When the target user terminal is not within the coverage of the target scheduling area, allocate the resource acquisition request to the second storage node, so that the second storage node returns the target resource to the target user terminal.

[0011] Optionally, the determining the target scheduling area corresponding to the target resource according to the pre-acquired protocol information includes:

[0012] Determine candidate scheduling areas from multiple scheduling areas according to a preset selection rule, so that the content provider selects a target scheduling area for the target resource from the candidate scheduling areas;

[0013] Obtain protocol information, and determine the target scheduling area corresponding to the target resource according to the protocol information, where the protocol information carries information about the target resource and the target scheduling area.

[0014] Optionally, the determining candidate scheduling areas from multiple scheduling areas according to the preset selection rule includes:

[0015] Determine the number of storage nodes included in each scheduling area, the service quality and traffic limit redundancy of the storage nodes, and the traffic ratio between the storage nodes;

[0016] When there are at least two candidate storage nodes in any scheduling area whose difference in service quality satisfies a preset condition, the traffic ratio is less than a first preset threshold, and the traffic limit redundancy of the high-service-quality storage nodes among the candidate storage nodes is higher than a second preset threshold, determine the any scheduling area as a candidate scheduling area, determine the high-service-quality storage nodes among the candidate storage nodes as the first storage node, and determine the low-service-quality storage nodes among the candidate storage nodes as the second storage node.

[0017] Optionally, after allocating the resource acquisition request to the first storage node, the method further includes:

[0018] Receive feedback information from the first storage node;

[0019] Based on the feedback information, determine the remaining bearable capacity of the target scheduling area;

[0020] Obtain new protocol information, and return the step of determining the target scheduling area corresponding to the target resource according to the pre-obtained protocol information, where the traffic occupied by the user terminal served by the new protocol information on the first storage node does not exceed the remaining available capacity.

[0021] Optionally, the obtaining of the new protocol information includes:

[0022] Obtain multiple candidate protocol information and the corresponding metric values of each candidate protocol information;

[0023] Select the new protocol information from the candidate protocol information in descending order of the metric values, so that the traffic occupied by the user terminal served by the new protocol information on the first storage node does not exceed the remaining available capacity.

[0024] According to the second aspect of the embodiments of the present disclosure, there is provided a resource scheduling device, including:

[0025] A determination unit, configured to execute determining a target scheduling area corresponding to a target resource according to pre-obtained protocol information, where the target scheduling area includes at least one first storage node and at least one second storage node, and the quality of service of the first storage node is better than that of the second storage node;

[0026] A receiving unit, configured to execute receiving a resource acquisition request of the target user terminal for the target resource;

[0027] A first scheduling unit, configured to execute, when the target user terminal is within the coverage range of the target scheduling area, allocate the resource acquisition request to the first storage node, so that the first storage node returns the target resource to the target user terminal;

[0028] A second scheduling unit, configured to execute, when the target user terminal is not within the coverage range of the target scheduling area, allocate the resource acquisition request to the second storage node, so that the second storage node returns the target resource to the target user terminal.

[0029] Optionally, the determination unit is configured to execute:

[0030] Determine candidate scheduling areas from multiple scheduling areas according to a preset selection rule, so that a content provider selects a target scheduling area for the target resource from the candidate scheduling areas;

[0031] Obtain protocol information, and determine the target scheduling area corresponding to the target resource according to the protocol information, where the protocol information carries information about the target resource and the target scheduling area.

[0032] Optionally, the determining unit is configured to perform:

[0033] Determine the number of storage nodes included in each scheduling area, the quality of service and traffic ceiling redundancy of the storage nodes, and the traffic ratio between the storage nodes;

[0034] In the case that there are at least two candidate storage nodes in any scheduling area where the difference between the qualities of service satisfies a preset condition, the traffic ratio is less than a first preset threshold, and the traffic ceiling redundancy of the high-quality service storage nodes among the candidate storage nodes is higher than a second preset threshold, determine the any scheduling area as a candidate scheduling area, determine the high-quality service storage nodes among the candidate storage nodes as first storage nodes, and determine the low-quality service storage nodes among the candidate storage nodes as second storage nodes.

[0035] Optionally, the apparatus further includes a feedback unit configured to perform:

[0036] Receive feedback information from the first storage node;

[0037] Based on the feedback information, determine the remaining bearable capacity of the target scheduling area;

[0038] Obtain new protocol information, and return to the step of determining the target scheduling area corresponding to the target resource according to the pre-obtained protocol information, where the traffic occupied by the user terminal served by the new protocol information on the first storage node does not exceed the remaining bearable capacity.

[0039] Optionally, the feedback unit is specifically configured to perform:

[0040] Obtain multiple candidate protocol information and the corresponding metric values of each candidate protocol information;

[0041] Select new protocol information from the candidate protocol information in descending order of the metric values, so that the traffic occupied by the user terminal served by the new protocol information on the first storage node does not exceed the remaining bearable capacity.

[0042] According to a third aspect of the embodiments of the present disclosure, there is provided an electronic device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, where when the processor executes the program, the steps of the resource scheduling method as described in any one of the above are implemented.

[0043] According to a fourth aspect of the embodiments of the present disclosure, there is provided a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the steps of the resource scheduling method as described in any one of the above are implemented.

[0044] Compared with the prior art, the present application has the following advantages:

[0045] According to the pre-acquired protocol information, determine the target scheduling area corresponding to the target resource. The target scheduling area includes at least one first storage node and at least one second storage node, and the quality of service of the first storage node is better than that of the second storage node; receive a resource acquisition request for the target resource from the target user terminal; when the target user terminal is within the coverage of the target scheduling area, allocate the resource acquisition request to the first storage node so that the first storage node returns the target resource to the target user terminal; when the target user terminal is not within the coverage of the target scheduling area, allocate the resource acquisition request to the second storage node so that the second storage node returns the target resource to the target user terminal.

[0046] In this way, according to the protocol information, the quality of service requirements of different user terminals for the target resource can be determined. For user terminals within the coverage of the target scheduling area, the resource acquisition requests sent by them are scheduled to the first storage node with higher quality of service. For user terminals outside the coverage of the target scheduling area, the resource acquisition requests sent by them are scheduled to the second storage node with lower quality of service. That is to say, according to the pre-signed agreement, user terminals can be divided into those that require high-quality services and those that do not, and different user terminals are scheduled to different storage nodes, so that the provided services can meet the needs of user terminals as much as possible, thereby realizing the reasonable allocation of resources. BRIEF DESCRIPTION OF THE DRAWINGS

[0047] Figure 1 is a flowchart of the steps of a resource scheduling method of the present application;

[0048] Figure 2 is a logical schematic diagram of a resource scheduling method of the present application;

[0049] Figure 3 is a structural block diagram of a resource scheduling device of the present application;

[0050] Figure 4 is a schematic diagram of an electronic device of the present application. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0051] To make the above objects, features, and advantages of the present application more obvious and understandable, the present application will be further described in detail below with reference to the accompanying drawings and specific embodiments.

[0052] It should be noted that the terms "first", "second", etc. in the description, claims and above-mentioned drawings of the present disclosure are used to distinguish similar objects, and do not necessarily have to be used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged under appropriate circumstances so that the embodiments of the present disclosure described herein can be implemented in an order other than those illustrated or described herein. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present disclosure. On the contrary, they are merely examples of devices and methods consistent with some aspects of the present disclosure as detailed in the appended claims.

[0053] Referring to Figure 1 , a step flowchart of a resource scheduling method of the present application is shown, which may specifically include the following steps:

[0054] In step S11, according to the pre-acquired protocol information, a target scheduling area corresponding to the target resource is determined. The target scheduling area includes at least one first storage node and at least one second storage node, and the quality of service of the first storage node is better than that of the second storage node.

[0055] In a CDN network, the target resource is stored in different storage nodes within the scheduling area. After receiving a resource acquisition request sent by a user terminal, the scheduling server can allocate the resource acquisition request to different storage nodes, and then the storage nodes respond to the resource acquisition request and return the target resource. Among them, the storage node can be a server or an IDC device, and the target resource can be a video resource, or a data resource, a web page resource, and a text or image resource, etc., without specific limitation.

[0056] Generally, the scheduling strategy of the central platform is usually determined based on a traffic control algorithm, and user requests are scheduled to servers or IDCs with different traffic limits according to a predetermined ratio. For example, if there are two IDCs in the scheduling area, and their traffic limits are 100G and 60G respectively, then the same type of user requests will be scheduled to these two IDCs according to a ratio of 5:3. However, in the above solution, the scheduling strategy does not consider the quality of service of the IDC. Therefore, user requests are likely to be scheduled to IDCs with poor quality of service, making it difficult to guarantee the quality of service obtained by users and thus affecting the user experience.

[0057] It can be understood that due to limitations in distance, bandwidth, and traffic ceilings, the quality of service provided by different storage nodes varies. The quality of service can depend on metrics such as the transmission rate of the target resource and the latency at which the user terminal receives the target resource. Or, if the target resource is a video, then the quality of service can also be negatively correlated with the video's stuttering frequency. Specifically, the evaluation method of the quality of service can be set according to user needs. Based on the quality of service, the storage nodes in any scheduling area can be divided into first storage nodes and second storage nodes. In this disclosure, the quality of service of the first storage nodes is better than that of the second storage nodes.

[0058] In one implementation, the step of determining the target scheduling area corresponding to the target resource according to the pre-acquired protocol information may include: determining a candidate scheduling area from multiple scheduling areas according to a preset selection rule, so that the content provider selects the target scheduling area for the target resource from the candidate scheduling areas; obtaining the protocol information and determining the target scheduling area corresponding to the target resource according to the protocol information, where the protocol information carries information about the target resource and the target scheduling area.

[0059] That is to say, a resource acquisition agreement can be pre-signed with the content provider, and the candidate scheduling areas can be presented to the content provider. Then, the content provider can choose whether to require quality of service guarantee. If so, corresponding protocol information is generated. From the protocol information, the target scheduling area corresponding to the target resource can be determined. Among them, the products provided by the content provider (Content Provider, CP) are network content services, including various media contents such as text, images, audio, and video. In this way, different target resources and user terminals in different scheduling areas can be distinguished according to the protocol information signed with the content provider, and different scheduling strategies can be determined, thereby realizing the personalization of the scheduling strategy, which is conducive to meeting user needs.

[0060] For example, when playing the protocol of an on-demand video, the content provider can be allowed to choose whether to require quality of service guarantee and give the optional areas and the guarantee data of the optional areas, such as ensuring that the stuttering ratio of Jiangsu Telecom users is less than 2% or the stuttering ratio of Beijing Unicom users is less than 1%. The content provider can choose whether to require quality of service guarantee. Correspondingly, for those that need to be guaranteed, relevant fees can be charged. In this way, for users with different needs, corresponding resource scheduling schemes can be executed according to the guarantee data given by them to meet the needs of different users as much as possible.

[0061] Among them, according to the preset selection rules, the steps of determining candidate scheduling areas from multiple scheduling areas may include: determining the number of storage nodes included in each scheduling area, the quality of service and traffic ceiling redundancy of the storage nodes, and the traffic ratio between the storage nodes; when there are at least two candidate storage nodes in any scheduling area whose difference in quality of service meets the preset conditions, the traffic ratio is less than the first preset threshold, and the traffic ceiling redundancy of the high-quality service storage nodes among the candidate storage nodes is higher than the second preset threshold, any scheduling area is determined as a candidate scheduling area, the high-quality service storage nodes among the candidate storage nodes are determined as the first storage nodes, and the low-quality service storage nodes among the candidate storage nodes are determined as the second storage nodes.

[0062] That is to say, the candidate scheduling areas that can be used as target scheduling areas should have the following characteristics: there are storage nodes with distinct quality of service effects in the candidate scheduling area. In other words, there are storage nodes with relatively high quality of service and storage nodes with relatively low quality of service in the area. In this way, resource scheduling based on quality of service can be achieved; within the candidate scheduling area, the preset scheduling traffic ratios of different storage nodes with distinct quality of service effects are not overly disparate. It can be understood that user requests will ultimately be allocated according to the preset scheduling traffic ratios. If the preset scheduling traffic ratios are overly disparate, the space for adjusting the allocation of user requests is small, and most user requests will still be scheduled based on the preset scheduling traffic ratios, making it impossible to achieve the allocation process based on quality of service; there is redundancy in the traffic ceiling of the high-quality service storage nodes in the candidate scheduling area, and strict traffic control is not required. In this way, after allocating user requests to the high-quality service storage nodes, the normal operation of the high-quality service storage nodes can be maintained as much as possible, reducing the situation where the high-quality service storage nodes experience traffic overload and the quality of service deteriorates.

[0063] For example, if a scheduling area Z has only two IDCs, denoted as U and V respectively, and it is found that the proportions of users who experience at least one lag within 5 minutes when using U and V to watch videos are 8% and 1% respectively, then U and V can be considered as low-quality service IDC and high-quality service IDC respectively; if the traffic ratio of U and V is 2:1 and there is approximately 20% redundancy in the traffic ceiling of V, then Z can be used as a candidate scheduling area.

[0064] In step S12, a resource acquisition request for a target resource from a target user terminal is received.

[0065] When the target user terminal wants to obtain the target resource, it will send a resource acquisition request for the target resource. Among them, the resource acquisition request can be an http (Hyper Text Transfer Protocol) request. Then, the scheduling server will redirect the http request sent by the target user terminal to a specified storage node, so that the storage node returns the target resource to the target user terminal.

[0066] In step S13, when the target user terminal is within the coverage area of the target scheduling area, the resource acquisition request is allocated to the first storage node, so that the first storage node returns the target resource to the target user terminal.

[0067] In the present disclosure, if the target user terminal is within the coverage area of the target scheduling area, it indicates that the scheduling area to which the target user terminal belongs is the target scheduling area of the target resource specified in the protocol information, and the target resource requires quality of service guarantee within the target scheduling area. Then, the resource acquisition request can be allocated to the first storage node, so that the first storage node returns the target resource to the target user terminal. Since the first storage node is a storage node with a higher quality of service, it can provide better services for the target user terminal, the transmission of the target resource is smoother, and there is less lag.

[0068] In one implementation, after allocating the resource acquisition request to the first storage node, feedback information from the first storage node can also be received; based on the feedback information, the remaining available capacity of the target scheduling area is determined; new protocol information is obtained, and the step of determining the target scheduling area corresponding to the target resource according to the pre-obtained protocol information is returned, where the traffic occupied by the user terminals served by the new protocol information on the first storage node does not exceed the remaining available capacity.

[0069] That is to say, according to the feedback information, it can be determined how many resource acquisition requests that need to be allocated to the first storage node the target scheduling area can actually bear, and the remaining available capacity can be determined. Furthermore, it can be estimated how many resources can still be scheduled with high quality of service in the target scheduling area, and finally, it can be decided how many content providers can be signed agreements with.

[0070] For example, the feedback information may include information such as the current quality of service or the current traffic carried by the first storage node. Based on this information, the remaining available capacity of the target scheduling area can be determined. If the remaining available capacity is higher than a certain threshold, it means that the first storage node can still receive and process more resource acquisition requests; conversely, if the remaining available capacity is lower than a certain threshold, it means that the first storage node can no longer receive and process more resource acquisition requests. In this way, through dynamic traffic estimation and adjustment, the number of users that can be served can be continuously updated, and by gradually advancing in the process of signing agreements, the reasonable allocation of resources can be further achieved.

[0071] Among them, the step of obtaining new protocol information may include: obtaining multiple candidate protocol information and the corresponding metric values for each candidate protocol information; selecting new protocol information from the candidate protocol information in descending order of the metric values, so that the traffic occupied by the user terminals served by the new protocol information on the first storage node does not exceed the remaining available capacity. That is to say, if there are too many content providers requiring relevant services, a bidding mode based on metric values can be adopted to select a part of them from multiple candidate protocol information as the new protocol information. In this way, on the one hand, the revenue of the service provider can be increased, and on the other hand, the quality of service of the first storage node can also be maintained.

[0072] In step S14, in the case where the target user terminal is not within the coverage area of the target scheduling area, the resource acquisition request is allocated to the second storage node, so that the second storage node returns the target resource to the target user terminal.

[0073] In the present disclosure, if the target user terminal is not within the coverage area of the target scheduling area, it indicates that the scheduling area to which the target user terminal belongs is not the target scheduling area of the target resource specified in the protocol information, and the target resource does not require quality of service guarantee within the target scheduling area. Then, the resource acquisition request can be allocated to the second storage node, so that the second storage node returns the target resource to the target user terminal. Since the second storage node is a storage node with a lower quality of service, it can reduce the resource occupancy of the storage node with a high quality of service, ensure the traffic ratio between the storage nodes within the target scheduling area, and is conducive to maintaining the high-quality service provided by the first storage node.

[0074] Figure 2It is a logical schematic diagram of a resource scheduling method of the present application. First, through existing data, a feasible scheduling area can be found; then, agreements are signed with some content providers first; then, the scheduling server deploys a strategy. When the resources requested by users in a relevant area are videos that require quality of service guarantee, the user requests are allocated to the first storage node, otherwise, the user requests are allocated to the second storage node to ensure the traffic ratio; then, observe the traffic changes of the storage nodes, determine the remaining carrying capacity of the target scheduling area based on the feedback information, and gradually promote the signing of the agreement; furthermore, after determining the maximum amount that can be served in a certain area, if there are too many content providers that need relevant services, an auction model can be adopted.

[0075] As can be seen from the above, the technical solution provided by the embodiments of the present disclosure can determine the quality of service requirements of different user terminals for the target resources according to the protocol information. For user terminals within the coverage of the target scheduling area, the resource acquisition requests sent by them are scheduled to the first storage node with higher quality of service. For user terminals outside the coverage of the target scheduling area, the resource acquisition requests sent by them are scheduled to the second storage node with lower quality of service. That is to say, according to the pre-signed agreement, user terminals can be divided into those that need high-quality services and those that do not need high-quality services, and different user terminals are scheduled to different storage nodes, so that the provided services can meet the needs of user terminals as much as possible, thereby realizing the reasonable allocation of resources.

[0076] It should be noted that for the method embodiments, for the sake of simple description, they are all expressed as a series of action combinations. However, those skilled in the art should know that the present application is not limited by the described action sequence, because according to the present application, some steps can be carried out in other sequences or simultaneously. Secondly, those skilled in the art should also know that the embodiments described in the specification are all optional embodiments, and the actions involved are not necessarily required by the present application.

[0077] Refer to Figure 3 , which shows a structural block diagram of a resource scheduling device of the present application. The device may specifically include the following modules:

[0078] A determination unit 201, configured to execute determining a target scheduling area corresponding to a target resource according to pre-acquired protocol information, where the target scheduling area includes at least one first storage node and at least one second storage node, and the quality of service of the first storage node is better than that of the second storage node;

[0079] A receiving unit 202, configured to execute receiving a resource acquisition request of a target user terminal for the target resource;

[0080] The first scheduling unit 203 is configured to, when the target user terminal is within the coverage of the target scheduling area, allocate the resource acquisition request to the first storage node, so that the first storage node returns the target resource to the target user terminal;

[0081] The second scheduling unit 204 is configured to, when the target user terminal is not within the coverage of the target scheduling area, allocate the resource acquisition request to the second storage node, so that the second storage node returns the target resource to the target user terminal.

[0082] In one implementation, the determining unit 201 is configured to perform:

[0083] According to a preset selection rule, determine candidate scheduling areas from multiple scheduling areas, so that the content provider selects a target scheduling area for the target resource from the candidate scheduling areas;

[0084] Obtain protocol information, and determine the target scheduling area corresponding to the target resource according to the protocol information, where the protocol information carries information about the target resource and the target scheduling area.

[0085] In one implementation, the determining unit 201 is configured to perform:

[0086] Determine the number of storage nodes included in each scheduling area, the quality of service and traffic limit redundancy of the storage nodes, and the traffic ratio between the storage nodes;

[0087] When there are at least two candidate storage nodes in any scheduling area whose difference in quality of service satisfies a preset condition, the traffic ratio is less than a first preset threshold, and the traffic limit redundancy of the high-quality service storage nodes among the candidate storage nodes is higher than a second preset threshold, determine the any scheduling area as a candidate scheduling area, determine the high-quality service storage nodes among the candidate storage nodes as the first storage node, and determine the low-quality service storage nodes among the candidate storage nodes as the second storage node.

[0088] In one implementation, the device further includes a feedback unit, which is configured to perform:

[0089] Receive the feedback information of the first storage node;

[0090] Based on the feedback information, determine the remaining bearable capacity of the target scheduling area;

[0091] Obtain new protocol information, and return the step of determining the target scheduling area corresponding to the target resource according to the pre-obtained protocol information, where the traffic occupied by the user terminal served by the new protocol information on the first storage node does not exceed the remaining available capacity.

[0092] In one implementation manner, the feedback unit is specifically configured to execute:

[0093] Obtain multiple candidate protocol information and the corresponding metric values of each candidate protocol information;

[0094] Select new protocol information from the candidate protocol information in the order of the metric values from high to low, so that the traffic occupied by the user terminal served by the new protocol information on the first storage node does not exceed the remaining available capacity.

[0095] As can be seen from the above, the technical solution provided by the embodiments of the present disclosure can determine the service quality requirements of different user terminals for the target resource according to the protocol information. For the user terminals within the coverage area of the target scheduling area, the resource acquisition requests sent by them are scheduled to the first storage node with higher service quality. For the user terminals outside the coverage area of the target scheduling area, the resource acquisition requests sent by them are scheduled to the second storage node with lower service quality. That is to say, according to the pre-signed agreement, the user terminals can be divided into those that require high-quality services and those that do not require high-quality services, and different user terminals can be scheduled to different storage nodes, so that the provided services can meet the needs of the user terminals as much as possible, thereby realizing the reasonable allocation of resources.

[0096] For the device embodiments, since they are basically similar to the method embodiments, the description is relatively simple, and the relevant parts can refer to the partial description of the method embodiments.

[0097] Figure 4 It is a block diagram of an electronic device shown according to an exemplary embodiment.

[0098] In an exemplary embodiment, a computer-readable storage medium including instructions is also provided, such as a memory including instructions. The above instructions can be executed by a processor of an electronic device to complete the above method. Optionally, the computer-readable storage medium can be a ROM, a random access memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, and an optical audio playback device, etc.

[0099] In an exemplary embodiment, a computer program product is also provided. When it runs on a computer, it enables the computer to implement the above resource scheduling method.

[0100] As can be seen from the above, the technical solution provided by the embodiments of the present disclosure can determine the quality of service requirements of different user terminals for the target resource according to the protocol information. For user terminals within the coverage of the target scheduling area, the resource acquisition requests sent by them are scheduled to the first storage node with a higher quality of service. For user terminals outside the coverage of the target scheduling area, the resource acquisition requests sent by them are scheduled to the second storage node with a lower quality of service. That is to say, according to the pre-signed protocol, user terminals can be divided into those that require high-quality services and those that do not, and different user terminals are scheduled to different storage nodes, so that the provided services can meet the needs of user terminals as much as possible, thereby realizing the reasonable allocation of resources.

[0101] Each embodiment in this specification is described in a progressive manner. The key point of each embodiment is to illustrate the differences from other embodiments. The same or similar parts among the embodiments can be referred to each other.

[0102] Those skilled in the art should understand that the embodiments of the present application can be provided as a method, a device, or a computer program product. Therefore, the present application can take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present application can take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0103] The present application is described with reference to the flowcharts and / or block diagrams of methods, terminal devices (systems), and computer program products according to the present application. It should be understood that each process and / or block in the flowcharts and / or block diagrams, and the combination of processes and / or blocks in the flowcharts and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to the processors of general-purpose computers, special-purpose computers, embedded processors, or other programmable data processing terminal devices to generate a machine, so that the instructions executed by the processors of the computer or other programmable data processing terminal devices generate a machine for implementing the functions specified in Figure 1 one process or multiple processes and / or blocks Figure 1 one block or multiple blocks.

[0104] These computer program instructions can also be stored in a computer-readable memory that can direct a computer or other programmable data processing terminal device to work in a specific manner, so that the instructions stored in the computer-readable memory generate a manufactured article including an instruction device, and the instruction device implements the functions specified in Figure 1 one process or multiple processes and / or blocks Figure 1 one block or multiple blocks.

[0105] These computer program instructions can also be loaded onto a computer or other programmable data processing terminal device, so that a series of operation steps are executed on the computer or other programmable terminal device to generate a computer-implemented process. Thus, the instructions executed on the computer or other programmable terminal device provide steps for implementing the functions specified in one process or multiple processes and / or blocks Figure 1 one process or multiple processes and / or blocks Figure 1 steps of the functions specified in one block or multiple blocks.

[0106] Although the preferred embodiments of the present application have been described, those skilled in the art can make additional changes and modifications once they learn the basic creative concepts. Therefore, the appended claims are intended to be construed as including the preferred embodiments and all changes and modifications falling within the scope of the present application.

[0107] Finally, it should also be noted that in this article, relational terms such as first and second are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the term "comprising", "including" or any other variant thereof is intended to cover non-exclusive inclusion, so that a process, method, article or terminal device comprising a series of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such process, method, article or terminal device. Without further limitation, an element defined by the statement "comprising an..." does not exclude the presence of additional identical elements in the process, method, article or terminal device comprising the element.

[0108] The above has introduced in detail a resource scheduling method, device, electronic device and storage medium provided by the present application. Specific examples are used in this article to elaborate on the principle and implementation manner of the present application. The description of the above embodiments is only used to help understand the method and its core idea of the present application; at the same time, for those of ordinary skill in the art, according to the idea of the present application, there will be changes in the specific implementation manner and application scope. In summary, the content of this specification should not be construed as a limitation to the present application.

Claims

1. A resource scheduling method, characterized in that, it includes: According to the pre-acquired protocol information, determine the target scheduling area corresponding to the target resource, where the target scheduling area includes at least one first storage node and at least one second storage node, and the quality of service of the first storage node is better than that of the second storage node; Receive a resource acquisition request for the target resource from the target user terminal; When the target user terminal is within the coverage of the target scheduling area, allocate the resource acquisition request to the first storage node, so that the first storage node returns the target resource to the target user terminal; When the target user terminal is not within the coverage of the target scheduling area, allocate the resource acquisition request to the second storage node, so that the second storage node returns the target resource to the target user terminal.

2. The method according to claim 1, characterized in that, The step of determining the target scheduling area corresponding to the target resource according to the pre-acquired protocol information includes: According to a preset selection rule, determine candidate scheduling areas from multiple scheduling areas, so that the content provider selects the target scheduling area for the target resource from the candidate scheduling areas; Obtain the protocol information, and determine the target scheduling area corresponding to the target resource according to the protocol information, where the protocol information carries the information of the target resource and the target scheduling area.

3. The method according to claim 2, characterized in that, The step of determining candidate scheduling areas from multiple scheduling areas according to the preset selection rule includes: Determine the number of storage nodes included in each scheduling area, the quality of service and traffic limit redundancy of the storage nodes, and the traffic ratio between the storage nodes; When there are at least two candidate storage nodes in any scheduling area whose difference in quality of service satisfies a preset condition, the traffic ratio is less than a first preset threshold, and the traffic limit redundancy of the high-quality service storage nodes among the candidate storage nodes is higher than a second preset threshold, determine the any scheduling area as a candidate scheduling area, determine the high-quality service storage nodes among the candidate storage nodes as the first storage nodes, and determine the low-quality service storage nodes among the candidate storage nodes as the second storage nodes.

4. The method according to claim 1, characterized in that, After allocating the resource acquisition request to the first storage node, the method further includes: Receive the feedback information of the first storage node; Based on the feedback information, determine the remaining bearable capacity of the target scheduling area; Obtain new protocol information, and return to the step of determining the target scheduling area corresponding to the target resource according to the pre-acquired protocol information, where the traffic occupied by the user terminal served by the new protocol information on the first storage node does not exceed the remaining bearable capacity.

5. The method according to claim 4, characterized in that, The step of obtaining new protocol information includes: Obtain multiple candidate protocol information and the corresponding metric values of each candidate protocol information; Select new protocol information from the candidate protocol information in descending order of the said metric value, so that the traffic occupied by the user terminals served by the new protocol information on the first storage node does not exceed the remaining available capacity.

6. A resource scheduling device, characterized in that, it includes: A determination unit configured to determine a target scheduling area corresponding to a target resource according to pre-acquired protocol information, where the target scheduling area includes at least one first storage node and at least one second storage node, and the quality of service of the first storage node is better than that of the second storage node; A receiving unit configured to receive a resource acquisition request for the target resource from a target user terminal; A first scheduling unit configured to, when the target user terminal is within the coverage area of the target scheduling area, allocate the resource acquisition request to the first storage node, so that the first storage node returns the target resource to the target user terminal; A second scheduling unit configured to, when the target user terminal is not within the coverage area of the target scheduling area, allocate the resource acquisition request to the second storage node, so that the second storage node returns the target resource to the target user terminal.

7. The device according to claim 6, characterized in that, the determination unit is configured to: Determine candidate scheduling areas from multiple scheduling areas according to a preset selection rule, so that a content provider selects a target scheduling area for the target resource from the candidate scheduling areas; Obtain protocol information, and determine the target scheduling area corresponding to the target resource according to the protocol information, where the protocol information carries information about the target resource and the target scheduling area.

8. The device according to claim 7, characterized in that, the determination unit is configured to: Determine the number of storage nodes included in each scheduling area, the quality of service and traffic limit redundancy of the storage nodes, and the traffic ratio between the storage nodes; When there are at least two candidate storage nodes in any scheduling area whose difference in quality of service satisfies a preset condition, the traffic ratio is less than a first preset threshold, and the traffic limit redundancy of the high-quality service storage nodes among the candidate storage nodes is higher than a second preset threshold, determine the any scheduling area as a candidate scheduling area, determine the high-quality service storage nodes among the candidate storage nodes as the first storage nodes, and determine the low-quality service storage nodes among the candidate storage nodes as the second storage nodes.

9. The device according to claim 6, characterized in that, the device further includes a feedback unit configured to: Receive feedback information from the first storage node; Based on the feedback information, determine the remaining available capacity of the target scheduling area; Obtain new protocol information, and return to the step of determining the target scheduling area corresponding to the target resource according to the pre-acquired protocol information, where the traffic occupied by the user terminals served by the new protocol information on the first storage node does not exceed the remaining available capacity.

10. The device according to claim 9, wherein, the feedback unit is specifically configured to perform: obtain a plurality of candidate protocol information and the metric values corresponding to each candidate protocol information; select new protocol information from the candidate protocol information in descending order of the metric values, so that the traffic occupied by the user terminal served by the new protocol information on the first storage node does not exceed the remaining bearable amount.

11. An electronic device, comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein, when the processor executes the program, the steps of the resource scheduling method according to any one of claims 1 to 5 are implemented.

12. A computer-readable storage medium, wherein, a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the steps of the resource scheduling method according to any one of claims 1 to 5 are implemented.

Images