CN114650295B

CN114650295B - CDN quality scheduling method and device, medium and electronic equipment

Info

Publication number: CN114650295B
Application number: CN202210326197.2A
Authority: CN
Inventors: 施纯满; 傅潇庆; 李持航; 王剑
Original assignee: Beijing Youzhuju Network Technology Co Ltd
Current assignee: Beijing Youzhuju Network Technology Co Ltd
Priority date: 2022-03-29
Filing date: 2022-03-29
Publication date: 2023-12-05
Anticipated expiration: 2042-03-29
Also published as: CN114650295A

Abstract

The disclosure relates to a CDN quality scheduling method, a device, a medium and electronic equipment, which belong to the technical field of computers, and can dynamically adjust target CDN nodes for performing quality scheduling, so that each operator in each geographic area can use the optimal CDN node to provide service for users, the access quality of the users is improved, and access blocking is avoided. A quality scheduling method, comprising: acquiring effective round trip delay of each CDN node to which each operator belongs in each geographic area aiming at the client IP to which the corresponding operator belongs in the corresponding geographic area; and determining the first N CDN nodes with the optimal effective round trip delay in all CDN nodes of each operator in each geographic area as target CDN nodes for quality scheduling, wherein N is a positive integer greater than or equal to 1.

Description

CDN quality scheduling method and device, medium and electronic equipment

Technical Field

The disclosure relates to the technical field of computers, and in particular relates to a CDN quality scheduling method, device, medium and electronic equipment.

Background

In the related art, for global load balancing of domain name servers (Domain Name Server, DNS), nodes of a content delivery network (Content Delivery Network, CDN) corresponding to the same operator under the same province are all fixed. If a certain CDN node has the conditions of packet loss, high load running and the like, the access quality of a user can be affected, and the conditions of access blocking and the like occur.

Disclosure of Invention

This content section is provided to introduce concepts in a simplified form that are further described below in the detailed description section. This section of content is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.

In a first aspect, the present disclosure provides a quality scheduling method, including: acquiring effective round trip delay of each CDN node to which each operator belongs in each geographic area aiming at the client IP to which the corresponding operator belongs in the corresponding geographic area; and determining the first N CDN nodes with the optimal effective round trip delay in all CDN nodes of each operator in each geographic area as target CDN nodes for quality scheduling, wherein N is a positive integer greater than or equal to 1.

Optionally, the obtaining the effective round trip delay of each CDN node to which each operator belongs in each geographic region for the client IP to which the corresponding operator belongs in the corresponding geographic region includes: determining the IP of a client capable of detecting communication, which each operator belongs to, in each geographic area; acquiring the round trip delay of each client IP which can be detected and is belonged to each CDN node which belongs to each operator in each geographic area aiming at each client IP which can be detected and is belonged to the corresponding operator in the corresponding geographic area; and determining the average round trip delay of each CDN node of each operator in each geographic area for all the client-side IP which can be detected and is corresponding to the corresponding operator in the corresponding geographic area, and taking the average round trip delay as the effective round trip delay.

Optionally, the acquiring the round trip delay of each CDN node to which each operator belongs in each geographic region for each client IP that can be probed to which the corresponding operator belongs in the corresponding geographic region includes: and acquiring the round trip delay of each CDN node which belongs to each operator in each geographic area for detecting each client IP which belongs to the corresponding operator in the corresponding geographic area and can be detected once every first preset time length.

Optionally, the determining, as the effective round trip delay, an average round trip delay of each CDN node to which each operator belongs in each geographic area for all client IPs that can be probed to which the corresponding operator belongs in the corresponding geographic area includes: and averaging the round trip delay of all the client-side IP which can be detected and belongs to each CDN node which belongs to each operator in each geographic area aiming at the corresponding operator in the corresponding geographic area every second preset time length to obtain the average round trip delay of each CDN node as the effective round trip delay.

Optionally, the determining the first N CDN nodes with the optimal effective round trip delay from among all CDN nodes belonging to each operator in each geographic region as the target CDN node for quality scheduling includes: acquiring average packet loss rate of all client-side IP which can be detected and which belongs to the corresponding operator in the corresponding geographic area by each CDN node which belongs to the operator in each geographic area; removing CDN nodes with the average packet loss rate higher than a first preset packet loss rate threshold and the load higher than a first preset load value; and determining the first N CDN nodes with the optimal effective round trip delay in the CDN nodes after the rejection, which each operator belongs to, in each geographic area as target CDN nodes for quality scheduling.

Optionally, the method further comprises: acquiring quality index data corresponding to corresponding services of a client IP which can be detected and belongs to each operator in each geographic area; and selecting a target CDN node meeting the quality index requirement from the target CDN nodes based on the quality index data as a CDN node for the corresponding service.

Optionally, the selecting, based on the quality index data, a target CDN node that meets a quality index requirement from the target CDN nodes as a CDN node for the corresponding service includes: acquiring the average packet loss rate of each target CDN node for all the client-side IP which belongs to the corresponding operator and can be detected under the corresponding geographic area; removing target CDN nodes, of which the average packet loss rate is higher than a second preset packet loss rate threshold value and the load is higher than a second preset load value, from the target CDN nodes; and selecting a target CDN node meeting the quality index requirement from the rejected target CDN nodes based on the quality index data as a CDN node for the corresponding service.

In a second aspect, the present disclosure provides a quality scheduling apparatus, comprising: the acquiring module is used for acquiring the effective round trip delay of each CDN node to which each operator belongs in each geographic area aiming at the client IP to which the corresponding operator belongs in the corresponding geographic area; the determining module is configured to determine the first N CDN nodes with the optimal effective round trip delay among all CDN nodes belonging to each operator in each geographic region as a target CDN node for quality scheduling, where N is a positive integer greater than or equal to 1.

In a third aspect, the present disclosure provides a computer readable medium having stored thereon a computer program which when executed by a processing device performs the steps of the method according to any of the first aspects of the present disclosure.

In a fourth aspect, there is provided an electronic device comprising: a storage device having a computer program stored thereon; processing means for executing said computer program in said storage means to carry out the steps of the method of the first aspect of the disclosure.

By adopting the technical scheme, because the effective round trip delay of each CDN node of each operator in each geographic area for the client IP of the corresponding operator in the corresponding geographic area can be obtained, and the first N CDN nodes with the optimal effective round trip delay in all CDN nodes of each operator in each geographic area are determined as the target CDN nodes for quality scheduling, the target CDN nodes for executing quality scheduling can be dynamically adjusted under the conditions that a certain CDN node loses packets or the load runs high, and the like, so that each operator in each geographic area can provide service for users by using the optimal CDN node, the access quality of the users is improved, and access blocking is avoided.

Additional features and advantages of the present disclosure will be set forth in the detailed description which follows.

Drawings

The above and other features, advantages, and aspects of embodiments of the present disclosure will become more apparent by reference to the following detailed description when taken in conjunction with the accompanying drawings. The same or similar reference numbers will be used throughout the drawings to refer to the same or like elements. It should be understood that the figures are schematic and that elements and components are not necessarily drawn to scale. In the drawings:

fig. 1 is a schematic view of CDN access flow.

Fig. 2 is a flow chart of a quality scheduling method according to one embodiment of the present disclosure.

Fig. 3 is a flow chart of determining an effective round trip delay according to one embodiment of the present disclosure.

Fig. 4 is a flow chart of determining a target CDN node for quality scheduling according to one embodiment of the present disclosure.

Fig. 5 is a flow chart of yet another quality scheduling method according to one embodiment of the present disclosure.

Fig. 6 is a schematic block diagram of a quality scheduling apparatus according to one embodiment of the present disclosure.

Fig. 7 is a schematic structural view of an electronic device according to an embodiment of the present disclosure.

Detailed Description

Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While certain embodiments of the present disclosure have been shown in the accompanying drawings, it is to be understood that the present disclosure may be embodied in various forms and should not be construed as limited to the embodiments set forth herein, but are provided to provide a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are for illustration purposes only and are not intended to limit the scope of the present disclosure.

It should be understood that the various steps recited in the method embodiments of the present disclosure may be performed in a different order and/or performed in parallel. Furthermore, method embodiments may include additional steps and/or omit performing the illustrated steps. The scope of the present disclosure is not limited in this respect.

The term "including" and variations thereof as used herein are intended to be open-ended, i.e., including, but not limited to. The term "based on" is based at least in part on. The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments. Related definitions of other terms will be given in the description below.

It should be noted that the terms "first," "second," and the like in this disclosure are merely used to distinguish between different devices, modules, or units and are not used to define an order or interdependence of functions performed by the devices, modules, or units.

It should be noted that references to "one", "a plurality" and "a plurality" in this disclosure are intended to be illustrative rather than limiting, and those of ordinary skill in the art will appreciate that "one or more" is intended to be understood as "one or more" unless the context clearly indicates otherwise.

The names of messages or information interacted between the various devices in the embodiments of the present disclosure are for illustrative purposes only and are not intended to limit the scope of such messages or information.

All actions in this disclosure to obtain signals, information or data are performed in compliance with the corresponding data protection legislation policies of the country of location and to obtain authorization granted by the owner of the corresponding device.

It will be appreciated that prior to using the technical solutions disclosed in the embodiments of the present disclosure, the user should be informed and authorized of the type, usage range, usage scenario, etc. of the personal information related to the present disclosure in an appropriate manner according to the relevant legal regulations.

For example, in response to receiving an active request from a user, a prompt is sent to the user to explicitly prompt the user that the operation it is requesting to perform will require personal information to be obtained and used with the user. Thus, the user can autonomously select whether to provide personal information to software or hardware such as an electronic device, an application program, a server or a storage medium for executing the operation of the technical scheme of the present disclosure according to the prompt information.

As an alternative but non-limiting implementation, in response to receiving an active request from a user, the manner in which the prompt information is sent to the user may be, for example, a popup, in which the prompt information may be presented in a text manner. In addition, a selection control for the user to select to provide personal information to the electronic device in a 'consent' or 'disagreement' manner can be carried in the popup window.

It will be appreciated that the above-described notification and user authorization process is merely illustrative and not limiting of the implementations of the present disclosure, and that other ways of satisfying relevant legal regulations may be applied to the implementations of the present disclosure.

Meanwhile, it can be understood that the data (including but not limited to the data itself, the acquisition or the use of the data) related to the technical scheme should conform to the requirements of the corresponding laws and regulations and related regulations.

The content distribution network aims to add a layer of new network architecture in the existing Internet to release the content of a website to the network 'edge' closest to a user, so that the user can obtain the required content nearby, the network congestion condition of the Internet is solved, the response speed of the user for accessing the website is improved, and the problem of low response speed of the user for accessing the website due to the reasons of small network bandwidth, large user access amount, uneven website distribution and the like is solved.

The CDN access flow is as shown in fig. 1:

1) The netizen user provides the domain name to be accessed to the browser.

