CN111327688B - Resource scheduling method, server and readable storage medium - Google Patents
Resource scheduling method, server and readable storage medium Download PDFInfo
- Publication number
- CN111327688B CN111327688B CN202010072473.8A CN202010072473A CN111327688B CN 111327688 B CN111327688 B CN 111327688B CN 202010072473 A CN202010072473 A CN 202010072473A CN 111327688 B CN111327688 B CN 111327688B
- Authority
- CN
- China
- Prior art keywords
- target
- link
- route
- delay
- area
- 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.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/06—Protocols specially adapted for file transfer, e.g. file transfer protocol [FTP]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
Abstract
The embodiment of the invention provides a resource scheduling method, a server and a readable storage medium, which relate to the technical field of Internet, wherein the resource scheduling method is applied to the server and comprises the following steps: under the condition that a target downloading request sent by a target downloading terminal is received, determining a target resource corresponding to the target downloading request and a first area to which the target downloading terminal belongs; inquiring N second areas to which M uploading terminals storing the target resources belong; determining a target area, in the N second areas, of which the link time delay with the first area meets a first preset condition according to a preset time delay mapping table; and scheduling the target resources stored on the target uploading terminal to the target downloading terminal, wherein the target uploading terminal belongs to the uploading terminal of the target area in the M uploading terminals. The embodiment of the invention enables the downloading end to acquire resources from the uploading end with lower time delay, thereby improving the resource downloading speed of the downloading end.
Description
Technical Field
The present invention relates to the field of internet technologies, and in particular, to a resource scheduling method, a server, and a readable storage medium.
Background
Currently, Peer-to-Peer (P2P) technology is widely used as a download protocol, and its main logic is that a download end obtains terminal (hereinafter referred to as upload end) information capable of providing resource upload through a scheduling service, and then obtains resources from one or more of the upload ends.
In the existing scheduling service, an uploading terminal with the nearest geographical position is selected to provide resources according to the area to which the address of the downloading terminal belongs. However, in practical applications, the time delay may be high although the downloading end and the uploading end are close to each other in geographic location. Therefore, the existing method of selecting the uploading terminal based on the distance between the geographical locations may cause a problem of low downloading speed of the downloading terminal resource.
Disclosure of Invention
The embodiment of the invention aims to provide a resource scheduling method, a server and a readable storage medium, so that a downloading end can acquire resources from an uploading end with lower time delay, and the resource downloading speed of the downloading end is improved.
The specific technical scheme is as follows:
in a first aspect of the present invention, a resource scheduling method is first provided, which is applied to a server and includes:
under the condition that a target downloading request sent by a target downloading terminal is received, determining a target resource corresponding to the target downloading request and a first area to which the target downloading terminal belongs;
querying N second areas to which M uploading terminals storing the target resources belong, wherein M, N are positive integers greater than 1;
determining a target area, in the N second areas, of which the link time delay with the first area meets a first preset condition according to a preset time delay mapping table;
and scheduling the target resources stored on the target uploading terminal to the target downloading terminal, wherein the target uploading terminal belongs to the uploading terminal of the target area in the M uploading terminals.
In a second aspect of the present invention, there is also provided a server, including:
the first determining module is used for determining a target resource corresponding to a target downloading request and a first area to which the target downloading terminal belongs under the condition of receiving the target downloading request sent by the target downloading terminal;
the query module is used for querying N second areas to which M uploading terminals storing the target resources belong, wherein M, N are positive integers greater than 1;
a second determining module, configured to determine, according to a preset delay mapping table, a target area, of the N second areas, where a link delay with the first area meets a first preset condition;
and the scheduling module is used for scheduling the target resources stored on the target uploading end to the target downloading end, wherein the target uploading end belongs to the uploading end of the target area in the M uploading ends.
In yet another aspect of the present invention, there is also provided a computer-readable storage medium having stored therein instructions, which when run on a computer, cause the computer to execute any of the above-mentioned resource scheduling methods.
In yet another aspect of the present invention, there is also provided a computer program product containing instructions which, when run on a computer, cause the computer to perform any of the above-described resource scheduling methods.
The resource scheduling method provided by the embodiment of the invention comprises the steps of determining a first area to which a target downloading terminal belongs and a requested target resource, inquiring an uploading terminal stored with the target resource and a second area to which the uploading terminal belongs, determining the target area of which the link delay between the second area and the first area meets a first preset condition according to a preset delay mapping table, and scheduling the target resource stored on the uploading terminal belonging to the target area to the target downloading terminal; the problem that in the prior art, the downloading speed of the resource of the downloading end is low due to the fact that the uploading end is selected according to the distance between the geographical positions is solved; and the downloading end can acquire resources from the uploading end with lower time delay, so that the resource downloading speed of the downloading end is improved.
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.
Fig. 1 is a flowchart of a resource scheduling method according to an embodiment of the present invention;
fig. 2 is a flowchart illustrating establishing a preset delay mapping table according to an embodiment of the present invention;
FIG. 3 is a flowchart illustrating clearing a first link latency outlier in an embodiment of the present invention;
FIG. 4 is a flow chart of determining backbone routing in an embodiment of the present invention;
fig. 5 is a diagram illustrating a structure of a link between an upload terminal and a download terminal in an embodiment of the present invention;
FIG. 6 is a flowchart of a resource scheduling method in an embodiment of the present invention;
fig. 7 is a schematic structural diagram of a server according to an embodiment of the present invention;
fig. 8 is another schematic structural diagram of a server according to an embodiment of the present invention;
fig. 9 is a schematic structural diagram of a server according to another embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be described below with reference to the drawings in the embodiments of the present invention.
The resource scheduling method provided by the embodiment of the invention is applied to a server, and as shown in fig. 1, the method comprises the following steps:
step S100, under the condition that a target downloading request sent by a target downloading terminal is received, determining a target resource corresponding to the target downloading request and a first area to which the target downloading terminal belongs;
step S200, inquiring N second areas to which M uploading terminals storing the target resources belong, wherein M, N are positive integers greater than 1;
step S300, determining a target area, in the N second areas, of which the link time delay with the first area meets a first preset condition according to a preset time delay mapping table;
step S400, scheduling the target resource stored in the target upload terminal to the target download terminal, wherein the target upload terminal is an upload terminal belonging to the target area in the M upload terminals.
In this embodiment, the server can perform a resource scheduling function, and after receiving a target download request sent by a target download terminal, the server can obtain information such as a target resource desired to be downloaded by the target download terminal and an IP address of the target download terminal according to the target download request. The target resource may be, for example, video, music, documents, program installation packages, and the like. According to the IP address of the target downloading terminal, the first area to which the target downloading terminal belongs can be confirmed, and the area can be divided according to countries, provinces, regions, cities and the like.
Based on the target resource, the server can query the uploading end storing the target resource. In practical application, it may be queried that M such upload terminals exist at the same time, and the M upload terminals may be located in different areas, and according to the IP addresses of the M upload terminals, N second areas to which the M upload terminals belong may be determined.
The preset time delay mapping table records at least the link time delay between the first area and each second area. The first preset condition may be set according to actual needs, for example, in a preferred embodiment, the first preset condition may be that the link delay is shortest; for another example, in other possible embodiments, the first preset condition may also be that the link delay is smaller than a certain set value, and the like. Based on the first region, the preset delay mapping table and the first preset condition, at least one target region can be determined from the N second regions.
After the target area is determined, the target uploading terminals belonging to the target area can be determined from the M uploading terminals according to the attribution relationship between the M uploading terminals and the N second areas, and the number of the target uploading terminals may be one or more. At this time, the server can schedule the target resources stored on the target uploading terminal to the target downloading terminal; specifically, the server may establish a connection between the target downloading terminal and the target uploading terminal, and then the target resource stored in the target uploading terminal may be transmitted to the target downloading terminal.
In the embodiment of the invention, a first area to which a target downloading terminal belongs and a requested target resource are determined, an uploading terminal storing the target resource and a second area to which the uploading terminal belongs are inquired, the target area of which the link delay between the second area and the first area meets a first preset condition is determined from the second area according to a preset delay mapping table, and the target resource stored on the uploading terminal belonging to the target area is dispatched to the target downloading terminal; the problem that in the prior art, the downloading speed of the resource of the downloading end is low due to the fact that the uploading end is selected according to the distance between the geographical positions is solved; and the downloading end can acquire resources from the uploading end with lower time delay, so that the resource downloading speed of the downloading end is improved.
To further explain the working principle of the resource scheduling method provided by the embodiment of the present invention, a specific application example is described below.
It is assumed that there are four areas divided according to provinces, namely, province a, province B, province C and province D, wherein a target downloading terminal a located in province a sends a target downloading request, specifically, a target video is requested to be downloaded, to a server. The server obtains, through query, that the upload terminal B1 located in province B, the upload terminals C1 and C2 located in province C, and the upload terminal D1 located in province D can all provide the upload of the target video (i.e., store the target video). The link time delay between any two provinces of province A, province B, province C and province D is recorded in the preset time delay mapping table, and the link time delay between province A and province B is found to be 40ms, the link time delay between province A and province C is found to be 50ms, and the link time delay between province A and province D is found to be 60ms by calling the preset time delay mapping table. If the first preset condition mentioned above is that the link delay is shortest, that is, a second area with the shortest link delay to the first area is selected as the target area, based on the above query result, even if province C is closer to province a than province B in the geographic location, the server will use province B with shorter link delay to province a as the target area, and use the uploading end B1 as the target uploading end. The server establishes a connection between the downloading end a and the uploading end b1, and the subsequent downloading end a acquires the target video from the uploading end b1, so that the downloading end a can obtain a higher downloading speed.
Of course, when the link delay is not greater than 50ms under the first preset condition, the B province and the C province are simultaneously used as target areas, and the upload terminal B1, the upload terminal C1 and the upload terminal C2 are used as target upload terminals; at this time, since there are more uploading terminals, the downloading process of the downloading terminal a can be more stable.
Optionally, as shown in fig. 2, the resource scheduling method further includes:
step S510, obtaining at least one backbone route to which P regions belong, where the P regions include the first region and the second region, and P is a positive integer greater than 1;
step S520, obtaining J first link delays corresponding to the P regions, where the first link delay is a link delay between any two first routes located in two different regions of the P regions, and the first route is a route in the P regions, which is adjacent to the backbone route and different from the backbone route;
step S530, establishing a preset delay mapping table according to the P regions and the corresponding K first link delays, where the K first link delays are part or all of the J first link delays.
The backbone route is also called a core route, and is usually a route located at the center of the network, and the first route may be regarded as an access router of the backbone route. When the uploading end and the downloading end are respectively located in two different areas of the P areas, a backbone route generally exists on a transmission link between the uploading end and the downloading end; however, the backbone route in the transmission link is usually located between two first routes in different areas, and therefore, the first link delay can be regarded as the link delay caused by the backbone route. In general, the first link delay is a key factor for determining the total link delay of a transmission link between a downloading end and an uploading end; therefore, in this embodiment, J first link delays corresponding to P regions are obtained.
Considering that there may be an abnormal value or other unreasonable values in the J first link delays (of course, there may also be no such unreasonable values), the present embodiment removes the unreasonable values to obtain K first link delays, and establishes a preset delay mapping table according to P regions and K first link delays corresponding to the P regions, where K is not greater than J.
In the embodiment, a key factor for determining the total link time delay of a transmission link between a target downloading end and an uploading end is considered, the first link time delay brought by the backbone route is used as a basis for constructing the preset time delay mapping table, and the difficulty in establishing the preset time delay mapping table is reduced while the target resource in the uploading end with short time delay can be scheduled for the target downloading end.
Optionally, when a preset delay mapping table is established, a situation of mapping between one region and the region may occur, at this time, the corresponding link delay may be set to 0 in the preset delay mapping table, so that if there is an upload terminal located in the same region as the target download terminal, the upload terminal located in the same region is preferentially selected as the target upload terminal.
The following is also described by taking the area divided according to the provinces as an example: if P regions correspond to provinces A, B and C. Wherein, province a and province B belong to backbone route R1, and province C belongs to backbone route R2, so that 2 backbone routes to which 3 areas belong are correspondingly obtained here.
The first route can be further determined according to the backbone routes, and it is assumed that there are two first routes ra1 and ra2 in the a province, two first routes rb1 and rb2 in the B province, and two first routes rc1 and rc2 in the C province. If the downloading end a is positioned in province A, two uploading ends B and C with target resources are respectively positioned in provinces B and C, when connection is established between the downloading end a and the uploading end B and the target resources are transmitted, a link of a first route rb1 → a backbone route R1 → a first route ra2 exists on a corresponding transmission link, and the corresponding first link time delay is set to be 40 ms; when connection is established between the downloading end a and the uploading end c and target resources are transmitted, a link of 'first route rc1 → backbone route R2 → backbone route R1 → first route ra 2' exists on a corresponding transmission link, and the corresponding first link delay is set to be 70 ms. At this time, when the preset delay mapping table is established, the link delay between the provinces a and B may be determined to be 40ms, and the link delay between the provinces a and C may be determined to be 70 ms.
Certainly, there is a great chance that the first link delay measured at a single time is present, and in practical application, the preset delay mapping table may be established based on a plurality of first link delays. For example, when determining the link delay between the provinces a and B, the corresponding first link delay may be obtained multiple times, and in order to make the obtained link delay representative, the first link delay may also be obtained at different times, or the downloading end (or the uploading end) may be determined to be in different cities of the province a (or the province B), or the downloading end and the uploading end may be subjected to regional exchange, and so on. The following numerical values are obtained by the step of obtaining the first link time delay between the provinces A and B for a plurality of times: 40ms, 42ms, 38ms, 40ms, 500 ms; based on the above data, it can be seen that 500ms is significantly larger than other data, and it can be determined as an abnormal value and removed, and the link delay between the provinces a and B is determined based on the remaining data, and a specific determination manner may be, for example, taking an average, taking a mode, and the like, which is not limited herein.
In some application scenarios, the number of the first routes is large, and if the first routes are determined, much manpower and material resources may be consumed, so that only the backbone routes may be determined, and the link delay between the backbone routes and the first routes (or the link delay between the upload terminal and the first routes) is obtained to further calculate the first link delay, without determining specific routes as the first routes.
Based on the possible processes for removing outliers in the above example, this example provides an alternative implementation for removing outliers, specifically:
as shown in fig. 3, after acquiring J first link delays corresponding to the P regions in step S520, the resource scheduling method further includes:
step S521, performing data normalization processing on any one of the J first link delays according to a preset rule to obtain normalization values respectively corresponding to the any one of the J first link delays;
step S522, the first link delay corresponding to the normalized value outside the preset value range is cleared, and the K first link delays corresponding to the P regions are obtained.
In a preferred embodiment, the data normalization process may be a zero-mean normalization (z-score normalization) process; of course, in other possible embodiments, the data normalization process may be a min-max normalization or a fractional scaling normalization, etc.
In this embodiment, by performing data normalization processing on the first link delay, the difficulty in acquiring the abnormal value is reduced, and the efficiency of removing the abnormal value is improved.
Optionally, as shown in fig. 4, before acquiring at least one backbone route to which the P regions belong in step S510, the resource scheduling method includes:
step S501, obtaining routes in P areas and corresponding historical route tracking data, wherein the historical route tracking data comprises route addresses and historical link time delay;
step S502, determining a target network segment according to the historical routing tracking data, wherein the historical link time delay corresponding to the target network segment is greater than a time delay threshold value;
step S503, determining a route satisfying a second preset condition in the P regions as a backbone route, where the second preset condition includes: the routing address is located within the target network segment.
In some cases, specific routes in a trans-regional transmission link, for example, a trans-provincial transmission link, are not directly known, and in this embodiment, the analysis is performed based on historical route trace data (i.e., traceroute data) acquired in a historical resource transmission process to determine the backbone routes.
For example, the target resource may be forwarded multiple times through the route in the link that the upload terminal transmits the target resource to the download terminal, and the address of the route (or gateway) reached by each forwarding (i.e., each hop) and the link delay corresponding to the forwarding may be acquired through the traceroute command. For example, for a process of historical resource transmission of a certain Time, the number of forwarding times (Time To Live, TTL, which is interpreted as a survival Time and may refer To the number of forwarding times, which may also be referred To as a hop count) obtained by a traceroute command is 7, which are respectively denoted as TTL1, TTL2, … … and TTL7, and the historical link delays corresponding To TTL1, TTL2, … … and TTL7 are 5ms, 10ms, 20ms, 35ms, 20ms, 10ms and 5ms, respectively; if the set delay threshold is 30ms, the routing addresses of two routes corresponding to the hop TTL4 can be recorded. Through the collection, comparison, recording and analysis of more historical route tracing data, it may be found that the recorded route addresses are mainly located in some network segments, and then the network segments can be used as target network segments, and the route of the route address in the target network segment is determined as the backbone route. The above determining process of the backbone route can be regarded as a data mining process for the backbone route characteristics.
When the backbone route is determined, a route (non-backbone route) of a previous hop or a next hop of the backbone route may be determined as the first route. However, as described above, in some application scenarios, the number of the first routes may be large, and it is not necessary to specifically determine which routes are the first routes, and only after determining the backbone route, the link delay between the backbone route (or the upload terminal) and the previous hop of the backbone route, and the link delay between the backbone route (or the upload terminal) and the next hop of the backbone route are further obtained.
The embodiment can ensure that the backbone route in the network can still be accurately determined in the network without the backbone route address data, and the preset time delay mapping table can be established.
A specific application embodiment of the resource scheduling method provided in the embodiment of the present invention is described below, and as shown in fig. 5 and fig. 6, the resource scheduling method includes the following steps:
step S10, determining backbone route; specifically, data acquisition is performed by using traceroute to obtain historical traceroute data (such as a routing address and historical link delay); since a backbone route (Core Router) is usually a route of one hop which is a key of a cross-province route, and the corresponding link delay is long and is a main factor influencing the total delay of the whole transmission link, the collected historical traceroute data can be subsequently counted and analyzed, and it can be found that the corresponding historical link delay is usually high in some special network segments which are usually target network segments where addresses of the backbone routes are located; based on the above contents, the route with the address located in the special network segment can be determined as the backbone route;
step S20, extracting/entering provincial route; according to the backbone routes, Round-Trip Time (RTT) corresponding to a Province route (OUT Province route) and RTT corresponding to an Province route (IN Province route) can be extracted, wherein the Province route and the Province route both correspond to the first route mentioned above, the Province route is a previous hop of the backbone route to which the Province route belongs, and the Province route is a next hop of the backbone route to which the Province route belongs;
step S30, calculating the time delay of each data cross-provincial route, namely calculating the cross-provincial time delay generated at the cross-provincial route when the cross-provincial data is transmitted; with reference to fig. 5, in this step, a difference between an RTT (corresponding to RTT5) corresponding to the provincial route and an RTT (corresponding to RTT2) corresponding to the provincial route may be regarded as a provincial spanning delay (Cross provision RTT), where the provincial spanning delay corresponds to the first link delay in the foregoing;
step S40, cleaning abnormal values based on the z-score data; cleaning outliers across provincial time delays based on z-score normalization;
step S50, generating province-province trans-province time delay mapping tables; generating a trans-provincial time delay mapping table (corresponding to the preset time delay mapping table mentioned above) about each province according to the residual trans-provincial time delay after cleaning in the step S40 and the corresponding province, wherein the trans-provincial time delay mapping table reflects the link time delay speed relation from each province to each province in the whole country;
step S60, the scheduler optimizes the cross province distribution; the scheduler, that is, the server capable of operating the resource scheduling method provided by the embodiment of the present invention, schedules, for the target download end, the target resource of the upload end in the province having the shortest time delay across the province links according to the cross-province time delay mapping table when receiving the target download request of the target download end, and when the upload end and the target download end are in the same province, can preferentially schedule the target resource of the upload end in the same province.
In practical application, a server running the resource scheduling method can also dynamically sense the change condition of the cross-provincial link delay between provinces, and avoid that the link delay between the scheduled uploading end and the target downloading end is too high to influence the downloading speed of the downloading end due to the time delay jitter of backbone routes.
In the above specific application embodiment, the time delay of the cross-province link is evaluated based on traceroute data, and when the uploading end is selected in the cross-province, the province with the time delay lower than that of the link of the target downloading end is preferentially selected, and the province with the closest geographical position is no longer preferentially selected, so that the rationality of resource scheduling is improved, and the resource downloading speed of the downloading end is favorably improved.
An embodiment of the present invention further provides a server, as shown in fig. 7, where the server includes:
a first determining module 610, configured to determine, when a target download request sent by a target download end is received, a target resource corresponding to the target download request and a first area to which the target download end belongs;
the query module 620 is configured to query N second areas to which M uploading terminals storing the target resource belong, where M, N are positive integers greater than 1;
a second determining module 630, configured to determine, according to a preset delay mapping table, a target area, of the N second areas, where a link delay with the first area meets a first preset condition;
a scheduling module 640, configured to schedule a target resource stored in a target upload terminal to the target download terminal, where the target upload terminal is an upload terminal belonging to the target area in the M upload terminals.
Optionally, as shown in fig. 8, the server further includes:
a first obtaining module 651, configured to obtain at least one backbone route to which P regions belong, where P regions include the first region and the second region, and P is a positive integer greater than 1;
a second obtaining module 652, configured to obtain J first link delays corresponding to the P regions, where the first link delay is a link delay between any two first routes located in two different regions of the P regions, and the first route is a route in the P regions, which is adjacent to the backbone route and is different from the backbone route;
the establishing module 653 is configured to establish a preset delay mapping table according to the P regions and the corresponding K first link delays, where the K first link delays are part or all of the J first link delays.
Optionally, the server further comprises:
a third obtaining module 661, configured to obtain routes in P regions and corresponding historical route tracking data, where the historical route tracking data includes a route address and a historical link delay;
a third determining module 662, configured to determine a target network segment according to the historical routing tracking data, where a historical link delay corresponding to the target network segment is greater than a delay threshold;
a fourth determining module 663, configured to determine, as the backbone route, a route that satisfies a second preset condition in the P regions, where the second preset condition includes: the routing address is located within the target network segment.
Optionally, the server further comprises:
a fourth obtaining module 671, configured to perform data normalization processing on any one of the J first link delays according to a preset rule, to obtain normalized values corresponding to the any one of the first link delays;
a fifth obtaining module 672, configured to remove the first link delay corresponding to the normalized value outside the preset value range, and obtain K first link delays corresponding to the P regions.
Optionally, the second determining module 630 includes:
and the determining unit is used for determining a target area with the shortest link delay with the first area in the N second areas according to a preset delay mapping table.
The server provided by the embodiment of the invention is a server corresponding to the resource scheduling method, and all implementation manners in the method are suitable for the embodiment of the server, so that the same technical effect can be achieved.
The embodiment of the present invention further provides a server, as shown in fig. 9, including a processor 701, a communication interface 702, a memory 703 and a communication bus 704, where the processor 701, the communication interface 702, and the memory 703 complete mutual communication through the communication bus 704,
a memory 703 for storing a computer program;
the processor 701 is configured to implement the following steps when executing the program stored in the memory 703:
under the condition that a target downloading request sent by a target downloading terminal is received, determining a target resource corresponding to the target downloading request and a first area to which the target downloading terminal belongs;
querying N second areas to which M uploading terminals storing the target resources belong, wherein M, N are positive integers greater than 1;
determining a target area, in the N second areas, of which the link time delay with the first area meets a first preset condition according to a preset time delay mapping table;
and scheduling the target resources stored on the target uploading terminal to the target downloading terminal, wherein the target uploading terminal belongs to the uploading terminal of the target area in the M uploading terminals.
Optionally, the following steps can also be implemented:
acquiring at least one backbone route to which P regions belong, wherein the P regions comprise the first region and the second region, and P is a positive integer greater than 1;
acquiring J first link time delays corresponding to the P regions, where the first link time delay is a link time delay between any two first routes located in different two regions of the P regions, and the first route is a route in the P regions, which is adjacent to the backbone route and is different from the backbone route;
and establishing a preset time delay mapping table according to the P areas and the corresponding K first link time delays, wherein the K first link time delays are part or all of the J first link time delays.
Optionally, before the obtaining of the at least one backbone route to which the P regions belong, the following steps may be further implemented:
obtaining routes in P areas and corresponding historical route tracing data, wherein the historical route tracing data comprises route addresses and historical link time delay;
determining a target network segment according to the historical routing tracking data, wherein the historical link time delay corresponding to the target network segment is greater than a time delay threshold value;
determining routes meeting a second preset condition in the P areas as backbone routes, wherein the second preset condition comprises: the routing address is located within the target network segment.
Optionally, after obtaining the J first link delays corresponding to the P regions, the following steps may be further implemented:
performing data normalization processing on any one of the J first link time delays according to a preset rule to obtain normalization values respectively corresponding to the any one of the J first link time delays;
and clearing the first link time delay corresponding to the normalized value out of the preset value range to obtain K first link time delays corresponding to the P areas.
Optionally, the determining, according to a preset delay mapping table, a target area, of the N second areas, where a link delay with the first area meets a first preset condition, includes:
and determining a target area with the shortest link time delay with the first area in the N second areas according to a preset time delay mapping table.
The communication bus mentioned in the above terminal may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. 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 terminal and other equipment.
The Memory may include a Random Access Memory (RAM) or a non-volatile Memory (non-volatile Memory), such as at least one disk Memory. Optionally, the memory may also be at least one memory device located remotely from the processor.
The Processor may be a general-purpose Processor, and includes a Central Processing Unit (CPU), a Network Processor (NP), and the like; the Integrated Circuit 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, a discrete Gate or transistor logic device, or a discrete hardware component.
In another embodiment of the present invention, there is also provided a computer-readable storage medium, having stored therein instructions, which when run on a computer, cause the computer to execute the resource scheduling method described in any of the above embodiments.
In yet another embodiment, a computer program product containing instructions is provided, which when run on a computer, causes the computer to perform the method for resource scheduling described in any of the above embodiments.
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 (9)
1. A resource scheduling method is applied to a server, and is characterized by comprising the following steps:
under the condition that a target downloading request sent by a target downloading terminal is received, determining a target resource corresponding to the target downloading request and a first area to which the target downloading terminal belongs;
querying N second areas to which M uploading terminals storing the target resources belong, wherein M, N are positive integers greater than 1;
determining a target area, in the N second areas, for which the link delay with the first area meets a first preset condition according to a preset delay mapping table, including: determining a target area with the shortest link delay with the first area in the N second areas according to a preset delay mapping table; the preset time delay mapping table is used for at least recording the link time delay between the first area and each second area; the first preset condition is that the link time delay is shortest or the link time delay is less than a set value;
and scheduling the target resources stored on the target uploading terminal to the target downloading terminal, wherein the target uploading terminal belongs to the uploading terminal of the target area in the M uploading terminals.
2. The method of claim 1, further comprising:
acquiring at least one backbone route to which P regions belong, wherein the P regions comprise the first region and the second region, and P is a positive integer greater than 1;
acquiring J first link time delays corresponding to the P regions, where the first link time delay is a link time delay between any two first routes located in different two regions of the P regions, and the first route is a route in the P regions, which is adjacent to the backbone route and is different from the backbone route;
and establishing a preset time delay mapping table according to the P areas and the corresponding K first link time delays, wherein the K first link time delays are part or all of the J first link time delays.
3. The method according to claim 2, wherein before the obtaining at least one backbone route to which the P regions belong, the method comprises:
obtaining routes in P areas and corresponding historical route tracing data, wherein the historical route tracing data comprises route addresses and historical link time delay;
determining a target network segment according to the historical routing tracking data, wherein the historical link time delay corresponding to the target network segment is greater than a time delay threshold value;
determining routes meeting a second preset condition in the P areas as backbone routes, wherein the second preset condition comprises: the routing address is located within the target network segment.
4. The method according to claim 2, wherein after obtaining J first link delays corresponding to the P regions, the method further comprises:
performing data normalization processing on any one of the J first link time delays according to a preset rule to obtain normalization values respectively corresponding to the any one of the J first link time delays;
and clearing the first link time delay corresponding to the normalized value out of the preset value range to obtain K first link time delays corresponding to the P areas.
5. A server, comprising:
the first determining module is used for determining a target resource corresponding to a target downloading request and a first area to which the target downloading terminal belongs under the condition of receiving the target downloading request sent by the target downloading terminal;
the query module is used for querying N second areas to which M uploading terminals storing the target resources belong, wherein M, N are positive integers greater than 1;
a second determining module, configured to determine, according to a preset delay mapping table, a target area, of the N second areas, where a link delay with the first area meets a first preset condition, where the target area includes: determining a target area with the shortest link delay with the first area in the N second areas according to a preset delay mapping table; the preset time delay mapping table is used for at least recording the link time delay between the first area and each second area; the first preset condition is that the link time delay is shortest or the link time delay is less than a set value;
and the scheduling module is used for scheduling the target resources stored on the target uploading end to the target downloading end, wherein the target uploading end belongs to the uploading end of the target area in the M uploading ends.
6. The server of claim 5, further comprising:
a first obtaining module, configured to obtain at least one backbone route to which P regions belong, where the P regions include the first region and the second region, and P is a positive integer greater than 1;
a second obtaining module, configured to obtain J first link delays corresponding to the P regions, where the first link delay is a link delay between any two first routes located in two different regions of the P regions, and the first route is a route in the P regions, which is adjacent to the backbone route and is different from the backbone route;
and the establishing module is used for establishing a preset time delay mapping table according to the P areas and the corresponding K first link time delays, wherein the K first link time delays are part or all of the J first link time delays.
7. The server of claim 6, further comprising:
a third obtaining module, configured to obtain routes in P regions and corresponding historical route tracking data, where the historical route tracking data includes a route address and a historical link delay;
a third determining module, configured to determine a target network segment according to the historical routing tracking data, where a historical link delay corresponding to the target network segment is greater than a delay threshold;
a fourth determining module, configured to determine, as the backbone route, a route that satisfies a second preset condition in the P regions, where the second preset condition includes: the routing address is located within the target network segment.
8. A server is characterized by comprising a processor, a communication interface, a memory and a communication bus, wherein the processor and the communication interface are used for realizing the communication between the processor and the memory through the communication bus;
a memory for storing a computer program;
a processor for implementing the method steps of any of claims 1 to 4 when executing a program stored in the memory.
9. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the method according to any one of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010072473.8A CN111327688B (en) | 2020-01-21 | 2020-01-21 | Resource scheduling method, server and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010072473.8A CN111327688B (en) | 2020-01-21 | 2020-01-21 | Resource scheduling method, server and readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111327688A CN111327688A (en) | 2020-06-23 |
| CN111327688B true CN111327688B (en) | 2022-03-25 |
Family
ID=71167237
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010072473.8A Active CN111327688B (en) | 2020-01-21 | 2020-01-21 | Resource scheduling method, server and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111327688B (en) |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101287011A (en) * | 2008-05-26 | 2008-10-15 | 蓝汛网络科技（北京）有限公司 | Method, system and device for responding service request from user in content distributing network |
| CN101729430A (en) * | 2010-01-15 | 2010-06-09 | 西安电子科技大学 | Dynamic resource allocation system and allocation method used for supporting end-to-end time delay warranty |
| CN101997891A (en) * | 2009-08-28 | 2011-03-30 | 华为技术有限公司 | Method, device and system for allocating P2P media stream |
| CN102271368A (en) * | 2011-07-27 | 2011-12-07 | 哈尔滨工业大学深圳研究生院 | Cross-layer-resource-optimization-based space-sky information network information transmission method and system |
| CN103476084A (en) * | 2013-09-26 | 2013-12-25 | 常熟理工学院 | Method for achieving routing communication based on cross-layer wireless sensor network |
| CN104852831A (en) * | 2015-06-01 | 2015-08-19 | 清华大学深圳研究生院 | Prediction method for layered network round-trip time (RTT) |
| CN105991474A (en) * | 2015-05-18 | 2016-10-05 | 杭州迪普科技有限公司 | Traffic scheduling method, traffic scheduling device and network device |
| WO2017088551A1 (en) * | 2015-11-27 | 2017-06-01 | 中兴通讯股份有限公司 | Data scheduling method and apparatus for dedicated physical data channel |
| CN107770096A (en) * | 2017-12-11 | 2018-03-06 | 国网河南省电力公司信息通信公司 | A kind of SDN/NFV network dynamic resource allocation algorithms based on load balancing |
| CN107911296A (en) * | 2017-10-20 | 2018-04-13 | 西安电子科技大学 | Geographic position routing method based on backbone link guarantee time delay and vehicle-mounted terminal |
| CN108600147A (en) * | 2017-12-29 | 2018-09-28 | 北京奇艺世纪科技有限公司 | A kind of speed of download prediction technique and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10298980B2 (en) * | 2015-04-21 | 2019-05-21 | Edge2020 | Price driven multimedia content video time-bandwidth product improvement (VTBPI) transmission |
-
2020
- 2020-01-21 CN CN202010072473.8A patent/CN111327688B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101287011A (en) * | 2008-05-26 | 2008-10-15 | 蓝汛网络科技（北京）有限公司 | Method, system and device for responding service request from user in content distributing network |
| CN101997891A (en) * | 2009-08-28 | 2011-03-30 | 华为技术有限公司 | Method, device and system for allocating P2P media stream |
| CN101729430A (en) * | 2010-01-15 | 2010-06-09 | 西安电子科技大学 | Dynamic resource allocation system and allocation method used for supporting end-to-end time delay warranty |
| CN102271368A (en) * | 2011-07-27 | 2011-12-07 | 哈尔滨工业大学深圳研究生院 | Cross-layer-resource-optimization-based space-sky information network information transmission method and system |
| CN103476084A (en) * | 2013-09-26 | 2013-12-25 | 常熟理工学院 | Method for achieving routing communication based on cross-layer wireless sensor network |
| CN105991474A (en) * | 2015-05-18 | 2016-10-05 | 杭州迪普科技有限公司 | Traffic scheduling method, traffic scheduling device and network device |
| CN104852831A (en) * | 2015-06-01 | 2015-08-19 | 清华大学深圳研究生院 | Prediction method for layered network round-trip time (RTT) |
| WO2017088551A1 (en) * | 2015-11-27 | 2017-06-01 | 中兴通讯股份有限公司 | Data scheduling method and apparatus for dedicated physical data channel |
| CN107911296A (en) * | 2017-10-20 | 2018-04-13 | 西安电子科技大学 | Geographic position routing method based on backbone link guarantee time delay and vehicle-mounted terminal |
| CN107770096A (en) * | 2017-12-11 | 2018-03-06 | 国网河南省电力公司信息通信公司 | A kind of SDN/NFV network dynamic resource allocation algorithms based on load balancing |
| CN108600147A (en) * | 2017-12-29 | 2018-09-28 | 北京奇艺世纪科技有限公司 | A kind of speed of download prediction technique and device |
Non-Patent Citations (2)
| Title |
|---|
| "An Efficient Load Balancing Technology in CDN";Yun Bai等;《2009 Sixth International Conference on Fuzzy Systems and Knowledge Discovery》;20091028;全文 * |
| "一种基于区域划分的虚拟网映射新算法";吕博等;《电子与信息学报》;20111015;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111327688A (en) | 2020-06-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110505101B (en) | Network slice arranging method and device | |
| JP6820320B2 (en) | Methods and devices for real-time traffic guidance using real-time user monitoring data | |
| JP5534481B2 (en) | Communication quality monitoring system, communication quality monitoring method, and storage medium | |
| CN111327461B (en) | Domain name management method, device, equipment and medium based on CDN system | |
| CN103746929A (en) | Optimal access flow scheduling method based on DNS (Domain Name System) and optimal access flow scheduling equipment based on DNS | |
| CN116545936B (en) | Congestion control method, system, device, communication equipment and storage medium | |
| CN108574627B (en) | SDN network multi-control-domain cooperative management method and system | |
| CN108494575A (en) | A kind of power telecom network method of operation modeling method and system based on chart database | |
| CN113810293B (en) | Network preferred agent method, device, electronic equipment, server and storage medium | |
| JP6383009B2 (en) | Communication speed estimation device, communication speed estimation method, and program | |
| CN103227756A (en) | On-line protocol optimization method and device | |
| EP3345345B1 (en) | Systems and methods for remote network topology discovery | |
| CN111327688B (en) | Resource scheduling method, server and readable storage medium | |
| EP2689571B1 (en) | Replicating data | |
| US11606415B2 (en) | Method, apparatus and system for processing an access request in a content delivery system | |
| US20150058466A1 (en) | Device for server grouping | |
| CN113746654A (en) | IPv6 address management and flow analysis method and device | |
| CN114520784B (en) | Dynamic content acceleration access method and device | |
| CN114338516B (en) | Traffic forwarding and policy determining method and device | |
| EP4280561A1 (en) | Information flow identification method, network chip, and network device | |
| JP4871775B2 (en) | Statistical information collection device | |
| CN109218463B (en) | Acquisition system maintenance method and acquisition system | |
| CN114938348A (en) | Data stream forwarding method and device, electronic equipment and storage medium | |
| CN110601993A (en) | Multi-outlet load balancing method and device | |
| CN109302348B (en) | Data processing method based on CNN network and router |
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 |