CN110661879A - Node scheduling method, device and system, scheduling server and terminal equipment - Google Patents

Node scheduling method, device and system, scheduling server and terminal equipment Download PDF

Info

Publication number
CN110661879A
CN110661879A CN201910968273.8A CN201910968273A CN110661879A CN 110661879 A CN110661879 A CN 110661879A CN 201910968273 A CN201910968273 A CN 201910968273A CN 110661879 A CN110661879 A CN 110661879A
Authority
CN
China
Prior art keywords
node
client
scheduling
nodes
quality
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.)
Granted
Application number
CN201910968273.8A
Other languages
Chinese (zh)
Other versions
CN110661879B (en
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 QIYI Century Science and Technology Co Ltd
Original Assignee
Beijing QIYI Century Science and 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 QIYI Century Science and Technology Co Ltd filed Critical Beijing QIYI Century Science and Technology Co Ltd
Priority to CN201910968273.8A priority Critical patent/CN110661879B/en
Publication of CN110661879A publication Critical patent/CN110661879A/en
Application granted granted Critical
Publication of CN110661879B publication Critical patent/CN110661879B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/50Network services
    • H04L67/60Scheduling 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/61Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources taking into account QoS or priority requirements

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Information Transfer Between Computers (AREA)

Abstract

The embodiment of the invention provides a node scheduling method, a node scheduling device, a node scheduling system, a node scheduling server and terminal equipment. The node scheduling method comprises the following steps: the client sends a scheduling request to a scheduling server, wherein the scheduling request comprises content related information of data to be accessed and position related information for representing the position of the client; the scheduling server responds to the scheduling request, and screens a first node meeting a preset screening condition from a plurality of nodes, wherein the preset screening condition comprises the following steps: the stored content conforms to the content-related information, and the service quality of the client in the target area conforms to a predetermined high-quality condition; the scheduling server sends indication information to the client; and the client requests the data to be accessed from the first node based on the indication information. By applying the scheme of the embodiment of the invention, the problem that the quality of data service provided by the node to the client is difficult to ensure by the conventional node scheduling method and finally the client cannot quickly and effectively acquire the data to be accessed can be effectively solved.

Description

Node scheduling method, device and system, scheduling server and terminal equipment
Technical Field
The invention relates to the technical field of internet data service, in particular to a node scheduling method, a node scheduling device, a node scheduling system, a node scheduling server and terminal equipment.
Background
With the development of the internet, a user can request various data from a cloud through a client, for example: video data. In order to meet the access requirements of users in different regions, the cloud server may include a scheduling server and a plurality of nodes dispersed in each region and storing accessible data. In this way, when a user requests data from the cloud through the client, the scheduling server schedules nodes meeting data requirements for the client from the plurality of nodes, so that the client requests the scheduled nodes for the data required by the user.
In the prior art, when a scheduling server schedules nodes, the scheduling server selects a plurality of nodes that conform to content-related information according to the content-related information in a scheduling request sent by a client, and then allocates a node that is close to the client among the selected nodes to the client according to position-related information in the scheduling request.
The inventor finds that the prior art at least has the following problems in the process of implementing the invention: because the quality of the data service provided by the client by the node is influenced by various factors, the existing scheduling method only considers the distance between the node and the client, and is difficult to ensure the quality of the data service provided by the node for the client, and finally, the client cannot quickly and effectively acquire the data to be accessed.
Disclosure of Invention
Embodiments of the present invention provide a node scheduling method, an apparatus, a system, a scheduling server, a terminal device, and a storage medium, so as to solve the problem that the quality of data service provided by a node to a client is difficult to guarantee by using the existing node scheduling method, and finally the client cannot quickly and effectively acquire data to be accessed. The specific technical scheme is as follows:
in a first aspect, an embodiment of the present invention provides a node scheduling method, which is applied to a scheduling system including a client and a scheduling server; the method comprises the following steps:
the client sends a scheduling request to the scheduling server, wherein the scheduling request comprises content related information of data to be accessed and position related information for representing the position of the client;
the scheduling server responds to the scheduling request, and screens a first node meeting a preset screening condition from a plurality of nodes, wherein the preset screening condition comprises the following steps: the stored content conforms to the content-related information, and the service quality of the client in the target area conforms to a predetermined high-quality condition; the target area is a geographical area where the client is located and obtained based on the position related information;
the dispatching server sends indication information that the first node is an accessible node to the client;
and the client requests the data to be accessed from the first node based on the indication information.
Optionally, the screening, by the dispatch server, a first node meeting a predetermined screening condition from a plurality of nodes, including:
the scheduling server screens a plurality of candidate nodes of which the stored contents accord with the content related information from a plurality of nodes;
the scheduling server obtains quality evaluation values of a plurality of candidate nodes aiming at a target area according to the quality evaluation values of the nodes aiming at different geographic areas; the quality evaluation value of any node aiming at a geographic area is used for representing the service quality of the node aiming at a client in the geographic area;
and the scheduling server screens a first node, which meets a preset high-quality screening condition aiming at the service quality of the client in the target area, from the plurality of candidate nodes according to the quality evaluation values aiming at the target area of the plurality of candidate nodes.
Optionally, the screening, by the scheduling server, a first node, from the plurality of candidate nodes, whose service quality for the client in the target area meets a predetermined high-quality screening condition according to the quality evaluation values of the plurality of candidate nodes for the target area, includes:
the scheduling server screens a node with a quality evaluation value higher than a preset evaluation threshold value aiming at a target area from the plurality of candidate nodes, and the node is used as a first node for the service quality of the client in the target area to meet a preset high-quality screening condition;
or,
and the scheduling server sequences the plurality of alternative nodes according to the sequence from high to low of the obtained quality evaluation values, selects the first N alternative nodes in the sequence obtained by sequencing and takes the first N alternative nodes as first nodes according to the preset high-quality screening condition aiming at the service quality of the client in the target area.
Optionally, the calculation manner of the quality evaluation value of any node for different geographic areas includes:
the scheduling server obtains service quality parameters of clients in different geographic areas when the clients are served by the node;
and the scheduling server calculates quality judgment values of the node aiming at different geographic areas based on the obtained service quality parameters.
Optionally, the system further comprises an information acquisition server; the calculation mode of the quality evaluation value of any node aiming at different geographic areas comprises the following steps:
the information acquisition server acquires service quality parameters of the client provided with services by the node in different geographic areas;
the information acquisition server calculates quality judgment values of the node aiming at different geographic areas based on the obtained service quality parameters;
the scheduling server obtains quality evaluation values of a plurality of candidate nodes aiming at a target area according to the quality evaluation values of the nodes aiming at different geographic areas, and the quality evaluation values comprise:
and the scheduling server acquires the quality evaluation values of a plurality of candidate nodes aiming at the target area according to the quality evaluation values of the nodes aiming at different geographical areas, which are calculated by the information acquisition server.
Optionally, the number of the first nodes is multiple;
the method for sending the indication information of the first node as the accessible node to the client by the scheduling server comprises the following steps:
the scheduling server sends indication information for indicating each first node as an accessible node and reference information corresponding to each first node to the client; the reference information comprises a quality judgment value and/or a cost coefficient aiming at a target area, and the cost coefficient is in a direct proportion relation with the running cost of the node;
the client requests the data to be accessed from the first node based on the indication information, and the method comprises the following steps:
and the client screens target nodes from all the first nodes indicated by the indication information according to the received reference information, and requests the target nodes for the data to be accessed.
Optionally, when the reference information includes a quality evaluation value and a cost coefficient for the target area, and the quality evaluation value includes a download speed, the client filters a target node from the first nodes indicated by the indication information according to the received reference information, including:
if the local data cache of the client is 0, selecting the node with the highest downloading speed in each first node as a target node;
if the local data cache of the client is larger than 0 and smaller than a preset data cache threshold value, selecting a node with the maximum comprehensive cost ratio value in each first node as a target node, wherein the comprehensive cost ratio value is equal to the ratio of the download speed to the cost coefficient;
if the local data cache of the client is larger than the preset data cache threshold, selecting the node with the minimum cost coefficient in each first node as a target node;
the local data cache of the client is as follows: and the client caches local data corresponding to the content related information.
Optionally, before the client sends the scheduling request to the scheduling server, the method further includes:
the client searches a node corresponding to the content related information of the data to be accessed from a local database; the local database records the corresponding relation between the content related information of the historical access data and the nodes providing the historical access data;
when the data to be accessed is searched, requesting the searched node for the data to be accessed;
and when the scheduling request is not searched, executing the step of sending the scheduling request to the scheduling server.
In a second aspect, an embodiment of the present invention provides a node scheduling method, which is applied to a scheduling server in a scheduling system, where the scheduling server further includes a client; the method comprises the following steps:
receiving a scheduling request sent by the client, wherein the scheduling request comprises content related information of data to be accessed and position related information used for representing the position of the client;
screening a first node from a plurality of nodes, the first node meeting a predetermined screening condition, the predetermined screening condition comprising: the stored content conforms to the content-related information, and the service quality of the client in the target area conforms to a predetermined high-quality condition; the target area is a geographical area where the client is located and obtained based on the position related information;
and sending indication information for indicating the first node as an accessible node to the client.
In a third aspect, an embodiment of the present invention provides a node scheduling method, which is applied to a client in a scheduling system, where the scheduling system further includes a scheduling server; the method comprises the following steps:
sending a scheduling request to the scheduling server, wherein the scheduling request comprises content-related information of data to be accessed and position-related information for representing the position of the client;
receiving indication information that a first node sent by the scheduling server in response to the scheduling request can be an accessible node;
and requesting data to be accessed from the first node based on the indication information.
In a fourth aspect, an embodiment of the present invention provides a node scheduling apparatus, which is applied to a scheduling server in a scheduling system, where the scheduling system further includes a client; the device comprises:
a request receiving module, configured to receive a scheduling request sent by the client, where the scheduling request includes content-related information of data to be accessed and location-related information used to represent a location where the client is located;
a node screening module, configured to screen a first node that meets a predetermined screening condition from a plurality of nodes, where the predetermined screening condition includes: the stored content conforms to the content-related information, and the service quality of the client in the target area conforms to a predetermined high-quality condition; the target area is a geographical area where the client is located and obtained based on the position related information;
an information sending module, configured to send, to the client, indication information for indicating that the first node is an accessible node.
In a fifth aspect, an embodiment of the present invention provides a node scheduling apparatus, which is applied to a client in a scheduling system, where the scheduling system further includes a scheduling server; the device comprises:
the scheduling request module is used for sending a scheduling request to the scheduling server, wherein the scheduling request comprises content related information of data to be accessed and position related information used for representing the position of the client;
an information receiving module, configured to receive indication information that a first node sent by the scheduling server in response to the scheduling request is available as an accessible node;
and the data access module is used for requesting the data to be accessed from the first node based on the indication information.
In a sixth aspect, an embodiment of the present invention provides a node scheduling system, where the system includes a scheduling server and a client;
the client is used for sending a scheduling request to the scheduling server, wherein the scheduling request comprises content related information of data to be accessed and position related information used for representing the position of the client;
the scheduling server is configured to filter, in response to the scheduling request, a first node that meets a predetermined filtering condition from a plurality of nodes, where the predetermined filtering condition includes: the stored content conforms to the content-related information, and the service quality of the client in the target area conforms to a predetermined high-quality condition; the target area is a geographical area where the client is located and obtained based on the position related information;
the scheduling server is further configured to send, to the client, indication information that the first node is an accessible node;
the client is further used for requesting the data to be accessed from the first node based on the indication information.
A seventh aspect, an embodiment of the present invention provides a scheduling server, where the scheduling server includes a processor, a communication interface, a memory, and a communication bus, where the processor, the communication interface, and the memory complete communication with each other through the communication bus;
a memory for storing a computer program;
a processor, configured to implement the method steps of the second aspect when executing the program stored in the memory.
In an eighth aspect, an embodiment of the present invention provides a terminal device, where the terminal device includes a processor, a communication interface, a memory, and a communication bus, where the processor and the communication interface complete communication between the memory and the processor through the communication bus;
a memory for storing a computer program;
a processor for implementing the method steps of the third aspect when executing the program stored in the memory.
In a ninth aspect, the present invention provides a computer-readable storage medium, in which a computer program is stored, and when the computer program is executed by a processor, the method steps of the first to third aspects are implemented.
As can be seen from the above, by setting the predetermined filtering condition, the method provided by the embodiment of the present invention can filter, from the plurality of nodes, the first node that satisfies that the stored content meets the content related information and that the service quality of the client in the target area meets the predetermined high quality condition, and send the first node to the client, so that the client can connect to the first node. Therefore, the scheduling server schedules high-quality nodes for the client by the preset screening condition based on the content related information and the position related information in the client scheduling request, so that the client can be connected to the nodes with higher service quality, and the client can quickly and effectively acquire the data to be accessed. Therefore, the problem that the service quality provided by the nodes is difficult to guarantee by the existing node scheduling method and finally the client cannot rapidly and effectively acquire the data to be accessed can be effectively solved through the scheme.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a flowchart of a node scheduling method applied to a scheduling system according to an embodiment of the present invention;
fig. 2 is a flowchart of another node scheduling method applied to a scheduling system according to an embodiment of the present invention;
fig. 3 is a flowchart of a node scheduling method applied to a scheduling server according to an embodiment of the present invention;
fig. 4 is a flowchart of a node scheduling method applied to a client according to an embodiment of the present invention;
fig. 5 is a schematic structural diagram of a node scheduling apparatus according to an embodiment of the present invention;
fig. 6 is a schematic structural diagram of another node scheduling apparatus according to an embodiment of the present invention;
fig. 7 is a schematic structural diagram of a node scheduling system according to an embodiment of the present invention;
fig. 8 is a schematic structural diagram of another node scheduling system according to an embodiment of the present invention;
fig. 9 is a schematic structural diagram of a dispatch server according to an embodiment of the present invention;
fig. 10 is a schematic structural diagram of a terminal device according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
In the prior art, when a scheduling server schedules nodes, the scheduling server selects a plurality of nodes that conform to content-related information according to the content-related information in a scheduling request sent by a client, and then allocates a node that is close to the client among the selected nodes to the client according to position-related information in the scheduling request.
For example, when a user needs to watch an episode or a movie, the user uses a client to send a scheduling request to a scheduling server, and the scheduling request generally includes content-related information such as a video file name and a bitrate and location-related information such as a client IP. The scheduling server receives the scheduling request, selects a plurality of nodes which meet the content related information such as file names, code rates and the like from a plurality of nodes, then selects nodes close to a user from the plurality of nodes through the position related information such as client IP and the like, and sends the address information (such as IP addresses) of the nodes to the client, so that the client can access the target node through the address information of the nodes.
Because the quality of the data service provided by the client by the node is influenced by various factors, the existing scheduling method only considers the distance between the node and the client, and is difficult to ensure the quality of the data service provided by the central node for the client equipment, and finally, the client cannot quickly and effectively acquire the data to be accessed. For example, the failure to obtain data to be accessed quickly and efficiently can be expressed as: when a user watches an episode or a movie, a picture delay, a pause, and the like may occur.
In order to solve the problem that the quality of data service provided by a node to a client is difficult to guarantee by the conventional node scheduling method, and finally the client cannot quickly and effectively acquire data to be accessed, the embodiment of the invention provides a node scheduling method, a device, a system, a scheduling server, terminal equipment and a storage medium.
First, a node scheduling method provided in an embodiment of the present invention is described below.
The node scheduling method provided by the embodiment of the invention is applied to a scheduling system comprising a client and a scheduling server; as shown in fig. 7, the scheduling system includes a scheduling server 701 and a client 702, where the client 702 requests the scheduling server 701 for node scheduling before accessing data, the scheduling server 701 allocates a node to the client 702 based on the request of the client 702, and the client 702 further requests the node allocated by the scheduling server 701 for data.
As shown in fig. 1, a node scheduling method applied to a scheduling system according to an embodiment of the present invention may include the following steps:
s101, the client sends a scheduling request to the scheduling server, wherein the scheduling request comprises content related information of data to be accessed and position related information for representing the position of the client;
s102, the scheduling server, in response to the scheduling request, filters a first node meeting a predetermined filtering condition from a plurality of nodes, where the predetermined filtering condition includes: the stored content conforms to the content-related information, and the service quality of the client in the target area conforms to a predetermined high-quality condition; the target area is a geographical area where the client is located and obtained based on the position related information;
s103, the dispatching server sends the indication information of the first node as an accessible node to the client;
wherein the indication information is used for indicating the first node which can be connected to the client. The indication information may be IP address information of the first node or identification information indicating the location of the first node, or the like.
S104, the client requests the data to be accessed from the first node based on the indication information.
Wherein, the number of the screened first nodes can be one or more. For the screened first nodes, the client can select access according to preset conditions or randomly.
In step S101, the content-related information of different types of data to be accessed is different. Taking online video as an example, the content-related information may include a video file name, a bit rate, audio information, and the like; for online audio, the content-related information may include an audio file name, an audio format, audio quality, and the like. The location-related information of the location where the client is located may be an IP address of a device running the client, or an administrative area (province, county, city, etc.) where the client is located, or a location of an area divided by a user according to actual needs, but is not limited thereto.
In step S102, the scheduling server may filter a plurality of specific implementations of the first node that meets the predetermined filtering condition from the plurality of nodes. For example, in an implementation manner, screening a first node meeting a predetermined screening condition from a plurality of nodes may include the following steps one, two, and three:
step one, the dispatching server screens a plurality of candidate central nodes which accord with the content related information from a plurality of nodes;
secondly, the scheduling server obtains quality evaluation values of a plurality of candidate nodes aiming at a target area according to the quality evaluation values of the nodes aiming at different geographic areas; the quality evaluation value of any node aiming at a geographic area is used for representing the service quality of the node aiming at a client in the geographic area;
and thirdly, screening a first node, which meets a preset high-quality screening condition aiming at the service quality of the client in the target area, from the plurality of candidate nodes by the scheduling server according to the quality evaluation values aiming at the target area of the plurality of candidate nodes.
The scheduling server can screen a plurality of candidate nodes which accord with the content related information from a plurality of nodes through data information which is recorded by the scheduling server and stored by each node; the candidate node conforming to the content-related information is a node capable of providing data to be accessed for the client. The scheduling server may pre-record content-related information of data stored in each node, so that after the content-related information of the data to be accessed sent by the client is obtained, the content-related information of the data to be accessed may be matched with the content-related information corresponding to each node to obtain an alternative node, where the content-related information of the data stored in the alternative node is the same as the content-related information of the data to be accessed. Of course, the scheduling server may also obtain the data information stored by the node by accessing each node, and then filter a plurality of candidate nodes that meet the content-related information from the plurality of nodes.
It should be noted that the quality evaluation value corresponding to any optional node is a quality evaluation value of the service provided by the node to the client in the target area; the target area is an area where the client is located and is determined based on the position-related information. The quality evaluation value may include one or more of a download speed, a hit rate, and the like. The hit rate is the ratio of the amount of data requested by the requestor to the amount of data actually obtained by the requestor. In the embodiment of the invention, the request party is a client. In addition, the type of the content included in the quality evaluation value corresponding to each candidate node is the same as the type of the content included in the quality evaluation value.
It should be noted that there are various calculation methods for obtaining the quality evaluation values of each node for different geographic areas.
For example, in a possible implementation manner, the calculation manner of the quality evaluation values of any node for different geographic areas may include:
the scheduling server obtains service quality parameters of clients in different geographic areas when the clients are served by the node;
and the scheduling server calculates quality judgment values of the node aiming at different geographic areas based on the obtained service quality parameters.
In this implementation, when each node provides a service to a client in any area, the scheduling server may collect the quality of service parameters from the client, so that the scheduling server may collect the quality of service parameters of each node for different areas by itself.
When each client is served by each node, the service quality parameters can be determined and reported to the scheduling server, so that the scheduling server can acquire the service quality parameters of each node for different areas.
In another possible implementation manner, in order to reduce the burden of the scheduling server, on the basis of including the scheduling server and the client, the scheduling system may further include an information collecting server through which information collection is performed from the client. For the scheduling system including the information collecting server, the schematic structural diagram can refer to fig. 8, as shown in fig. 8, the scheduling system includes: a scheduling server 701, a client 702 and an information collection server 703. Therefore, on the premise of containing the information acquisition server, the calculation mode of any node aiming at the quality judgment values of different geographic areas comprises the following steps:
the information acquisition server acquires service quality parameters of the client provided with services by the node in different geographic areas;
and the information acquisition server calculates quality judgment values of the node aiming at different geographic areas based on the obtained service quality parameters.
And the scheduling server acquires the quality evaluation values of a plurality of candidate nodes aiming at the target area according to the quality evaluation values of the nodes aiming at different geographical areas, which are calculated by the information acquisition server.
In this implementation, when each node provides a service to a client in any area, the information acquisition server may acquire the quality of service parameters from the client, so that the information acquisition server may acquire the quality of service parameters of each node for different areas by itself.
For clarity of the solution, a specific type of the quality of service parameter is described below by taking a specific quality evaluation value as an example, and an implementation manner of calculating the quality evaluation values of the node for different geographic areas based on the obtained quality of service parameter is calculated.
Illustratively, when the quality evaluation value only includes the download speed, the quality of service parameters may include at least: the speed at which the data is downloaded. At this time, based on the obtained quality of service parameters, the specific process of calculating the quality evaluation values of the node for different geographic areas may include: and aiming at each geographic area, performing first preprocessing on the data downloading speed of each client in the area when the client is served by the node, and determining the value obtained by the first preprocessing as a quality judgment value of the node on the service provided by the client in the area. The first preprocessing may be an averaging processing, a median processing, or a minimum processing.
Illustratively, when the quality evaluation value includes only the hit rate, the quality of service parameters may include at least: with respect to the ratio of the amount of requested data to the amount of data actually obtained. At this time, based on the obtained quality of service parameters, the specific process of calculating the quality evaluation values of the node for different geographic areas may include: and aiming at each geographic area, performing second preprocessing on the quantity ratio of each client in the area when the client is served by the node, and determining the value obtained by the second preprocessing as a quality judgment value of the node on the service provided by the client in the area. The second preprocessing may be an averaging processing, a median processing, or a minimum processing.
It will be appreciated that when the quality assessment value includes both hit rate and download speed, then the quality of service parameters may include at least: the speed at which the data is downloaded, and the ratio of the amount of data requested to that actually obtained. At this time, the first preprocessing may be performed on the download speed of each client in the area when the client is served by the node in the similar manner as described above, and the second preprocessing may be performed on the hit rate, then corresponding weight values are respectively set for the download speed and the hit rate after the preprocessing, the download speed and the hit rate after the preprocessing are respectively multiplied by the weight values, and then the summation is performed, so as to calculate the quality evaluation value of the service provided by the client in the area by the node.
In addition, it should be noted that, from the plurality of candidate nodes, there are various specific implementations of filtering the first node whose service quality for the client in the target area meets the predetermined high-quality filtering condition.
Optionally, in a possible implementation manner, the screening, by the scheduling server, a first node, from the plurality of candidate nodes, whose service quality for the client in the target area meets a predetermined high-quality screening condition according to the quality evaluation values of the plurality of candidate nodes for the target area, may include:
and the scheduling server screens the nodes with the quality evaluation value higher than a preset evaluation threshold value aiming at the target area from the plurality of candidate nodes as first nodes of which the service quality aiming at the client in the target area meets a preset high-quality screening condition.
For clarity, specific implementation procedures of the implementation mode are exemplarily described below with reference to specific contents included in the quality evaluation value:
when the quality evaluation value only comprises the downloading speed, the candidate node with the downloading speed greater than the preset downloading speed threshold value is determined as the first node by comparing the downloading speeds corresponding to different candidate nodes with the preset downloading speed threshold value.
When the quality evaluation value only comprises the hit rate, determining the candidate node with the hit rate larger than the preset hit rate threshold as the first node by comparing the hit rate corresponding to the candidate node with the preset hit rate.
When the quality evaluation value comprises the download speed and the hit rate, corresponding priorities can be set for the download speed and the hit rate, and the service quality provided by different alternative nodes to the client is evaluated according to the sequence from high to low of the priorities, so that the first node is screened from the multiple alternative nodes.
For example, the priority of the downloading speed can be set to be higher than the hit rate, and at this time, whether the numerical values of the downloading speeds corresponding to different candidate nodes are all larger than a predetermined downloading speed threshold value is judged;
when the number of the candidate nodes is not greater than the preset downloading speed threshold value, determining the candidate nodes with the downloading speed values greater than the preset downloading speed threshold value as first nodes;
and when the candidate nodes are all larger than the preset download speed threshold, judging whether the hit rates corresponding to the different candidate nodes are all larger than the preset hit rate threshold, if not, determining the candidate nodes with the hit rates larger than the preset hit rate threshold as first nodes, and if so, selecting all the candidate nodes or randomly selecting a plurality of the candidate nodes as the first nodes.
Optionally, in another possible implementation manner, the screening, by the scheduling server, a first node, from the plurality of candidate nodes, whose service quality for the client in the target area meets a predetermined high-quality screening condition according to the quality evaluation values of the plurality of candidate nodes for the target area may include:
and the scheduling server sequences the plurality of alternative nodes according to the sequence from high to low of the obtained quality evaluation values, selects the first N alternative nodes in the sequence obtained by sequencing and takes the first N alternative nodes as first nodes according to the preset high-quality screening condition aiming at the service quality of the client in the target area.
Of course, the scheduling server may also sort the plurality of candidate nodes according to the sequence of the obtained quality evaluation values from low to high, and select the last N candidate nodes in the sorted sequence as the first nodes according to the predetermined high-quality screening condition for the service quality of the client in the target area.
For clarity, specific implementation procedures of the implementation mode are exemplarily described below with reference to specific contents included in the quality evaluation value:
when the quality evaluation value only includes the download speed, the download speed can be used as a sorting basis, the candidate nodes are sorted according to the sequence from high download speed to low download speed, and the top N candidate nodes in the sequence obtained by sorting are determined as the first nodes.
When the quality evaluation value only includes the hit rate, the hit rate can be used as a sorting basis, the candidate nodes are sorted according to the sequence from high to low of the hit rate, and the top N candidate nodes in the sequence obtained by sorting are determined as the first nodes.
When the quality evaluation value includes a download speed and a hit rate, a priority of the download speed may be set higher than a priority of the hit rate. Sequencing all the alternative nodes in the sequence of high to low download speed; when the downloading speeds of a plurality of alternative nodes in the current sequence are the same, sequencing the plurality of alternative nodes with the same downloading speed according to the sequence from high hit rate to low hit rate, and determining the first N alternative nodes in the sequence obtained by sequencing again as the first node. Of course, the hit rate can also be set to have a higher priority than the download speed, and the sorting manner at this time is similar to the above-mentioned manner, and will not be described herein again.
It should be emphasized that the specific implementation manner of the scheduling server for screening the first node meeting the predetermined screening condition from the plurality of nodes is not limited to the implementation manner shown in the above step one, step two and step three. For example: the scheduling server can also obtain the quality evaluation values of the plurality of nodes aiming at the target area according to the quality evaluation values of the nodes aiming at different geographic areas; and screening a plurality of candidate nodes of which the service quality for the client in the target area meets a preset high-quality screening condition from the plurality of nodes according to the quality evaluation values of the plurality of nodes for the target area, and then screening a plurality of first nodes of which the stored content meets the content-related information from the plurality of candidate nodes.
As can be seen from the above, by setting the predetermined filtering condition, the method provided by the embodiment of the present invention can filter, from the plurality of nodes, the first node that satisfies that the stored content meets the content related information and that the service quality of the client in the target area meets the predetermined high quality condition, and send the first node to the client, so that the client can connect to the first node. Therefore, the scheduling server schedules high-quality nodes for the client by the preset screening condition based on the content related information and the position related information in the client scheduling request, so that the client can be connected to the nodes with higher service quality, and the client can quickly and effectively acquire the data to be accessed. Therefore, the problem that the service quality provided by the nodes is difficult to guarantee by the existing node scheduling method and finally the client cannot rapidly and effectively acquire the data to be accessed can be effectively solved through the scheme.
Since the number of the first nodes fed back to the client by the scheduling server may be multiple, a certain mode may be selected, and a node more suitable for the client is selected from the multiple first nodes, so as to further improve the matching degree of the nodes.
Based on the processing idea, an embodiment of the present invention further provides another node scheduling method, which is applied to a scheduling system, and as shown in fig. 2, the method may include the following steps:
s201, the client sends a scheduling request to the scheduling server, wherein the scheduling request comprises content related information of data to be accessed and position related information for representing the position of the client;
s202, in response to the scheduling request, the scheduling server filters a first node meeting a predetermined filtering condition from a plurality of nodes, where the predetermined filtering condition includes: the stored content conforms to the content-related information, and the service quality of the client in the target area conforms to a predetermined high-quality condition; the target area is a geographical area where the client is located and obtained based on the position related information;
in this embodiment, steps S201 to S202 may be the same as steps S101 to S102 in the above embodiment, and are not described herein again.
S203, the dispatching server sends indication information for indicating each first node as an accessible node and reference information corresponding to each first node to the client;
the reference information comprises a quality judgment value and/or a cost coefficient aiming at a target area, and the cost coefficient is in a direct proportion relation with the running cost of the node;
and S204, the client screens target nodes from the first nodes indicated by the indication information according to the received reference information, and requests the target nodes for the data to be accessed.
In step S203, the cost coefficient is equal to the ratio of the node cost value to the node standard value; the node cost value is the actual operation cost of the node with the cost coefficient to be calculated in the preset time period under the unit data flow; the node standard value is the average value of the actual running costs of the plurality of nodes in a preset time period; the larger the cost factor, the higher the cost.
In step S204, the implementation manner of the target node is filtered from the first nodes indicated by the indication information, and is related to the specific type of the reference information. In the following, the implementation of screening the target node from the first nodes indicated by the indication information is described with reference to different types of reference information:
when the reference information includes the quality evaluation value or the cost coefficient, a target node may be selected from the plurality of first nodes according to a size of the quality evaluation value or the cost coefficient.
When the reference information includes a quality evaluation value and a cost coefficient for the target area, and the quality evaluation value includes a download speed, the filtering, by the client, the target node from the first nodes indicated by the indication information according to the received reference information may include:
if the local data cache of the client is 0, selecting the node with the highest downloading speed in each first node as a target node;
if the local data cache of the client is larger than 0 and smaller than a preset data cache threshold value, selecting a node with the maximum comprehensive cost ratio value in each first node as a target node, wherein the comprehensive cost ratio value is equal to the ratio of the download speed to the cost coefficient;
if the local data cache of the client is larger than the preset data cache threshold, selecting the node with the minimum cost coefficient in each first node as a target node;
the local data cache of the client is as follows: and the client caches local data corresponding to the content related information.
Due to the fact that ownership of the nodes has various situations, except for the nodes built by the data service provider, the data service provider usually needs to rent or purchase a third-party node, and under the condition that the service quality provided by the nodes to the client is guaranteed, according to different situations of local data caching of the client, by introducing the cost coefficient and considering the relation between the cost coefficient and the downloading speed, the multiple first nodes sent by the scheduling server can be selected again, and therefore the target nodes which are more suitable for the client are matched, namely the nodes with the highest downloading speed, the lowest cost or the highest cost performance. Therefore, on the premise of ensuring the service quality, the node scheduling can be further optimized, and the optimization balance of the service quality and the cost can be further obtained.
As can be seen from the above, by setting the predetermined filtering condition, the method provided by the embodiment of the present invention can filter, from the plurality of nodes, the first node that satisfies that the stored content meets the content related information and that the service quality of the client in the target area meets the predetermined high quality condition, and send the first node to the client, so that the client can connect to the first node. Therefore, the scheduling server schedules high-quality nodes for the client by the preset screening condition based on the content related information and the position related information in the client scheduling request, so that the client can be connected to the nodes with higher service quality, and the client can quickly and effectively acquire the data to be accessed. Therefore, the problem that the service quality provided by the nodes is difficult to guarantee by the existing node scheduling method and finally the client cannot rapidly and effectively acquire the data to be accessed can be effectively solved through the scheme. In addition, according to the embodiment of the invention, under the condition of ensuring the service quality provided by the node to the client, the target node which better meets the actual requirement can be selected from the plurality of first nodes according to different types of the reference information received by the client, so that the matching degree of the nodes is further improved, and the service quality and the cost of the nodes are favorably considered.
Optionally, in order to further improve the efficiency of node scheduling and enable the client to have a certain degree of node selection capability, before the client sends a scheduling request to the scheduling server, the method may further include:
the client searches a node corresponding to the content related information of the data to be accessed from a local database; the local database records the corresponding relation between the content related information of the historical access data and the nodes providing the historical access data;
when the data to be accessed is searched, requesting the searched node for the data to be accessed;
and when the scheduling request is not searched, executing the step of sending the scheduling request to the scheduling server.
Therefore, before the client sends the scheduling request to the scheduling server, the client can repeatedly utilize the stored nodes by inquiring the historical nodes recorded in the local database of the client, and the efficiency of node scheduling is effectively improved.
As shown in fig. 3, an embodiment of the present invention further provides a node scheduling method, which is applied to a scheduling server in a scheduling system, where the scheduling system further includes a client; the method may include:
s301, receiving a scheduling request sent by a client, wherein the scheduling request comprises content related information of data to be accessed and position related information for representing the position of the client;
s302, filtering a first node meeting a predetermined filtering condition from a plurality of nodes, where the predetermined filtering condition includes: the stored content conforms to the content-related information, and the service quality of the client in the target area conforms to a predetermined high-quality condition; the target area is a geographical area where the client is located and obtained based on the position related information;
there are various specific implementations of screening the first node that meets the predetermined screening condition from among the plurality of nodes. For example, in an implementation manner, screening a first node meeting a predetermined screening condition from a plurality of nodes may include the following steps one, two, and three:
step one, screening a plurality of candidate nodes of which the stored contents accord with the content related information from the plurality of nodes;
secondly, obtaining quality evaluation values of a plurality of candidate nodes aiming at a target area according to the quality evaluation values of the nodes aiming at different geographical areas; the quality evaluation value of any node aiming at a geographic area is used for representing the service quality of the node aiming at a client in the geographic area;
and thirdly, screening a first node aiming at the service quality of the client in the target area and meeting a preset high-quality screening condition from the plurality of candidate nodes according to the quality evaluation values of the plurality of candidate nodes aiming at the target area. Wherein, the number of the screened first nodes can be one or more.
Optionally, the screening, according to the quality evaluation values of the plurality of candidate nodes for the target area, a first node, from the plurality of candidate nodes, for which the service quality of the client in the target area meets a predetermined high-quality screening condition may include:
screening nodes with quality evaluation values higher than a preset evaluation threshold value aiming at the target area from the plurality of candidate nodes as first nodes with service quality of clients in the target area meeting preset high-quality screening conditions;
or,
and sequencing the multiple candidate nodes according to the sequence of the obtained quality evaluation values from high to low, and selecting the first N candidate nodes in the sequence obtained by sequencing as first nodes according to the preset high-quality screening condition of the service quality of the client in the target area.
S303, sending indication information for indicating the first node as an accessible node to the client; so that the client requests the data to be accessed from the first node based on the indication information.
Optionally, when the number of the first nodes is multiple, the indication information that the first node is an accessible node is sent to the client; causing the client to request the data to be accessed from the first node based on the indication information may include:
sending indication information for indicating each first node as an accessible node and reference information corresponding to each first node to the client; the reference information comprises a quality judgment value and/or a cost coefficient aiming at a target area, and the cost coefficient is in a direct proportion relation with the running cost of the node; and enabling the client to screen a target node from each first node indicated by the indication information according to the received reference information, and requesting the data to be accessed from the target node.
By applying the method provided by the embodiment of the invention, the first node which meets the requirements that the stored content meets the content related information and the service quality of the client in the target area meets the preset high-quality condition can be obtained by screening from the plurality of nodes by setting the preset screening condition, and the first node is sent to the client, so that the client can be connected with the first node. Therefore, the scheduling server schedules high-quality nodes for the client by the preset screening condition based on the content related information and the position related information in the client scheduling request, so that the client can be connected to the nodes with higher service quality, and the client can quickly and effectively acquire the data to be accessed. Therefore, the problem that the service quality provided by the nodes is difficult to guarantee by the existing node scheduling method and finally the client cannot rapidly and effectively acquire the data to be accessed can be effectively solved through the scheme.
As shown in fig. 4, an embodiment of the present invention further provides a node scheduling method, which is applied to a client in a scheduling system, where the scheduling system further includes a scheduling server; the method may include:
s401, sending a scheduling request to the scheduling server, wherein the scheduling request comprises content-related information of data to be accessed and position-related information for representing the position of the client;
wherein the content related information of different types of data to be accessed is different. Taking online video as an example, the content-related information may include a video file name, a bit rate, audio information, and the like; for online audio, the content-related information may include an audio file name, an audio format, audio quality, and the like. The location-related information of the location where the client is located may be an IP address of a device running the client, or an administrative area (province, county, city, etc.) where the client is located, or a location of an area divided by a user according to actual needs, but is not limited thereto.
S402, receiving indication information that a first node sent by the scheduling server in response to the scheduling request can be used as an accessible node;
s403, requesting the data to be accessed from the first node based on the indication information.
Wherein, the number of the screened first nodes can be one or more. For the screened first nodes, the client can select access according to preset conditions or random modes and the like.
Optionally, when the number of the first nodes is multiple, the scheduling server sends, to the client, indication information for indicating each first node as an accessible node and reference information corresponding to each first node; the reference information comprises a quality judgment value and/or a cost coefficient aiming at a target area, and the cost coefficient is in a direct proportion relation with the running cost of the node; the requesting, from the first node, data to be accessed based on the indication information may include:
and screening target nodes from the first nodes indicated by the indication information according to the received reference information, and requesting the data to be accessed from the target nodes.
Further, when the reference information includes only a quality evaluation value and a cost coefficient for the target area, and the quality evaluation value includes a download speed, the screening the target nodes from the respective first nodes indicated by the indication information according to the received reference information may include:
if the local data cache of the client is 0, selecting the node with the highest downloading speed in each first node as a target node;
if the local data cache of the client is larger than 0 and smaller than a preset data cache threshold value, selecting a node with the maximum comprehensive cost ratio value in each first node as a target node, wherein the comprehensive cost ratio value is equal to the ratio of the download speed to the cost coefficient;
if the local data cache of the client is larger than the preset data cache threshold, selecting the node with the minimum cost coefficient in each first node as a target node;
the local data cache of the client is as follows: and the client caches local data corresponding to the content related information.
Optionally, before sending the scheduling request to the scheduling server, the method may further include:
searching a node corresponding to the content related information of the data to be accessed from a local database; the local database records the corresponding relation between the content related information of the historical access data and the nodes providing the historical access data;
when the data to be accessed is searched, requesting the searched node for the data to be accessed;
and when the scheduling request is not searched, executing the step of sending the scheduling request to the scheduling server.
By applying the method provided by the embodiment of the invention, the client sends the scheduling request comprising the content related information of the data to be accessed and the position related information for representing the position of the client to the scheduling server, so that the scheduling server can screen the plurality of nodes by setting the preset screening condition to obtain the first node which meets the stored content and the content related information, and the first node which meets the preset high quality condition aiming at the service quality of the client in the target area and returns to the client, and the client can be connected with the first node. Therefore, the client sends the scheduling request in the scheme, so that the scheduling server schedules high-quality nodes for the client through the predetermined screening condition based on the content related information and the position related information in the scheduling request, and thus, the client can be ensured to be connected to the nodes with higher service quality, and the client can quickly and effectively acquire the data to be accessed. Therefore, the problem that the service quality provided by the nodes is difficult to guarantee by the existing node scheduling method and finally the client cannot rapidly and effectively acquire the data to be accessed can be effectively solved through the scheme.
Corresponding to the above method embodiment, as shown in fig. 5, an embodiment of the present invention further provides a node scheduling apparatus, which is applied to a scheduling server, where the apparatus may include:
a request receiving module 501, configured to receive a scheduling request sent by a client, where the scheduling request includes content-related information of data to be accessed and location-related information used to represent a location where the client is located;
a node screening module 502, configured to screen a first node meeting a predetermined screening condition from a plurality of nodes, where the predetermined screening condition includes: the stored content conforms to the content-related information, and the service quality of the client in the target area conforms to a predetermined high-quality condition; the target area is a geographical area where the client is located and obtained based on the position related information;
optionally, the node screening module 502 is specifically configured to screen a plurality of candidate nodes, from among the plurality of nodes, whose stored contents meet the content-related information;
obtaining quality evaluation values of a plurality of candidate nodes aiming at a target area according to the quality evaluation values of the nodes aiming at different geographic areas; the quality evaluation value of any node aiming at a geographic area is used for representing the service quality of the node aiming at a client in the geographic area;
and screening a first node, which meets a preset high-quality screening condition aiming at the service quality of the client in the target area, from the plurality of candidate nodes according to the quality evaluation values aiming at the target area of the plurality of candidate nodes. Wherein, the number of the screened first nodes can be one or more.
Optionally, the node screening module 502 is specifically configured to screen, from the multiple candidate nodes, a node whose quality evaluation value for the target area is higher than a predetermined evaluation threshold as a first node whose service quality for the client in the target area meets a predetermined high-quality screening condition;
or,
and sequencing the multiple candidate nodes according to the sequence of the obtained quality evaluation values from high to low, and selecting the first N candidate nodes in the sequence obtained by sequencing as first nodes according to the preset high-quality screening condition of the service quality of the client in the target area. An information sending module 503, configured to send, to the client, indication information for indicating that the first node is an accessible node; so that the client requests the data to be accessed from the first node based on the indication information.
Optionally, when the number of the first nodes is multiple, the information sending module 503 is specifically configured to send, to the client, indication information for indicating each first node as an accessible node and reference information corresponding to each first node; the reference information comprises a quality judgment value and/or a cost coefficient aiming at a target area, and the cost coefficient is in a direct proportion relation with the running cost of the node; and enabling the client to screen a target node from each first node indicated by the indication information according to the received reference information, and requesting the data to be accessed from the target node.
Corresponding to the above method embodiment, as shown in fig. 6, an embodiment of the present invention further provides a node scheduling apparatus, which is applied to the client, where the apparatus includes:
a scheduling request module 601, configured to send a scheduling request to the scheduling server, where the scheduling request includes content-related information of data to be accessed and location-related information used to represent a location where the client is located;
an information receiving module 602, configured to receive indication information that the first node sent by the scheduling server in response to the scheduling request is available as an accessible node;
a data access module 603, configured to request, based on the indication information, data to be accessed from the first node.
Optionally, when the number of the first nodes is multiple, the scheduling server sends, to the client, indication information for indicating each first node as an accessible node and reference information corresponding to each first node; the reference information comprises a quality judgment value and/or a cost coefficient aiming at a target area, and the cost coefficient is in a direct proportion relation with the running cost of the node; the data access module 603 is specifically configured to filter a target node from each first node indicated by the indication information according to the received reference information, and request the data to be accessed from the target node.
Optionally, when the reference information only includes a quality evaluation value and a cost coefficient for a target area, and the quality evaluation value includes a download speed, the data access module 603 is specifically configured to select, as the target node, a node with a maximum comprehensive cost ratio among the first nodes if the local data cache of the client is greater than 0 and smaller than a preset data cache threshold, where the comprehensive cost ratio is equal to a ratio of the download speed to the cost coefficient;
if the local data cache of the client is larger than the preset data cache threshold, selecting the node with the minimum cost coefficient in each first node as a target node;
the local data cache of the client is as follows: and the client caches local data corresponding to the content related information.
Optionally, the apparatus may further comprise a lookup module;
the searching module is used for searching a node corresponding to the content related information of the data to be accessed from a local database before sending a scheduling request to the scheduling server; the local database records the corresponding relation between the content related information of the historical access data and the nodes providing the historical access data;
when the data to be accessed is searched, requesting the searched node for the data to be accessed;
and when the scheduling request is not searched, executing the step of sending the scheduling request to the scheduling server.
Corresponding to the node scheduling method provided in the foregoing embodiment, as shown in fig. 7, an embodiment of the present invention further provides a node scheduling system, where the system includes a scheduling server 701 and a client 702;
the client 702 is configured to send a scheduling request to the scheduling server, where the scheduling request includes content-related information of data to be accessed and location-related information used to represent a location where the client is located;
the scheduling server 701 is configured to, in response to the scheduling request, filter a first node that meets a predetermined filtering condition from a plurality of nodes, where the predetermined filtering condition includes: the stored content conforms to the content-related information, and the service quality of the client in the target area conforms to a predetermined high-quality condition; the target area is a geographical area where the client is located and obtained based on the position related information;
the dispatch server 701 is further configured to send, to the client, indication information that the first node is an accessible node;
the client 702 is further configured to request data to be accessed from the first node based on the indication information. As can be seen from the above, by setting the predetermined screening condition, the method provided by the embodiment of the present invention can screen the first node from the plurality of nodes, where the stored content meets the content related information, and the service quality of the client in the target area meets the predetermined high quality condition, so that the client can be connected to the first node. Therefore, the scheduling server schedules high-quality nodes for the client by the preset screening condition based on the content related information and the position related information in the client scheduling request, so that the client can be connected to the nodes with higher service quality, and the client can quickly and effectively acquire the data to be accessed. Therefore, the problem that the service quality provided by the nodes is difficult to guarantee by the existing node scheduling method and finally the client cannot rapidly and effectively acquire the data to be accessed can be effectively solved through the scheme.
Optionally, as shown in fig. 8, the system may include not only the scheduling server 701 and the client 702, but also an information collecting server 703;
the information acquisition server 703 is configured to acquire quality of service parameters of clients served by the node in different geographic areas; calculating quality judgment values of the node aiming at different geographic areas based on the obtained service quality parameters;
the scheduling server 701 is configured to filter a plurality of candidate nodes, from among the plurality of nodes, whose stored contents meet the content-related information; obtaining quality evaluation values of a plurality of alternative nodes aiming at a target area according to the quality evaluation values of the nodes aiming at different geographical areas, which are calculated by the information acquisition server; the quality evaluation value of any node aiming at a geographic area is used for representing the service quality of the node aiming at a client in the geographic area; according to the quality evaluation values of the plurality of candidate nodes aiming at the target area, screening a first node aiming at the service quality of the client in the target area and meeting a preset high-quality screening condition from the plurality of candidate nodes; and sending indication information for indicating the first node as an accessible node to the client.
For the specific function implementation of the scheduling server and the client, reference may be made to the above description of the node scheduling method applied to the scheduling system, which is not described herein again.
As shown in fig. 9, in an embodiment provided by the present invention, a dispatch server is further provided, where the dispatch server includes a processor 901, a communication interface 902, a memory 903, and a communication bus 904, where the processor 901, the communication interface 902, and the memory 903 complete communication with each other through the communication bus 904;
a memory 903 for storing computer programs;
the processor 901 is configured to implement the node scheduling method applied to the scheduling server according to the embodiment of the present invention when executing the program stored in the memory.
As shown in fig. 10, in another embodiment provided by the present invention, a terminal device is further provided, where the terminal device includes a processor 1001, a communication interface 1002, a memory 1003 and a communication bus 1004, where the processor 1001, the communication interface 1002 and the memory 1003 complete communication with each other through the communication bus 1004;
a memory 1003 for storing a computer program;
the processor 1001 is configured to implement the node scheduling method applied to the client according to the embodiment of the present invention when executing the program stored in the memory.
The communication bus mentioned in the dispatch server and the terminal device may be a Peripheral Component Interconnect (PCI) bus or an Extended Industry Standard Architecture (EISA) bus. The communication bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown, but this does not mean that there is only one bus or one type of bus.
The communication interface is used for communication between the scheduling server and other equipment.
The Memory may include a Random Access Memory (RAM) or a Non-Volatile Memory (NVM), such as at least one disk Memory. Alternatively, the memory may be at least one memory device located remotely from the processor.
The Processor may be a general-purpose Processor, including a Central Processing Unit (CPU), a Network Processor (NP), and the like; but may also be a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic device, discrete hardware component.
In another embodiment provided by the present invention, a computer-readable storage medium is further provided, where a computer program is stored in the computer-readable storage medium, and when the computer program is executed by a processor, the node scheduling method provided by the embodiment of the present invention is implemented.
In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the invention to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, from one website site, computer, server, or data center to another website site, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., Solid State Disk (SSD)), among others.
It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
All the embodiments in the present specification are described in a related manner, and the same and similar parts among the embodiments may be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the system embodiment, since it is substantially similar to the method embodiment, the description is simple, and for the relevant points, reference may be made to the partial description of the method embodiment.
The above description is only for the preferred embodiment of the present invention, and is not intended to limit the scope of the present invention. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention shall fall within the protection scope of the present invention.