2) The browser calls a domain name resolution library to resolve the domain name, and generally obtains a CNAME record corresponding to the domain name. In order to obtain the actual IP address, the browser needs to resolve the obtained CNAME domain name again to obtain the actual IP address. In this process, global load balancing domain name server (Domain Name Server, DNS) resolution to CDN vendors is used. The geographic location of the client IP can be queried, for example, by the IP library, and then the resolved IP for that geographic location is returned.

3) After obtaining the IP address returned by DNS analysis, the browser sends an access request to the cache server.

4) The cache server directly returns the content to the netizen user according to the domain name to be accessed provided by the browser if the cache exists; if no Cache exists, requesting to the father layer through a scheduling strategy in the Cache

5) If the parent layer has a cache, directly returning the content to the edge node; if the parent layer does not have a cache, the request is forwarded to the domain name real source station according to the source station configured by the user.

6) After the cache server obtains the content from the real source station address, the content is locally stored for later use on one hand, and the obtained data is returned to the client side on the other hand, so that the data service process is completed.

7) The client side obtains the data returned by the cache server, displays the data and completes the whole browsing data request process.

However, in the related art, CDN nodes corresponding to the same operator under the same province are all fixed. If a certain CDN node has the conditions of packet loss, high load running and the like, the access quality of a user can be affected, and the conditions of access blocking and the like occur. Particularly for quality racing scenes, the impact is greater.

Fig. 2 is a flow chart of a quality scheduling method according to one embodiment of the present disclosure. As shown in fig. 2, the quality scheduling method includes the following steps S21 and S22.

In step S21, an effective round trip delay of each CDN node to which each operator belongs in each geographic region is obtained for the client IP to which the corresponding operator belongs in the corresponding geographic region.

The geographical area may be a geographical area divided by province, or may be a geographical area divided by other area division criteria.

In some embodiments, step S21 may include steps S211 to S213 as shown in fig. 3.

First, in step S211, a client IP to which each operator belongs in each geographical area is determined. For example, the client IP may be divided according to the geographic area-operator granularity by accessing the log, and the live IP of the detectable channel corresponding to each IP segment may be obtained through real-time detection, which is used as a detection list. That is, by real-time probing, a client IP (i.e., a live IP) to which each operator belongs in each geographical area can be acquired. Table 1 is an exemplary client IP probe list. As shown in table 1, the client IP capable of probe access to which the operator 1 belongs under the region 1 includes 1.1.1.1 and 1.1.1.3.

TABLE 1

Then, in step S212, the round trip delay of each client IP that can be probed and that each CDN node that each operator belongs to in each geographic region belongs to for each corresponding operator in the corresponding geographic region is obtained.

For example, taking table 1 as an example, assuming that there are 3 CDN nodes to which the lower operator 1 in the area 1 belongs, namely, CDN node 1, CDN node 2 and CDN node 3, the round trip delay t1 of the CDN node 1 for the client IP 1.1.1.1.1 capable of probing the lower operator 1 in the area 1 and the round trip delay t2 of the client IP 1.1.1.3 are obtained, the round trip delay t3 of the CDN node 2 for the client IP 1.1.1.1 capable of probing the lower operator 1 in the area 1 and the round trip delay t4 of the client IP 1.1.1.3 are obtained, and the round trip delay t5 of the CDN node 3 for the client IP 1.1.1.1.1 capable of probing the lower operator 1 in the area 1 and the round trip delay t6 of the client IP 1.1.1.1.3 are obtained.

In some embodiments, the CDN node may perform probing for each client IP capable of probing, to which the corresponding operator belongs, in the corresponding geographic region every first preset time period. The first preset time period may be any reasonable time interval, such as 1 minute. After the CDN node probing is completed, corresponding round trip delay information may be obtained.

Then, in step S213, an average round trip delay of each CDN node belonging to each operator in each geographic area for all the client IPs capable of probing corresponding to the corresponding operator in the corresponding geographic area is determined as an effective round trip delay.

Still taking the above example as an example, it may be determined that the average round trip delay of CDN node 1 to which operator 1 belongs under region 1 is (t1+t2)/2, the average round trip delay of CDN node 2 is (t3+t4)/2, and the average round trip delay of CDN node 3 is (t5+t6)/2.

In some embodiments, the round trip delay of all the client IPs that can be probed and that each CDN node belongs to each operator in each geographic area may be averaged for each CDN node that each operator belongs to in the corresponding geographic area every second preset time length, so as to obtain the average round trip delay of each CDN node as the effective round trip delay. The second preset time period may be any preset time period, for example, 20 minutes. For example, assume that 3 CDN nodes belong to the lower operator 1 in the region 1 are CDN node 1, CDN node 2 and CDN node 3, and the 3 CDN nodes are all configured to perform round trip delay detection on all the client IPs capable of detecting the probe access that belong to the lower operator 1 in the region 1 every 1 minute; then, the round trip delay detected by the CDN node 1 is averaged every 20 minutes to obtain the effective round trip delay of the CDN node 1; averaging the round trip delay detected by the CDN node 2 every 20 minutes to obtain the effective round trip delay of the CDN node 2; the round trip delay detected by the CDN node 3 is averaged every 20 minutes to obtain an effective round trip delay of the CDN node 3.

Through the steps S211 to S213, the effective round trip delay of each CDN node to which each operator belongs in each geographic region for the client IP to which the corresponding operator belongs in the corresponding geographic region can be obtained.

In step S22, the first N CDN nodes with the optimal effective round trip delay among all CDN nodes to which each operator belongs in each geographic region are determined as the target CDN nodes for quality scheduling. N is a positive integer greater than or equal to 1.

