CN115604263A - Resource scheduling method and device, electronic equipment and storage medium - Google Patents
Resource scheduling method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN115604263A CN115604263A CN202211219780.XA CN202211219780A CN115604263A CN 115604263 A CN115604263 A CN 115604263A CN 202211219780 A CN202211219780 A CN 202211219780A CN 115604263 A CN115604263 A CN 115604263A
- Authority
- CN
- China
- Prior art keywords
- target
- scheduling
- storage node
- resource
- protocol information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
- H04N21/25—Management operations performed by the server for facilitating the content distribution or administrating data related to end-users or client devices, e.g. end-user or client device authentication, learning user preferences for recommending movies
- H04N21/262—Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists
- H04N21/26208—Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists the scheduling operation being performed under constraints
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Databases & Information Systems (AREA)
- Multimedia (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The application provides a resource scheduling method, a resource scheduling device, an electronic device and a storage medium, wherein the resource scheduling method comprises the following steps: determining a target scheduling area corresponding to a target resource according to protocol information acquired in advance, wherein the target scheduling area comprises at least one first storage node and at least one second storage node, and the service quality of the first storage node is superior to that of the second storage node; receiving a resource acquisition request of a target user terminal to a target resource; under the condition that the target user terminal is within the coverage of the target scheduling area, the resource acquisition request is distributed to the first storage node, so that the first storage node returns the target resource to the target user terminal; and under the condition that the target user terminal is not in the coverage 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. Therefore, the provided service can meet the requirements of the user terminal as much as possible and realize reasonable resource distribution.
Description
Technical Field
The present application relates to the field of communications technologies, and in particular, to a resource scheduling method and apparatus, an electronic device, and a storage medium.
Background
A Content Delivery Network (CDN) is an intelligent virtual Network constructed on the basis of an existing Network, and a user can obtain required Content nearby by using functional modules such as load balancing, content Delivery, scheduling and the like of a central platform by means of edge servers deployed in various places, so that Network congestion is reduced, and the access response speed and hit rate of the user are increased. The scheduling refers to allocating a user request to different servers or IDCs (Internet Data centers) for processing according to the user and related information of a scheduled area, so as to meet requirements of different services such as service quality, business value, flow control, and the like.
In the prior art, a scheduling policy of a central platform is generally determined based on a flow control algorithm, and a user request is scheduled to a server or an IDC with different upper flow limits according to a predetermined ratio, for example, if there are two IDCs in a scheduling area, and the upper flow limits of the two IDCs are 100G and 60G, respectively, then the user request of the same type will be scheduled to the two IDCs according to a ratio of 5.
However, in a scheduling area, there are often IDCs with better service quality and IDCs with poorer service quality, and in the above scheme, the scheduling policy does not consider the service quality of the IDCs, so that a user request is likely to be scheduled to the IDCs with poorer service quality, which makes it difficult to guarantee the service quality acquired by the user, thereby affecting the user experience.
Disclosure of Invention
In order to solve the above technical problems, the present application shows a resource scheduling method, an apparatus, an electronic device, and a storage medium, so as to at least solve the problem that in the related art, the software logic of a controller is relatively complex, and the consumption of power supply electric quantity is relatively large, which results in poor customer experience. The technical scheme of the disclosure is as follows: .
In a first aspect, the present application shows a resource scheduling method, where the method includes:
determining a target scheduling area corresponding to a target resource according to protocol information acquired in advance, wherein the target scheduling area comprises at least one first storage node and at least one second storage node, and the service quality of the first storage node is superior to that of the second storage node;
receiving a resource acquisition request of a target user terminal to the target resource;
under the condition that the target user terminal is within the coverage 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;
and under the condition that the target user terminal is not in the coverage 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.
Optionally, the determining, according to the protocol information acquired in advance, a target scheduling area corresponding to the target resource includes:
determining candidate scheduling areas from a plurality of scheduling areas according to a preset selection rule, so that a content provider selects a target scheduling area for a target resource from the candidate scheduling areas;
acquiring protocol information, and determining a target scheduling area corresponding to the target resource according to the protocol information, wherein the protocol information carries the information of the target resource and the target scheduling area.
Optionally, the determining, according to a preset selection rule, a candidate scheduling region from the multiple scheduling regions includes:
determining the number of storage nodes included in each scheduling region, the service quality and the traffic upper limit redundancy of the storage nodes and the traffic proportion among the storage nodes;
and under the condition that at least two candidate storage nodes exist in any scheduling region, wherein the difference value between the service qualities meets a preset condition, the flow ratio is smaller than a first preset threshold, and the upper limit redundancy of the flow of a high-service-quality storage node in the candidate storage nodes is higher than a second preset threshold, determining any scheduling region as a candidate scheduling region, determining a high-service-quality storage node in the candidate storage nodes as a first storage node, and determining a low-service-quality storage node in the candidate storage nodes as a second storage node.
Optionally, after the allocating the resource obtaining request to the first storage node, the method further includes:
receiving feedback information of the first storage node;
determining the residual bearable capacity of the target scheduling area based on the feedback information;
and acquiring new protocol information, and returning to the step of determining a target scheduling area corresponding to a target resource according to the pre-acquired protocol information, wherein the flow occupied by the user terminal served by the new protocol information in the first storage node does not exceed the residual bearable capacity.
Optionally, the acquiring new protocol information includes:
acquiring a plurality of candidate protocol information and an index value corresponding to each candidate protocol information;
and selecting new protocol information from the candidate protocol information according to the sequence of the index value from high to low, so that the flow occupied by the user terminal served by the new protocol information in the first storage node does not exceed the residual bearable capacity.
According to a second aspect of the embodiments of the present disclosure, there is provided a resource scheduling apparatus, including:
the system comprises a determining unit, a scheduling unit and a scheduling unit, wherein the determining unit is configured to determine a target scheduling area corresponding to a target resource according to protocol information acquired in advance, the target scheduling area comprises 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;
a receiving unit configured to perform receiving a resource acquisition request of a target user terminal for the target resource;
a first scheduling unit, configured to perform, in a case that the target user terminal is within the coverage 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;
a second scheduling unit, configured to perform, when the target user terminal is not within the coverage 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.
Optionally, the determining unit is configured to perform:
determining candidate scheduling regions from the plurality of scheduling regions according to a preset selection rule, so that a content provider selects a target scheduling region for a target resource from the candidate scheduling regions;
acquiring protocol information, and determining a target scheduling area corresponding to the target resource according to the protocol information, wherein the protocol information carries the information of the target resource and the target scheduling area.
Optionally, the determining unit is configured to perform:
determining the number of storage nodes included in each scheduling region, the service quality and the traffic upper limit redundancy of the storage nodes and the traffic proportion among the storage nodes;
and under the condition that at least two candidate storage nodes exist in any scheduling region, the difference value between the service qualities meets a preset condition, the flow ratio is smaller than a first preset threshold value, and the flow upper limit redundancy of a high-service-quality storage node in the candidate storage nodes is higher than a second preset threshold value, determining the any scheduling region as a candidate scheduling region, determining a high-service-quality storage node in the candidate storage nodes as a first storage node, and determining a low-service-quality storage node in the candidate storage nodes as a second storage node.
Optionally, the apparatus further includes a feedback unit configured to perform:
receiving feedback information of the first storage node;
determining the residual bearable capacity of the target scheduling area based on the feedback information;
and acquiring new protocol information, and returning to the step of determining a target scheduling area corresponding to a target resource according to the pre-acquired protocol information, wherein the flow occupied by the user terminal served by the new protocol information in the first storage node does not exceed the residual bearable capacity.
Optionally, the feedback unit is specifically configured to perform:
acquiring a plurality of candidate protocol information and an index value corresponding to each candidate protocol information;
and selecting new protocol information from the candidate protocol information according to the sequence of the index value from high to low, so that the flow occupied by the user terminal served by the new protocol information in the first storage node does not exceed the residual bearable capacity.
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, the processor implementing the steps of the resource scheduling method according to any one of the above items when executing the program.
According to a fourth aspect of the embodiments of the present disclosure, there is provided a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the resource scheduling method of any one of the above.
Compared with the prior art, the method has the following advantages:
determining a target scheduling area corresponding to a target resource according to protocol information acquired in advance, wherein the target scheduling area comprises at least one first storage node and at least one second storage node, and the service quality of the first storage node is superior to that of the second storage node; receiving a resource acquisition request of a target user terminal to a target resource; under the condition that the target user terminal is within the coverage range of the target scheduling area, allocating the resource acquisition request to a first storage node so that the first storage node returns the target resource to the target user terminal; and under the condition that the target user terminal is not in the coverage 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.
Therefore, according to the protocol information, the service quality requirements of different user terminals on the target resources can be determined, the resource acquisition requests sent by the user terminals in the coverage of the target scheduling region are scheduled to the first storage node with higher service quality, and the resource acquisition requests sent by the user terminals outside the coverage of the target scheduling region are scheduled to the second storage node with lower service quality, that is, the user terminals can be divided into the storage nodes which need high-quality service and the storage nodes which do not need high-quality service according to the pre-signed protocol, and different user terminals are scheduled to different storage nodes, so that the provided service can meet the requirements of the user terminals as much as possible, and the reasonable allocation of resources is realized.
Drawings
FIG. 1 is a flowchart illustrating steps of a resource scheduling method according to the present application;
FIG. 2 is a logic diagram of a resource scheduling method according to the present application;
fig. 3 is a block diagram of a resource scheduling apparatus according to the present application;
fig. 4 is a schematic diagram of an electronic device of the present application.
Detailed Description
In order to make the aforementioned objects, features and advantages of the present application more comprehensible, the present application is described in further detail with reference to the accompanying drawings and the detailed description.
It should be noted that the terms "first," "second," and the like in the description and claims of the present disclosure and in the above-described drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the disclosure described herein are capable of operation in other sequences than those illustrated or described herein. The implementations described in the exemplary embodiments below are not intended to represent all implementations consistent with the present disclosure. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the disclosure, as detailed in the appended claims.
Referring to fig. 1, a flowchart illustrating steps of a resource scheduling method according to the present application is shown, which specifically includes the following steps:
in step S11, a target scheduling area corresponding to the target resource is determined according to the protocol information acquired in advance, 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.
In a CDN network, a target resource is stored in different storage nodes in a scheduling area, a scheduling server may allocate a resource acquisition request to different storage nodes after receiving the resource acquisition request sent by a user terminal, and then the storage nodes respond to the resource acquisition request and return the target resource, where the storage nodes may be servers or IDC devices, and the target resource may be a video resource, a data resource, a web resource, a text or an image resource, and the like, and the details are not limited.
Generally, the scheduling policy of the central platform is usually determined based on a flow control algorithm, and the user requests are scheduled to servers or IDCs with different upper flow limits according to a predetermined ratio, for example, if there are two IDCs in the scheduling area, and the upper flow limits are 100G and 60G, respectively, then the user requests of the same type are scheduled to the two IDCs according to a ratio of 5. However, in the above scheme, the scheduling policy does not consider the service quality of the IDC, so that the user request is likely to be scheduled to the IDC with poor service quality, which makes it difficult to guarantee the service quality acquired by the user, thereby affecting the user experience.
It can be understood that, due to the limitations of the distance, the bandwidth, and the upper limit of the traffic, the service quality that different storage nodes can provide is different, and the service quality may depend on indexes such as the transmission rate of the target resource, the time delay of the user terminal receiving the target resource, and the like, or, if the target resource is a video, the service quality may also be negatively related to the video frequency, and specifically, the evaluation mode of the service quality may be set according to the user requirement. The storage nodes in any scheduling region may be divided into a first storage node and a second storage node based on quality of service, and in the present disclosure, the quality of service of the first storage node is superior to that of the second storage node.
In an implementation manner, the step of determining the target scheduling area corresponding to the target resource according to the protocol information acquired in advance may include: determining candidate scheduling areas from the plurality of scheduling areas according to a preset selection rule so that a content provider selects a target scheduling area for a target resource from the candidate scheduling areas; and acquiring protocol information, and determining a target scheduling area corresponding to the target resource according to the protocol information, wherein the protocol information carries the target resource and the information of the target scheduling area.
That is, a resource acquisition agreement may be previously signed with a content provider, and the candidate scheduling region may be displayed to the content provider, and then the content provider may select that service quality assurance is required or not required, if required, corresponding agreement information may be generated, and a target scheduling region corresponding to a target resource may be determined from the agreement information. Among them, the products provided by Content Providers (CPs) are network Content services, including various media contents such as text, image, audio and video. Therefore, 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 are determined, so that the personalization of the scheduling strategies is realized, and the user requirements are favorably met.
For example, when playing a video-on-demand protocol, the content provider can select whether service quality assurance is required, and provide assurance data of an optional area and an optional area, such as ensuring that the katton ratio of Jiangsu telecommunication users is less than 2% or the katton ratio of Beijing Unicom users is less than 1%. The content provider may choose to require or not require quality of service guarantees and accordingly, may charge a fee for those that require guarantees. Therefore, for users with different requirements, the corresponding resource scheduling scheme can be executed according to the given guarantee data, and the requirements of different users can be met as much as possible.
The step of determining a candidate scheduling region from the multiple scheduling regions according to a preset selection rule may include: determining the number of storage nodes included in each scheduling area, the service quality and the traffic upper limit redundancy of the storage nodes and the traffic proportion among the storage nodes; under the condition that a difference value between at least two service qualities in any scheduling region meets a preset condition and a candidate storage node with a flow ratio smaller than a first preset threshold exists, and the upper limit of the flow of a high-service-quality storage node in the candidate storage node is higher than a second preset threshold, determining any scheduling region as a candidate scheduling region, determining a high-service-quality storage node in the candidate storage node as a first storage node, and determining a low-service-quality storage node in the candidate storage node as a second storage node.
That is, the candidate scheduling region that can be the target scheduling region should have the following characteristics: the candidate scheduling region has storage nodes with a clear service quality effect, in other words, the region has storage nodes with high service quality and storage nodes with poor service quality, so that resource scheduling based on service quality can be realized; in the candidate scheduling region, the preset scheduling flow proportions of different storage nodes with distinct service quality effects are not too different, so that it can be understood that a user request is finally distributed according to the preset scheduling flow proportions, if the preset scheduling flow proportions are too different, the adjustable space for the distribution of the user request is small, most of the user requests can still be scheduled based on the preset scheduling flow proportions, and the distribution process based on the service quality cannot be realized; the upper limit of the flow of the high-service quality storage node in the candidate scheduling region is redundant, and strict flow control is not needed, so that after a user request is distributed to the high-service quality storage node, the normal operation of the high-service quality storage node can be maintained as far as possible, and the condition that the flow overload occurs on the high-service quality storage node to cause the reduction of the service quality is reduced.
For example, if only two IDCs are present in a scheduling area Z, and are respectively marked as U and V, it is found that the proportion of users watching video by using U and V that are stuck at least once in 5 minutes is 8% and 1%, respectively, then U and V can be considered as low quality of service IDC and high quality of service IDC, respectively; if the traffic ratio of U and V is 2.
In step S12, a resource acquisition request from the target user terminal to the target resource is received.
When a target user terminal wants to acquire a target resource, a resource acquisition request for the target resource is sent, where the resource acquisition request may be an http (Hyper Text Transfer Protocol) request, and then the scheduling server redirects 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.
In step S13, when the target ue is within the coverage of the target scheduling area, the resource obtaining request is allocated to the first storage node, so that the first storage node returns the target resource to the target ue.
In this disclosure, if the target user terminal is in the coverage of the target scheduling region, which indicates that the scheduling region to which the target user terminal belongs is the target scheduling region of the target resource specified in the protocol information, and the target resource needs to be guaranteed in the target scheduling region, the resource acquisition request may be allocated to the first storage node, so that the first storage node returns the target resource to the target user terminal. Because the first storage node is a storage node with higher service quality, better service can be provided for the target user terminal, the transmission of target resources is smoother, and the jamming is less.
In one implementation, after the resource acquisition request is allocated to the first storage node, feedback information of the first storage node may also be received; determining the residual bearable capacity of the target scheduling area based on the feedback information; and acquiring new protocol information, and returning to the step of determining a target scheduling area corresponding to the target resource according to the pre-acquired protocol information, wherein the flow occupied by the user terminal served by the new protocol information in the first storage node does not exceed the residual bearable capacity.
That is to say, it may be determined how many resource acquisition requests that need to be allocated to the first storage node can be carried by the target scheduling region according to the feedback information, and the remaining bearable amount is determined, and further, it may be estimated how many resources can be also implemented by the target scheduling region in terms of high qos scheduling, and finally, how many content providers can sign an agreement with the target scheduling region is determined.
For example, the feedback information may include information such as current service quality or current bearer traffic of the first storage node, and according to the information, the remaining bearer capacity of the target scheduling area may be determined, and if the remaining bearer capacity is higher than a certain threshold, it indicates that the first storage node may further receive and process more resource acquisition requests; conversely, if the remaining bearable capacity is lower than a certain threshold, it indicates that the first storage node has failed to receive and process more resource acquisition requests. Therefore, the user quantity which can be served can be continuously updated through the dynamic estimation and adjustment of the flow, and the reasonable allocation of resources is further realized by adopting a mode of gradually advancing in the link of signing an agreement.
The step of acquiring new protocol information may include: acquiring a plurality of candidate protocol information and an index value corresponding to each candidate protocol information; and selecting new protocol information from the candidate protocol information according to the sequence of the index values from high to low, so that the flow occupied by the user terminal served by the new protocol information in the first storage node does not exceed the residual bearable capacity. That is, if there are too many content providers that require the relevant service, a bid model based on an index value may be used to select a part of the candidate agreement information as new agreement information. In this way, on the one hand, the revenue of the service provider can be increased, and on the other hand, the service quality of the first storage node can be maintained.
In step S14, in the case that the target ue is not within the coverage of the target scheduling area, the resource obtaining request is allocated to the second storage node, so that the second storage node returns the target resource to the target ue.
In this disclosure, if the target user terminal is not in the coverage of the target scheduling region, which indicates that the scheduling region to which the target user terminal belongs is not the target scheduling region of the target resource specified in the protocol information, and the target resource does not need to be guaranteed in the target scheduling region by service quality, the resource acquisition request may be allocated to the second storage node, so that the second storage node returns the target resource to the target user terminal. Because the second storage node is a storage node with lower service quality, the resource occupation of the storage node with high service quality can be reduced, the flow proportion among the storage nodes in the target scheduling area is ensured, and the maintenance of high-quality service provided by the first storage node is facilitated.
Fig. 2 is a logic diagram of a resource scheduling method according to the present application. Firstly, a feasible scheduling area can be found out through the existing data; then, an agreement is signed with a part of content providers; then, a scheduling server deploys a strategy, when the resource requested by the user in the relevant region is a video needing service quality guarantee, the user request is distributed to a first storage node, otherwise, the user request is distributed to a second storage node to guarantee the flow proportion; then, observing the flow change of the storage nodes, determining the residual bearable capacity of the target scheduling area based on the feedback information, and gradually advancing the protocol signing; furthermore, after the maximum amount of services that can be served in a certain region is determined, if there are too many content providers that need the relevant services, a bidding mode may be employed.
As can be seen from the above, according to the technical solution provided in the embodiments of the present disclosure, according to protocol information, quality of service requirements of different user terminals on a target resource may be determined, for a user terminal within a coverage area of a target scheduling area, a resource acquisition request sent by the user terminal is scheduled to a first storage node with higher quality of service, and for a user terminal outside the coverage area of the target scheduling area, a resource acquisition request sent by the user terminal is scheduled to a second storage node with lower quality of service, that is, according to a pre-signed protocol, the user terminals may be divided into those requiring high quality service and those not requiring high quality service, and different user terminals are scheduled to different storage nodes, so that the provided service can meet the requirements of the user terminals as much as possible, thereby implementing reasonable allocation of resources.
It is noted that, for simplicity of explanation, the method embodiments are described as a series of acts or combination of acts, but those skilled in the art will appreciate that the present application is not limited by the order of acts, as some steps may, in accordance with the present application, occur in other orders and concurrently. Further, those skilled in the art will also appreciate that the embodiments described in the specification are exemplary and that no action is necessarily required in this application.
Referring to fig. 3, a block diagram of a resource scheduling apparatus according to the present application is shown, where the apparatus may specifically include the following modules:
a determining unit 201, configured to determine a target scheduling area corresponding to a target resource according to protocol information acquired in advance, where the target scheduling area includes at least one first storage node and at least one second storage node, and a quality of service of the first storage node is better than that of the second storage node;
a receiving unit 202, configured to perform receiving a resource acquisition request of a target user terminal for the target resource;
a first scheduling unit 203, configured to perform, in a case that the target user terminal is within the coverage 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;
a second scheduling unit 204, configured to perform, in a case that the target user terminal is not within the coverage 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 one implementation, the determining unit 201 is configured to perform:
determining candidate scheduling regions from the plurality of scheduling regions according to a preset selection rule, so that a content provider selects a target scheduling region for a target resource from the candidate scheduling regions;
acquiring protocol information, and determining a target scheduling area corresponding to the target resource according to the protocol information, wherein the protocol information carries the information of the target resource and the target scheduling area.
In one implementation, the determining unit 201 is configured to perform:
determining the number of storage nodes included in each scheduling region, the service quality and the traffic upper limit redundancy of the storage nodes and the traffic proportion among the storage nodes;
and under the condition that at least two candidate storage nodes exist in any scheduling region, wherein the difference value between the service qualities meets a preset condition, the flow ratio is smaller than a first preset threshold, and the upper limit redundancy of the flow of a high-service-quality storage node in the candidate storage nodes is higher than a second preset threshold, determining any scheduling region as a candidate scheduling region, determining a high-service-quality storage node in the candidate storage nodes as a first storage node, and determining a low-service-quality storage node in the candidate storage nodes as a second storage node.
In one implementation, the apparatus further includes a feedback unit configured to perform:
receiving feedback information of the first storage node;
determining the residual bearable capacity of the target scheduling area based on the feedback information;
and acquiring new protocol information, and returning to the step of determining a target scheduling area corresponding to a target resource according to the pre-acquired protocol information, wherein the flow occupied by the user terminal served by the new protocol information in the first storage node does not exceed the residual bearable capacity.
In one implementation, the feedback unit is specifically configured to perform:
acquiring a plurality of candidate protocol information and an index value corresponding to each candidate protocol information;
and selecting new protocol information from the candidate protocol information according to the sequence of the index value from high to low, so that the flow occupied by the user terminal served by the new protocol information in the first storage node does not exceed the residual bearable capacity.
As can be seen from the above, according to the technical solution provided in the embodiments of the present disclosure, according to protocol information, quality of service requirements of different user terminals on a target resource may be determined, for a user terminal within a coverage area of a target scheduling area, a resource acquisition request sent by the user terminal is scheduled to a first storage node with higher quality of service, and for a user terminal outside the coverage area of the target scheduling area, a resource acquisition request sent by the user terminal is scheduled to a second storage node with lower quality of service, that is, according to a pre-signed protocol, the user terminals may be divided into those requiring high quality service and those not requiring high quality service, and different user terminals are scheduled to different storage nodes, so that the provided service can meet the requirements of the user terminals as much as possible, thereby implementing reasonable allocation of resources.
For the device embodiment, since it is basically similar to the method embodiment, the description is simple, and for the relevant points, refer to the partial description of the method embodiment.
FIG. 4 is a block diagram of an electronic device shown in accordance with an example embodiment.
In an exemplary embodiment, a computer-readable storage medium comprising instructions, such as a memory comprising instructions, executable by a processor of an electronic device to perform the above-described method is also provided. Alternatively, the computer-readable storage medium may be a ROM, a Random Access Memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical audio playback device, and the like.
In an exemplary embodiment, a computer program product is also provided, which, when run on a computer, causes the computer to implement the method of resource scheduling described above.
As can be seen from the above, according to the technical solution provided in the embodiments of the present disclosure, according to protocol information, quality of service requirements of different user terminals on a target resource may be determined, for a user terminal within a coverage area of a target scheduling area, a resource acquisition request sent by the user terminal is scheduled to a first storage node with higher quality of service, and for a user terminal outside the coverage area of the target scheduling area, a resource acquisition request sent by the user terminal is scheduled to a second storage node with lower quality of service, that is, according to a pre-signed protocol, the user terminals may be divided into those requiring high quality service and those not requiring high quality service, and different user terminals are scheduled to different storage nodes, so that the provided service can meet the requirements of the user terminals as much as possible, thereby implementing reasonable allocation of resources.
The embodiments in the present specification are all described in a progressive manner, and each embodiment focuses on differences from other embodiments, and portions that are the same and similar between the embodiments may be referred to each other.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, apparatus, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and so forth) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, terminal devices (systems), and computer program products according to the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing terminal to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing terminal, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing terminal to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing terminal to cause a series of operational steps to be performed on the computer or other programmable terminal to produce a computer implemented process such that the instructions which execute on the computer or other programmable terminal provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While the preferred embodiments of the present application have been described, additional variations and modifications of these embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all alterations and modifications as fall within the scope of the application.
Finally, it should also be noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or terminal that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or terminal. Without further limitation, an element defined by the phrases "comprising one of 8230; \8230;" 8230; "does not exclude the presence of additional like elements in a process, method, article, or terminal device that comprises the element.
The resource scheduling method, the resource scheduling device, the electronic device, and the storage medium provided by the present application are introduced in detail, and specific examples are applied in the present application to explain the principles and embodiments of the present application, and the descriptions of the above embodiments are only used to help understand the method and the core idea of the present application; meanwhile, for a person skilled in the art, according to the idea of the present application, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present application.
Claims (12)
1. A method for scheduling resources, comprising:
determining a target scheduling area corresponding to a target resource according to protocol information acquired in advance, wherein the target scheduling area comprises at least one first storage node and at least one second storage node, and the service quality of the first storage node is superior to that of the second storage node;
receiving a resource acquisition request of a target user terminal to the target resource;
under the condition that 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;
and under the condition that the target user terminal is not in 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.
2. The method according to claim 1, wherein the determining the target scheduling region corresponding to the target resource according to the protocol information acquired in advance comprises:
determining candidate scheduling regions from the plurality of scheduling regions according to a preset selection rule, so that a content provider selects a target scheduling region for a target resource from the candidate scheduling regions;
acquiring protocol information, and determining a target scheduling area corresponding to the target resource according to the protocol information, wherein the protocol information carries the information of the target resource and the target scheduling area.
3. The method according to claim 2, wherein the determining the candidate scheduling region from the plurality of scheduling regions according to a preset selection rule comprises:
determining the number of storage nodes included in each scheduling region, the service quality and the traffic upper limit redundancy of the storage nodes and the traffic proportion among the storage nodes;
and under the condition that at least two candidate storage nodes exist in any scheduling region, wherein the difference value between the service qualities meets a preset condition, the flow ratio is smaller than a first preset threshold, and the upper limit redundancy of the flow of a high-service-quality storage node in the candidate storage nodes is higher than a second preset threshold, determining any scheduling region as a candidate scheduling region, determining a high-service-quality storage node in the candidate storage nodes as a first storage node, and determining a low-service-quality storage node in the candidate storage nodes as a second storage node.
4. The method of claim 1, wherein after said allocating said resource acquisition request to said first storage node, said method further comprises:
receiving feedback information of the first storage node;
determining the remaining bearable capacity of the target scheduling area based on the feedback information;
and acquiring new protocol information, and returning to the step of determining a target scheduling area corresponding to a target resource according to the pre-acquired protocol information, wherein the flow occupied by the user terminal served by the new protocol information in the first storage node does not exceed the residual bearable capacity.
5. The method of claim 4, wherein obtaining new protocol information comprises:
acquiring a plurality of candidate protocol information and an index value corresponding to each candidate protocol information;
and selecting new protocol information from the candidate protocol information according to the sequence of the index value from high to low, so that the flow occupied by the user terminal served by the new protocol information in the first storage node does not exceed the residual bearable capacity.
6. A resource scheduling apparatus, comprising:
the system comprises a determining unit, a scheduling unit and a scheduling unit, wherein the determining unit is configured to determine a target scheduling area corresponding to a target resource according to protocol information acquired in advance, the target scheduling area comprises 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;
a receiving unit configured to perform receiving a resource acquisition request of a target user terminal for the target resource;
a first scheduling unit, configured to perform, in a case that the target user terminal is within the coverage 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;
a second scheduling unit, configured to perform, when the target user terminal is not within the coverage 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.
7. The apparatus of claim 6, wherein the determining unit is configured to perform:
determining candidate scheduling areas from a plurality of scheduling areas according to a preset selection rule, so that a content provider selects a target scheduling area for a target resource from the candidate scheduling areas;
acquiring protocol information, and determining a target scheduling area corresponding to the target resource according to the protocol information, wherein the protocol information carries the information of the target resource and the target scheduling area.
8. The apparatus of claim 7, wherein the determining unit is configured to perform:
determining the number of storage nodes included in each scheduling region, the service quality and the traffic upper limit redundancy of the storage nodes and the traffic proportion among the storage nodes;
and under the condition that at least two candidate storage nodes exist in any scheduling region, the difference value between the service qualities meets a preset condition, the flow ratio is smaller than a first preset threshold value, and the flow upper limit redundancy of a high-service-quality storage node in the candidate storage nodes is higher than a second preset threshold value, determining the any scheduling region as a candidate scheduling region, determining a high-service-quality storage node in the candidate storage nodes as a first storage node, and determining a low-service-quality storage node in the candidate storage nodes as a second storage node.
9. The apparatus of claim 6, further comprising a feedback unit configured to perform:
receiving feedback information of the first storage node;
determining the residual bearable capacity of the target scheduling area based on the feedback information;
and acquiring new protocol information, and returning to the step of determining a target scheduling area corresponding to a target resource according to the pre-acquired protocol information, wherein the flow occupied by the user terminal served by the new protocol information in the first storage node does not exceed the residual bearable capacity.
10. The apparatus according to claim 9, wherein the feedback unit is specifically configured to perform:
acquiring a plurality of candidate protocol information and an index value corresponding to each candidate protocol information;
and selecting new protocol information from the candidate protocol information according to the sequence of the index values from high to low so that the flow occupied by the user terminal served by the new protocol information in the first storage node does not exceed the residual bearable capacity.
11. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the steps of the resource scheduling method according to any of claims 1 to 5 when executing the program.
12. A computer-readable storage medium, having stored thereon a computer program which, when being executed by a processor, carries out the steps of the resource scheduling method according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211219780.XA CN115604263A (en) | 2022-09-30 | 2022-09-30 | Resource scheduling method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211219780.XA CN115604263A (en) | 2022-09-30 | 2022-09-30 | Resource scheduling method and device, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115604263A true CN115604263A (en) | 2023-01-13 |
Family
ID=84844064
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211219780.XA Pending CN115604263A (en) | 2022-09-30 | 2022-09-30 | Resource scheduling method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115604263A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116708035A (en) * | 2023-08-07 | 2023-09-05 | 钛合联(深圳)科技有限公司 | Network data security encryption method and system |
-
2022
- 2022-09-30 CN CN202211219780.XA patent/CN115604263A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116708035A (en) * | 2023-08-07 | 2023-09-05 | 钛合联(深圳)科技有限公司 | Network data security encryption method and system |
| CN116708035B (en) * | 2023-08-07 | 2023-10-03 | 钛合联(深圳)科技有限公司 | Network data security encryption method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110300184B (en) | Edge node distribution method, device, scheduling server and storage medium | |
| US11178062B2 (en) | Orchestrating physical and virtual resources for delivering digital contents | |
| AU2013351670B2 (en) | Business scheduling method and apparatus and convergence device | |
| US10432709B2 (en) | Load balancing method, load balancing system, load balancing device and topology reduction method | |
| CN110336885B (en) | Edge node distribution method, device, scheduling server and storage medium | |
| EP3547625B1 (en) | Method and system for sending request for acquiring data resource | |
| EP2976887A1 (en) | Bandwidth management for over-the-top adaptive streaming | |
| US10484463B2 (en) | Load balancing system, load balancing device and topology management method | |
| CN105897836A (en) | Back source request processing method and device | |
| WO2015096680A1 (en) | Node distribution method and control center | |
| CN103532873B (en) | flow control policy applied to distributed file system | |
| CN108566370A (en) | A kind of method and device of data Hui Yuan | |
| CN110545450B (en) | Node distribution method, system, electronic equipment and storage medium | |
| CN115604263A (en) | Resource scheduling method and device, electronic equipment and storage medium | |
| CN108282668B (en) | Video acquisition method and system | |
| EP2007102A1 (en) | Content-on-demand method and network therefor | |
| CN105847183A (en) | Bandwidth distribution method of content distribution network and bandwidth distribution system of content distribution network | |
| CN106209952A (en) | Service node distribution method, device, CDN management server and system | |
| Sahoo et al. | Greedy heuristic for replica server placement in cloud based content delivery networks | |
| CN110191362B (en) | Data transmission method and device, storage medium and electronic equipment | |
| Da Silva et al. | MUSLIN: Achieving high, fairly shared QoE through multi-source live streaming | |
| CN115580568B (en) | Method and system for realizing network service quality guarantee based on IPv6 flow label | |
| JP6276206B2 (en) | Bandwidth allocation control device and bandwidth allocation control method | |
| CN108055596B (en) | Method and system for guaranteeing specific user flow | |
| US20140215075A1 (en) | Load balancing apparatus and method based on estimation of resource usage |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |