CN108712335A - Dispatching method, system, equipment and the storage medium that network accesses - Google Patents
Dispatching method, system, equipment and the storage medium that network accesses Download PDFInfo
- Publication number
- CN108712335A CN108712335A CN201810460761.3A CN201810460761A CN108712335A CN 108712335 A CN108712335 A CN 108712335A CN 201810460761 A CN201810460761 A CN 201810460761A CN 108712335 A CN108712335 A CN 108712335A
- Authority
- CN
- China
- Prior art keywords
- node
- path
- access
- network
- target access
- 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.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/123—Evaluation of link metrics
Abstract
The invention discloses dispatching method, system, equipment and storage mediums that a kind of network accesses.Present node of the present invention determines target access node by receiving access request according to access request；Based on the content distributing network where present node, determine from present node to several access path target access node；Using ant group algorithm, access request is sent to target access node by accessed path apart from shortest target access path, and by target access path from several access path, to realize the scheduling to access request.Accessed path is gone to improve the web experience of user apart from the scheduling of shortest access path progress user's access so as to realize the quick response to user access request from content distributing network where present node by then passing through ant group algorithm.
Description
Technical field
A kind of accessed the present invention relates to network communication technology field more particularly to network dispatching method, system, equipment and
Storage medium.
Background technology
Current network scheduling system is less in network node, is generally used in the relatively simple network scenarios of network path
Shortest path first looks for scheduling path, and then realizes the response to user access request, but with the increasing of number of network node
More and network load condition real-time change, it is larger in network node, it is used in the more complicated network of network path
Static shortest path first can not reach ideal dispatching effect, and then the decline for causing user network to be experienced.Therefore, such as
The access request what fast and effeciently sends user is scheduled, and is avoided access response overlong time, is one urgently to be resolved hurrily
The problem of.
The above is only used to facilitate the understanding of the technical scheme, and is not represented and is recognized that the above is existing skill
Art.
Invention content
The main purpose of the present invention is to provide a kind of network access dispatching method, system, equipment and storage medium,
Aim to solve the problem that the dispatching effect in the prior art to user access request is bad, response time long technical problem.
To achieve the above object, the present invention provides the dispatching method that a kind of network accesses, the method includes following steps
Suddenly:
Present node receives access request, and target access node is determined according to the access request；
Based on the content distributing network where the present node, determine from the present node to the target access section
Several access path between point；
Using ant group algorithm, accessed path and passes through institute apart from shortest target access path from several access path
It states target access path and the access request is sent to the target access node.
Preferably, the present node receives access request, and the step of target access node is determined according to the access request
After rapid, the method further includes：
The present node obtains corresponding network address information, works as prosthomere according to described in network address information determination
Content distributing network belonging to point.
Preferably, the content distributing network based on where the present node is determined from the present node to institute
Several access path between target access node are stated, including：
Obtain the corresponding node identification of the target access node；
Node location information corresponding with the node identification is searched in mapping relations, being stored in the mapping relations has
Correspondence between node identification and node location；
Based on the content distributing network where the present node, determined from described current according to the node location information
Node is to several access path between the target access node.
Preferably, it is described using ant group algorithm from several access path accessed path apart from shortest target access road
Diameter, including：
Obtain the corresponding current network load of each access path in several access path；
Based on ant group algorithm, calculates separately in several access path and be moved to the target access from the present node
The transition probability of node and the iterative calculation for executing preset times obtain result of calculation；
According to the result of calculation, using the highest access path of transition probability as target access path.
Preferably, described to be based on ant group algorithm, it calculates separately and is moved to from the present node in several access path
The transition probability of the target access node and the iterative calculation for executing preset times obtain result of calculation, including：
The distance between present node and the target access node parameter described in several access path are obtained respectively；
According to the distance parameter, is calculated separately in several access path by following formula based on ant group algorithm and worked as from described
Front nodal point is moved to the transition probability of the target access node, and the iterative calculation for executing preset times obtains result of calculation,
Wherein,For the transition probability of target access node j, τ are transferred to by present node i in t moment antij(t)
For the information content on t moment present node i to target access node j, allowedkAllow the node of selection in next step for ant,
α is information heuristic greedy method, and β is expected heuristic value, ηij(t) it is the inverse of distance parameter described in t moment.
Preferably, described to obtain respectively between present node and the target access node described in several access path
Distance parameter, including：
The actual range between present node and the target access node described in several access path is obtained respectively
It is consumed with when being connected to；
According to consumption when the actual range, connection and current network load, determine current described in every access path
The distance between node and the target access node parameter.
Preferably, described according to consumption when the actual range, connection and current network load, determine every access path
Described in the distance between present node and the target access node parameter, including：
According to consumption when the actual range, connection and current network load, several access path are determined by following formula
In the distance between present node and the target access node parameter described in every access path,
L'=dij+a*T
Wherein, L'For distance parameter, dijFor actual range, a is current network load, and T is the inverse consumed when connection.
In addition, to achieve the above object, the present invention also proposes a kind of scheduling system that network accesses, the system comprises：
Ask respond module, path searching module and request scheduling module；
The ask respond module determines present node and target for receiving access request according to the access request
Accessed node；
The path searching module, for based on the content distributing network where the present node, determination to be worked as from described
Front nodal point is to several access path between the target access node；
The request scheduling module, for using ant group algorithm from several access path accessed path apart from shortest
Target access path, and the access request is sent to by the target access node by the target access path.
In addition, to achieve the above object, the present invention also proposes that a kind of controlling equipment that network accesses, the equipment include：
Memory, processor and the scheduler program for being stored in the network access that can be run on the memory and on the processor,
The scheduler program that the network accesses is arranged for carrying out the step of dispatching method that network as described above accesses.
In addition, to achieve the above object, the present invention also proposes a kind of storage medium, and network is stored on the storage medium
The scheduler program of access, the scheduler program that the network accesses realize what network as described above accessed when being executed by processor
The step of dispatching method.
Present node of the present invention determines target access node by receiving access request according to access request；Based on current
Content distributing network where node is determined from present node to several access path target access node；Using
Ant group algorithm accessed path from several access path is incited somebody to action apart from shortest target access path, and by target access path
Access request is sent to target access node, goes to search from content distributing network where present node by then passing through ant group algorithm
The scheduling that the shortest path of path distance carries out user's access carries so as to realize to the quick response of user access request
The web experience of high user.
Description of the drawings
Fig. 1 is the structural representation for the controlling equipment that the network for the hardware running environment that the embodiment of the present invention is related to accesses
Figure；
Fig. 2 is the flow diagram for the dispatching method first embodiment that inventive network accesses；
Fig. 3 is the flow diagram for the dispatching method second embodiment that inventive network accesses；
Fig. 4 is the flow diagram for the dispatching method 3rd embodiment that inventive network accesses；
Fig. 5 is the structure diagram for the scheduling system first embodiment that inventive network accesses.
The embodiments will be further described with reference to the accompanying drawings for the realization, the function and the advantages of the object of the present invention.
Specific implementation mode
It should be appreciated that described herein, specific examples are only used to explain the present invention, is not intended to limit the present invention.
Referring to Fig.1, Fig. 1 is the controlling equipment knot of the network access for the hardware running environment that the embodiment of the present invention is related to
Structure schematic diagram.
As shown in Figure 1, the controlling equipment that the network accesses may include processor 1001, such as central processing unit
(Central Processing Unit, CPU), communication bus 1002, user interface 1003, network interface 1004, memory
1005.Wherein, communication bus 1002 is for realizing the connection communication between these components.User interface 1003 may include display
Shield (Display), input unit such as keyboard (Keyboard), optional user interface 1003 can also connect including the wired of standard
Mouth, wireless interface.Network interface 1004 may include optionally standard wireline interface and wireless interface (such as Wireless Fidelity
(WIreless-FIdelity, WI-FI) interface).Memory 1005 can be the random access memory (Random of high speed
Access Memory, RAM) memory, can also be stable nonvolatile memory (Non-Volatile Memory,
), such as magnetic disk storage NVM.Memory 1005 optionally can also be the storage device independently of aforementioned processor 1001.
It will be understood by those skilled in the art that structure shown in Fig. 1 does not constitute the controlling equipment accessed network
It limits, may include either combining certain components or different components arrangement than illustrating more or fewer components.
As shown in Figure 1, as may include operating system, data storage mould in a kind of memory 1005 of storage medium
The scheduler program that block, network communication module, Subscriber Interface Module SIM and network access.
In the controlling equipment that network shown in Fig. 1 accesses, network interface 1004 is mainly used for carrying out with network server
Data communicate；User interface 1003 is mainly used for carrying out data interaction with user；In the controlling equipment that inventive network accesses
Processor 1001, memory 1005 can be arranged in the controlling equipment that network accesses, and the controlling equipment that the network accesses is logical
The scheduler program that processor 1001 calls the network stored in memory 1005 to access is crossed, and is executed provided in an embodiment of the present invention
The dispatching method that network accesses.
An embodiment of the present invention provides the dispatching methods that a kind of network accesses, and are accessed for inventive network with reference to Fig. 2, Fig. 2
Dispatching method first embodiment flow diagram.
In the present embodiment, it the described method comprises the following steps：
Step S10：Present node receives access request, and target access node is determined according to the access request；
Possess certainly it should be noted that present node described in the present embodiment or the target access node can be one
Own only network address, the equipment being connected with the network with independent address and with transmission or reception data function, such as：
PC, work station, printer or server etc..
It is understood that the present node and target access node in the present embodiment may belong to the same content
Distribution network further includes certainly several other nodes in the content distributing network, and the present node can in the present embodiment
To be the controlling equipment of above-mentioned network access.
In the concrete realization, present node receives the access request that user sends, and is parsed to the access request, root
The corresponding request content of the request and corresponding target access node are determined according to analysis result.
Step S20：Based on the content distributing network where the present node, determine from the present node to the mesh
Mark several access path between accessed node；
It should be understood that the content distributing network (Content Delivery Network, CDN) is by network
One on the existing Internet basic layer intelligent virtual network that node (server) is constituted is placed everywhere.In this implementation
It can be by the address information of itself such as Internet protocol (Internet as the present node for possessing only network address in example
Protocol Address, IP) address accurately determines the content distributing network belonging to it.
It will be appreciated that in the content distributing network for possessing numerous nodes, visited from the present node to the target
Ask that there may be the paths that several can carry out information exchange between node, in order to realize the quick response to access request,
In the present embodiment, the present node can be determined based on the content distributing network at place from the present node to the target
Then several ways diameter between accessed node is searched from these paths apart from shortest path, i.e., the described target access road
Diameter.
In this step, the lookup in the target access path can be realized by ant group algorithm, it also can be by other
Seek the algorithm of shortest path to realize, but in view of the node size in content distributing network is huge, path is complex, this
Embodiment preferably realizes the acquisition to the target access path using ant group algorithm.
Step S30：Using ant group algorithm from several access path accessed path apart from shortest target access path,
And the access request is sent to by the target access node by the target access path.
It should be understood that ant group algorithm is a kind of probabilistic type algorithm being used for finding path optimizing, principle is substantially：One
Establish rules mould ant colony during looking for food, ant can on path release pheromone, encounter the crossing that do not pass by also, just choose at random
Xuan Yitiao is walked on road, and discharges pheromones related with path length simultaneously, and pheromone concentration is inversely proportional with path length, later
When ant meets the crossing again, just select the higher path of pheromone concentration, the pheromones to move in circles on optimal path dense
Spend increasing, final ant colony can find optimal path of looking for food.Ant group algorithm is attached to network and accessed by the present embodiment
Come to seek most short access path in the optimization in path.
In this step, the present node is finding out the shortest target access of path distance by ant group algorithm
Behind path, the access request can be sent to target access node according to the corresponding each node in the target access path.
Present node receives access request in the present embodiment, and target access node is determined according to access request；Based on current
Content distributing network where node is determined from present node to several access path target access node；Using
Ant group algorithm accessed path from several access path is incited somebody to action apart from shortest target access path, and by target access path
Access request is sent to target access node, and the content distributing network where being then based on present node goes to look by ant group algorithm
The shortest path of path distance is looked for carry out the scheduling of user's access, so as to realize the quick response to user access request,
Improve the web experience of user.
With reference to figure 3, Fig. 3 is the flow diagram for the dispatching method second embodiment that inventive network accesses.
The tool of step S20 described in the dispatching method accessed based on above-mentioned first embodiment, the network that the present embodiment proposes
Body realization method can be：Based on the content distributing network where the present node, determine from the present node to described
Several ways diameter between target access node；Using ant group algorithm from several ways diameter accessed path apart from shortest target
Access path.Wherein, the acquisition modes of present node to the several ways diameter between target access node can be as follows：
Step S201：Obtain the corresponding node identification of the target access node；
It should be noted that the node identification can be the identification information that can be used for distinguishing each node, mark letter
Breath can be the corresponding sequence number of node, identification code etc..It, can be in advance by content point in order to ensure the quick obtaining to node identification
The corresponding node identification of all nodes is stored in the corresponding memory space of each node in hairnet network.
In the concrete realization, present node searches the corresponding node mark of the target access node from local storage space
Know.
Step S202：Node location information corresponding with the node identification is searched in mapping relations, the mapping is closed
Storage has the correspondence between node identification and node location in system；
It should be noted that the mapping relations can be reflecting between each node identification pre-established and node location
It penetrates, the node location information can be the corresponding IP address of each node, physics (Medium Access Control, Mac)
Location or other etc. can show that the information of node present position in content distributing network.
In this step, in order to when knowing the corresponding node identification of target access node, realize to node location information
Quick obtaining, the present node can search node corresponding with node identification position in the mapping relations pre-established
Confidence ceases.
Step S203：Based on the content distributing network where the present node, determined according to the node location information
From the present node to several access path the target access node.
After getting the corresponding node location information of the target access node, the present node can be according to its institute
Content distributing network determine several paths that the target access node can be reached from the present node.
Present node is by obtaining the corresponding node identification of target access node in the present embodiment；It is searched in mapping relations
Node location information corresponding with node identification；Based on the content distributing network where present node, according to node location information
It determines from present node to the several ways diameter target access node, can realize quickly obtaining to different access path
It takes, further improves dispatching efficiency.
With reference to figure 4, Fig. 4 is the flow diagram for the dispatching method 3rd embodiment that inventive network accesses.
Based on the various embodiments described above, in a kind of dispatching method for network access that the present embodiment proposes, the target access
The acquisition modes in path can with through the following steps that：
Step S204：Obtain the corresponding current network load of each access path in several access path；
It should be understood that can have an overall scheduling server, i.e. core section in content distributing network under normal conditions
Point.The current network load can be the load number carried in current time each access path, and the load number is to become in real time
Change.
In the concrete realization, the present node can obtain respectively from the corresponding core node of place content distributing network
The relevant information of the corresponding current network load of access path, so that it is determined that the corresponding current network load of each access path.
Step S205：Based on ant group algorithm, calculates separately in several access path and be moved to institute from the present node
It states the transition probability of target access node and executes the iterative calculation of preset times, obtain result of calculation；
In the concrete realization, the present node can obtain respectively present node described in several access path with it is described
The distance between target access node parameter；Then it according to the distance parameter, is calculated separately by following formula based on ant group algorithm
The transition probability of the target access node is moved in several access path from the present node, and executes preset times
Iterative calculation obtain result of calculation,
Wherein,For the transition probability of target access node j, τ are transferred to by present node i in t moment ant kij
(t) it is the information content on t moment present node i to target access node j, allowedkAllow selection in next step for ant k
Node, α are information heuristic greedy method, and β is expected heuristic value, ηij(t) it is the inverse of distance parameter described in t moment.
It should be noted that the scale of problem to be optimized in the present embodiment, i.e. ant number are m；Each road of initial time
Information content on diameter is equal, and ant k (k=1,2,3 ..., m) during the motion, is determined according to the information content on each paths
Its moving direction.Under normal circumstances, every ant in ant group algorithm has following characteristics：Mobile every time, every ant is at it
Pheromones are all left on the branch (i, j) of process.The distance between probability and the city in ant selection city and currently connecting is propped up
The pheromones surplus that road is included is related.So that force ant to carry out legal movement, after the completion of once moving, just permit
Perhaps the city that ant migration had accessed (this can be controlled by taboo list)；Such as：With taboo list tabuk(j=1,2,
3 ... ..., n) record the city that ant k currently passes by, gather with tabukEvolutionary process is made dynamic and is adjusted.In search process
In, ant calculates transition probability according to the heuristic information of information content and path on each paths.
Further, in order to ensure that the target access path finally obtained is optimal, the present embodiment can be according to practical feelings
Condition carries out the iteration of ant group algorithm, until iterations reach preset iterations, it is complete then to obtain last time iteration
At when each path corresponding transition probability, finally the transition probability got is selected by roulette mechanism again, and will
Path corresponding to the transition probability of final checked is as the target access path.Wherein, the roulette wheel selection is also known as
Propertional model, concrete principle do not repeat herein.Certainly, the selection mode of target access path described in the present embodiment
The size according to transition probability be can also be to carry out, that is, choose the maximum path of transition probability as target access path.
It will be appreciated that the network congestion situation of content distributing network is the scene of a real-time change.It is final in order to make
The target access path of acquisition is the optimal path under Current Content distribution network, the present embodiment consider real-time network load because
Usually realize the acquisition to target access path.
Specifically, in the present embodiment, the acquisition modes of the distance parameter can be：Several access roads are obtained respectively
Actual range between present node described in diameter and the target access node and while being connected to, are consumed；Then according to the reality away from
From, connection when consumption and current network load, determine present node described in every access path and the target access node
The distance between parameter.Wherein, the actual range is the present node and the target access node actual geographic position
The distance between, average Ping of the consumption for the present node and the target access node between logical durations when the connection.
Specifically corresponding distance parameter can be according to formula L&apos in each path;=dij+ a*T is calculated, wherein L'For distance parameter, dijFor reality
Border distance, a are current network load, and T is the inverse consumed when connection, i.e. T=1/ (consumes) when connection.
The present embodiment and the various embodiments described above are illustrated with reference to specific example.
Such as：In the content distribution network where present node i, there are two from present node i to target access node j
Path, respectively：I-1-j and i-2-j, is computed, and it is 90% that ant k, which selects the probability of path i-1-j, selects path i-2-j
Probability be 10%, then roulette mechanism just can be used to select ant currently to want the path of walking, i.e. target in we at this time
Access path；The path i-1-j that transition probability is 90% can certainly directly be chosen as the target access path.
Certainly, in actual conditions, in order to avoid residual risk element excessively causes residual risk element to flood heuristic information, every
Ant completes after the wheel from present node i to target access node j accesses, to need to be updated processing to residual risk.
Specifically, the t+n moment, the information content on path (i, j) can be adjusted according to following rule：
τij(t+n)=(1- ρ) τij(t)+Δτij(t)
Wherein, ρ indicates information volatility coefficient；1- ρ indicate pheromones residual coefficients；Δτij(t) this cycle Road is indicated
Information content element increment on diameter (i, j).
Step S206：According to the result of calculation, using the highest access path of transition probability as target access path.
In the concrete realization, after calculating the corresponding transition probability in each path, can choose will shift the present node
The highest path of probability is as target access path.
Ant group algorithm by being combined with content distributing network, considering real-time network loading factors and dividing by the present embodiment
The transition probability for being moved to target access node in several network scheduling paths from present node is not calculated, is then executed default
The iterative calculation of number is selected the highest path of transition probability as final target access path further according to result of calculation, is had
Effect avoids local network congestion and the low phenomenon of other localized network bandwidth usages, improves the utilization rate of whole network, keeps away
Exempt from bandwidth resources waste.
In addition, the embodiment of the present invention also proposes a kind of computer readable storage medium, the computer readable storage medium
On be stored with the scheduler program of network access, realized when the scheduler program that the network accesses is executed by processor as described above
Network access dispatching method the step of.
It is the structure diagram for the scheduling system first embodiment that inventive network accesses with reference to Fig. 5, Fig. 5.
As shown in figure 5, the embodiment of the present invention also proposes that a kind of scheduling system that network accesses includes：Ask respond module
501, path searching module 502 and request scheduling module 503；
The ask respond module 501 determines present node and mesh for receiving access request according to the access request
Mark accessed node；
Possess certainly it should be noted that present node described in the present embodiment or the target access node can be one
Own only network address, the equipment being connected with the network with independent address and with transmission or reception data function, such as：
PC, work station, printer or server etc..
It is understood that the present node and target access node in the present embodiment may belong to the same content
Distribution network further includes certainly several other nodes in the content distributing network, and the present node can in the present embodiment
To be the scheduling system of the network access itself, that is to say, that any node in content distributing network is receiving use
When the access request of family, can all itself be set to the present node, become the scheduling system of network access.
In the concrete realization, the ask respond module 501 receives the access request that user sends, using itself as current
Node, and access request is parsed, the corresponding request content of the request and corresponding target are determined according to analysis result
Accessed node.
The path searching module 502, for based on the content distributing network where the present node, determining from described
Present node is to several access path between the target access node；
It will be appreciated that in the content distributing network for possessing numerous nodes, visited from the present node to the target
Ask that there may be the paths that several can carry out information exchange between node, in order to realize the quick response to access request,
In the present embodiment, the path searching module 502 can be determined based on the content distributing network at place from the present node to institute
The several ways diameter between target access node is stated, is then searched apart from shortest path, i.e., the described target from these paths
Access path.
The request scheduling module 503, for using ant group algorithm from several access path accessed path distance most
Short target access path, and the access request is sent to by the target access node by the target access path.
It should be noted that the path searching module 502 to the lookup in target access path can by ant group algorithm come
It realizes, can also be realized by other algorithms for seeking shortest path, but in view of the node size in content distributing network is huge
Greatly, path is complex, and the present embodiment preferably realizes the acquisition to the target access path using ant group algorithm.
In the concrete realization, the request scheduling module 503 is finding out the shortest institute of path distance using ant group algorithm
After stating target access path, the access request can be sent to target according to the corresponding each node in the target access path
Accessed node.
The scheduling system that network accesses in the present embodiment receives access request, and target access section is determined according to access request
Point；Based on the content distributing network where present node, determine from present node to several visits target access node
It asks the way diameter；Using ant group algorithm, accessed path and passes through mesh apart from shortest target access path from several access path
Access request is sent to target access node by mark access path, and the content distributing network where being then based on present node passes through
Ant group algorithm goes accessed path apart from the scheduling of shortest path progress user's access, so as to realize to user access request
Quick response, improve the web experience of user.
It is real that the other embodiment or specific implementation for the scheduling system that inventive network accesses can refer to above-mentioned each method
Example is applied, details are not described herein again.
It should be noted that herein, the terms "include", "comprise" or its any other variant are intended to non-row
His property includes, so that process, method, article or system including a series of elements include not only those elements, and
And further include other elements that are not explicitly listed, or further include for this process, method, article or system institute it is intrinsic
Element.In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that including this
There is also other identical elements in the process of element, method, article or system.
The embodiments of the present invention are for illustration only, can not represent the quality of embodiment.
Through the above description of the embodiments, those skilled in the art can be understood that above-described embodiment side
Method can add the mode of required general hardware platform to realize by software, naturally it is also possible to by hardware, but in many cases
The former is more preferably embodiment.Based on this understanding, technical scheme of the present invention substantially in other words does the prior art
Going out the part of contribution can be expressed in the form of software products, which is stored in a storage medium
In (such as read-only memory (Read Only Memory, ROM)/RAM, magnetic disc, CD), including some instructions are used so that one
Terminal device (can be mobile phone, computer, server, air conditioner or the network equipment etc.) executes each embodiment of the present invention
The method.
It these are only the preferred embodiment of the present invention, be not intended to limit the scope of the invention, it is every to utilize this hair
Equivalent structure or equivalent flow shift made by bright specification and accompanying drawing content is applied directly or indirectly in other relevant skills
Art field, is included within the scope of the present invention.
Claims (10)
1. the dispatching method that a kind of network accesses, which is characterized in that the method includes：
Present node receives access request, and target access node is determined according to the access request；
Based on the content distributing network where the present node, it is determined from the present node to the target access node
Between several access path；
Using ant group algorithm, accessed path and passes through the mesh apart from shortest target access path from several access path
The access request is sent to the target access node by mark access path.
2. the method as described in claim 1, which is characterized in that the present node receives access request, according to the access
After request determines the step of target access node, the method further includes：
The present node obtains corresponding network address information, and the present node institute is determined according to the network address information
The content distributing network of category.
3. method as claimed in claim 2, which is characterized in that the content delivery network based on where the present node
Network, it is determining from the present node to several access path the target access node, including：
Obtain the corresponding node identification of the target access node；
Node location information corresponding with the node identification is searched in mapping relations, being stored in the mapping relations has node
Correspondence between mark and node location；
Based on the content distributing network where the present node, determined from the present node according to the node location information
To several access path between the target access node.
4. method as claimed in claim 3, which is characterized in that described to be searched from several access path using ant group algorithm
The shortest target access path of path distance, including：
Obtain the corresponding current network load of each access path in several access path；
Based on ant group algorithm, calculates separately in several access path and be moved to the target access node from the present node
Transition probability and execute the iterative calculation of preset times, obtain result of calculation；
According to the result of calculation, using the highest access path of transition probability as target access path.
5. method as claimed in claim 4, which is characterized in that it is described to be based on ant group algorithm, calculate separately several access roads
The transition probability of the target access node is moved to from the present node in diameter and executes the iterative calculation of preset times, obtain
Result of calculation is taken, including：
The distance between present node and the target access node parameter described in several access path are obtained respectively；
According to the distance parameter, is calculated separately in several access path by following formula based on ant group algorithm and work as prosthomere from described
Point is moved to the transition probability of the target access node, and the iterative calculation for executing preset times obtains result of calculation,
Wherein,For the transition probability of target access node j, τ are transferred to by present node i in t moment antij(t) it is t
Information content on moment present node i to target access node j, allowedkThe node of selection, α is allowed to be in next step for ant
Information heuristic greedy method, β are expected heuristic value, ηij(t) it is the inverse of distance parameter described in t moment.
6. method as claimed in claim 5, which is characterized in that described obtain respectively works as prosthomere described in several access path
The distance between point and the target access node parameter, including：
The actual range between present node and the target access node described in several access path and company are obtained respectively
It is consumed when logical；
According to consumption when the actual range, connection and current network load, present node described in every access path is determined
The distance between target access node parameter.
7. method as claimed in claim 6, which is characterized in that described according to consumption when the actual range, connection and current
Network load determines the distance between present node described in every access path and the target access node parameter, including：
According to consumption when the actual range, connection and current network load, determined by following formula every in several access path
The distance between present node and the target access node parameter described in access path,
L'=dij+a*T
Wherein, L'For distance parameter, dijFor actual range, a is current network load, and T is the inverse consumed when connection.
8. the scheduling system that a kind of network accesses, which is characterized in that the system comprises：Ask respond module, path searching mould
Block and request scheduling module；
The ask respond module determines present node and target access for receiving access request according to the access request
Node；
The path searching module, for based on the content distributing network where the present node, determining from described and working as prosthomere
Point arrives several access path between the target access node；
The request scheduling module, for using ant group algorithm from several access path accessed path apart from shortest target
Access path, and the access request is sent to by the target access node by the target access path.
9. the controlling equipment that a kind of network accesses, which is characterized in that the equipment includes：Memory, processor and it is stored in institute
The scheduler program that the network that stating can run on memory and on the processor accesses, the scheduler program that the network accesses are matched
It is set to the step of realizing the dispatching method that the network as described in any one of claim 1 to 7 accesses.
10. a kind of storage medium, which is characterized in that be stored with the scheduler program of network access, the net on the storage medium
The scheduler program that network accesses realizes the dispatching party that network as described in any one of claim 1 to 7 accesses when being executed by processor
The step of method.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810460761.3A CN108712335A (en) | 2018-05-14 | 2018-05-14 | Dispatching method, system, equipment and the storage medium that network accesses |
| PCT/CN2018/094722 WO2019218439A1 (en) | 2018-05-14 | 2018-07-06 | Network access scheduling method, system, device, and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810460761.3A CN108712335A (en) | 2018-05-14 | 2018-05-14 | Dispatching method, system, equipment and the storage medium that network accesses |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108712335A true CN108712335A (en) | 2018-10-26 |
Family
ID=63867924
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810460761.3A Pending CN108712335A (en) | 2018-05-14 | 2018-05-14 | Dispatching method, system, equipment and the storage medium that network accesses |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN108712335A (en) |
| WO (1) | WO2019218439A1 (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109995653A (en) * | 2019-04-15 | 2019-07-09 | 深圳市迅雷网络技术有限公司 | Data transmission method, device, system and the readable storage medium storing program for executing of cross-node |
| CN110515564A (en) * | 2019-08-30 | 2019-11-29 | 苏州浪潮智能科技有限公司 | A kind of determination method and apparatus in the path input/output I/O |
| CN111385208A (en) * | 2018-12-29 | 2020-07-07 | 广州市百果园信息技术有限公司 | Routing method, routing device, computer equipment and storage medium |
| CN112866315A (en) * | 2019-11-27 | 2021-05-28 | 北京金山云网络技术有限公司 | Method and device for selecting back source node, electronic equipment and storage medium |
| CN113300962A (en) * | 2021-01-26 | 2021-08-24 | 阿里巴巴集团控股有限公司 | Path acquisition method, access method, device and equipment |
| CN114745391A (en) * | 2022-04-14 | 2022-07-12 | 上海蜜家文化传媒有限公司 | Method and system for global content distribution |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105847380A (en) * | 2016-04-18 | 2016-08-10 | 乐视控股（北京）有限公司 | UDP acceleration method and system in content distribution network |
| CN105933226A (en) * | 2016-04-20 | 2016-09-07 | 乐视控股（北京）有限公司 | Content distributing method and system |
| US20170163755A1 (en) * | 2001-10-18 | 2017-06-08 | Level 3 Communications, Llc | Content request routing and load balancing for content distribution networks |
| CN107493232A (en) * | 2016-06-12 | 2017-12-19 | 阿里巴巴集团控股有限公司 | A kind of access accelerating method and device of CDN |
| CN107888502A (en) * | 2017-11-24 | 2018-04-06 | 重庆邮电大学 | Immiscible box-like Ant Routing method in content center network |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2438741A4 (en) * | 2009-06-03 | 2014-06-04 | Ericsson Telefon Ab L M | Method and node for finding content in a content distribution network, and method for creating a virtual representation of a content distribution network |
| CN102521391B (en) * | 2011-12-22 | 2013-06-12 | 上海电机学院 | Traffic route search system and traffic route search method |
-
2018
- 2018-05-14 CN CN201810460761.3A patent/CN108712335A/en active Pending
- 2018-07-06 WO PCT/CN2018/094722 patent/WO2019218439A1/en active Application Filing
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170163755A1 (en) * | 2001-10-18 | 2017-06-08 | Level 3 Communications, Llc | Content request routing and load balancing for content distribution networks |
| CN105847380A (en) * | 2016-04-18 | 2016-08-10 | 乐视控股（北京）有限公司 | UDP acceleration method and system in content distribution network |
| CN105933226A (en) * | 2016-04-20 | 2016-09-07 | 乐视控股（北京）有限公司 | Content distributing method and system |
| CN107493232A (en) * | 2016-06-12 | 2017-12-19 | 阿里巴巴集团控股有限公司 | A kind of access accelerating method and device of CDN |
| CN107888502A (en) * | 2017-11-24 | 2018-04-06 | 重庆邮电大学 | Immiscible box-like Ant Routing method in content center network |
Non-Patent Citations (3)
| Title |
|---|
| GANG LIU，等: ""An Ant Colony Optimization Algorithm for Overlay Backbone Multicast Routing in Content Delivery Networks"", 《2012 IEEE 11TH INTERNATIONAL CONFERENCE ON TRUST, SECURITY AND PRIVACY IN COMPUTING AND COMMUNICATIONS》 * |
| 潘红广: ""内容中心网络路由与转发策略的研究"", 《中国优秀硕士学位论文全文数据库 信息科技辑 2018年第02期》 * |
| 郁磊，等: "《MATLAB智能算法30个案例分析（第2版）》", 31 August 2015 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111385208A (en) * | 2018-12-29 | 2020-07-07 | 广州市百果园信息技术有限公司 | Routing method, routing device, computer equipment and storage medium |
| CN109995653A (en) * | 2019-04-15 | 2019-07-09 | 深圳市迅雷网络技术有限公司 | Data transmission method, device, system and the readable storage medium storing program for executing of cross-node |
| CN109995653B (en) * | 2019-04-15 | 2021-07-09 | 深圳市迅雷网络技术有限公司 | Cross-node data transmission method, device and system and readable storage medium |
| CN110515564A (en) * | 2019-08-30 | 2019-11-29 | 苏州浪潮智能科技有限公司 | A kind of determination method and apparatus in the path input/output I/O |
| CN110515564B (en) * | 2019-08-30 | 2023-01-10 | 苏州浪潮智能科技有限公司 | Method and device for determining input/output (I/O) path |
| CN112866315A (en) * | 2019-11-27 | 2021-05-28 | 北京金山云网络技术有限公司 | Method and device for selecting back source node, electronic equipment and storage medium |
| CN112866315B (en) * | 2019-11-27 | 2023-06-06 | 北京金山云网络技术有限公司 | Method and device for selecting back source node, electronic equipment and storage medium |
| CN113300962A (en) * | 2021-01-26 | 2021-08-24 | 阿里巴巴集团控股有限公司 | Path acquisition method, access method, device and equipment |
| CN114745391A (en) * | 2022-04-14 | 2022-07-12 | 上海蜜家文化传媒有限公司 | Method and system for global content distribution |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2019218439A1 (en) | 2019-11-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108712335A (en) | Dispatching method, system, equipment and the storage medium that network accesses | |
| He et al. | Green resource allocation based on deep reinforcement learning in content-centric IoT | |
| Cheng et al. | Virtual network embedding through topology awareness and optimization | |
| US7537523B2 (en) | Dynamic player groups for interest management in multi-character virtual environments | |
| CN107690176B (en) | Network selection method based on Q learning algorithm | |
| CN110601973A (en) | Route planning method, system, server and storage medium | |
| CN105681153A (en) | Virtual network mapping method and device | |
| CN108712302A (en) | The computational methods and device of zone bandwidth, computer-readable medium | |
| Zhang et al. | New computing tasks offloading method for MEC based on prospect theory framework | |
| CN111176784B (en) | Virtual machine integration method based on extreme learning machine and ant colony system | |
| CN107566535B (en) | Self-adaptive load balancing method based on concurrent access timing sequence rule of Web map service | |
| Chen et al. | Joint caching and computing service placement for edge-enabled IoT based on deep reinforcement learning | |
| CN113887748B (en) | Online federal learning task allocation method and device, and federal learning method and system | |
| Chai et al. | A parallel placement approach for service function chain using deep reinforcement learning | |
| Wang et al. | Edge intelligence in motion: Mobility-aware dynamic DNN inference service migration with downtime in mobile edge computing | |
| Awad et al. | A swarm intelligence-based approach for dynamic data replication in a cloud environment | |
| CN113489787B (en) | Method and device for collaborative migration of mobile edge computing service and data | |
| CN113325875A (en) | Unmanned aerial vehicle path planning method for minimizing number of unmanned aerial vehicles | |
| Shefu et al. | Fruit fly optimization algorithm for network-aware web service composition in the cloud | |
| Zangiabady et al. | Self‐adaptive online virtual network migration in network virtualization environments | |
| CN113543160A (en) | 5G slice resource allocation method and device, computing equipment and computer storage medium | |
| CN114785692B (en) | Communication network flow balancing method and device for aggregation regulation of virtual power plants | |
| CN110392409B (en) | WMSNs multipath QoS routing method, system and storage medium based on distribution communication network | |
| Zheng et al. | A single-player Monte Carlo tree search method combined with node importance for virtual network embedding | |
| Hsu et al. | DiffServ‐based bandwidth‐constrained anycast routing in a mobile IPv6 network |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20181026 |