That is, the effective round trip delays of all CDN nodes belonging to each operator in each geographic region are ordered, and the first N CDN nodes with the lowest effective round trip delays are selected from the ordered effective round trip delays. For example, sorting the effective round trip delays of all CDN nodes of the operator 1 in the region 1 to select the first N CDN nodes with the lowest effective round trip delays; sorting the effective round trip delays of all CDN nodes of the operator 2 in the region 1 to select the first N CDN nodes with the lowest effective round trip delays; sorting the effective round trip delays of all CDN nodes of the operators 2 under the region 2 to select the first N CDN nodes with the lowest effective round trip delays; and so on until the screening of CDN nodes for all operators for all geographic regions is completed. After the screening is completed, the screened CDN node can be used as a target CDN node of quality scheduling.

Table 2 shows the effective round trip delay profile of CDN nodes at geographic region-operator granularity. Assuming that the top 2 CDN nodes are to be selected from the CDN nodes as the target CDN nodes for quality scheduling, nodes Z and T of operator 1 under region 1 and nodes R and U of operator 2 under region 2 will be selected as the target CDN nodes for quality scheduling.

TABLE 2

Information of the target CDN nodes for quality scheduling may be provided to a domain name server (Domain Name Server, DNS) so that DNS may combine the target CDN nodes for quality scheduling into a DNS scheduling domain for DNS global load balancing.

As shown in fig. 4, first, in step S221, an average packet loss rate of all the client IPs that can be detected and that each CDN node that each operator belongs to in each geographic area corresponds to each corresponding operator in the corresponding geographic area is obtained.

For example, assuming that 3 CDN nodes belonging to the operator 1 under the area 1 are respectively CDN node 1, CDN node 2 and CDN node 3, and two detectable clients IP belonging to the operator 1 under the area 1 are respectively IP1 and IP2, the packet loss rate p1 of the CDN node 1 for the client IP1 and the packet loss rate p2 of the client IP2, the packet loss rate p3 of the CDN node 2 for the client IP1 and the packet loss rate p4 of the CDN node 2 for the client IP2, and the packet loss rate p5 of the CDN node 3 for the client IP1 and the packet loss rate p5 for the client IP2 may be obtained first, and then the average packet loss rate of the CDN node 1 is (p1+p2)/2, the average packet loss rate of the CDN node 2 is (p3+p4)/2, and the average packet loss rate of the CDN node 3 is (p5+p6)/2. In addition, the packet loss rate of the CDN node may be detected once every third preset duration, and the average packet loss rate of the CDN node may be obtained once every fourth preset duration. The third preset duration and the fourth preset duration may be durations set according to actual scenes.

Then, in step S222, CDN nodes having average packet loss rates higher than the first preset packet loss rate threshold and loads higher than the first preset load value are removed.

The load may be a real-time load of the CDN node, or an average load of the CDN node over a period of time.

The first preset packet loss rate threshold and the first preset load value are parameters which can be pre-configured.

In step S223, the first N CDN nodes with the optimal effective round trip delay among the culled CDN nodes to which each operator belongs in each geographic region are determined as the target CDN nodes for quality scheduling.

Taking table 2 as an example, assuming that the average packet loss rate of the node Z of the operator 1 under the area 1 is higher than the first preset packet loss rate threshold and the load is higher than the first preset load value, the node Z needs to be rejected, that is, the node Z does not participate in the evaluation of the target CDN node for quality scheduling, but screens the target CDN node for quality scheduling of the operator 1 under the area 1 from the node T and the node X.

By adopting the technical scheme, as the average packet loss rate of all the client-side IPs which can be detected and are owned by each CDN node of each operator in each geographic area is firstly obtained, then the CDN nodes with the average packet loss rate higher than the first preset packet loss rate threshold and the load higher than the first preset load value are removed, and then the first N CDN nodes with the optimal effective round trip delay in the removed CDN nodes of each operator in each geographic area are determined as the target CDN nodes for quality scheduling, the influence of the CDN nodes with the packet loss, the high running of the machine performance and the like on CDN services can be avoided.

As shown in fig. 5, first, in step S51, quality index data corresponding to a corresponding service of a client IP to which each operator belongs in each geographical area that can be probed is acquired.

In some embodiments, after the target CDN nodes for quality scheduling are determined, the target CDN nodes for quality scheduling can form a scheduling domain. Then, the domain name cname with the client data is added to the scheduling domain, and the corresponding client quality index data can be obtained.

For example, CDN services may include picture services, download services, on-demand services, and the like. The quality indexes of interest of different services may also be different, for example, the quality indexes of interest of the picture service may include a first packet, a success rate, a downloading speed, etc., the quality indexes of interest of the downloading service include a first packet, a first screen, a downloading speed, a success rate, etc., and the quality indexes of interest of the on-demand service include a click-through rate, an interruption rate, an error rate, etc. Accordingly, corresponding quality index data needs to be acquired for different services.

Table 3 shows exemplary quality index data.

TABLE 3 Table 3

In step S52, a target CDN node satisfying the quality index requirement is selected from the target CDN nodes as a CDN node for the corresponding service based on the quality index data.

In some embodiments, when screening, first quality index data of the corresponding service may be considered first, for example, a CDN node that the first quality index data meets the requirement of the first quality index data is screened out of the target CDN nodes, then, second quality index data of the screened CDN nodes is ordered, and a first M CDN nodes with optimal second quality index data are selected from the second quality index data as CDN nodes for the corresponding service, where M is a positive integer greater than or equal to 1.