Claims (15)

1. A node scheduling method is characterized in that the node scheduling method is applied to a scheduling system comprising a client and a scheduling server; the method comprises the following steps:
the client sends a scheduling request to the scheduling server, wherein the scheduling request comprises content related information of data to be accessed and position related information for representing the position of the client;
the scheduling server responds to the scheduling request, and screens a first node meeting a preset screening condition from a plurality of nodes, wherein the preset screening condition comprises the following steps: the stored content conforms to the content-related information, and the service quality of the client in the target area conforms to a predetermined high-quality condition; the target area is a geographical area where the client is located and obtained based on the position related information;
the dispatching server sends indication information that the first node is an accessible node to the client;
and the client requests the data to be accessed from the first node based on the indication information.
2. The method of claim 1, wherein the scheduling server filters a first node from the plurality of nodes that meets a predetermined filtering condition, comprising:
the scheduling server screens a plurality of candidate nodes of which the stored contents accord with the content related information from a plurality of nodes;
the scheduling server obtains quality evaluation values of a plurality of candidate nodes aiming at a target area according to the quality evaluation values of the nodes aiming at different geographic areas; the quality evaluation value of any node aiming at a geographic area is used for representing the service quality of the node aiming at a client in the geographic area;
and the scheduling server screens a first node, which meets a preset high-quality screening condition aiming at the service quality of the client in the target area, from the plurality of candidate nodes according to the quality evaluation values aiming at the target area of the plurality of candidate nodes.
3. The method according to claim 2, wherein the scheduling server screens a first node, which meets a predetermined high quality screening condition for the service quality of the client in the target area, from the plurality of candidate nodes according to the quality evaluation values of the plurality of candidate nodes for the target area, and comprises:
the scheduling server screens a node with a quality evaluation value higher than a preset evaluation threshold value aiming at a target area from the plurality of candidate nodes, and the node is used as a first node for the service quality of the client in the target area to meet a preset high-quality screening condition;
or,
and the scheduling server sequences the plurality of alternative nodes according to the sequence from high to low of the obtained quality evaluation values, selects the first N alternative nodes in the sequence obtained by sequencing and takes the first N alternative nodes as first nodes according to the preset high-quality screening condition aiming at the service quality of the client in the target area.
4. The method of claim 2, wherein the manner in which any node calculates the quality assessment values for different geographic regions comprises:
the scheduling server obtains service quality parameters of clients in different geographic areas when the clients are served by the node;
and the scheduling server calculates quality judgment values of the node aiming at different geographic areas based on the obtained service quality parameters.
5. The method of claim 2, wherein the system further comprises an information collection server;
the calculation mode of the quality evaluation value of any node aiming at different geographic areas comprises the following steps:
the information acquisition server acquires service quality parameters of the client provided with services by the node in different geographic areas;
the information acquisition server calculates quality judgment values of the node aiming at different geographic areas based on the obtained service quality parameters;
the scheduling server obtains quality evaluation values of a plurality of candidate nodes aiming at a target area according to the quality evaluation values of the nodes aiming at different geographic areas, and the quality evaluation values comprise:
and the scheduling server acquires the quality evaluation values of a plurality of candidate nodes aiming at the target area according to the quality evaluation values of the nodes aiming at different geographical areas, which are calculated by the information acquisition server.
6. The method according to any one of claims 1 to 5, wherein the number of the first nodes is plural;
the method for sending the indication information of the first node as the accessible node to the client by the scheduling server comprises the following steps:
the scheduling server sends indication information for indicating each first node as an accessible node and reference information corresponding to each first node to the client; the reference information comprises a quality judgment value and/or a cost coefficient aiming at a target area, and the cost coefficient is in a direct proportion relation with the running cost of the node;
the client requests the data to be accessed from the first node based on the indication information, and the method comprises the following steps:
and the client screens target nodes from all the first nodes indicated by the indication information according to the received reference information, and requests the target nodes for the data to be accessed.
7. The method of claim 6, wherein when the reference information comprises a quality evaluation value and a cost coefficient for the target area, and the quality evaluation value comprises a download speed, the client filters the target nodes from the first nodes indicated by the indication information according to the received reference information, and comprises:
if the local data cache of the client is 0, selecting the node with the highest downloading speed in each first node as a target node;
if the local data cache of the client is larger than 0 and smaller than a preset data cache threshold value, selecting a node with the maximum comprehensive cost ratio value in each first node as a target node, wherein the comprehensive cost ratio value is equal to the ratio of the download speed to the cost coefficient;
if the local data cache of the client is larger than the preset data cache threshold, selecting the node with the minimum cost coefficient in each first node as a target node;
the local data cache of the client is as follows: and the client caches local data corresponding to the content related information.
8. The method according to any of claims 1-5, wherein before the client sends a scheduling request to the scheduling server, the method further comprises:
the client searches a node corresponding to the content related information of the data to be accessed from a local database; the local database records the corresponding relation between the content related information of the historical access data and the nodes providing the historical access data;
when the data to be accessed is searched, requesting the searched node for the data to be accessed;
and when the scheduling request is not searched, executing the step of sending the scheduling request to the scheduling server.
9. A node scheduling method is characterized in that the node scheduling method is applied to a scheduling server in a scheduling system, and the scheduling server further comprises a client; the method comprises the following steps:
receiving a scheduling request sent by the client, wherein the scheduling request comprises content related information of data to be accessed and position related information used for representing the position of the client;
screening a first node from a plurality of nodes, the first node meeting a predetermined screening condition, the predetermined screening condition comprising: the stored content conforms to the content-related information, and the service quality of the client in the target area conforms to a predetermined high-quality condition; the target area is a geographical area where the client is located and obtained based on the position related information;
and sending indication information for indicating the first node as an accessible node to the client.
10. A node scheduling method is characterized in that the node scheduling method is applied to a client in a scheduling system, and the scheduling system further comprises a scheduling server; the method comprises the following steps:
sending a scheduling request to the scheduling server, wherein the scheduling request comprises content-related information of data to be accessed and position-related information for representing the position of the client;
receiving indication information that a first node sent by the scheduling server in response to the scheduling request can be an accessible node;
and requesting data to be accessed from the first node based on the indication information.
11. A node scheduling device is applied to a scheduling server in a scheduling system, and the scheduling system further comprises a client; the device comprises:
a request receiving module, configured to receive a scheduling request sent by the client, where the scheduling request includes content-related information of data to be accessed and location-related information used to represent a location where the client is located;
a node screening module, configured to screen a first node that meets a predetermined screening condition from a plurality of nodes, where the predetermined screening condition includes: the stored content conforms to the content-related information, and the service quality of the client in the target area conforms to a predetermined high-quality condition; the target area is a geographical area where the client is located and obtained based on the position related information;
an information sending module, configured to send, to the client, indication information for indicating that the first node is an accessible node.
12. A node scheduling device is applied to a client in a scheduling system, and the scheduling system further comprises a scheduling server; the device comprises:
the scheduling request module is used for sending a scheduling request to the scheduling server, wherein the scheduling request comprises content related information of data to be accessed and position related information used for representing the position of the client;
an information receiving module, configured to receive indication information that a first node sent by the scheduling server in response to the scheduling request is available as an accessible node;
and the data access module is used for requesting the data to be accessed from the first node based on the indication information.
13. A node scheduling system is characterized in that the system comprises a scheduling server and a client;
the client is used for sending a scheduling request to the scheduling server, wherein the scheduling request comprises content related information of data to be accessed and position related information used for representing the position of the client;
the scheduling server is configured to filter, in response to the scheduling request, a first node that meets a predetermined filtering condition from a plurality of nodes, where the predetermined filtering condition includes: the stored content conforms to the content-related information, and the service quality of the client in the target area conforms to a predetermined high-quality condition; the target area is a geographical area where the client is located and obtained based on the position related information;
the scheduling server is further configured to send, to the client, indication information that the first node is an accessible node;
the client is further used for requesting the data to be accessed from the first node based on the indication information.
14. The scheduling server is characterized by comprising a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory are used for completing mutual communication through the communication bus;
a memory for storing a computer program;
a processor for implementing the method steps of claim 9 when executing a program stored in the memory.
15. The terminal equipment is characterized by comprising a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory are used for completing mutual communication through the communication bus;
a memory for storing a computer program;
a processor for implementing the method steps of claim 10 when executing a program stored in the memory.
CN201910968273.8A 2019-10-12 2019-10-12 Node scheduling method, device and system, scheduling server and terminal equipment Active CN110661879B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910968273.8A CN110661879B (en) 2019-10-12 2019-10-12 Node scheduling method, device and system, scheduling server and terminal equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910968273.8A CN110661879B (en) 2019-10-12 2019-10-12 Node scheduling method, device and system, scheduling server and terminal equipment

