CN113301085A - Scheduling method, device, equipment and storage medium - Google Patents
Scheduling method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN113301085A CN113301085A CN202010623758.6A CN202010623758A CN113301085A CN 113301085 A CN113301085 A CN 113301085A CN 202010623758 A CN202010623758 A CN 202010623758A CN 113301085 A CN113301085 A CN 113301085A
- Authority
- CN
- China
- Prior art keywords
- link
- user
- nodes
- node
- scheduling
- 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
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/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
- H04L67/63—Routing a service request depending on the request content or context
-
- 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
Abstract
The embodiment of the application provides a scheduling method, a scheduling device, scheduling equipment and a storage medium. In the scheduling method, dynamic routing data of a plurality of nodes in the content distribution network can be acquired, and a user area of at least one link capable server corresponding to the node is dynamically determined according to the dynamic routing data. Based on the implementation mode, the link adjustment condition and the roadblock condition of the node can be dynamically sensed, and then the corresponding relation between at least one link corresponding to the node and the user area can be updated in real time, so that a scheduling strategy can be flexibly formulated according to the actual condition of the link, the influence of the change of the link state on flow scheduling is effectively reduced, and the access stability is improved.
Description
Technical Field
The present application relates to the field of communications technologies, and in particular, to a scheduling method, apparatus, device, and storage medium.
Background
In some typical Content Delivery Network (CDN) deployment modes, to save cost, CDN nodes are built as multilink nodes, that is, one CDN node corresponds to a plurality of different types of links.
However, the node construction method introduces more complexity, which is not favorable for realizing traffic scheduling. Therefore, a new solution is yet to be proposed.
Disclosure of Invention
Aspects of the present application provide a scheduling method, apparatus, device, and storage medium, so as to improve traffic scheduling performance of a multilink node and improve access stability.
The embodiment of the application provides a scheduling method, which comprises the following steps: acquiring dynamic routing data of a plurality of nodes in a content distribution network; determining a user area which can be served by at least one link respectively corresponding to the plurality of nodes according to the dynamic routing data; distributing the network address in the user address base to the plurality of nodes according to the user area which can be respectively served by at least one link corresponding to the plurality of nodes and the user area to which the network address in the user address base belongs to obtain a scheduling strategy; and scheduling the access request from the network address in the user address library according to the scheduling policy.
The embodiment of the present application further provides a scheduling method, including: receiving a first access request of a first user area; determining a first node corresponding to the first user area from a plurality of nodes in a content distribution network according to a set scheduling strategy; the first node includes a first link capable of providing service to the first user zone; calculating the current flow of the first link according to the dynamic flow data of the first link; if the current flow of the first link is larger than the safety capacity of the first link, returning the address of the first node to the first user so that the first user can access the specified address through the first link; and the scheduling strategy is obtained by calculation according to the respective dynamic routing data of the nodes.
An embodiment of the present application further provides a scheduling apparatus, including: a routing data acquisition module to: acquiring dynamic routing data of a plurality of nodes in a content distribution network; a link determination module to: determining a user area which can be served by at least one link respectively corresponding to the plurality of nodes according to the dynamic routing data; a policy making module to: distributing the network address in the user address base to the plurality of nodes according to the user area which can be respectively served by at least one link corresponding to the plurality of nodes and the user area to which the network address in the user address base belongs to obtain a scheduling strategy; a scheduling module to: and scheduling the access request from the network address in the user address library according to the scheduling policy.
An embodiment of the present application further provides a scheduling apparatus, including: a request receiving module to: receiving a first access request of a first user area; a node determination module to: determining a first node corresponding to the first user area from a plurality of nodes in a content distribution network according to a set scheduling strategy; the first node includes a first link capable of providing service to the first user zone; a capacity calculation module to: calculating the current flow of the first link according to the dynamic flow data of the first link; a sending module configured to: if the current flow of the first link is larger than the safety capacity of the first link, returning the address of the first node to the first user so that the first user can access the specified address through the first link; and the scheduling strategy is obtained by calculation according to the respective dynamic routing data of the nodes.
An embodiment of the present application further provides an electronic device, including: a memory and a processor; the memory is to store one or more computer instructions; the processor is to execute the one or more computer instructions to: and executing the steps in the scheduling method provided by the embodiment of the application.
The embodiments of the present application further provide a computer-readable storage medium storing a computer program, where the computer program, when executed by a processor, can implement the steps in the scheduling method provided in the embodiments of the present application.
In the embodiment of the application, dynamic routing data of a plurality of nodes in a content distribution network can be acquired, and a user area of at least one link server corresponding to the node is dynamically determined according to the dynamic routing data. Based on the implementation mode, the link adjustment condition and the roadblock condition of the node can be dynamically sensed, and then the corresponding relation between at least one link corresponding to the node and the user area can be updated in real time, so that a scheduling strategy can be flexibly formulated according to the actual condition of the link, the influence of the change of the link state on flow scheduling is effectively reduced, and the access stability is improved.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:
fig. 1a is a schematic flowchart of a scheduling method according to an exemplary embodiment of the present application;
FIG. 1b is a schematic illustration of determining user areas that a link can serve based on dynamic routing data;
FIG. 1c is a schematic diagram of a link organization structure provided in an exemplary embodiment of the present application;
fig. 2 is a flowchart illustrating a scheduling method according to another exemplary embodiment of the present application;
fig. 3a is a schematic diagram of an internal architecture of a scheduling system according to an exemplary embodiment of the present application;
FIG. 3b is a schematic diagram illustrating an improvement in a link overload condition according to an exemplary embodiment of the present application;
fig. 4 is a schematic diagram of a scheduling apparatus according to an exemplary embodiment of the present application;
fig. 5 is a schematic diagram of a scheduling apparatus according to another exemplary embodiment of the present application;
fig. 6 is a schematic structural diagram of an electronic device according to an exemplary embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the technical solutions of the present application will be described in detail and completely with reference to the following specific embodiments of the present application and the accompanying drawings. It should be apparent that the described embodiments are only some of the embodiments of the present application, 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 application.
The CDN is an intelligent virtual network constructed on the basis of the existing network, and can enable a user to obtain required content nearby by means of functional modules of load balancing, content distribution, scheduling and the like of a central platform by means of edge servers deployed in various places, so that network congestion is reduced, and response speed and hit rate of user access are improved.
For the access request of the user, the central platform of the CND can distribute the access request to the edge nodes according to the load conditions of different nodes, and the edge nodes route the access request of the user to corresponding links so as to process the access request of the user. The above process of allocating the access request of the user to the edge node may be described as a traffic scheduling process of the CDN.
When the CDN nodes are constructed as multi-link nodes, the nodes do not need to be constructed in each operator network independently, and the cost can be greatly saved. The multilink node means that one CDN node corresponds to multiple different links, and the multiple different links belong to different operators. Furthermore, one CDN node may serve users of multiple different operators. However, the node construction method introduces more complexity, which is not favorable for realizing traffic scheduling.
In view of the above technical problem, embodiments of the present application provide a solution, which will be described below with reference to the accompanying drawings.
Fig. 1a is a schematic flowchart of a scheduling method according to an exemplary embodiment of the present application, and as shown in fig. 1a, the method includes:
And 102, determining user areas which can be served by at least one link respectively corresponding to the plurality of nodes according to the dynamic routing data.
And 104, distributing the network addresses in the user address base to the nodes according to the user areas which can be respectively served by the at least one link corresponding to the nodes and the user areas to which the network addresses in the user address base belong, so as to obtain a scheduling strategy.
And 105, scheduling the access request from the network address in the user address library according to the scheduling policy.
The embodiment of the application is suitable for a Content Delivery Network (CDN), and an execution main body of the scheduling method can be a scheduling system of a CDN center platform. The plurality of nodes mentioned in this embodiment may be implemented as edge nodes in the CDN. The edge nodes may be single link nodes or multi-link nodes. Wherein, the single link node corresponds to a type of link and can serve the user of an operator; the multilink nodes correspond to a plurality of different types of links, and the plurality of different types of links belong to different operators, so that each edge node can provide network services for users of the different operators, and the network deployment cost is further saved.
In this embodiment, in order to achieve a better traffic scheduling effect, an implementation manner is provided for acquiring dynamic routing data of a node and formulating a scheduling policy according to the dynamic routing data.
In some embodiments, the dynamic routing data of the node may be obtained according to a set period, or may be obtained under the trigger of a specified condition, or may be randomly obtained according to a scheduling policy, which includes but is not limited to this embodiment.
The set period may be set according to actual requirements, and may be set to 38 hours, 24 hours, 12 hours, or other time periods, which is not limited in this embodiment. Based on the period, the link information of the nodes can be synchronized in time, so that the scheduling strategy can be adjusted in time, and the routing synchronization between the scheduling strategy and the network line is ensured.
Dynamic routing refers to a routing mode in which a node can automatically establish a routing table and adjust a routing policy in due time according to changes in actual conditions. When the link in the node changes, such as the link fails or other available links are added, the dynamic route can automatically select a better available route. In the present embodiment, the route data generated by the dynamic route is described as dynamic route data. For example, when a node implements dynamic routing based on BGP (Border Gateway Protocol), the obtained dynamic routing data is BGP dynamic routing data.
Based on the dynamic routing data, the available links in the nodes and the routing results of the nodes for different access requests can be dynamically sensed, so that the latest link condition of each node can be acquired, the link change of the node can be found in time, and the scheduling strategy can be adjusted according to the link change condition.
And determining the user area which can be served by each link in the node according to the routing result of the node for different access requests. For example, as shown in fig. 1b, for link 1, the user area 1 to which the access request on link 1 belongs and the user area 2 can be determined based on the address prefix list (prefix) in the dynamic routing data as the user areas that link 1 can serve.
An alternative embodiment of determining a user area that can be served by each of at least one link corresponding to each of the plurality of nodes according to the dynamic routing data will be described below by taking any one of the plurality of nodes as an example. Aiming at any node in a plurality of nodes, the access requests respectively routed to at least one link corresponding to the node can be obtained from the dynamic routing data of the node; and determining the user areas which can be respectively served by the at least one link corresponding to the node according to the user areas to which the access requests respectively routed to the at least one link belong.
For example, in the dynamic routing data of the node a, the node a routes the access request of the user area 1 to the link a1, routes the access request of the user area 2 to the link a2, and routes the location requests of the user areas 3 and 4 to the link a 3. Based on the above, the available links corresponding to the node a are: link a1, link a1, and link a1, where link a1 may serve users of user area 1, link a2 may serve users of user area 2, and link a3 may serve users of user area 3 and user area zone 4.
The user areas are obtained by dividing the areas to which the network addresses belong, and each user area corresponds to a network address set.
The user address library, i.e., the network address database, includes a plurality of user network addresses, and the plurality of user network addresses can implement network access through the CDN. The user address library can be collected by developers through various technical means. In the process of realizing content distribution, the user address library can be updated according to the network address corresponding to the historical access record, and details are not repeated.
Alternatively, the network address may be implemented as an IP (Internet Protocol) address, and the user address repository may be implemented as an IP repository; alternatively, the network address may be implemented as a Media Access Control (MAC) address, and the user address library is implemented as a MAC address library, which includes but is not limited to this embodiment.
After determining the available links of each node and the user areas that each link can serve, the network addresses in the user address library can be allocated to determine the corresponding relationship between the network addresses and the nodes. When each network address is allocated, the user area to which the network address belongs and the user area which can be served by the link corresponding to each node can be used as allocation bases, so that the user area to which the network address belongs is matched with the user area which can be served by the link corresponding to the node.
The determined corresponding relation between the network address and the node can be used as a scheduling strategy adopted by traffic scheduling, and in the subsequent traffic scheduling process, the access request from the network address in the user address library can be scheduled based on the scheduling strategy.
For example, when an access request is received, a user area to which the network address of the user who sent the access request belongs may be acquired; then, based on the scheduling policy, the node corresponding to the user area is determined, and the address corresponding to the node can be returned to the user. In turn, the user may access the node based on the address. After receiving the access request of the user, the node can route the access request of the user to a link which can provide service for the user area so as to process the access request of the user.
In this embodiment, dynamic routing data of a plurality of nodes in the content distribution network may be acquired, and a user area of at least one link capable server corresponding to the node may be dynamically determined according to the dynamic routing data. Based on the implementation mode, the link adjustment condition and the roadblock condition of the node can be dynamically sensed, and then the corresponding relation between at least one link corresponding to the node and the user area can be updated in real time, so that a scheduling strategy can be flexibly formulated according to the actual condition of the link, the influence of the change of the link state on flow scheduling is effectively reduced, and the access stability is improved. When the nodes in the content distribution network are multilink nodes, the phenomenon that the nodes are not overloaded but the links are overloaded can be effectively avoided.
In some exemplary embodiments, when the network address in the user address repository is allocated to the plurality of nodes according to the user area that the at least one link corresponding to each of the plurality of nodes can respectively serve and the user area to which the network address in the user address repository belongs, the network address in the user address repository may be divided into a plurality of network address sets according to the user area to which the network address belongs, and each network address set corresponds to the same user area. Aiming at any network address set in the plurality of network address sets, dividing the network address set into a target node in the plurality of nodes, wherein a target link corresponding to the target node can provide service for a user area corresponding to the network address set.
For example, following the example in the foregoing embodiment, the set of IP addresses belonging to user area 1 in the user IP library may be allocated to the node to which link a1 belongs; allocating the IP address set belonging to the user area 2 in the user IP library to the node to which the link a2 belongs; the IP addresses belonging to user area 2 and user area 4 in the user IP library are set and assigned to the node to which link a3 belongs.
In this embodiment, the user area may be obtained by dividing the geographic area or the management area according to a larger granularity (e.g., continent, country), or may be obtained by dividing the geographic area or the management area according to a smaller granularity (e.g., city, province), which is not limited in this embodiment as the case may be.
In the process of scheduling the multilink nodes, the availability of the links corresponding to the nodes and the traffic of each link affect the traffic scheduling among the nodes, so that the complexity of the traffic scheduling is increased, and the stability of user access is not improved. In some exemplary embodiments, in the process of performing traffic scheduling according to the scheduling policy determined in the foregoing embodiments, the available capacity of the link may be further considered to avoid overload of the link.
Based on this, for the access request of the user, after the corresponding node is determined according to the scheduling policy, it can be further determined whether the available capacity of the link in the node for providing service to the access request meets the scheduling requirement. If so, the access request is dispatched to the node, and the node routes the access request to the link. If not, the access request can be switched to other nodes with the same link type to meet the user requirement.
Alternatively, the link types may include, but are not limited to, IXP (Internet Exchange Point), Internet switching center, IX) type, peering type, and Transit type. The IXP is a link capable of performing peer-to-peer computing (peer) with multiple operators simultaneously, and can serve users of multiple operators. peering is a link that can be computed peer-to-peer with a particular operator, serving only users of one operator. transit is a link that can reach all corners around the world, and can serve users of any operator in any country.
An alternative embodiment of scheduling according to scheduling policy and link capacity will be exemplified below.
Optionally, after receiving the first access request of the first user in the first user area, the scheduling system may determine the first node from the multiple nodes of the CDN according to the scheduling policy; wherein the first node comprises a first link capable of providing service to a first user zone. Next, the scheduling system may obtain dynamic traffic data of the first link, and calculate a current traffic of the first link according to the dynamic traffic data of the first link; if the current flow of the first link is greater than the safe capacity of the first link, the scheduling system may return the address of the first node to the first user. Further, the first user may access the first node, and the first node may route the user's access request onto the first link to enable the first user to access the specified address over the first link.
If the current flow of the first link is smaller than or equal to the safety capacity of the first link, determining a second link with the same link type as the first link from at least one link corresponding to the plurality of nodes respectively; next, the scheduling system may obtain dynamic traffic data of the second link, and calculate a current traffic of the second link according to the dynamic traffic data of the second link. If the current flow of the second link is larger than the safety capacity of the second link, the address of the second node to which the second link belongs can be returned to the first user. Further, the first user may access the second node, and the second node may route the user's access request onto the second link to enable the first user to access the specified address over the second link.
Similarly, when the current traffic of the second link is less than or equal to the security capacity of the second link, the access request of the first user may be switched to a third link with the same link type, which is not described in detail.
Based on the above, the access request of each user area is matched with the link type, and meanwhile, the overload of the link is effectively avoided, the overload condition of the link is improved, and the response quality of the user access is improved.
The dynamic traffic data includes real-time access traffic of each node and real-time access traffic of each link in the node. The dynamic traffic data may dynamically reflect the links available in each node and the traffic usage of each link. For any node, the user area that can be served by each at least one link corresponding to the node can be obtained according to the dynamic routing data of the node, and the current traffic of each at least one link corresponding to the node can be obtained according to the dynamic traffic data of the node.
For each link, real-time traffic data of each port of the link can be monitored in real time based on a Simple Network Management Protocol (snmp), and the real-time traffic data of the link can be calculated according to the real-time traffic data of each port. An alternative embodiment of obtaining the current traffic of the link according to the dynamic traffic data will be exemplarily described below by taking any one link as an example.
Optionally, for any link, the real-time traffic data of at least one port of the link may be obtained from the dynamic traffic data, and the real-time traffic data of the at least one port may be summed to obtain the current traffic of the link.
The safety capacity of each link may be a preset value or may be obtained by dynamic calculation. Optionally, taking the first link as an example, an implementation manner of dynamically calculating the security capacity of the link is as follows:
calculating the respective utilization rate of at least one port according to the real-time flow of the at least one port of the first link; determining a target utilization rate satisfying a set condition from respective utilization rates of the at least one port; calculating the ratio of the current flow of the first link and the target utilization rate as the safety capacity of the first link, as shown in the following formula:
wherein LinkCapacity represents the security capacity of the link, n is the number of ports contained in the link, and B is the number of ports contained in the linkiIs the current flow of the ith port, RiFor the utilization of the ith port, i ═ 1,2,3 … n.
Optionally, for any port of the at least one port, a ratio between a current flow of the port and a set safety capacity of the port may be calculated, so as to obtain a utilization rate of the port. That is to say that the first and second electrodes,
Ciis the static security capacity of the ith port, where CiMay be a set value.
An optional link organization structure of a multi-link node can be shown in fig. 1c, taking node 1 as an example, where node 1 corresponds to different types of links, that is: IX link, peering link, and transit link. One or more ports may be included under each link, for example, the peering link includes port 1, port 2 and port 3 shown in fig. 1 c. When the safety capacity of the peering link is calculated, the current flow and the static safety capacity of the port 1, the port 2 and the port 3 can be obtained, and calculation is performed based on the formula, which is not described again.
It should be noted that, in some optional embodiments, after the safety capacity of the link is calculated based on the above formula, the safety capacity of the link may be further adjusted in real time according to the current traffic of the link.
Optionally, for any link, if the current traffic of the link is greater than the specified proportion of the safety capacity of the link, the safety capacity of the link may be reduced at a set rate. Optionally, the specified ratio may be set according to requirements, for example, may be set to 80%, 90%, 95%, or other ratio values, and this embodiment is not limited. The set rate is a configurable value, and can be set according to requirements, for example, the safe capacity of the link can be reduced at a rate of 30 mega per minute (30M/min), or reduced at a rate of 1 mega per second (1M/s), which is not limited in this embodiment.
Accordingly, when the link is no longer overloaded, for example, when the current traffic of the link is less than or equal to a specified proportion of the safety capacity of the link, the safety capacity of the link may be increased at a set rate to restore the safety capacity of the link to the value calculated according to the above formula.
Based on the above embodiment, the safety capacity of the link can be adaptively adjusted according to the current flow of the link, so that a very effective link overload protection mechanism is realized, the link overload phenomenon in the flow scheduling process is avoided, the node overload is indirectly avoided, and the load balancing effect is improved. Based on the above embodiments of the present application, when part of links of part of nodes changes, for example, the optical fiber network of part of links is interrupted, or part of links is newly added, the scheduling policy can be adjusted in time, so as to lay a better foundation for subsequent traffic scheduling between nodes. In the scheduling process, a better link is selected for the user according to the capacity of the link, so that the phenomena of node overload and link overload can be avoided, and the stability of user access is ensured.
It should be noted that, the descriptions of "first", "second", "third", etc. in this document are used to distinguish different description objects, for example, to distinguish different users, different links, or different addresses, and do not represent a sequential order, nor do they limit "first" and "second" to be different types.
Fig. 2 is a flowchart illustrating a scheduling method according to another exemplary embodiment of the present application, and as shown in fig. 2, the scheduling method includes:
In this embodiment, the set scheduling policy may be calculated according to dynamic routing data of a plurality of nodes in a set period. Optionally, the set period may be the latest time period before the current traffic scheduling, and further, the latest condition of the link may be acquired, so that the link is scheduled according to a scheduling policy matched with the link condition in the next traffic scheduling period, and the scheduling efficiency is improved. The set period may be one day or three days, and this embodiment is not limited. For example, a scheduling policy for traffic scheduling on the following day may be formulated based on the dynamic routing data on the previous day. Alternatively, based on a 0: 00-12: dynamic routing data in the 00 time period is formulated as 12: 00-24: and scheduling strategies adopted for traffic scheduling in the time period of 00.
When the current flow of the first link is larger than the safety capacity of the first link, the first access request is routed to the first node, and the first link can be effectively prevented from being overloaded. And if the current flow of the first link is less than or equal to the security capacity of the first link, routing the first access request to other nodes, wherein the other nodes comprise other links with the same link type as the first link, so as to process the first access request through the other links.
In this embodiment, based on a scheduling policy formulated by dynamic routing data of a plurality of nodes in a set period, a link adjustment condition and a roadblock condition of the node may be dynamically sensed to obtain a scheduling policy matched with the link condition, so that an influence of a change in a link state on traffic scheduling is effectively reduced, and access stability is improved. In the process of carrying out flow scheduling based on the scheduling strategy, the nodes are selected according to the available capacity of the link, so that the phenomenon of link overload can be avoided, and the stability of user access is ensured.
It should be noted that the execution subjects of the steps of the methods provided in the above embodiments may be the same device, or different devices may be used as the execution subjects of the methods. For example, the execution subjects of step 201 to step 203 may be device a; for another example, the execution subject of steps 201 and 202 may be device a, and the execution subject of step 203 may be device B; and so on.
In addition, in some of the flows described in the above embodiments and the drawings, a plurality of operations are included in a specific order, but it should be clearly understood that the operations may be executed out of the order presented herein or in parallel, and the sequence numbers of the operations, such as 201, 202, etc., are merely used for distinguishing different operations, and the sequence numbers do not represent any execution order per se. Additionally, the flows may include more or fewer operations, and the operations may be performed sequentially or in parallel.
The scheduling method provided by the embodiment of the present application will be exemplarily described below with reference to an example of a typical scheduling system. Fig. 3a illustrates an internal structure diagram of the scheduling system, and the main functions of the scheduling system may include: link mapping, user granularity partitioning, link dynamic capacity, link overload protection, cost scheduling, quality scheduling, and the like.
The link mapping refers to collecting BGP dynamic routing data at a scheduled timing, and generating a link library according to the dynamic routing data. The link library stores the current available links of each node and the user areas that can be served by the available links. Based on this, the scheduling system can be aware of which user zones each link can serve. Meanwhile, when one or at least one link optical fiber network in the multilink nodes is suddenly interrupted, the change can be detected by the BGP dynamic routing in time, so that the scheduling system can make policy adjustment in time.
The user granularity division refers to that a scheduling system collects BGP dynamic routing data at regular time and divides user areas at regular time (for example, 1 day) according to the BGP routing data; the division principle of the user area is as follows: and ensuring that a part of walk transition link, a part of walk IX or a waiting link do not appear in the access request of the same user area.
The dynamic capacity of the link refers to that the scheduling system monitors the service condition of each port of the link in real time and generates link safety capacity according to the snmp real-time flow data of the port. For a specific calculation, reference may be made to the descriptions of the foregoing embodiments, which are not repeated herein.
Link overload protection refers to a scheduling system automatically reducing the safety capacity of a link at a configurable rate when the traffic of the link exceeds a certain percentage (e.g., 90% configurable) of the safety capacity. When the link is no longer overloaded, the scheduling system may restore the safe capacity of the link at another configurable speed.
Based on the mode, the scheduling can be carried out according to the link capacity, and the link running-out condition is obviously improved. An improved result is shown in fig. 3b, in which the link overload conditions at time t5 and time t6, which are scheduled according to the link capacity, are compared with the time t1 to time t4, which are not scheduled according to the link capacity, the traffic peak of the link is near the safe capacity line, does not exceed the physical threshold line, and the overload phenomenon hardly occurs. Based on the mode, the links with lower cost and higher quality can be conveniently established with a plurality of operators, so that the cost is reduced.
Fig. 4 is a schematic structural diagram of a scheduling apparatus according to an exemplary embodiment of the present application, and as shown in fig. 4, the scheduling apparatus includes:
a routing data obtaining module 401, configured to: acquiring dynamic routing data of a plurality of nodes in a content distribution network; the plurality of nodes are multilink nodes.
A link determination module 402 for: and determining user areas which can be respectively served by at least one link corresponding to the nodes according to the dynamic routing data.
A policy making module 403, configured to: and distributing the network address in the user address base to the nodes according to the user area which can be respectively served by at least one link corresponding to the nodes and the user area to which the network address in the user address base belongs to obtain a scheduling strategy.
A scheduling module 404 configured to: and scheduling the access request from the network address in the user address library according to the scheduling policy.
Further optionally, when determining, according to the dynamic routing data, a user area that can be served by each of at least one link corresponding to each of the plurality of nodes, the link determining module 402 is specifically configured to: aiming at any node in the plurality of nodes, acquiring access requests respectively routed to at least one link corresponding to the node from the dynamic routing data of the node; and determining the user areas which can be respectively served by the at least one link corresponding to the node according to the user areas to which the access requests respectively routed to the at least one link belong.
Further optionally, when the policy making module 403 allocates the network address in the user address base to the plurality of nodes according to the user area that can be served by each of the at least one link corresponding to each of the plurality of nodes and the user area to which the network address in the user address base belongs, specifically, the policy making module is configured to: dividing the network addresses in the user address library into a plurality of network address sets according to the user areas to which the network addresses belong, wherein each network address set corresponds to the same user area; aiming at any network address set in the plurality of network address sets, dividing the network address set into target nodes in the plurality of nodes, wherein the target links corresponding to the target nodes can provide services for user areas corresponding to the network address sets.
Further optionally, the scheduling module 404 includes: a request receiving module 4041, a node determining module 4042, a capacity calculating module 4043, and a sending module 4044. When the scheduling module 404 schedules the access request from the network address in the user address repository according to the scheduling policy, specifically, the scheduling module is configured to: receiving, by the request receiving module 4041, a first access request of a first user of the first user area; determining, by a node determination module 4042, a first node from the plurality of nodes, the first node including a first link capable of providing services to the first user zone, according to the scheduling policy; calculating the current flow of the first link according to the dynamic flow data of the first link by a capacity calculation module 4043; if the current traffic of the first link is greater than the security capacity of the first link, the address of the first node is returned to the first user through a sending module 4044, so that the first user accesses the specified address through the first link.
Further optionally, the scheduling module 404 is further configured to: if the current traffic of the first link is less than or equal to the security capacity of the first link, determining, by a node determination module 4042, a second link having the same link type as the first link from at least one link corresponding to each of the plurality of nodes; calculating the current flow of the second link according to the dynamic flow data of the second link by a capacity calculation module 4043; if the current traffic of the second link is greater than the security capacity of the second link, the sending module 4044 returns the address of the second node to which the second link belongs to the first user, so that the first user accesses the specified address through the second link in the second node.
Further optionally, when the capacity calculation module 4043 calculates the current traffic of the first link according to the dynamic traffic data of the first link, specifically configured to: calculating the respective utilization rate of at least one port according to the real-time flow of the at least one port of the first link; determining a target utilization rate meeting a set condition from respective utilization rates of the at least one port; and calculating the ratio of the current flow of the first link to the target utilization rate as the safety capacity of the first link.
Further optionally, the capacity calculation module 4043 is further configured to: and if the current flow of the link is larger than the specified proportion of the safety capacity of the link, reducing the safety capacity of the link according to a set rate.
In this embodiment, dynamic routing data of a plurality of nodes in the content distribution network may be acquired, and a user area of at least one link capable server corresponding to the node may be dynamically determined according to the dynamic routing data. Based on the implementation mode, the link adjustment condition and the roadblock condition of the node can be dynamically sensed, and then the corresponding relation between at least one link corresponding to the node and the user area can be updated in real time, so that a scheduling strategy can be flexibly formulated according to the actual condition of the link, the influence of the change of the link state on flow scheduling is effectively reduced, and the access stability is improved.
Fig. 5 is a schematic structural diagram of a scheduling apparatus according to another exemplary embodiment of the present application, and as shown in fig. 5, the scheduling apparatus includes:
a request receiving module 501, configured to: receiving a first access request of a first user area; a node determining module 502 configured to: determining a first node corresponding to the first user area from a plurality of nodes in a content distribution network according to a set scheduling strategy; the first node includes a first link capable of providing service to the first user zone; and the scheduling strategy is obtained by calculation according to the respective dynamic routing data of the plurality of nodes in a set period. A capacity calculation module 503, configured to: and calculating the current flow of the first link according to the dynamic flow data of the first link. A sending module 504, configured to: and if the current flow of the first link is larger than the safety capacity of the first link, returning the address of the first node to the first user so that the first user can access the specified address through the first link.
In this embodiment, based on a scheduling policy formulated by dynamic routing data of a plurality of nodes in a set period, a link adjustment condition and a roadblock condition of the node may be dynamically sensed to obtain a scheduling policy matched with the link condition, so that an influence of a change in a link state on traffic scheduling is effectively reduced, and access stability is improved. In the process of carrying out flow scheduling based on the scheduling strategy, the node is selected according to the current flow of the link, so that the phenomenon of link overload can be avoided, and the stability of user access is ensured.
Fig. 6 is a schematic structural diagram of an electronic device according to an exemplary embodiment of the present application, and as shown in fig. 6, the electronic device includes: a memory 601 and a processor 602.
The memory 601 is used for storing computer programs and may be configured to store other various data to support operations on the electronic device. Examples of such data include instructions for any application or method operating on the electronic device, contact data, phonebook data, messages, pictures, videos, and so forth.
The memory 601 may be implemented by any type or combination of volatile or non-volatile memory devices such as Static Random Access Memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic or optical disks.
A processor 602, coupled to the memory 601, for executing the computer programs in the memory 601 to: acquiring dynamic routing data of a plurality of nodes in a content distribution network; determining a user area which can be served by at least one link respectively corresponding to the plurality of nodes according to the dynamic routing data; distributing the network address in the user address base to the plurality of nodes according to the user area which can be respectively served by at least one link corresponding to the plurality of nodes and the user area to which the network address in the user address base belongs to obtain a scheduling strategy; and scheduling the access request from the network address in the user address library according to the scheduling policy.
Further optionally, when determining, according to the dynamic routing data, a user area that can be served by each of the at least one link corresponding to each of the plurality of nodes, the processor 602 is specifically configured to: aiming at any node in the plurality of nodes, acquiring access requests respectively routed to at least one link corresponding to the node from the dynamic routing data of the node; and determining the user areas which can be respectively served by the at least one link corresponding to the node according to the user areas to which the access requests respectively routed to the at least one link belong.
Further optionally, when the processor 602 allocates the network address in the user address base to the plurality of nodes according to the user area that can be served by each of the at least one link corresponding to each of the plurality of nodes and the user area to which the network address in the user address base belongs, the processor is specifically configured to: dividing the network addresses in the user address library into a plurality of network address sets according to the user areas to which the network addresses belong, wherein each network address set corresponds to the same user area; aiming at any network address set in the plurality of network address sets, dividing the network address set into target nodes in the plurality of nodes, wherein the target links corresponding to the target nodes can provide services for user areas corresponding to the network address sets.
Further optionally, when the processor 602 schedules an access request from a network address in the user address repository according to the scheduling policy, specifically configured to: receiving a first access request of a first user area; determining a first node from the plurality of nodes according to the scheduling policy, the first node comprising a first link capable of providing service to the first user zone; calculating the current flow of the first link according to the dynamic flow data of the first link; and if the current flow of the first link is larger than the safety capacity of the first link, returning the address of the first node to the first user so that the first user can access the specified address through the first link.
Further optionally, the processor 602 is further configured to: if the current flow of the first link is less than or equal to the safety capacity of the first link, determining a second link with the same link type as that of the first link from at least one link corresponding to the plurality of nodes respectively; calculating the current flow of the second link according to the dynamic flow data of the second link; and if the current flow of the second link is larger than the safety capacity of the second link, returning the address of the second node to which the second link belongs to the first user, so that the first user accesses the specified address through the second link in the second node.
Further optionally, when calculating the current traffic of the first link according to the dynamic traffic data of the first link, the processor 602 is specifically configured to: calculating the respective utilization rate of at least one port according to the real-time flow of the at least one port of the first link; determining a target utilization rate meeting a set condition from respective utilization rates of the at least one port; and calculating the ratio of the current flow of the first link to the target utilization rate as the safety capacity of the first link.
Further optionally, the processor 602 is further configured to: and if the current flow of the link is larger than the specified proportion of the safety capacity of the link, reducing the safety capacity of the link according to a set rate.
Further, as shown in fig. 6, the electronic device further includes: communication component 603, display component 604, power component 605, audio component 606, and the like. Only some of the components are schematically shown in fig. 6, and the electronic device is not meant to include only the components shown in fig. 6.
Wherein the communication component 603 is configured to facilitate communication between the device in which the communication component is located and other devices in a wired or wireless manner. The device in which the communication component is located may access a wireless network based on a communication standard, such as WiFi, 2G, 3G, 4G, or 5G, or a combination thereof. In an exemplary embodiment, the communication component receives a broadcast signal or broadcast related information from an external broadcast management system via a broadcast channel. In an exemplary embodiment, the communication component may be implemented based on Near Field Communication (NFC) technology, Radio Frequency Identification (RFID) technology, infrared data association (IrDA) technology, Ultra Wideband (UWB) technology, Bluetooth (BT) technology, and other technologies.
The display assembly 604 includes a screen, which may include a liquid crystal display assembly (LCD) and a Touch Panel (TP). If the screen includes a touch panel, the screen may be implemented as a touch screen to receive an input signal from a user. The touch panel includes one or more touch sensors to sense touch, slide, and gestures on the touch panel. The touch sensor may not only sense the boundary of a touch or slide action, but also detect the duration and pressure associated with the touch or slide operation.
The power supply 605 provides power to various components of the device in which the power supply is located. The power components may include a power management system, one or more power supplies, and other components associated with generating, managing, and distributing power for the device in which the power component is located.
In this embodiment, dynamic routing data of a plurality of nodes in the content distribution network may be acquired, and a user area of at least one link servable server corresponding to a node may be dynamically determined according to the dynamic routing data. Based on the implementation mode, the link adjustment condition and the roadblock condition of the node can be dynamically sensed, and then the corresponding relation between at least one link corresponding to the node and the user area can be updated in real time, so that a scheduling strategy can be flexibly formulated according to the actual condition of the link, the influence of the change of the link state on flow scheduling is effectively reduced, and the access stability is improved.
In addition to the execution logic described in the foregoing embodiments, the electronic device illustrated in fig. 6 may also execute the following data processing logic: the communication component 603 receives a first access request of a first user zone; the processor 602 determines a first node corresponding to the first user area from a plurality of nodes in a content distribution network according to a set scheduling policy; the first node includes a first link capable of providing service to the first user zone; calculating the current flow of the first link according to the dynamic flow data of the first link; if the current flow of the first link is larger than the safety capacity of the first link, returning the address of the first node to the first user so that the first user can access the specified address through the first link; and the scheduling strategy is obtained by calculation according to the respective dynamic routing data of the plurality of nodes in a set period.
Accordingly, the present application further provides a computer-readable storage medium storing a computer program, where the computer program is capable of implementing the steps that can be executed by the electronic device in the foregoing method embodiments when executed.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that 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 like elements in a process, method, article, or apparatus that comprises the element.
The above description is only an example of the present application and is not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.
Claims (12)
1. A scheduling method for a content distribution network, comprising:
acquiring dynamic routing data of a plurality of nodes in a content distribution network;
determining a user area which can be served by at least one link respectively corresponding to the plurality of nodes according to the dynamic routing data;
distributing the network address in the user address base to the plurality of nodes according to the user area which can be respectively served by at least one link corresponding to the plurality of nodes and the user area to which the network address in the user address base belongs to obtain a scheduling strategy;
and scheduling the access request from the network address in the user address library according to the scheduling policy.
2. The method of claim 1, wherein determining, according to the dynamic routing data, a user area that can be served by each of the at least one link corresponding to each of the plurality of nodes comprises:
aiming at any node in the plurality of nodes, acquiring access requests respectively routed to at least one link corresponding to the node from the dynamic routing data of the node;
and determining the user areas which can be respectively served by the at least one link corresponding to the node according to the user areas to which the access requests respectively routed to the at least one link belong.
3. The method according to claim 1, wherein allocating the network addresses in the user address base to the plurality of nodes according to the user areas that can be served by the respective at least one link corresponding to the plurality of nodes and the user areas to which the network addresses in the user address base belong comprises:
dividing the network addresses in the user address library into a plurality of network address sets according to the user areas to which the network addresses belong, wherein each network address set corresponds to the same user area;
aiming at any network address set in the plurality of network address sets, dividing the network address set into target nodes in the plurality of nodes, wherein the target links corresponding to the target nodes can provide services for user areas corresponding to the network address sets.
4. The method of claim 1, wherein scheduling access requests from network addresses in the user address repository according to the scheduling policy comprises:
receiving a first access request of a first user area;
determining a first node from the plurality of nodes according to the scheduling policy, the first node comprising a first link capable of providing service to the first user zone;
calculating the current flow of the first link according to the dynamic flow data of the first link;
and if the current flow of the first link is larger than the safety capacity of the first link, returning the address of the first node to the first user so that the first user can access the specified address through the first link.
5. The method of claim 4, further comprising:
if the current flow of the first link is less than or equal to the safety capacity of the first link, determining a second link with the same link type as that of the first link from at least one link corresponding to the plurality of nodes respectively;
calculating the current flow of the second link according to the dynamic flow data of the second link;
and if the current flow of the second link is larger than the safety capacity of the second link, returning the address of the second node to which the second link belongs to the first user, so that the first user accesses the specified address through the second link in the second node.
6. The method of claim 4 or 5, further comprising:
calculating the respective utilization rate of at least one port according to the real-time flow of the at least one port of the first link;
determining a target utilization rate meeting a set condition from respective utilization rates of the at least one port;
and calculating the ratio of the current flow of the first link to the target utilization rate as the safety capacity of the first link.
7. The method of claim 6, further comprising:
and if the current flow of the link is larger than the specified proportion of the safety capacity of the link, reducing the safety capacity of the link according to a set rate.
8. A scheduling method for a content distribution network, comprising:
receiving a first access request of a first user area;
determining a first node corresponding to the first user area from a plurality of nodes in a content distribution network according to a set scheduling strategy; the first node includes a first link capable of providing service to the first user zone;
calculating the current flow of the first link according to the dynamic flow data of the first link;
if the current flow of the first link is larger than the safety capacity of the first link, returning the address of the first node to the first user so that the first user can access the specified address through the first link;
and the scheduling strategy is obtained by calculation according to the respective dynamic routing data of the nodes.
9. A scheduling apparatus, comprising:
a routing data acquisition module to: acquiring dynamic routing data of a plurality of nodes in a content distribution network;
a link determination module to: determining a user area which can be served by at least one link respectively corresponding to the plurality of nodes according to the dynamic routing data;
a policy making module to: distributing the network address in the user address base to the plurality of nodes according to the user area which can be respectively served by at least one link corresponding to the plurality of nodes and the user area to which the network address in the user address base belongs to obtain a scheduling strategy;
a scheduling module to: and scheduling the access request from the network address in the user address library according to the scheduling policy.
10. A scheduling apparatus, comprising:
a request receiving module to: receiving a first access request of a first user area;
a node determination module to: determining a first node corresponding to the first user area from a plurality of nodes in a content distribution network according to a set scheduling strategy; the first node includes a first link capable of providing service to the first user zone;
a capacity calculation module to: calculating the current flow of the first link according to the dynamic flow data of the first link;
a sending module configured to: if the current flow of the first link is larger than the safety capacity of the first link, returning the address of the first node to the first user so that the first user can access the specified address through the first link;
and the scheduling strategy is obtained by calculation according to the respective dynamic routing data of the nodes.
11. An electronic device, comprising: a memory and a processor;
the memory is to store one or more computer instructions;
the processor is to execute the one or more computer instructions to: performing the steps in the scheduling method of any of claims 1-8.
12. A computer-readable storage medium storing a computer program, wherein the computer program, when executed by a processor, is adapted to carry out the steps of the scheduling method according to any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010623758.6A CN113301085B (en) | 2020-06-30 | 2020-06-30 | Scheduling method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010623758.6A CN113301085B (en) | 2020-06-30 | 2020-06-30 | Scheduling method, device, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113301085A true CN113301085A (en) | 2021-08-24 |
| CN113301085B CN113301085B (en) | 2022-04-12 |
Family
ID=77318158
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010623758.6A Active CN113301085B (en) | 2020-06-30 | 2020-06-30 | Scheduling method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113301085B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117240825A (en) * | 2023-11-09 | 2023-12-15 | 北京火山引擎科技有限公司 | Address library construction method, device, equipment and medium applied to CDN |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101202684A (en) * | 2006-12-15 | 2008-06-18 | 中国电信股份有限公司 | Method for close judgment of user in content distributing network |
| CN105897822A (en) * | 2015-11-11 | 2016-08-24 | 乐卡汽车智能科技（北京）有限公司 | Content distribution network CDN node selection method and apparatus |
| WO2016145753A1 (en) * | 2015-03-17 | 2016-09-22 | 网宿科技股份有限公司 | Method, device and system for processing traffic of mobile terminal based on content delivery network |
| CN107277097A (en) * | 2016-04-08 | 2017-10-20 | 北京优朋普乐科技有限公司 | Content distributing network and its load estimation equalization methods |
| CN107645525A (en) * | 2016-07-21 | 2018-01-30 | 阿里巴巴集团控股有限公司 | Detection processing, dispatching method and related device, the node of content distributing network |
| CN109561141A (en) * | 2018-11-21 | 2019-04-02 | 中国联合网络通信集团有限公司 | A kind of selection method and equipment of CDN node |
| CN109951338A (en) * | 2019-03-28 | 2019-06-28 | 北京金山云网络技术有限公司 | CDN network configuration method, configuration device, electronic equipment and storage medium |
| CN109995857A (en) * | 2019-03-21 | 2019-07-09 | 北京京东尚科信息技术有限公司 | A kind of resource access method, server and computer storage medium |
-
2020
- 2020-06-30 CN CN202010623758.6A patent/CN113301085B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101202684A (en) * | 2006-12-15 | 2008-06-18 | 中国电信股份有限公司 | Method for close judgment of user in content distributing network |
| WO2016145753A1 (en) * | 2015-03-17 | 2016-09-22 | 网宿科技股份有限公司 | Method, device and system for processing traffic of mobile terminal based on content delivery network |
| CN105897822A (en) * | 2015-11-11 | 2016-08-24 | 乐卡汽车智能科技（北京）有限公司 | Content distribution network CDN node selection method and apparatus |
| CN107277097A (en) * | 2016-04-08 | 2017-10-20 | 北京优朋普乐科技有限公司 | Content distributing network and its load estimation equalization methods |
| CN107645525A (en) * | 2016-07-21 | 2018-01-30 | 阿里巴巴集团控股有限公司 | Detection processing, dispatching method and related device, the node of content distributing network |
| CN109561141A (en) * | 2018-11-21 | 2019-04-02 | 中国联合网络通信集团有限公司 | A kind of selection method and equipment of CDN node |
| CN109995857A (en) * | 2019-03-21 | 2019-07-09 | 北京京东尚科信息技术有限公司 | A kind of resource access method, server and computer storage medium |
| CN109951338A (en) * | 2019-03-28 | 2019-06-28 | 北京金山云网络技术有限公司 | CDN network configuration method, configuration device, electronic equipment and storage medium |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117240825A (en) * | 2023-11-09 | 2023-12-15 | 北京火山引擎科技有限公司 | Address library construction method, device, equipment and medium applied to CDN |
| CN117240825B (en) * | 2023-11-09 | 2024-02-02 | 北京火山引擎科技有限公司 | Address library construction method, device, equipment and medium applied to CDN |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113301085B (en) | 2022-04-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Aral et al. | A decentralized replica placement algorithm for edge computing | |
| CN109547517B (en) | Method and device for scheduling bandwidth resources | |
| US9137165B2 (en) | Methods of load balancing using primary and stand-by addresses and related load balancers and servers | |
| US9621642B2 (en) | Methods of forwarding data packets using transient tables and related load balancers | |
| CN112532668B (en) | Network edge computing method, device and medium | |
| US8850067B2 (en) | Internet protocol (IP) address pool management and allocation | |
| CN102137014A (en) | Resource management method, system and resource manager | |
| CN110858808A (en) | Method, system and device for realizing speed limit | |
| CN105515977B (en) | Method, device and system for acquiring transmission path in network | |
| CN108055309B (en) | Data transmission system and method | |
| JP2012099062A (en) | Service cooperation system and information processing system | |
| US20210194988A1 (en) | Systems and methods for dynamic multi-access edge allocation using artificial intelligence | |
| US9014036B2 (en) | Dynamic band selection and aggregation | |
| CN110198332B (en) | Scheduling method and device for content distribution network node and storage medium | |
| CN103078880A (en) | Content information processing method, system and equipment based on multiple content delivery networks | |
| Chang et al. | Write-aware replica placement for cloud computing | |
| CN115499859B (en) | NWDAF-based method for managing and deciding computing resources | |
| CN113301085B (en) | Scheduling method, device, equipment and storage medium | |
| CN111901236A (en) | Method and system for optimizing openstack cloud network by using dynamic routing | |
| CN110198267A (en) | A kind of traffic scheduling method, system and server | |
| CN1330124C (en) | Method and apparatus for virtualizing network resources | |
| Wittenburg et al. | A survey of current directions in service placement in mobile ad-hoc networks | |
| CN113301079A (en) | Data acquisition method, system, computing device and storage medium | |
| CN104184673A (en) | Load balancing method based on instant communication service and system | |
| CN108243225B (en) | Distributed system, management method and access method |
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 |