Taking a picture service as an example, assuming that the first quality index data is a success rate, and the success rate is required to be greater than 96%, and the second quality index data is a downloading speed, and the first 2 CDN nodes with the optimal downloading speed are required to be selected, then: for the CDN node A, CDN node Y, CDN node P, CDN node X and the CDN node S of the lower operator 1 in the area 1, which have been screened according to the effective round trip delay in table 3, the CDN node A, CDN node Y, CDN node P and the CDN node X may be screened according to the requirement of the first quality index data (i.e., the requirement that the success rate is greater than 96%), and then the CDN node a and the CDN node X may be screened from the screened CDN node A, CDN node Y, CDN node P and CDN node X as the CDN nodes for the picture service of the lower operator 1 in the area 1 according to the requirement of the second quality index data (i.e., the first 2 CDN nodes with the optimal downloading speed).

In some embodiments, CDN nodes meeting multiple quality index data requirements of the corresponding service may also be screened from the target CDN nodes. For example, a CDN node whose first quality index data meets the first quality index data requirement and whose second quality index data meets the second quality index data requirement is screened from the target CDN nodes.

Taking a picture service as an example, assuming that the first quality index data is the success rate and the second quality index data is the downloading speed, and the downloading speed is required to be greater than 600KB and the success rate is required to be greater than 96%, then: for the CDN nodes A, CDN, Y, CDN, P, CDN and S of the regional 1 lower operator 1, which have been screened out according to the effective round trip delay in table 3, only the CDN nodes a and X satisfy the requirement that the downloading speed is greater than 600KB and the success rate is greater than 96%, so the CDN nodes a and X are selected as CDN nodes for the picture service of the regional 1 lower operator 1.

By adopting the technical scheme, the quality index data corresponding to the corresponding service of the client IP which can be detected and passed and belongs to each operator in each geographic area is firstly obtained, and then the target CDN node meeting the quality index requirement is selected from the target CDN nodes based on the quality index data to serve as the CDN node for the corresponding service, so that the optimal CDN node scheduling domain for the corresponding service can be obtained based on the analysis of the client quality data, and each operator in each geographic area can be further ensured to provide the corresponding service for the user by using the optimal CDN node for the corresponding service, the access quality of the user is improved, and the access blocking is avoided.

In some embodiments, step S52 may be implemented by: firstly, acquiring average packet loss rate of each target CDN node for all client-side IP which belongs to a corresponding operator and can be detected under a corresponding geographic area; removing target CDN nodes with average packet loss rate higher than a second preset packet loss rate threshold and load higher than a second preset load value from the target CDN nodes; and selecting a target CDN node meeting the quality index requirement from the rejected target CDN nodes based on the quality index data as a CDN node for corresponding service. The CDN nodes screened for the corresponding services can form a scheduling domain for the corresponding services, such as a downloading scheduling domain, a picture scheduling domain and the like.

The determination method of the average packet loss rate may refer to the foregoing determination method of the average packet loss rate, and will not be described herein.

The load here may be a real-time load of the target CDN node, or an average load of the target CDN node in a certain period.

By adopting the technical scheme, the target CDN nodes with the average packet loss rate higher than the second preset packet loss rate threshold and the load higher than the second preset load value are removed, so that the influence of the target CDN nodes with the conditions of packet loss, high machine performance running and the like on corresponding CDN services can be avoided.

Fig. 6 is a schematic block diagram of a quality scheduling apparatus according to one embodiment of the present disclosure. As shown in fig. 6, the quality schedule finally includes: an obtaining module 61, configured to obtain an effective round trip delay of each CDN node to which each operator belongs in each geographic area for a client IP to which the corresponding operator belongs in the corresponding geographic area; the determining module 62 is configured to determine, as target CDN nodes for quality scheduling, the first N CDN nodes with the optimal effective round trip delay among all CDN nodes belonging to each operator in each geographic area, where N is a positive integer greater than or equal to 1.

Optionally, the obtaining module 61 is configured to: determining the IP of a client capable of detecting communication, which each operator belongs to, in each geographic area; acquiring the round trip delay of each client IP which can be detected and is belonged to each CDN node which belongs to each operator in each geographic area aiming at each client IP which can be detected and is belonged to the corresponding operator in the corresponding geographic area; and determining the average round trip delay of each CDN node of each operator in each geographic area for all the client-side IP which can be detected and is corresponding to the corresponding operator in the corresponding geographic area, and taking the average round trip delay as the effective round trip delay.

Optionally, the obtaining module 61 is configured to: and acquiring the round trip delay of each CDN node which belongs to each operator in each geographic area for detecting each client IP which belongs to the corresponding operator in the corresponding geographic area and can be detected once every first preset time length.

Optionally, the obtaining module 61 is configured to: and averaging the round trip delay of all the client-side IP which can be detected and belongs to each CDN node which belongs to each operator in each geographic area aiming at the corresponding operator in the corresponding geographic area every second preset time length to obtain the average round trip delay of each CDN node as the effective round trip delay.

Optionally, the acquiring module 61 is configured to acquire an average packet loss rate of each CDN node to which each operator belongs in each geographic area for all the client IPs that can be detected and that can be detected to which the corresponding operator belongs in the corresponding geographic area; the determining module 62 is configured to reject CDN nodes with the average packet loss rate higher than a first preset packet loss rate threshold and the load higher than a first preset load value, and determine the first N CDN nodes with the optimal effective round trip delay among the rejected CDN nodes belonging to each operator in each geographic area as target CDN nodes for quality scheduling.

Optionally, the obtaining module 61 is further configured to obtain quality index data corresponding to the corresponding service, where the quality index data corresponds to a client IP capable of detecting access to which each operator belongs in each geographic area; the determining module 62 is further configured to select, based on the quality index data, a target CDN node that meets a quality index requirement from the target CDN nodes as a CDN node for the corresponding service.