Publications (2)

Publication Number Publication Date
CN110661879A true CN110661879A (en) 2020-01-07
CN110661879B CN110661879B (en) 2023-03-24

Family

ID=69040601

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910968273.8A Active CN110661879B (en) 2019-10-12 2019-10-12 Node scheduling method, device and system, scheduling server and terminal equipment

Country Status (1)

Country Link
CN (1) CN110661879B (en)

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111274012A (en) * 2020-01-16 2020-06-12 珠海格力电器股份有限公司 Service scheduling method and device, electronic equipment and storage medium
CN111432247A (en) * 2020-03-19 2020-07-17 平安科技(深圳)有限公司 Traffic scheduling method, traffic scheduling device, server and storage medium
CN112073542A (en) * 2020-11-12 2020-12-11 腾讯科技(深圳)有限公司 Fog node scheduling method and device, computer equipment and storage medium
CN113051078A (en) * 2021-03-29 2021-06-29 上海商汤智能科技有限公司 Data processing method and related device, equipment, system and storage medium
CN113297113A (en) * 2021-05-21 2021-08-24 中国邮政储蓄银行股份有限公司 Control method and control device based on service bus system
CN113301072A (en) * 2020-04-13 2021-08-24 阿里巴巴集团控股有限公司 Service scheduling method and system, scheduling equipment and client
CN113360637A (en) * 2020-03-05 2021-09-07 北京三快在线科技有限公司 Method, device, storage medium and electronic equipment for acquiring merchant information
CN113612841A (en) * 2021-08-02 2021-11-05 北京金山云网络技术有限公司 Task scheduling method, apparatus, computer equipment and storage medium
CN114745565A (en) * 2022-04-14 2022-07-12 上海哔哩哔哩科技有限公司 Edge node scheduling method and device
CN115714817A (en) * 2022-11-03 2023-02-24 天翼数字生活科技有限公司 Dynamic feedback weighted cloud storage resource scheduling method, device and equipment

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103581299A (en) * 2013-10-08 2014-02-12 华为软件技术有限公司 Service dispatching method, device and system
CN103825837A (en) * 2014-02-19 2014-05-28 上海视云网络科技有限公司 Node load distributed CDN global scheduling method
CN105847399A (en) * 2016-04-25 2016-08-10 乐视控股(北京)有限公司 Server scheduling method and device
CN105897845A (en) * 2015-12-15 2016-08-24 乐视云计算有限公司 CDN (Content Delivery Network) service node dispatching method and server
CN106357776A (en) * 2016-09-23 2017-01-25 北京奇虎科技有限公司 Method and device for selecting transmission resource of streaming data
US20170064037A1 (en) * 2015-08-28 2017-03-02 Qualcomm Incorporated Small cell edge computing platform
US20170142177A1 (en) * 2015-11-13 2017-05-18 Le Holdings (Beijing) Co., Ltd. Method and system for network dispatching
CN107071089A (en) * 2017-05-18 2017-08-18 腾讯科技(深圳)有限公司 Dispatch control method, device and system
CN107613030A (en) * 2017-11-06 2018-01-19 网宿科技股份有限公司 A method and system for processing service requests
US20180288141A1 (en) * 2014-11-11 2018-10-04 Wangsu Science & Technology Co., Ltd. Http scheduling system and method of content delivery network
CN108769107A (en) * 2018-04-12 2018-11-06 北京奇艺世纪科技有限公司 A kind of video dispatching method, device and electronic equipment

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103581299A (en) * 2013-10-08 2014-02-12 华为软件技术有限公司 Service dispatching method, device and system
CN103825837A (en) * 2014-02-19 2014-05-28 上海视云网络科技有限公司 Node load distributed CDN global scheduling method
US20180288141A1 (en) * 2014-11-11 2018-10-04 Wangsu Science & Technology Co., Ltd. Http scheduling system and method of content delivery network
US20170064037A1 (en) * 2015-08-28 2017-03-02 Qualcomm Incorporated Small cell edge computing platform
US20170142177A1 (en) * 2015-11-13 2017-05-18 Le Holdings (Beijing) Co., Ltd. Method and system for network dispatching
CN105897845A (en) * 2015-12-15 2016-08-24 乐视云计算有限公司 CDN (Content Delivery Network) service node dispatching method and server
CN105847399A (en) * 2016-04-25 2016-08-10 乐视控股(北京)有限公司 Server scheduling method and device
CN106357776A (en) * 2016-09-23 2017-01-25 北京奇虎科技有限公司 Method and device for selecting transmission resource of streaming data
CN107071089A (en) * 2017-05-18 2017-08-18 腾讯科技(深圳)有限公司 Dispatch control method, device and system
CN107613030A (en) * 2017-11-06 2018-01-19 网宿科技股份有限公司 A method and system for processing service requests
CN108769107A (en) * 2018-04-12 2018-11-06 北京奇艺世纪科技有限公司 A kind of video dispatching method, device and electronic equipment

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
张艳敏等: "视频网格资源调度策略优化研究", 《计算机产品与流通》 *

