CN117135126A - Request scheduling method and device for content distribution network - Google Patents

Request scheduling method and device for content distribution network Download PDF

Info

Publication number
CN117135126A
CN117135126A CN202310960984.7A CN202310960984A CN117135126A CN 117135126 A CN117135126 A CN 117135126A CN 202310960984 A CN202310960984 A CN 202310960984A CN 117135126 A CN117135126 A CN 117135126A
Authority
CN
China
Prior art keywords
target
edge node
scheduling
node
request
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
Application number
CN202310960984.7A
Other languages
Chinese (zh)
Inventor
唐龙龙
郝兆军
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Kingsoft Cloud Network Technology Co Ltd
Original Assignee
Beijing Kingsoft Cloud Network Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Kingsoft Cloud Network Technology Co Ltd filed Critical Beijing Kingsoft Cloud Network Technology Co Ltd
Priority to CN202310960984.7A priority Critical patent/CN117135126A/en
Publication of CN117135126A publication Critical patent/CN117135126A/en
Pending legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
    • H04L47/6265—Queue scheduling characterised by scheduling criteria for service slots or service orders past bandwidth allocation
    • 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/50—Network services
    • H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
    • H04L67/63—Routing a service request depending on the request content or context

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The application relates to a request scheduling method and device of a content distribution network. The method comprises the following steps: receiving a scheduling request of a current edge node, wherein the scheduling request is a request sent by the current edge node when a plurality of target requests are received and meet a triggering condition, and the scheduling request comprises a target bandwidth value which is used for indicating the bandwidth value required by the current edge node; determining at least one target edge node from a plurality of edge nodes according to the target bandwidth value, wherein the target edge node is provided with a scheduling bandwidth; and sending a feedback message to the current edge node, wherein the feedback message comprises the node identification of the target edge node and the scheduling bandwidth value of the scheduling bandwidth provided by the target edge node. The application solves the technical problem of high pressure of the central node in the CDN request scheduling process.

Description