Optionally, the obtaining module 61 is further configured to obtain an average packet loss rate of each target CDN node for all the client IPs that belong to the corresponding operator in the corresponding geographic area and can be detected; the determining module 62 is further configured to reject target CDN nodes, among the target CDN nodes, having the average packet loss rate higher than a second preset packet loss rate threshold and a load higher than a second preset load value, and select, from among the rejected target CDN nodes, a target CDN node satisfying the quality index requirement as a CDN node for the corresponding service based on the quality index data.

Specific embodiments of each module in the quality scheduling apparatus according to the embodiments of the present disclosure have been described in detail in the related methods, and are not described herein again.

Referring now to fig. 7, a schematic diagram of an electronic device 600 suitable for use in implementing embodiments of the present disclosure is shown. The terminal devices in the embodiments of the present disclosure may include, but are not limited to, mobile terminals such as mobile phones, notebook computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), in-vehicle terminals (e.g., in-vehicle navigation terminals), and the like, and stationary terminals such as digital TVs, desktop computers, and the like. The electronic device shown in fig. 7 is merely an example and should not be construed to limit the functionality and scope of use of the disclosed embodiments.

As shown in fig. 7, the electronic device 600 may include a processing means (e.g., a central processing unit, a graphic processor, etc.) 601, which may perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 602 or a program loaded from a storage means 608 into a Random Access Memory (RAM) 603. In the RAM 603, various programs and data required for the operation of the electronic apparatus 600 are also stored. The processing device 601, the ROM 602, and the RAM 603 are connected to each other through a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.

In general, the following devices may be connected to the I/O interface 605: input devices 606 including, for example, a touch screen, touchpad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, and the like; an output device 607 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like; storage 608 including, for example, magnetic tape, hard disk, etc.; and a communication device 609. The communication means 609 may allow the electronic device 600 to communicate with other devices wirelessly or by wire to exchange data. While fig. 7 shows an electronic device 600 having various means, it is to be understood that not all of the illustrated means are required to be implemented or provided. More or fewer devices may be implemented or provided instead.

In particular, according to embodiments of the present disclosure, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a non-transitory computer readable medium, the computer program comprising program code for performing the method shown in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via communication means 609, or from storage means 608, or from ROM 602. The above-described functions defined in the methods of the embodiments of the present disclosure are performed when the computer program is executed by the processing device 601.

It should be noted that the computer readable medium described in the present disclosure may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this disclosure, a computer-readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present disclosure, however, the computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, fiber optic cables, RF (radio frequency), and the like, or any suitable combination of the foregoing.

In some implementations, the clients, servers may communicate using any currently known or future developed network protocol, such as HTTP (HyperText Transfer Protocol ), and may be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), the internet (e.g., the internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed networks.

The computer readable medium may be contained in the electronic device; or may exist alone without being incorporated into the electronic device.

The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: acquiring effective round trip delay of each CDN node to which each operator belongs in each geographic area aiming at the client IP to which the corresponding operator belongs in the corresponding geographic area; and determining the first N CDN nodes with the optimal effective round trip delay in all CDN nodes of each operator in each geographic area as target CDN nodes for quality scheduling.

Computer program code for carrying out operations of the present disclosure may be written in one or more programming languages, including, but not limited to, an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider).

The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The modules described in the embodiments of the present disclosure may be implemented in software or hardware. The name of a module does not in some cases define the module itself.

The functions described above herein may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: a Field Programmable Gate Array (FPGA), an Application Specific Integrated Circuit (ASIC), an Application Specific Standard Product (ASSP), a system on a chip (SOC), a Complex Programmable Logic Device (CPLD), and the like.

In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. The machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

According to one or more embodiments of the present disclosure, example 1 provides a quality scheduling method, comprising: acquiring effective round trip delay of each CDN node to which each operator belongs in each geographic area aiming at the client IP to which the corresponding operator belongs in the corresponding geographic area; and determining the first N CDN nodes with the optimal effective round trip delay in all CDN nodes of each operator in each geographic area as target CDN nodes for quality scheduling, wherein N is a positive integer greater than or equal to 1.

Example 2 provides the method of example 1, according to one or more embodiments of the present disclosure, wherein: the obtaining the effective round trip delay of each CDN node to which each operator belongs in each geographic region for the client IP to which the corresponding operator belongs in the corresponding geographic region includes: determining the IP of a client capable of detecting communication, which each operator belongs to, in each geographic area; acquiring the round trip delay of each client IP which can be detected and is belonged to each CDN node which belongs to each operator in each geographic area aiming at each client IP which can be detected and is belonged to the corresponding operator in the corresponding geographic area; and determining the average round trip delay of each CDN node of each operator in each geographic area for all the client-side IP which can be detected and is corresponding to the corresponding operator in the corresponding geographic area, and taking the average round trip delay as the effective round trip delay.

Example 3 provides the method of example 2, according to one or more embodiments of the present disclosure, wherein: the obtaining the round trip delay of each CDN node to which each operator belongs in each geographic region for each client IP to which the corresponding operator belongs in the corresponding geographic region includes: and acquiring the round trip delay of each CDN node which belongs to each operator in each geographic area for detecting each client IP which belongs to the corresponding operator in the corresponding geographic area and can be detected once every first preset time length.

Example 4 provides the method of example 2, according to one or more embodiments of the present disclosure, wherein: the determining, as the effective round trip delay, an average round trip delay of each CDN node to which each operator belongs in each geographic region for all client IPs that can be probed and to which the corresponding operator belongs in the corresponding geographic region includes: and averaging the round trip delay of all the client-side IP which can be detected and belongs to each CDN node which belongs to each operator in each geographic area aiming at the corresponding operator in the corresponding geographic area every second preset time length to obtain the average round trip delay of each CDN node as the effective round trip delay.