Cited By (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111274012A (en) * 2020-01-16 2020-06-12 珠海格力电器股份有限公司 Service scheduling method and device, electronic equipment and storage medium
CN113360637A (en) * 2020-03-05 2021-09-07 北京三快在线科技有限公司 Method, device, storage medium and electronic equipment for acquiring merchant information
CN111432247A (en) * 2020-03-19 2020-07-17 平安科技(深圳)有限公司 Traffic scheduling method, traffic scheduling device, server and storage medium
CN111432247B (en) * 2020-03-19 2022-10-18 平安科技(深圳)有限公司 Traffic scheduling method, traffic scheduling device, server and storage medium
CN113301072A (en) * 2020-04-13 2021-08-24 阿里巴巴集团控股有限公司 Service scheduling method and system, scheduling equipment and client
CN112073542B (en) * 2020-11-12 2021-02-05 腾讯科技(深圳)有限公司 Fog node scheduling method and device, computer equipment and storage medium
WO2022100318A1 (en) * 2020-11-12 2022-05-19 腾讯科技(深圳)有限公司 Fog node scheduling method and apparatus, and computer device and storage medium
CN112073542A (en) * 2020-11-12 2020-12-11 腾讯科技(深圳)有限公司 Fog node scheduling method and device, computer equipment and storage medium
US11838387B2 (en) 2020-11-12 2023-12-05 Tencent Technology (Shenzhen) Company Limited Fog node scheduling method and apparatus, computer device, and storage medium
CN113051078A (en) * 2021-03-29 2021-06-29 上海商汤智能科技有限公司 Data processing method and related device, equipment, system and storage medium
CN113297113A (en) * 2021-05-21 2021-08-24 中国邮政储蓄银行股份有限公司 Control method and control device based on service bus system
CN113612841A (en) * 2021-08-02 2021-11-05 北京金山云网络技术有限公司 Task scheduling method, apparatus, computer equipment and storage medium
CN114745565A (en) * 2022-04-14 2022-07-12 上海哔哩哔哩科技有限公司 Edge node scheduling method and device
CN114745565B (en) * 2022-04-14 2023-10-20 上海哔哩哔哩科技有限公司 Scheduling method and device for edge nodes
CN115714817A (en) * 2022-11-03 2023-02-24 天翼数字生活科技有限公司 Dynamic feedback weighted cloud storage resource scheduling method, device and equipment

Also Published As

Publication number Publication date
CN110661879B (en) 2023-03-24

Similar Documents

Publication Publication Date Title
CN110661879B (en) Node scheduling method, device and system, scheduling server and terminal equipment
CN108881448B (en) API request processing method and device
US20170142177A1 (en) Method and system for network dispatching
US8510448B2 (en) Service provider registration by a content broker
CN115208955B (en) Method, device, computer equipment and medium for processing resource request
CN110830565B (en) Resource downloading method, device, system, electronic equipment and storage medium
CN112929676A (en) Live data stream acquisition method, device, node and system
CN108574685A (en) A kind of Streaming Media method for pushing, apparatus and system
CN110620828A (en) File pushing method, system, device, electronic equipment and medium
CN110460879B (en) Video request scheduling method, device, server and storage medium
CN108093272B (en) Video CDN scheduling optimization method and device
CN107733805B (en) Service load scheduling method and device
CN108156257B (en) Information pushing method and device
CN110677684B (en) Video processing method, video access method, distributed storage method and distributed video access system
CN109510775A (en) Orient dispatching method, authentication device, the network equipment and the storage medium of flow
CN113315836B (en) File access request scheduling method and device, electronic equipment and storage medium
CN110099292B (en) Data center node determination method and device and electronic equipment
CN110677683B (en) Video storage and video access method and distributed storage and video access system
CN107846614B (en) Video traffic scheduling method and device and electronic equipment
EP3526668B1 (en) Systems and methods for reducing download requirements
CN114615333A (en) Resource access request processing method, device, equipment and medium
KR20150053675A (en) Method for intermediating cloud server
CN107888388B (en) Charging method and system for network acceleration service
CN110535853B (en) Video request scheduling method, device, server and storage medium
CN110691143B (en) File pushing method and device, electronic equipment and medium

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
GR01 Patent grant
GR01 Patent grant