Request scheduling method and device for content distribution network
Technical Field
The present application relates to the field of content distribution, and in particular, to a method and apparatus for scheduling requests in a content distribution network.
Background
In the prior art, a content delivery network (Content Delivery Network, CDN) involves a 302 scheduling situation, where the 302 scheduling refers to a situation where, when a request received by an edge node of the CDN exceeds the processing capability of the node, a part of requests are scheduled to other nodes and processed by the other nodes.
The existing 302 scheduling process is to direct the customer traffic to the center through a domain name system (Domain Name System, DNS), where the center gives 302 an address, and finally directs the customer traffic to the corresponding node. However, in the above process, all the requests to be scheduled need to be given to the center first and then scheduled to other nodes, so that the stress of the center node is too high.
Disclosure of Invention
The application provides a request scheduling method and device of a content distribution network, which are used for solving the technical problem that a central node is high in pressure in the CDN request scheduling process.
In a first aspect, the present application provides a method for scheduling requests of a content distribution network, including: receiving a scheduling request of a current edge node, wherein the scheduling request is a request sent when the current edge node receives a plurality of target requests and the plurality of target requests meet a triggering condition, and the scheduling request comprises a target bandwidth value which is used for indicating a bandwidth value required by the current edge node; determining at least one target edge node from a plurality of edge nodes according to the target bandwidth value, wherein the target edge node is provided with a scheduling bandwidth; and sending a feedback message to the current edge node, wherein the feedback message comprises the node identification of the target edge node and the scheduling bandwidth value of the scheduling bandwidth provided by the target edge node.
In a second aspect, the present application further provides a request scheduling method of a content distribution network, including: when a current edge node receives a plurality of target requests and the plurality of target requests meet a trigger condition, sending a scheduling request to a central node, wherein the scheduling request comprises a target bandwidth value, and the target bandwidth value is used for indicating a bandwidth value required by the current edge node; receiving a feedback message of the central node, wherein the feedback message comprises a node identifier of a target edge node and a scheduling bandwidth value provided by the target edge node, and the target edge node is determined according to the target bandwidth value; and scheduling part of the target requests in the plurality of target requests to the target edge node according to the scheduling bandwidth value.
In a third aspect, the present application provides a request scheduling apparatus of a content distribution network, comprising: a receiving module, configured to receive a scheduling request of a current edge node, where the scheduling request is a request sent when the current edge node receives a plurality of target requests and the plurality of target requests meet a trigger condition, and the scheduling request includes a target bandwidth value, where the target bandwidth value is used to indicate a bandwidth value required by the current edge node; a determining module, configured to determine at least one target edge node from a plurality of edge nodes according to the target bandwidth value, where the target edge node is provided with a scheduling bandwidth; and the sending module is used for sending a feedback message to the current edge node, wherein the feedback message comprises the node identification of the target edge node and the scheduling bandwidth value of the scheduling bandwidth provided by the target edge node.
As an alternative example, the determining module includes: the determining unit is used for determining a first edge node with a schedulable bandwidth in all edge nodes according to the node logs acquired from all the edge nodes; and selecting at least one target edge node from all the first edge nodes according to the schedulable bandwidth of the first edge nodes, and determining a scheduling bandwidth value of each target edge node.
As an alternative example, the determining unit includes: a determining subunit, configured to sort the first edge node according to the schedulable bandwidth of the first edge node; determining the first N first edge nodes of the sequencing result as the target edge nodes, wherein N is determined according to the number of the first edge nodes; and determining a bandwidth value of a schedulable bandwidth corresponding to each target edge node in a preset proportion as the scheduling bandwidth value, wherein the smaller the number of received requests of the target edge node in unit time is, the larger the preset proportion of the target edge node is.
As an alternative example, the apparatus further includes: the monitoring module is used for monitoring the scheduling bandwidth of each target edge node after sending feedback information to the current edge node; and in the case that the scheduling bandwidth is not fully used within a predetermined time period, determining the unused scheduling bandwidth as a schedulable bandwidth.
In a fourth aspect, the present application also provides a request scheduling apparatus of a content distribution network, including: the device comprises a sending module, a central node and a receiving module, wherein the sending module is used for sending a scheduling request to the central node under the condition that a plurality of target requests are received by a current edge node and meet a triggering condition, wherein the scheduling request comprises a target bandwidth value, and the target bandwidth value is used for indicating a bandwidth value required by the current edge node; the receiving module is used for receiving the feedback message of the central node, wherein the feedback message comprises a node identifier of a target edge node and a scheduling bandwidth value provided by the target edge node, and the target edge node is determined according to the target bandwidth value; and the scheduling module is used for scheduling part of the target requests in the plurality of target requests to the target edge node according to the scheduling bandwidth value.
As an alternative example, the scheduling module includes: the scheduling unit is used for determining a first request which is allowed to be scheduled from the target requests; determining a first bandwidth value of the first request; and dispatching the request with the proportion in the first request to the target edge node according to the proportion of the dispatching bandwidth value of the target edge node to the first bandwidth value.
As an alternative example, the scheduling unit includes: a scheduling subunit, configured to determine each of the target edge nodes as a current target edge node, and perform the following operations: determining a current ratio of the scheduling bandwidth value of the current target edge node to the first bandwidth value; randomly selecting the request of the current proportion from the first request under the condition that the current proportion is less than or equal to 1, and scheduling the selected request to the current target edge node; and in the case that the current proportion is greater than 1, scheduling all the first requests to the current target edge node.
As an alternative example, the transmitting module includes: a sending unit, configured to send the scheduling request to the central node when the number of the plurality of target requests exceeds a preset number; or sending the scheduling request to a central node under the condition that the occupation value of the central processor of the current edge node exceeds a preset threshold value; and sending the scheduling request to the central node under the condition that the total request bandwidth value requested by the target requests exceeds the node bandwidth value of the current edge node, wherein the node bandwidth value is set by the central node for the current edge node.
In a fifth aspect, the present application provides an electronic device, comprising: at least one communication interface; at least one bus connected to the at least one communication interface; at least one processor coupled to the at least one bus; at least one memory coupled to the at least one bus, wherein the memory stores a computer program, and the processor is configured to implement the request scheduling method of any one of the content distribution networks described above when executing the computer program.
In a sixth aspect, the present application also provides a computer storage medium storing computer executable instructions for performing the method for scheduling requests of the content distribution network according to any one of the above aspects of the present application.
Compared with the prior art, the technical scheme provided by the embodiment of the application has the following advantages: according to the method provided by the embodiment of the application, after the current edge node receives the target request, if the target request exceeds the processing capacity of the current edge node, the current edge node sends the scheduling request to the center node, the center node feeds back the target edge node to the current edge node, and the current edge node can schedule part of the request to the target edge node, so that the target request does not need to reach the center node, and the pressure of the center node is reduced.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the application and together with the description, serve to explain the principles of the application.
In order to more clearly illustrate the embodiments of the application or the technical solutions of the prior art, the drawings which are used in the description of the embodiments or the prior art will be briefly described, and it will be obvious to a person skilled in the art that other drawings can be obtained from these drawings without inventive effort.
One or more embodiments are illustrated by way of example and not limitation in the figures of the accompanying drawings, in which like references indicate similar elements, and in which the figures of the drawings are not to be taken in a limiting sense, unless otherwise indicated.
Fig. 1 is a flowchart of a request scheduling method of a content distribution network according to an embodiment of the present application;
fig. 2 is a flowchart of another method for scheduling requests in a content distribution network according to an embodiment of the present application;
fig. 3 is a flowchart of a request scheduling method of a content distribution network according to still another embodiment of the present application;
fig. 4 is a flowchart of a request scheduling method of a content distribution network according to still another embodiment of the present application;
fig. 5 is a flowchart of a request scheduling method of a content distribution network according to still another embodiment of the present application;
fig. 6 is a schematic scheduling diagram of a request scheduling method of a content distribution network according to an embodiment of the present application;
fig. 7 is a schematic diagram of a request quota of another method for scheduling requests of a content distribution network according to an embodiment of the present application;
fig. 8 is a schematic structural diagram of a request scheduling device of a content distribution network according to an embodiment of the present application;
fig. 9 is a schematic structural diagram of a request scheduling device of another content distribution network according to an embodiment of the present application;
fig. 10 is a schematic diagram of an electronic device according to an embodiment of the present application.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present application more apparent, the technical solutions of the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application, and it is apparent that the described embodiments are some embodiments of the present application, but not all embodiments of the present application. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.
The following disclosure provides many different embodiments, or examples, for implementing different structures of the application. In order to simplify the present disclosure, components and arrangements of specific examples are described below. They are, of course, merely examples and are not intended to limit the application. Furthermore, the present application may repeat reference numerals and/or letters in the various examples. This repetition is for the purpose of simplicity and clarity and does not in itself dictate a relationship between the various embodiments and/or configurations discussed.
Fig. 1 is a flowchart of a request scheduling method of a content distribution network according to an embodiment of the present application. As shown in fig. 1, the request scheduling method of the content distribution network includes:
s102, receiving a scheduling request of a current edge node, wherein the scheduling request is a request sent by the current edge node when a plurality of target requests are received and meet a triggering condition, and the scheduling request comprises a target bandwidth value which is used for indicating the bandwidth value required by the current edge node;
s104, determining at least one target edge node from a plurality of edge nodes according to the target bandwidth value, wherein the target edge node is provided with a scheduling bandwidth;
and S106, sending a feedback message to the current edge node, wherein the feedback message comprises the node identification of the target edge node and the scheduling bandwidth value of the scheduling bandwidth provided by the target edge node.
The request scheduling method of the content distribution network is applied to the central node, and the current edge node requests the target edge node by sending a request to the central node, so that a part of requests of the target request are scheduled to the target edge node.
The application also provides a request scheduling method of the content distribution network applied to the current edge node, as shown in fig. 2, comprising the following steps:
s202, sending a scheduling request to a central node under the condition that a plurality of target requests are received by a current edge node and meet triggering conditions, wherein the scheduling request comprises a target bandwidth value which is used for indicating the bandwidth value required by the current edge node;
s204, receiving a feedback message of the central node, wherein the feedback message comprises a node identifier of a target edge node and a scheduling bandwidth value provided by the target edge node, and the target edge node is determined according to the target bandwidth value;
s206, scheduling part of target requests in the plurality of target requests to the target edge node according to the scheduling bandwidth value.
The description is made in connection with the current edge node and the center node.
The current edge node may be any one of the edge nodes. The edge node can be a network node with fewer intermediate links from the user access, and has better response capability and connection speed for the final access user. The current edge node may receive a target request, which is an edge user initiated request using CDN acceleration services. The target request corresponds to a certain flow value, and the flow value is the usage of the flow in a certain time, for example 1024kb/s, which means that the flow with the size of 1024kb is used every second. The bandwidth value per unit time is 1M (1024 kb=1m). After the current edge node receives the plurality of target requests, the plurality of target requests can correspond to a total request bandwidth value, wherein the total request bandwidth value is the total value of bandwidth values requested by all target requests received by the current edge node, the current edge node corresponds to a node bandwidth value, and the node bandwidth value can be a proper bandwidth value independently designated by the central node as an edge node and used for indicating the processing capacity of the edge node, and if the node bandwidth value is exceeded, the edge node cannot process and needs to perform scheduling processing.
There are various ways in which the plurality of target requests satisfy the trigger condition, and as one of the ways, the trigger condition may be considered to be satisfied in a case where the total request bandwidth value of the plurality of target requests is greater than the node bandwidth value of the current edge node. The current edge node receives a plurality of target requests, for example, 100 target requests, the total request bandwidth value (total bandwidth size of requests) of the 100 target requests is 80M, the node bandwidth value of the current edge node is 50M, the total request bandwidth value requested by the plurality of target requests is greater than the node bandwidth value of the current edge node, in this case, the current edge node determines the target bandwidth value, that is, the bandwidth size required by the current edge node is 80-50=30m. The current edge node carries the target bandwidth value in the scheduling request and sends the scheduling request to the central node.
After receiving the scheduling request, the central node firstly acquires a target bandwidth value, and then determines a target edge node according to the target bandwidth value. The central node may determine at least one edge node from all edge nodes as a target edge node, and the target edge node may provide a portion of the schedulable bandwidth as a scheduling bandwidth, and specifically how much scheduling bandwidth is provided is determined by the central node. The current edge node dispatches a portion of the target requests to the target edge node. How many target requests to schedule is determined from the scheduling bandwidth value of the scheduling bandwidth.
The central node returns the node identification of the target edge node and the scheduling bandwidth value of the scheduling bandwidth provided by the target edge node to the current edge node through a feedback message, and the current edge node schedules a part of target requests to the target edge node.
In the method provided by the embodiment of the application, after the current edge node receives the target request, if the target request exceeds the processing capacity of the current edge node, the current edge node sends a scheduling request to the center node, the center node feeds back the target edge node to the current edge node, and the current edge node can schedule part of the request to the target edge node, so that the center node is not required to process the target request, and the pressure of the center node is reduced.
For a central node, as shown in fig. 3, the central node determining at least one target edge node from a plurality of edge nodes according to a target bandwidth value includes:
s302, determining a first edge node with a schedulable bandwidth in all edge nodes according to node logs acquired from all edge nodes;
s304, selecting at least one target edge node from all the first edge nodes according to the schedulable bandwidth of the first edge nodes, and determining the scheduling bandwidth value of each target edge node.
Optionally, in this embodiment, the central node may obtain a node log of each edge node from all edge nodes, and perform data calculation on the node log to determine the schedulable bandwidth of each edge node. The target edge node is then determined by the calculated size of the schedulable bandwidth.
First, a first edge node having a schedulable bandwidth is determined, and if the edge node already has no schedulable bandwidth, a scheduling service cannot be provided. The schedulable bandwidth of the first edge node is small, and therefore, the first edge node with a larger schedulable bandwidth can be selected as the target edge node. The determined target edge nodes may be one or more, if the target edge nodes are one, one target edge node provides a part of the schedulable bandwidth as the scheduling bandwidth, and if the target edge nodes are a plurality, each target edge node provides a part of the schedulable bandwidth as the scheduling bandwidth. The scheduling bandwidth provided by each target edge node can be large or small, but does not exceed the own schedulable bandwidth. The total value of the scheduling bandwidth provided by the plurality of target edge nodes is close to or equal to the target bandwidth value.
For example, three target edge nodes with schedulable bandwidths of 100M, 80M and 60M, the target bandwidth value of 100M, and the three target edge nodes randomly provide scheduling bandwidths of 50M,30M and 20M respectively. Alternatively, the scheduling bandwidths are provided proportionally, e.g. 50M, 40M, 30M, respectively, i.e. half the scheduling bandwidth is provided.
As an alternative example, the central node selecting at least one target edge node from all the first edge nodes according to the size of the schedulable bandwidth of the first edge node, and determining the scheduling bandwidth value of each target edge node includes:
sequencing the first edge nodes according to the schedulable bandwidths of the first edge nodes from large to small;
determining the first N first edge nodes of the sequencing result as target edge nodes, wherein N is determined according to the number of the first edge nodes;
and determining a bandwidth value of the schedulable bandwidth corresponding to each target edge node as a scheduling bandwidth value, wherein the smaller the number of requests received by the target edge node in unit time is, the larger the predetermined proportion of the target edge node is.
In this embodiment, the central node may determine the target edge node according to the size of the schedulable bandwidth, and specifically may determine an edge node with a larger schedulable bandwidth in a certain proportion as the target edge node. For the determined target edge node, not all schedulable bandwidths of the target edge node are scheduled, but a certain schedulable bandwidth is reserved, and the reserved schedulable bandwidth is determined according to the node log. At a minimum, enough bandwidth is reserved for the target edge node to operate itself, and the remaining bandwidth is used as schedulable bandwidth. Alternatively, the central node determines the bandwidth size that the target edge node must reserve, with the remaining bandwidth being the schedulable bandwidth in addition to the bandwidth size that must be reserved. A portion of the bandwidth is determined from the schedulable bandwidth as a scheduling bandwidth. Typically, not all schedulable bandwidth of one target edge node is taken as the scheduling bandwidth. The specific scheduling bandwidth value in scheduling can be a certain proportion of the schedulable bandwidth of the target edge nodes, and the proportion is determined according to the request book received in unit time of each target edge node.
As an alternative example, as shown in fig. 4, after the central node sends the feedback message to the current edge node, the central node further includes:
s402, monitoring the scheduling bandwidth of each target edge node;
s404, in a case where the scheduling bandwidth is not used entirely for a predetermined period of time, determining the unused scheduling bandwidth as a schedulable bandwidth.
In this embodiment, after the central node determines the target edge nodes and determines the scheduling bandwidth value of each target edge node, the current edge node may schedule according to the scheduling bandwidth value. However, in the scheduling process, the scheduling bandwidth of the target edge node may not be used up, so if the scheduling bandwidth is not used up in a predetermined period of time, the scheduling bandwidth may be recovered and re-determined to be a schedulable bandwidth.
For the current edge node, as shown in fig. 5, the current edge node scheduling a portion of the target requests in the plurality of target requests to the target edge node according to the scheduling bandwidth value includes:
s502, determining a first request which is allowed to be scheduled from a plurality of target requests;
s504, determining a first bandwidth value of the first request;
s506, the proportional request in the first request is scheduled to the target edge node according to the ratio of the scheduling bandwidth value of the target edge node to the first bandwidth value.
In this embodiment, when the current edge node schedules target requests, not all target requests may be scheduled first, but the first request allowed to be scheduled is selected first. Whether the target request is allowed to be scheduled or not, the area where the target request is sent can be checked, and if the area where the user who sends the target request is located is consistent with the area of the current edge node, the target request is not allowed to be scheduled. If the regions are not consistent, then scheduling is allowed. The total bandwidth value corresponding to the first request allowed to be scheduled is a first bandwidth value. According to the ratio of the scheduling bandwidth value of the target edge node to the first bandwidth value, how many target requests are scheduled to the target edge node is determined.
As an alternative example, scheduling the scaled request of the first request to the target edge node in terms of the ratio of the scheduled bandwidth value of the target edge node to the first bandwidth value includes: determining each target edge node as a current target edge node, and performing the following operations: determining a current proportion of a scheduling bandwidth value to a first bandwidth value of a current target edge node; randomly selecting a request with the current proportion from the first request under the condition that the current proportion is less than or equal to 1, and scheduling the selected request to a current target edge node; in case the current ratio is greater than 1, all first requests are scheduled to the current target edge node. For example, taking three target edge nodes as an example, the provided scheduling bandwidth values are respectively 50M,30M and 20M, and the first bandwidth value of the first request is 100M, then 50/100=50% of the first requests will be scheduled to the first target edge node, 30/100=30% of the requests will be scheduled to the second target edge node, and 20/100=20% of the requests will be scheduled to the third target edge node. In addition, there is a case that the scheduling bandwidth value provided for a target edge node is greater than the first bandwidth value, for example, if the scheduling bandwidth value provided for a certain target edge node is 120M, and exceeds 100M, the first request is scheduled to the target edge node.
As an alternative example, the method further includes: sending scheduling requests to a central node under the condition that the number of the target requests exceeds the preset number; or sending a scheduling request to the central node under the condition that the occupation value of the central processor of the current edge node exceeds a preset threshold value; and sending a scheduling request to a central node under the condition that the total request bandwidth value requested by the target requests exceeds the node bandwidth value of the current edge node, wherein the node bandwidth value is set by the central node for the current edge node.
In this embodiment, in addition to the case where the total request bandwidth value requested by the target request exceeds the node bandwidth value, the current edge node may also send a scheduling request if the number of target requests exceeds a preset number or the occupation value of the central processor of the current edge node exceeds a predetermined threshold. The preset number and the predetermined threshold are values determined by the central node.
The above is the function and interaction of the center node and the edge node. The description is made in connection with one example.
Fig. 6 is a schematic diagram of the system of the present embodiment. First, the user sends a target request to the edge node through the client, in fig. 6, the client 1 to the client 4 send the request to the edge node 1, the client 5 and the client 6 send the request to the edge node 3, and the edge node 2 does not receive the request temporarily. Since the edge node 1 receives more requests, the pressure is high, and the pressure is reflected in bandwidth, CPU occupancy rate and the number of received nodes. The edge node is close to the core switch, so that the interactive program can more quickly and accurately sense the condition of insufficient bandwidth. I.e. the total requested bandwidth value is larger than the node bandwidth value. The interactive program of the edge node 1 sends a scheduling request to the central node through the step 2, requesting to apply for a certain bandwidth quota. In addition, if the CPU occupancy exceeds a predetermined threshold or the number of requests exceeds a predetermined number, the CPU occupancy may also be used as a trigger condition to trigger the transmission scheduling request in step 2. The scheduling request carries the required bandwidth size W, that is, the target bandwidth value. If the node bandwidth value is 50M and the total request bandwidth value is 80M, w=30m.
After receiving the scheduling request, the central node calculates the schedulable bandwidth of each edge node through the logs sent by all the edge nodes. Because the processing link length from the edge node to the central node is longer, a certain delay exists after data aggregation calculation (specifically, the delay time length is n minutes, such as about 3 minutes, according to the link length and the processing efficiency). But contains a detailed bandwidth log of all edge nodes as a full amount of data. And the node jitter is larger, so that too real-time data is not needed for the stability of a central strategy, and the generated delay just solves the problem of large data jitter. That is, when the central node receives the scheduling request, the central node calculates the data of each edge node that is actually n minutes ago due to the delay, but the calculated schedulable bandwidth of each edge node is more suitable for bandwidth scheduling due to the delay, so that the influence of large jitter of the data is avoided.
The central node determines a target edge node according to the schedulable bandwidths of the edge nodes, and the determining rule is to select a node with small pressure as the target edge node (the small pressure indicates that the schedulable bandwidth is large, the CPU occupancy rate is low, and the number of received requests is small), for example, the central node determines that the edge node 2 and the edge node 3 can be used as the target edge node, 20M of the schedulable bandwidths of the edge node 2 is selected, and 10M of the schedulable bandwidths of the edge node 3 is selected. In particular, other values may be selected, so as to ensure that the total value of the scheduling bandwidths of the edge node 2 and the edge node 3 is close to 30M. Then, the edge node 1 dispatches the request 3 and the request 4 of the target requests to the edge node 2 and the edge node 3, respectively, as indicated by the broken lines in fig. 6, through step 3.
When the edge node 1 schedules the target requests to the edge node 2 and the edge node 3, how much target requests to the edge node 2 and the edge node 3 are specifically scheduled can be determined according to the scheduling bandwidth values of the edge node 2 and the edge node 3. First, the total bandwidth value of the first requests allowed to be scheduled in the target requests is a value, for example, 50M, the scheduling bandwidth value of the edge node 2 is 30M, and the scheduling bandwidth value of the edge node 3 is 20M, and then, of the first requests allowed to be scheduled in the target requests, 30/50=60% of the first requests are scheduled to the edge node 2, 20/50=40% of the first requests are scheduled to the edge node 3, and specific scheduling of which first requests can be determined randomly. After the dispatching bandwidth value distributed by the central node is distributed, the central node monitors, if the dispatching bandwidth value distributed in a certain time is not used or remains, the dispatching bandwidth value distributed is recovered, and the dispatching bandwidth corresponding to the recovered dispatching bandwidth value is restored to the schedulable bandwidth. As for the above-mentioned 20M scheduling bandwidth of the edge node 3, 10M is used, and the remaining 10M can be restored to the schedulable bandwidth of the edge node 3. Recovery and separation process of scheduling bandwidth as shown in fig. 7, after an edge node sends a scheduling request to a central node, the central node determines an allocated quota from an allocation center, obtains the quota from a quota pool, allocates the quota of edge node 2 and edge node 3 to edge node 1, and edge node 1 schedules a first request allowed to be scheduled in a target request to edge node 2 and edge node 3.
Fig. 8 is a schematic structural diagram of a request scheduling device of a content distribution network according to an embodiment of the present application, which is applied to a central node, as shown in fig. 8, where the request scheduling device of the content distribution network includes:
a receiving module 802, configured to receive a scheduling request of a current edge node, where the scheduling request is a request sent by the current edge node when a plurality of target requests are received and the plurality of target requests meet a triggering condition, and the scheduling request includes a target bandwidth value, where the target bandwidth value is used to indicate a bandwidth value required by the current edge node;
a determining module 804, configured to determine at least one target edge node from a plurality of edge nodes according to the target bandwidth value, where the target edge node is provided with a scheduling bandwidth;
a sending module 806, configured to send a feedback message to the current edge node, where the feedback message includes the node identifier of the target edge node and the scheduling bandwidth value of the scheduling bandwidth provided by the target edge node.
For other examples of this embodiment, please refer to the above examples, and the description thereof is omitted.
Fig. 9 is a schematic structural diagram of a request scheduling apparatus of another content distribution network according to an embodiment of the present application, where the request scheduling apparatus is applied to a current edge node, as shown in fig. 9, where the request scheduling apparatus of the content distribution network includes:
a sending module 902, configured to send a scheduling request to a central node when the current edge node receives a plurality of target requests and the plurality of target requests meet a trigger condition, where the scheduling request includes a target bandwidth value, and the target bandwidth value is used to indicate a bandwidth value required by the current edge node;
a receiving module 904, configured to receive a feedback message of the central node, where the feedback message includes a node identifier of a target edge node and a scheduling bandwidth value provided by the target edge node, and the target edge node determines according to the target bandwidth value;
a scheduling module 906, configured to schedule a portion of the target requests among the plurality of target requests to the target edge node according to the scheduling bandwidth value.
For other examples of this embodiment, please refer to the above examples, and the description thereof is omitted.
As shown in fig. 10, an embodiment of the present application provides an electronic device including a processor 111, a communication interface 112, a memory 113, and a communication bus 114, wherein the processor 111, the communication interface 112, and the memory 113 perform communication with each other through the communication bus 114,
a memory 113 for storing a computer program;
in one embodiment of the present application, the processor 111 is configured to implement the request scheduling method of the content distribution network provided in any one of the foregoing method embodiments when executing the program stored in the memory 113.
The embodiment of the application also provides a computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of a request scheduling method of a content distribution network according to any of the method embodiments described above.
The apparatus embodiments described above are merely illustrative, wherein the elements illustrated as separate elements may or may not be physically separate, and the elements shown as elements may or may not be physical elements, may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
From the above description of embodiments, it will be apparent to those skilled in the art that the embodiments may be implemented by means of software plus a general purpose hardware platform, or may be implemented by hardware. Based on such understanding, the foregoing technical solution may be embodied essentially or in a part contributing to the related art in the form of a software product, which may be stored in a computer readable storage medium, such as ROM/RAM, a magnetic disk, an optical disk, etc., including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform the method described in the respective embodiments or some parts of the embodiments.
It is to be understood that the terminology used herein is for the purpose of describing particular example embodiments only, and is not intended to be limiting. As used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. The terms "comprises," "comprising," "includes," "including," and "having" are inclusive and therefore specify the presence of stated features, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, steps, operations, elements, components, and/or groups thereof. The method steps, processes, and operations described herein are not to be construed as necessarily requiring their performance in the particular order described or illustrated, unless an order of performance is explicitly stated. It should also be appreciated that additional or alternative steps may be used.
The foregoing is only a specific embodiment of the application to enable those skilled in the art to understand or practice the application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the application. Thus, the present application is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims (10)

