CN108337191B - Method and system for scheduling network resources - Google Patents
Method and system for scheduling network resources Download PDFInfo
- Publication number
- CN108337191B CN108337191B CN201710038241.9A CN201710038241A CN108337191B CN 108337191 B CN108337191 B CN 108337191B CN 201710038241 A CN201710038241 A CN 201710038241A CN 108337191 B CN108337191 B CN 108337191B
- Authority
- CN
- China
- Prior art keywords
- area network
- resource
- network
- value
- resources
- 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
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/78—Architectures of resource allocation
- H04L47/783—Distributed allocation of resources, e.g. bandwidth brokers
- H04L47/785—Distributed allocation of resources, e.g. bandwidth brokers among multiple network domains, e.g. multilateral agreements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/80—Actions related to the user profile or the type of traffic
- H04L47/805—QOS or priority aware
-
- 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
- H04L67/1074—Peer-to-peer [P2P] networks for supporting data block transmission mechanisms
- H04L67/1078—Resource delivery mechanisms
- H04L67/1085—Resource delivery mechanisms involving dynamic management of active down- or uploading connections
-
- 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/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method and a system for scheduling network resources, and relates to the technical field of communication. The method for scheduling the network resources comprises the following steps: respectively setting resource detection nodes in each area network, and performing service detection on each area network by using the resource information of each area network obtained by the resource detection nodes to obtain service factors of each area network; receiving a resource request, and setting a cost value for the service factor of each area network according to the area network to which a source user of the resource request belongs and the service factor of each area network; selecting one area network from each area network by using a spanning tree algorithm according to the overhead value, and caching the resources of the selected area network as optimal resources; and when the same resource request is received again, responding the cached optimal resource to the source user. The invention can improve the utilization rate of resources in the whole network.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a method and a system for scheduling network resources.
Background
With the rapid development of internet services, users have an increasing demand for resources, and have an increasing demand for the access speed of resources. In order to meet the requirements of users on resources and the access speed of the resources, each operator takes a measure for enhancing the introduction of the resources. For example, the method adopts the method of content introduction of IDC (Internet Data Center) or the method of cache supplement introduction. The IDC content introduction means that an operator introduces contents provided by a content provider into an IDC computer room to provide services such as host hosting for the contents. Cache replenishment introduction refers to saving a copy of content accessed or downloaded by a user in a storage device, and when the content is accessed or downloaded again by the user, the content is provided directly to the user by the storage device. Therefore, richer resources are provided for the user, and the speed of accessing the resources by the user is increased.
Different operators, and different subsidiaries under the same operator flag each develop their own resources. Since a content resource provider does not have an IP (Internet Protocol) address of the whole network, a resource access error easily occurs, and a situation occurs in which a resource required by a user is introduced into a local area network but still accesses other area networks to acquire the resource. Resources in a plurality of regional networks cannot mutually visit and communicate, and the utilization rate of the resources in the whole network is reduced.
Disclosure of Invention
The embodiment of the invention provides a method and a system for scheduling network resources, which can improve the utilization rate of resources in the whole network.
In a first aspect, an embodiment of the present invention provides a method for scheduling network resources, including: respectively setting resource detection nodes in each area network, and performing service detection on each area network by using the resource information of each area network obtained by the resource detection nodes to obtain service factors of each area network; receiving a resource request, and setting a cost value for the service factor of each area network according to the area network to which a source user of the resource request belongs and the service factor of each area network; selecting one area network from each area network by using a spanning tree algorithm according to the overhead value, and caching the resources of the selected area network as optimal resources; and when the same resource request is received again, responding the cached optimal resource to the source user.
In some embodiments of the first aspect, the traffic factor comprises resource attribution, page open latency, connection time, and/or download speed.
In some embodiments of the first aspect, setting an overhead value for the service factor of each local area network according to the local area network to which the source user of the resource request belongs and the service factor of each local area network includes: setting the cost value of the same resource attribution with the local network to which the source user belongs to be smaller than the cost value of the resource attribution which is different from the local network to which the source user belongs but has the same operator, and setting the cost value of the resource attribution which is different from the local network to which the source user belongs but has the same operator to be smaller than the cost value of the resource attribution which is different from the local network to which the source user belongs and has the different operator; and/or setting the cost value with low page opening delay to be smaller than the cost value with high page opening delay; and/or setting the overhead value with short connection time to be smaller than the overhead value with long connection time; and/or setting the overhead value with the fast downloading speed to be smaller than the overhead value with the slow downloading speed.
In some embodiments of the first aspect, selecting one area network from the area networks by using a spanning tree algorithm according to the overhead value, and caching resources of the selected area network as optimal resources, includes: acquiring the minimum overhead value of the service factors with the same priority of each area network according to the sequence of the priorities of the preset service factors from high to low by utilizing a spanning tree algorithm; and caching the resources of the regional network which are uniquely corresponding to the minimum overhead value as optimal resources.
In some embodiments of the first aspect, the method further comprises: and eliminating the area network corresponding to the service factor with the overhead value larger than or equal to the preset threshold value.
In some embodiments of the first aspect, the method further comprises: acquiring log information of each area network; and updating the overhead value of the service factor of each area network according to the log information of each area network.
In a second aspect, an embodiment of the present invention provides a system for scheduling network resources, including: the resource detection node is arranged in each regional network and is configured to detect resource information of each regional network; the detection device is configured to perform service detection on each area network to obtain a service factor of each area network; the computing platform is configured to receive the resource request, and set an overhead value for the business factors of each local area network according to the local area network to which the source user of the resource request belongs and the business factors of each local area network; the system is further configured to select one area network from the area networks by using a spanning tree algorithm according to the overhead value; the caching device is configured to cache the selected resources of the regional network as optimal resources; and is further configured to respond the cached optimal resource to the source user when the same resource request is received again.
In some embodiments of the second aspect, the traffic factor comprises resource attribution, page open latency, connection time, and/or download speed.
In some embodiments of the second aspect, the computing platform is specifically configured to: setting the cost value of the same resource attribution with the local network to which the source user belongs to be smaller than the cost value of the resource attribution which is different from the local network to which the source user belongs but has the same operator, and setting the cost value of the resource attribution which is different from the local network to which the source user belongs but has the same operator to be smaller than the cost value of the resource attribution which is different from the local network to which the source user belongs and has the different operator; and/or setting the cost value with low page opening delay to be smaller than the cost value with high page opening delay; and/or setting the overhead value with short connection time to be smaller than the overhead value with long connection time; and/or setting the overhead value with the fast downloading speed to be smaller than the overhead value with the slow downloading speed.
In some embodiments of the second aspect, the computing platform is specifically configured to: acquiring the minimum overhead value of the service factors with the same priority of each area network according to the sequence of the priorities of the preset service factors from high to low by utilizing a spanning tree algorithm; and caching the resources of the regional network which are uniquely corresponding to the minimum overhead value as optimal resources.
In some embodiments of the second aspect, the computing platform is further configured to cull the area networks corresponding to the traffic factors having the cost values greater than or equal to the preset threshold.
In some embodiments of the second aspect, the resource probing node is further configured to obtain log information for each area network; the computing platform is further configured to update the cost value of the business factor for each of the area networks based on the log information for each of the area networks.
The embodiment of the invention provides a method and a system for scheduling network resources, wherein a service detection node in the embodiment of the invention can detect resource information of each area network so as to obtain a service factor, and the overhead value of the service factor of each area network is set according to the service factor and the area network to which a source user of a resource request belongs. And selecting the area network with the optimal resource in each area network by using a spanning tree algorithm according to the overhead value of the service factor, caching the optimal resource, and directly responding the cached optimal resource to the source user when the same resource request is received again. Compared with the prior art, the embodiment of the invention can collect the service factors of each regional network in the whole network and select the regional network with the optimal resource in each regional network, thereby realizing the mutual access and intercommunication of the resources of a plurality of regional networks in the whole network, uniformly scheduling all the resources in the whole network, avoiding the problems of resource access errors and the like and improving the utilization rate of the resources in the whole network.
Drawings
The present invention will be better understood from the following description of specific embodiments thereof taken in conjunction with the accompanying drawings, in which like or similar reference characters designate like or similar features.
FIG. 1 is a flow chart of a method for network resource scheduling according to an embodiment of the present invention;
FIG. 2 is a flow chart of a method for network resource scheduling in another embodiment of the present invention;
FIG. 3 is a diagram of a spanning tree in another embodiment of the present invention;
FIG. 4 is a schematic diagram of another spanning tree in another embodiment of the present invention;
fig. 5 is a schematic structural diagram of a system for scheduling network resources according to an embodiment of the present invention.
Detailed Description
Features and exemplary embodiments of various aspects of the present invention will be described in detail below. In the following detailed description, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be apparent, however, to one skilled in the art that the present invention may be practiced without some of these specific details. The following description of the embodiments is merely intended to provide a better understanding of the present invention by illustrating examples of the present invention. The present invention is in no way limited to any specific configuration and algorithm set forth below, but rather covers any modification, replacement or improvement of elements, components or algorithms without departing from the spirit of the invention. In the drawings and the following description, well-known structures and techniques are not shown in order to avoid unnecessarily obscuring the present invention.
The embodiment of the invention provides a method for scheduling network resources, which is applied to a scene that the whole network comprises a plurality of regional networks, wherein the regional networks can be networks in different provinces or different regions under different operator flags.
Fig. 1 is a flowchart of a method for scheduling network resources according to an embodiment of the present invention, and as shown in fig. 1, the method for scheduling network resources includes steps 101 to 104.
In step 101, resource detection nodes are respectively set in each area network, and service detection is performed on each area network by using resource information of each area network obtained by the resource detection nodes, so as to obtain service factors of each area network.
One or more resource detection nodes can be arranged in each area network, and the resource detection nodes can detect and obtain resource information of each area network. The resource detection node can be used as a cloud node to store resource information of each area network, and can also be used for sending the resource information of each area network to the cloud nodes of the whole network to be stored. In one example, the resource information may be a correspondence of a domain name to an IP address. According to the resource information, the service detection can be carried out on the regional network, the service detection can be specifically service detection, the sensing monitoring of various network services can be realized, and the functions of collecting and crawling resources in the regional network can be realized. Through service detection, the service factor of each area network can be obtained. The traffic factors characterize the network traffic quality of the area network, which in one example includes resource attribution, page open latency, connection time, and/or download speed. Specifically, the resource attribution may include a local home network, a non-local home network and a heterogeneous network with the source user. The local home network of the source user is the same local and same operator as the local network of the source user, the non-local home network of the source user is the non-local and same operator as the local network of the source user, and the different network of the source user is the non-local and non-operator as the local network of the source user.
In step 102, a resource request is received, and an overhead value is set for the service factor of each local area network according to the local area network to which the source user of the resource request belongs and the service factor of each local area network.
The source user sends a resource request in order to acquire the resource. For example, the resource request includes a domain name of a resource requested by the user, there may be multiple IP addresses corresponding to the domain name, and the area networks where multiple IP addresses are located may be different, that is, there may be multiple resource attributions of the same resource. The resource request of the user source user can be acquired in a split or mirror method. The mirroring method refers to performing data configuration on a router or a switch, and assigning the traffic of a source user to other ports so as to obtain a resource request of the source user. The optical splitting method is to arrange an optical splitter on an optical fiber for transmitting data, wherein one path is used for transmitting the traffic of a source user, and the other path is used for obtaining a resource request of the source user.
According to the regional network to which the source user of the resource request belongs and the service factors of each regional network, an overhead value (namely Metirc) is set for the service factors of each regional network, so that in the subsequent steps, the optimal resource can be obtained for the user according to the set overhead value, namely the resource with good quality can be obtained more conveniently.
In step 103, according to the overhead value, a spanning tree algorithm is used to select one of the area networks, and the resources of the selected area network are cached as the optimal resources.
By utilizing the spanning tree algorithm, one area network can be selected from each area network according to the overhead value, and for a user sending a resource request, compared with the resources of other area networks, the resources of the selected area network are more convenient to obtain and have better quality. And caching the selected resources of the area network as optimal resources, so that the resources can be directly called in the subsequent process.
In step 104, when the same resource request is received again, the cached optimal resource is responded to the source user.
When the same resource request as that in step 102 is received again, it is no longer necessary to obtain resources again in the corresponding area network, and the optimal resource cached in step 103 may be directly responded to the source user. It should be noted that, when the optimal resource is responded to the source user, the optimal resource is responded in a preemptive response manner.
The embodiment of the invention provides a method for scheduling network resources, wherein a service detection node in the embodiment of the invention can detect resource information of each area network so as to obtain a service factor, and the overhead value of the service factor of each area network is set according to the service factor and the area network to which a source user of a resource request belongs. And selecting the area network with the optimal resource in each area network by using a spanning tree algorithm according to the overhead value of the service factor, caching the optimal resource, and directly responding the cached optimal resource to the source user when the same resource request is received again. Compared with the prior art, the embodiment of the invention can collect the service factors of each regional network in the whole network and select the regional network with the optimal resource in each regional network, thereby realizing the mutual access and intercommunication of the resources of a plurality of regional networks in the whole network, uniformly scheduling all the resources in the whole network, avoiding the problems of resource access errors and the like and improving the utilization rate of the resources in the whole network.
Fig. 2 is a flowchart of a method for scheduling network resources in another embodiment of the present invention, and fig. 2 is different from fig. 1 in that step 103 shown in fig. 1 can be subdivided into step 1031 and step 1032 as in fig. 2.
In step 1031, the minimum overhead value of the service factor with the same priority level of each area network is obtained by using the spanning tree algorithm according to the order from high to low of the priority level of the preset service factor.
The priority of the service factors is preset, and the service factors with higher priority participate in the selection process of the area network with the optimal resources more preferentially. Therefore, the minimum overhead value of the service factors with the same priority of each area network is obtained according to the sequence from high to low of the preset priority of the service factors. Specifically, according to the sequence from high to low of the priority of the preset service factor, obtaining the minimum value of the overhead values of the service factors with the same priority of each area network; judging whether the area network corresponding to the minimum value of the overhead values of the service factors of the same priority of each area network is unique; if the regional network corresponding to the minimum value of the overhead values of the service factors of the same priority of each regional network is unique, caching the resources of the regional network corresponding to the minimum value of the overhead values as optimal resources; if the area network corresponding to the minimum value of the overhead values of the business factors of the same priority of each area network is not unique, judging whether the network corresponding to the minimum value of the overhead values of the business factors of the lower priority of each area network is unique until the area network corresponding to the minimum value of the overhead values is unique. For example, the regional network to which the source user of the resource request belongs may be used as a root node in the spanning tree algorithm, the overhead value of the service factor with the highest priority of each regional network is compared first, and if the regional network corresponding to the minimum overhead value of the service factor with the highest priority is unique, the resource of the regional network corresponding to the minimum overhead value of the service factor with the highest priority is obtained and cached as the optimal resource; if the area network corresponding to the minimum overhead value of the service factor with the highest priority is not unique, comparing the overhead values of the service factors with the second highest priority; if the area network corresponding to the minimum overhead value of the service factor with the second highest priority is unique, acquiring the resource of the area network corresponding to the minimum overhead value of the service factor with the second highest priority as the optimal resource cache; if the area network corresponding to the minimum overhead value of the service factor with the highest priority is not unique, comparing the overhead values of the service factors with the third highest priority; and repeating the steps until the area network corresponding to the minimum overhead value of the service factor with the highest priority is unique, acquiring the resource of the area network corresponding to the minimum overhead value of the service factor with the highest priority as the optimal resource cache, wherein N is an integer greater than 2.
It is worth mentioning that if the cost values of the service factors of the plurality of area networks are equal, one area network is randomly selected from the plurality of area networks, and the resources of the selected area network are taken as the optimal resources for caching.
It should be noted that, in order to avoid that the overall quality of the resource is affected by the quality of one service factor among the plurality of service factors being too poor, a preset threshold may be preset, and the area network corresponding to the service factor whose overhead value is greater than or equal to the preset threshold may be removed. If there are multiple service factors in each area network, the preset thresholds corresponding to the multiple service factors may be the same or different. Before comparing the service factor with the highest priority, the regional network corresponding to the service factor with the overhead value greater than or equal to the preset threshold value can be removed. Or in the process of comparing the overhead values of the service factors with the same priority, removing the area network corresponding to the service factor with the overhead value greater than or equal to the preset threshold value. The timing of rejecting the area network corresponding to the service factor with the overhead value greater than or equal to the preset threshold is not limited herein.
In step 1032, the resources of the area network uniquely corresponding to the minimum overhead value are cached as the optimal resources.
In one illustrative example, the traffic factors include resource attribution (i.e., location), page open latency (i.e., delay), connection time (i.e., connect time), and download speed (i.e., speed) in a prioritized order. Moreover, in step 102 of the above embodiment, the overhead value of the service factor is set, specifically, the overhead value of the resource home location that is the same as the local area network to which the source user belongs is set to be smaller than the overhead value of the resource home location that is different from the local area network to which the source user belongs but has the same operator, and the overhead value of the resource home location that is different from the local area network to which the source user belongs but has the same operator is set to be smaller than the overhead value of the resource home location that is different from the local area network to which the source user belongs and has the different operator; the cost value with low page opening delay is smaller than the cost value with high page opening delay; the overhead value with short connection time is smaller than the overhead value with long connection time; the overhead value with fast download speed is smaller than the overhead value with slow download speed. For example, the resource request of the source user includes a domain name www.test.com, there are three local networks having resources corresponding to the domain name, the overhead value of the service factor of each local network is represented as (location, delay, connect time, speed), the three local networks are R1, R2, and R3, the resource attribution of R1 is a local home network of the source user, the resource attribution of R2 is a non-local home network of the source user, and the resource attribution of R3 is a different home network from the source user. The overhead value of the local area network ROOT to which the source user belongs is (0, 0, 0, 0), the overhead value of the service factor of R1 is (5, 10, 15, 100), the overhead value of the service factor of R2 is (5, 20, 20, 10), the overhead value of the service factor of R1 is (100, 20, 20, 20), and the preset threshold corresponding to each service factor is set to be 100. Fig. 3 is a schematic diagram of a spanning tree in another embodiment of the present invention, the overhead values of the first service factors of R1, R2, and R3 are compared first, and the area networks corresponding to the minimum overhead values are R1 and R2; the overhead values of the second service factors of R1 and R2 need to be compared, so that the regional network R1 corresponding to the minimum overhead value can be obtained, but the fourth service factor in R1 is equal to the preset threshold, and therefore, the resource of R2 can be determined to be the optimal resource cache by removing the candidate queue of the regional network where the optimal resource is located from R1. When the source user issues a resource request containing domain name www.test.com again, the cached resource of R2 is preemptively answered to the source user.
For another example, fig. 4 is a schematic diagram of another spanning tree in another embodiment of the present invention, before comparing the overhead values of the resource attributions, it may be detected whether the overhead value of a service factor is greater than or equal to a preset threshold, R1 and R3 may be removed, and then the resource of R2 is cached as the optimal resource.
In another embodiment of the present invention, log information of each area network may also be obtained, and the overhead value of the service factor of each area network may be updated according to the log information of each area network. Therefore, new user requirements and new resources in the whole network are updated, and the real-time performance and accuracy of various resources and data in the whole network are guaranteed.
Fig. 5 is a schematic structural diagram of a system 200 for network resource scheduling according to an embodiment of the present invention, and as shown in fig. 5, the system 200 for network resource scheduling includes a resource detection node 201, a detection device 202, a computing platform 203, and a cache device 204.
The resource detection node 201 is disposed in each area network and configured to detect resource information of each area network.
The detecting device 202 is configured to perform service detection on each area network, and obtain a service factor of each area network.
The computing platform 203 is configured to receive the resource request, and set an overhead value for the service factor of each local area network according to the local area network to which the source user of the resource request belongs and the service factor of each local area network; and selecting one area network from the area networks by using a spanning tree algorithm according to the overhead value.
The caching device 204 is configured to cache the selected resources of the area network as optimal resources; and is further configured to respond the cached optimal resource to the source user when the same resource request is received again.
The embodiment of the present invention provides a system 200 for network resource scheduling, where a service detection node 201 in the embodiment of the present invention can detect resource information of each area network, a detection device 202 obtains a service factor, and a computing platform 203 sets an overhead value of the service factor of each area network according to the service factor and the area network to which a source user of a resource request belongs. And selecting the area network with the optimal resource in each area network by using a spanning tree algorithm according to the overhead value of the service factor, caching the optimal resource by using the caching device 204, and directly responding the cached optimal resource to the source user when the same resource request is received again. Compared with the prior art, the embodiment of the invention can collect the service factors of each regional network in the whole network and select the regional network with the optimal resource in each regional network, thereby realizing the mutual access and intercommunication of the resources of a plurality of regional networks in the whole network, uniformly scheduling all the resources in the whole network, avoiding the problems of resource access errors and the like and improving the utilization rate of the resources in the whole network.
It should be noted that the service factor includes a resource attribution, a page opening delay, a connection time and/or a download speed. Correspondingly, the computing platform 203 is specifically configured to: setting the cost value of the same resource attribution with the local network to which the source user belongs to be smaller than the cost value of the resource attribution which is different from the local network to which the source user belongs but has the same operator, and setting the cost value of the resource attribution which is different from the local network to which the source user belongs but has the same operator to be smaller than the cost value of the resource attribution which is different from the local network to which the source user belongs and has the different operator; and/or setting the cost value with low page opening delay to be smaller than the cost value with high page opening delay; and/or setting the overhead value with short connection time to be smaller than the overhead value with long connection time; and/or setting the overhead value with the fast downloading speed to be smaller than the overhead value with the slow downloading speed.
In another embodiment of the present invention, the computing platform 203 in the above embodiment is specifically configured to: acquiring the minimum overhead value of the service factors with the same priority of each area network according to the sequence of the priorities of the preset service factors from high to low by utilizing a spanning tree algorithm; and caching the resources of the regional network which are uniquely corresponding to the minimum overhead value as optimal resources.
The computing platform 203 is further configured to cull the area networks corresponding to the service factors with the overhead values greater than or equal to the preset threshold.
In another embodiment of the present invention, the resource probing node 201 in the foregoing embodiment is further configured to obtain log information of each area network. The computing platform 203 is further configured to update the cost value of the traffic factor for each area network according to the log information for each area network.
It should be clear that the embodiments in this specification are described in a progressive manner, and the same or similar parts in the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the device embodiments, the description is relatively simple, and for the relevant points, reference may be made to the relevant description of the method embodiments. The present invention is not limited to the specific steps and structures described above and shown in the drawings. Also, a detailed description of known process techniques is omitted herein for the sake of brevity.
The resource probing node 201, the detecting means 202, the computing platform 203 and the cache means 204 shown in the above block diagrams may be implemented as hardware, software, firmware or a combination thereof. When implemented in hardware, it may be, for example, an electronic circuit, an Application Specific Integrated Circuit (ASIC), suitable firmware, plug-in, function card, or the like. When implemented in software, the elements of the invention are the programs or code segments used to perform the required tasks. The program or code segments may be stored in a machine-readable medium or transmitted by a data signal carried in a carrier wave over a transmission medium or a communication link. A "machine-readable medium" may include any medium that can store or transfer information.
Claims (10)
1. A method for network resource scheduling, comprising:
respectively setting resource detection nodes in each area network, and carrying out service detection on each area network by using the resource information of each area network obtained by the detection of the resource detection nodes to obtain service factors of each area network;
receiving a resource request, and setting a cost value for the service factor of each area network according to the area network to which a source user of the resource request belongs and the service factor of each area network;
selecting one area network from each area network by using a spanning tree algorithm according to the overhead value, and caching the resources of the selected area network as optimal resources;
when the same resource request is received again, the cached optimal resource is responded to the source user;
selecting one area network from each area network by using a spanning tree algorithm according to the overhead value, and caching the resources of the selected area network as optimal resources, wherein the caching comprises the following steps:
acquiring the minimum overhead value of the service factors with the same priority of each area network according to the preset priority of the service factors from high to low by using a spanning tree algorithm;
and caching the resources of the regional network which are uniquely corresponding to the minimum overhead value as optimal resources.
2. The method of claim 1, wherein the traffic factor comprises a resource attribution, a page open latency, a connection time, and/or a download speed.
3. The method according to claim 2, wherein the setting an overhead value for the service factor of each local area network according to the local area network to which the source user of the resource request belongs and the service factor of each local area network comprises:
setting the cost value of the same resource attribution of the local network to which the source user belongs to be smaller than the cost value of the resource attribution which is different from the local network to which the source user belongs but has the same operator, and setting the cost value of the resource attribution which is different from the local network to which the source user belongs but has the same operator to be smaller than the cost value of the resource attribution which is different from the local network to which the source user belongs and has the different operator; and/or
Setting the cost value with low page opening time delay to be smaller than the cost value with high page opening time delay; and/or
Setting the overhead value with short connection time to be smaller than the overhead value with long connection time; and/or
And setting the overhead value with the fast downloading speed to be smaller than the overhead value with the slow downloading speed.
4. The method of claim 1, further comprising:
and eliminating the area network corresponding to the service factor with the overhead value larger than or equal to the preset threshold value.
5. The method of claim 1, further comprising:
acquiring log information of each area network;
and updating the overhead value of the service factor of each area network according to the log information of each area network.
6. A system for network resource scheduling, comprising:
the resource detection node is arranged in each regional network and is configured to detect resource information of each regional network;
the detection device is configured to perform service detection on each area network to obtain a service factor of each area network;
the computing platform is configured to receive a resource request, and set an overhead value for the service factor of each local area network according to the local area network to which a source user of the resource request belongs and the service factor of each local area network; the system is further configured to select one area network from the area networks by using a spanning tree algorithm according to the overhead value;
the caching device is configured to cache the selected resources of the regional network as optimal resources; further configured to respond the cached optimal resource to the source user when the same resource request is received again;
the computing platform is specifically configured to:
acquiring the minimum overhead value of the service factors with the same priority of each area network according to the preset priority of the service factors from high to low by using a spanning tree algorithm;
and caching the resources of the regional network which are uniquely corresponding to the minimum overhead value as optimal resources.
7. The system of claim 6, wherein the traffic factor comprises a resource attribution, a page open latency, a connection time, and/or a download speed.
8. The system of claim 7, wherein the computing platform is specifically configured to:
setting the cost value of the same resource attribution of the local network to which the source user belongs to be smaller than the cost value of the resource attribution which is different from the local network to which the source user belongs but has the same operator, and setting the cost value of the resource attribution which is different from the local network to which the source user belongs but has the same operator to be smaller than the cost value of the resource attribution which is different from the local network to which the source user belongs and has the different operator; and/or
Setting the cost value with low page opening time delay to be smaller than the cost value with high page opening time delay; and/or
Setting the overhead value with short connection time to be smaller than the overhead value with long connection time; and/or
And setting the overhead value with the fast downloading speed to be smaller than the overhead value with the slow downloading speed.
9. The system of claim 6, wherein the computing platform is further configured to cull area networks corresponding to traffic factors having cost values greater than or equal to a preset threshold.
10. The system of claim 6, wherein the resource probing node is further configured to obtain log information for each area network;
the computing platform is further configured to update the overhead value of the business factor of each area network according to the log information of each area network.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710038241.9A CN108337191B (en) | 2017-01-19 | 2017-01-19 | Method and system for scheduling network resources |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710038241.9A CN108337191B (en) | 2017-01-19 | 2017-01-19 | Method and system for scheduling network resources |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108337191A CN108337191A (en) | 2018-07-27 |
| CN108337191B true CN108337191B (en) | 2021-09-03 |
Family
ID=62922793
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710038241.9A Active CN108337191B (en) | 2017-01-19 | 2017-01-19 | Method and system for scheduling network resources |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108337191B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1091528A3 (en) * | 1999-09-28 | 2003-05-28 | AT&T Corp. | Systems and methods for mapping quality of service across communications systems |
| CN101631366A (en) * | 2009-08-14 | 2010-01-20 | 中兴通讯股份有限公司 | Cell switching method and a cell switching device |
| CN103188715A (en) * | 2011-12-28 | 2013-07-03 | 中国移动通信集团广东有限公司 | Automatic monitoring and scheduling method and device for radio resources |
| CN104754640A (en) * | 2013-12-26 | 2015-07-01 | 中国移动通信集团公司 | Network resource scheduling method and network resource management server |
| CN105744637A (en) * | 2016-04-01 | 2016-07-06 | 中国科学院信息工程研究所 | Broadcast scheduling method for industrial wireless Mesh network |
| CN105916185A (en) * | 2016-03-30 | 2016-08-31 | 中国科学院信息工程研究所 | Uplink scheduling method based on double-tree routing and device |
-
2017
- 2017-01-19 CN CN201710038241.9A patent/CN108337191B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1091528A3 (en) * | 1999-09-28 | 2003-05-28 | AT&T Corp. | Systems and methods for mapping quality of service across communications systems |
| CN101631366A (en) * | 2009-08-14 | 2010-01-20 | 中兴通讯股份有限公司 | Cell switching method and a cell switching device |
| CN103188715A (en) * | 2011-12-28 | 2013-07-03 | 中国移动通信集团广东有限公司 | Automatic monitoring and scheduling method and device for radio resources |
| CN104754640A (en) * | 2013-12-26 | 2015-07-01 | 中国移动通信集团公司 | Network resource scheduling method and network resource management server |
| CN105916185A (en) * | 2016-03-30 | 2016-08-31 | 中国科学院信息工程研究所 | Uplink scheduling method based on double-tree routing and device |
| CN105744637A (en) * | 2016-04-01 | 2016-07-06 | 中国科学院信息工程研究所 | Broadcast scheduling method for industrial wireless Mesh network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108337191A (en) | 2018-07-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11632420B2 (en) | Point of presence management in request routing | |
| US10931738B2 (en) | Point of presence management in request routing | |
| CN107528862B (en) | Domain name resolution method and device | |
| US20190044787A1 (en) | Point of presence management in request routing | |
| US9998533B2 (en) | P2P content caching system and method | |
| CN107360184B (en) | Terminal equipment authentication method and device | |
| KR20050030542A (en) | Systems and methods for client-based web crawling | |
| US20220200957A1 (en) | Managing Application Access Controls And Routing In Cloud Computing Platforms | |
| CN109150741B (en) | Message sending method and device, electronic equipment and storage medium | |
| CN106130791B (en) | Cache equipment service capability traversal test system and method based on service quality | |
| CN112261172A (en) | Service addressing access method, device, system, equipment and medium | |
| CN113452808A (en) | Domain name resolution method, device, equipment and storage medium | |
| CN111600929B (en) | Transmission line detection method, routing strategy generation method and proxy server | |
| CN108337191B (en) | Method and system for scheduling network resources | |
| US10666604B2 (en) | Application access method and application access system via a split domain name system | |
| CN106254576B (en) | Message forwarding method and device | |
| US20220200892A1 (en) | Estimation Of Latency Across Regional Clouds | |
| US20220201673A1 (en) | Dynamic Expansion And Contraction Of Edge Clusters For Managing Access To Cloud-Based Applications | |
| CN113596105B (en) | Content acquisition method, edge node and computer readable storage medium | |
| CN114520784A (en) | Dynamic content accelerated access method and device | |
| CN115996188A (en) | Service scheduling method, device, equipment and computer readable storage medium | |
| CN114363287B (en) | Domain name recursive query method and device, recursive server and DNS system | |
| US10574526B2 (en) | Control method for application feature rules and application feature server | |
| CN108574714B (en) | Internet resource acquisition method and device and internet cache system | |
| CN111385248B (en) | Attack defense method and attack defense device |
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 |