Example 5 provides the method of example 1, according to one or more embodiments of the present disclosure, wherein: the determining the first N CDN nodes with the optimal effective round trip delay from all CDN nodes belonging to each operator in each geographic region as a target CDN node for quality scheduling includes: acquiring average packet loss rate of all client-side IP which can be detected and which belongs to the corresponding operator in the corresponding geographic area by each CDN node which belongs to the operator in each geographic area; removing CDN nodes with the average packet loss rate higher than a first preset packet loss rate threshold and the load higher than a first preset load value; and determining the first N CDN nodes with the optimal effective round trip delay in the CDN nodes after the rejection, which each operator belongs to, in each geographic area as target CDN nodes for quality scheduling.

According to one or more embodiments of the present disclosure, example 6 provides the method of any one of examples 1 to 5, further comprising: acquiring quality index data corresponding to corresponding services of a client IP which can be detected and belongs to each operator in each geographic area; and selecting a target CDN node meeting the quality index requirement from the target CDN nodes based on the quality index data as a CDN node for the corresponding service.

Example 7 provides the method of example 6, according to one or more embodiments of the present disclosure, wherein: the selecting, based on the quality index data, a target CDN node satisfying a quality index requirement from the target CDN nodes as a CDN node for the corresponding service, including: acquiring the average packet loss rate of each target CDN node for all the client-side IP which belongs to the corresponding operator and can be detected under the corresponding geographic area; removing target CDN nodes, of which the average packet loss rate is higher than a second preset packet loss rate threshold value and the load is higher than a second preset load value, from the target CDN nodes; and selecting a target CDN node meeting the quality index requirement from the rejected target CDN nodes based on the quality index data as a CDN node for the corresponding service.

According to one or more embodiments of the present disclosure, example 8 provides a quality scheduling apparatus, comprising: the acquiring module is used for acquiring the effective round trip delay of each CDN node to which each operator belongs in each geographic area aiming at the client IP to which the corresponding operator belongs in the corresponding geographic area; the determining module is configured to determine the first N CDN nodes with the optimal effective round trip delay among all CDN nodes belonging to each operator in each geographic region as a target CDN node for quality scheduling, where N is a positive integer greater than or equal to 1.

According to one or more embodiments of the present disclosure, example 9 provides the apparatus of example 8, wherein the acquisition module is to: determining the IP of a client capable of detecting communication, which each operator belongs to, in each geographic area; acquiring the round trip delay of each client IP which can be detected and is belonged to each CDN node which belongs to each operator in each geographic area aiming at each client IP which can be detected and is belonged to the corresponding operator in the corresponding geographic area; and determining the average round trip delay of each CDN node of each operator in each geographic area for all the client-side IP which can be detected and is corresponding to the corresponding operator in the corresponding geographic area, and taking the average round trip delay as the effective round trip delay.

According to one or more embodiments of the present disclosure, example 10 provides the apparatus of example 9, wherein the acquisition module is to: and acquiring the round trip delay of each CDN node which belongs to each operator in each geographic area for detecting each client IP which belongs to the corresponding operator in the corresponding geographic area and can be detected once every first preset time length.

According to one or more embodiments of the present disclosure, example 11 provides the apparatus of example 9, wherein the acquisition module is to: and averaging the round trip delay of all the client-side IP which can be detected and belongs to each CDN node which belongs to each operator in each geographic area aiming at the corresponding operator in the corresponding geographic area every second preset time length to obtain the average round trip delay of each CDN node as the effective round trip delay.

According to one or more embodiments of the present disclosure, example 12 provides the apparatus of example 8, wherein the obtaining module is further configured to obtain an average packet loss rate of each CDN node to which each operator belongs in each geographic region for all client IPs that can be probed that the corresponding operator belongs in the corresponding geographic region; the determining module is further configured to reject the CDN nodes having the average packet loss rate higher than the first preset packet loss rate threshold and the load higher than the first preset load value, and determine the first N CDN nodes with the optimal effective round trip delay among the rejected CDN nodes belonging to each operator in each geographic area as a target CDN node for quality scheduling.

According to one or more embodiments of the present disclosure, example 13 provides the apparatus of any one of examples 8 to 12, wherein the obtaining module is further configured to obtain quality indicator data corresponding to the corresponding service of the probeable client IP to which each operator belongs in each geographic area; the determining module is further configured to select, from the target CDN nodes, a target CDN node that meets a quality index requirement as a CDN node for the corresponding service based on the quality index data.

According to one or more embodiments of the present disclosure, example 14 provides the apparatus of example 13, wherein the obtaining module is further configured to obtain an average packet loss rate of each of the target CDN nodes for all the client IPs that can be probed and to which a corresponding operator belongs in a corresponding geographic region; the determining module is further configured to reject the target CDN node, of the target CDN nodes, that has the average packet loss rate higher than a second preset packet loss rate threshold and a load higher than a second preset load value, and select, from among the rejected target CDN nodes, a target CDN node that meets the quality index requirement as a CDN node for the corresponding service based on the quality index data.

The foregoing description is only of the preferred embodiments of the present disclosure and description of the principles of the technology being employed. It will be appreciated by persons skilled in the art that the scope of the disclosure referred to in this disclosure is not limited to the specific combinations of features described above, but also covers other embodiments which may be formed by any combination of features described above or equivalents thereof without departing from the spirit of the disclosure. Such as those described above, are mutually substituted with the technical features having similar functions disclosed in the present disclosure (but not limited thereto).