1. A request scheduling method of a content distribution network, applied to a central node, comprising:
receiving a scheduling request of a current edge node, wherein the scheduling request is a request sent by the current edge node when a plurality of target requests are received and meet a triggering condition, and the scheduling request comprises a target bandwidth value which is used for indicating a bandwidth value required by the current edge node;
determining at least one target edge node from a plurality of edge nodes according to the target bandwidth value, wherein the target edge node is provided with a scheduling bandwidth;
and sending a feedback message to the current edge node, wherein the feedback message comprises a node identifier of the target edge node and a scheduling bandwidth value of a scheduling bandwidth provided by the target edge node.
2. The method of claim 1, wherein said determining at least one target edge node from a plurality of edge nodes based on said target bandwidth value comprises:
determining a first edge node with a schedulable bandwidth in all edge nodes according to the node logs acquired from all edge nodes;
and selecting at least one target edge node from all the first edge nodes according to the schedulable bandwidth of the first edge nodes, and determining a scheduling bandwidth value of each target edge node.
3. The method of claim 2, wherein selecting at least one of the target edge nodes from all of the first edge nodes according to the size of the schedulable bandwidth of the first edge node, and determining a scheduling bandwidth value for each of the target edge nodes comprises:
sequencing the first edge nodes according to the schedulable bandwidths of the first edge nodes from large to small;
determining the first N first edge nodes of the sequencing result as the target edge nodes, wherein N is determined according to the number of the first edge nodes;
and determining a bandwidth value of a schedulable bandwidth corresponding to each target edge node in a preset proportion as the scheduling bandwidth value, wherein the smaller the number of received requests of the target edge node in unit time is, the larger the preset proportion of the target edge node is.
4. A method according to claim 3, characterized in that after sending a feedback message to the current edge node, the method further comprises:
monitoring the scheduling bandwidth of each target edge node;
and in the case that the scheduling bandwidth is not fully used within a predetermined time period, determining the unused scheduling bandwidth as a schedulable bandwidth.
5. A method for scheduling requests of a content distribution network, applied to an edge node, comprising:
under the condition that a plurality of target requests are received by a current edge node and meet triggering conditions, sending a scheduling request to a central node, wherein the scheduling request comprises a target bandwidth value which is used for indicating the bandwidth value required by the current edge node;
receiving a feedback message of the central node, wherein the feedback message comprises a node identifier of a target edge node and a scheduling bandwidth value provided by the target edge node, and the target edge node is determined according to the target bandwidth value;
and scheduling part of the target requests in the plurality of target requests to the target edge node according to the scheduling bandwidth value.
6. The method of claim 5, wherein said scheduling a portion of the plurality of target requests to the target edge node according to the scheduling bandwidth value comprises:
determining a first request which is allowed to be scheduled from the target requests;
determining a first bandwidth value of the first request;
and dispatching the request with the proportion in the first request to the target edge node according to the proportion of the dispatching bandwidth value of the target edge node to the first bandwidth value.
7. The method of claim 6, wherein said scheduling the proportional request of the first request to the target edge node in proportion to the scheduled bandwidth value of the target edge node and the first bandwidth value comprises:
and determining each target edge node as a current target edge node, and executing the following operations:
determining a current ratio of the scheduling bandwidth value of the current target edge node to the first bandwidth value;
randomly selecting the request of the current proportion from the first request under the condition that the current proportion is less than or equal to 1, and scheduling the selected request to the current target edge node;
and in the case that the current proportion is greater than 1, scheduling all the first requests to the current target edge node.
8. The method of claim 5, wherein the sending a scheduling request to a hub node if a plurality of target requests are received by a current edge node and the plurality of target requests satisfy a trigger condition comprises:
transmitting the scheduling request to the central node under the condition that the number of the target requests exceeds a preset number; or alternatively
Transmitting the scheduling request to a central node under the condition that the occupation value of the central processor of the current edge node exceeds a preset threshold value;
and sending the scheduling request to the central node under the condition that the total request bandwidth value requested by the target requests exceeds the node bandwidth value of the current edge node, wherein the node bandwidth value is set by the central node for the current edge node.
9. A request scheduling apparatus for a content distribution network, applied to a central node, comprising:
a receiving module, configured to receive a scheduling request of a current edge node, where the scheduling request is a request sent when the current edge node receives a plurality of target requests and the plurality of target requests meet a trigger condition, and the scheduling request includes a target bandwidth value, where the target bandwidth value is used to indicate a bandwidth value required by the current edge node;
a determining module, configured to determine at least one target edge node from a plurality of edge nodes according to the target bandwidth value, where the target edge node is provided with a scheduling bandwidth;
and the sending module is used for sending a feedback message to the current edge node, wherein the feedback message comprises the node identification of the target edge node and the scheduling bandwidth value of the scheduling bandwidth provided by the target edge node.
10. A request scheduling device of a content distribution network, applied to a current edge node, comprising:
the device comprises a sending module, a central node and a receiving module, wherein the sending module is used for sending a scheduling request to the central node under the condition that a plurality of target requests are received by a current edge node and meet a triggering condition, and the scheduling request comprises a target bandwidth value which is used for indicating the bandwidth value required by the current edge node;
the receiving module is used for receiving a feedback message of the central node, wherein the feedback message comprises a node identifier of a target edge node and a scheduling bandwidth value provided by the target edge node, and the target edge node is determined according to the target bandwidth value;
and the scheduling module is used for scheduling part of the target requests in the plurality of target requests to the target edge node according to the scheduling bandwidth value.
CN202310960984.7A 2023-08-01 2023-08-01 Request scheduling method and device for content distribution network Pending CN117135126A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310960984.7A CN117135126A (en) 2023-08-01 2023-08-01 Request scheduling method and device for content distribution network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310960984.7A CN117135126A (en) 2023-08-01 2023-08-01 Request scheduling method and device for content distribution network