Moreover, although operations are depicted in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order. In certain circumstances, multitasking and parallel processing may be advantageous. Likewise, while several specific implementation details are included in the above discussion, these should not be construed as limiting the scope of the present disclosure. Certain features that are described in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination.

Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are example forms of implementing the claims. The specific manner in which the various modules perform the operations in the apparatus of the above embodiments have been described in detail in connection with the embodiments of the method, and will not be described in detail herein.

Claims

1. The CDN quality scheduling method is characterized by comprising the following steps of: during the global load balancing of the DNS,

acquiring effective round trip delay of each CDN node in all CDN nodes belonging to the same operator in the same geographic area aiming at a client IP belonging to the same operator in the same geographic area;

determining the first N CDN nodes with the optimal effective round trip delay in all CDN nodes belonging to the same operator in the same geographic area as target CDN nodes for quality scheduling, and forming the target CDN nodes into a DNS scheduling domain for DNS global load balancing, wherein N is a positive integer greater than or equal to 1;

acquiring quality index data corresponding to CDN service of a client IP which belongs to the same operator and can be detected under the same geographic area;

and selecting a target CDN node meeting the quality index requirement from the target CDN nodes based on the quality index data as a CDN node for the CDN service, and forming the CDN node for the CDN service into a DNS scheduling domain for the CDN service.

2. The method of claim 1, wherein the obtaining an effective round trip delay of each CDN node of all CDN nodes belonging to the same operator in the same geographic region for a client IP belonging to the same operator in the same geographic region comprises:

Determining the IP of a client capable of detecting access, which belongs to the same operator, in the same geographic area;

acquiring the round trip delay of each CDN node in all CDN nodes belonging to the same operator in the same geographic area for each client IP capable of detecting the traffic of the same operator in the same geographic area;

and determining the average round trip delay of each CDN node in all CDN nodes belonging to the same operator in the same geographic area aiming at all client-side IP capable of detecting the traffic of the same operator in the same geographic area, and taking the average round trip delay as the effective round trip delay.

3. The method according to claim 2, wherein the obtaining the round trip delay of each CDN node of all CDN nodes belonging to the same operator in the same geographic region for each client IP capable of probing access belonging to the same operator in the same geographic region includes:

acquiring round trip delay of each CDN node in all CDN nodes belonging to the same operator in the same geographic area, wherein the round trip delay is detected for each client IP capable of detecting the traffic of each client IP belonging to the same operator in the same geographic area every a first preset time length.

4. The method according to claim 2, wherein the determining, as the effective round trip delay, an average round trip delay of each CDN node of all CDN nodes belonging to the same operator in the same geographic area for all client IPs capable of probing through to which the same operator belongs in the same geographic area includes:

and averaging the round trip delay of each CDN node in all CDN nodes belonging to the same operator in the same geographic area according to all client-side IP which can be detected and is in the same geographic area every second preset time length, and obtaining the average round trip delay of each CDN node as the effective round trip delay.

5. The method of claim 1, wherein the determining the first N CDN nodes with the optimal effective round trip delay among all CDN nodes belonging to the same operator in the same geographic region as the target CDN node for quality scheduling includes:

acquiring average packet loss rate of all the client-side IP which can be detected and which is corresponding to the same operator in the same geographic area of each CDN node in all CDN nodes which belong to the same operator in the same geographic area;

Removing CDN nodes with the average packet loss rate higher than a first preset packet loss rate threshold and the load higher than a first preset load value;

and determining the first N CDN nodes with the optimal effective round trip delay in the CDN nodes after the rejection, which belong to the same operator in the same geographic area, as target CDN nodes for quality scheduling.

6. The method of claim 1, wherein the selecting, based on the quality index data, a target CDN node that meets a quality index requirement from the target CDN nodes as a CDN node for the CDN service includes:

acquiring average packet loss rate of all the client-side IP which can be detected and is owned by the same operator in the same geographic area by each target CDN node;

removing target CDN nodes, of which the average packet loss rate is higher than a second preset packet loss rate threshold value and the load is higher than a second preset load value, from the target CDN nodes;

and selecting a target CDN node meeting the quality index requirement from the rejected target CDN nodes based on the quality index data as a CDN node for the CDN service.

7. A CDN quality scheduling apparatus, comprising:

The system comprises an acquisition module, a control module and a control module, wherein the acquisition module is used for acquiring the effective round trip delay of each CDN node in all CDN nodes belonging to the same operator in the same geographic area for the client IP belonging to the same operator in the same geographic area during DNS global load balancing;

a determining module, configured to determine, during the DNS global load balancing, the first N CDN nodes with the optimal effective round trip delay among all CDN nodes belonging to the same operator in the same geographic area as a target CDN node for quality scheduling, and form the target CDN node into a DNS scheduling domain for DNS global load balancing, where N is a positive integer greater than or equal to 1;

the acquiring module is further configured to acquire quality index data corresponding to a CDN service, of a client IP capable of probing, to which the same operator belongs, in the same geographic area during the DNS global load balancing;

the determining module is further configured to select, during the DNS global load balancing, a target CDN node that meets a quality index requirement from the target CDN nodes based on the quality index data, as a CDN node for the CDN service, and combine the CDN node for the CDN service into a DNS dispatch domain for the CDN service.

8. A computer readable medium on which a computer program is stored, characterized in that the program, when being executed by a processing device, carries out the steps of the method according to any one of claims 1-6.

9. An electronic device, comprising:

a storage device having a computer program stored thereon;

processing means for executing said computer program in said storage means to carry out the steps of the method according to any one of claims 1-6.