Publications (1)

Publication Number Publication Date
CN117135126A true CN117135126A (en) 2023-11-28

Family

ID=88853654

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310960984.7A Pending CN117135126A (en) 2023-08-01 2023-08-01 Request scheduling method and device for content distribution network

Country Status (1)

Country Link
CN (1) CN117135126A (en)

Similar Documents

Publication Publication Date Title
EP3547649B1 (en) Method and system for sending request for acquiring data resource
EP3453148B1 (en) System and method for latency-based queuing
CN108513271B (en) Short message distribution method and device based on multiple short message channels
CN109618002B (en) Micro-service gateway optimization method, device and storage medium
CN108848530B (en) Method and device for acquiring network resources and scheduling server
CN112269641B (en) Scheduling method, scheduling device, electronic equipment and storage medium
EP3547625B1 (en) Method and system for sending request for acquiring data resource
CN110336848B (en) Scheduling method, scheduling system and scheduling equipment for access request
CN105335231B (en) server thread dynamic allocation method and device
CN106375471B (en) Edge node determination method and device
CN104243405A (en) Request processing method, device and system
CN109995839B (en) Load balancing method, system and load balancer
CN110659123A (en) Distributed task distribution scheduling method and device based on message
CN105407413A (en) Distributed video transcoding method and related device and system
CN109039953B (en) Bandwidth scheduling method and device
CN111030945A (en) Disaster recovery method, disaster recovery gateway, storage medium, device and system
CN115499859B (en) NWDAF-based method for managing and deciding computing resources
CN105792247B (en) data pushing method and device
CN106790354B (en) Communication method and device for preventing data congestion
CN117135126A (en) Request scheduling method and device for content distribution network
CN111385328B (en) Service request processing method, system and electronic equipment
CN101695049A (en) Method and device for processing businesses in monitoring system
CN115941604A (en) Flow distribution method, device, equipment, storage medium and program product
CN112925946B (en) Service data storage method and device and electronic equipment
CN115580634A (en) Computing network system and method for operating computing network system

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