CN107493232A - A kind of access accelerating method and device of CDN - Google Patents
A kind of access accelerating method and device of CDN Download PDFInfo
- Publication number
- CN107493232A CN107493232A CN201610408230.0A CN201610408230A CN107493232A CN 107493232 A CN107493232 A CN 107493232A CN 201610408230 A CN201610408230 A CN 201610408230A CN 107493232 A CN107493232 A CN 107493232A
- Authority
- CN
- China
- Prior art keywords
- node
- distance
- cdn
- destined
- determined
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/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]
-
- 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/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
-
- 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/16—Multipoint routing
-
- 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/22—Alternate routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/45—Network directories; Name-to-address mapping
- H04L61/4505—Network directories; Name-to-address mapping using standardised directories; using standardised directory access protocols
- H04L61/4511—Network directories; Name-to-address mapping using standardised directories; using standardised directory access protocols using domain name system [DNS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
A kind of acceleration access method of CDN, including：CDN node determines the first distance and the second distance between this node and each destined node, wherein, second distance between the CDN node and the destined node is obtained according to the first distance between the CDN node and the destined node currently determined and N number of first distance determined before, the N is the integer more than or equal to 1, and the destined node includes source station and/or other CDN nodes；The CDN node is according to the second distance between this node and each destined node, or, according to the second distance between the second distance between this node and each destined node and other one or more CDN nodes and corresponding destined node, it is determined that accessing the optimal path of corresponding domain name；The CDN node, according to the optimal path of the determination, forwards the access request to the domain name when receiving the access request to the domain name.The above method can improve the speed for carrying out go back to source by CDN and accessing.
Description
Technical field
The present invention relates to content distribution network (CDN, Content Delivery Network) technical field,
A kind of more particularly to access accelerating method and device of CDN.
Background technology
Content distribution network (CDN, Content Delivery Network) is deployed in multiple data
The distributed network of one group of proxy server composition of the heart.CDN can be provided for terminal user it is quick,
The access experience of High Availabitity.
Current CDN acceleration strategies are accelerated primarily directed to cacheable static data, for example are schemed
Piece, video, CSS (CSS, Cascading Style Sheets) etc..The core that CDN accelerates
Heart principle is：The Edge Server (Edge Server) that data cached be able to will be stored in advance in CDN
On, user terminal can obtain these data nearby, the source station (Origin without using these data
Server) obtain.Wherein, Edge Server is nearly client in CDN, provides acceleration for source station
Proxy server.
However, because dynamic content caches in CDN without image of Buddha static content is the same, thus according to
The access that the same mode of static content handles dynamic content can influence access speed.User terminal access is moved
During state content, the access to dynamic content each time will Hui Yuan, i.e., from source station obtain access dynamic in
Hold.Wherein, it is that procotol (IP, Internet Protocol) layer route determines to return source link, but
It is due to various reasons, such as ISP (ISP, Internet Service Provider)
Between the factor such as routing policy is different, limitation between ISP, cause the source link that returns of decision-making to be not
Best link, so as to cause back source access speed slack-off.
The content of the invention
It is the general introduction of the theme to being described in detail herein below.It is to limit claim that this general introduction, which is not,
Protection domain.
The embodiment of the present application provides a kind of CDN access accelerating method and device, it is possible to increase passes through
CDN carries out back the speed of source access.
The embodiment of the present application provides a kind of CDN access accelerated method, including：
CDN node determines the first distance and the second distance between this node and each destined node, its
In, the second distance between the CDN node and the destined node is according to currently determining
Between CDN node and the destined node first distance and determine before it is N number of first distance
Arrive, the N is the integer more than or equal to 1, and the destined node includes source station and/or other CDN
Node；
The CDN node according to the second distance between this node and each destined node, or, root
According to the second distance between this node and each destined node and other one or more CDN nodes with
Second distance between corresponding destined node, it is determined that accessing the optimal path of corresponding domain name；
The CDN node is when receiving the access request to the domain name, according to the optimal of the determination
Path, forward the access request to the domain name.
Alternatively, the CDN node determines between this node and each destined node in the following manner
The first distance：
For each destined node, the CDN node, which obtains, accesses the detection that the destined node is set
The response time of address, determine the response time as first between this node and the destined node
Distance.
Alternatively, the CDN node determines between this node and each destined node in the following manner
Second distance：
For each destined node, the CDN node determines this node and the predetermined section according to following formula
Jitter compensation value Dev between pointnew：
Devnew={ (1- β) × Devold+β×(Dcur-Dold)/2,
Wherein, DevoldTrembling between the preceding CDN node once determined and the destined node
Dynamic offset, DoldFor second between the preceding CDN node once determined and the destined node
Distance, DcurFor the first distance between the CDN node currently determined and the destined node, β
Span be more than 0 and less than or equal to 1；
The first distance between the CDN node and the destined node currently determined is less than or waited
It is described during second distance between the preceding CDN node once determined and the destined node
CDN node determines current second distance D between this node and the destined node according to following formulanew：
Dnew=(1- α) × Dold+Dcur× α,
Wherein, α span is more than 0 and less than or equal to 1；
The first distance between the CDN node and the destined node currently determined is more than previous
During second distance between the CDN node of secondary determination and the destined node, the CDN sections
Point determines current second distance D between this node and the destined node according to following formulanew：
Dnew=(1- α) × Dold+Dcur×α+Devnew/8。
Alternatively, the CDN node determine the first distance between this node and each destined node and
Second distance, including：
The CDN node periodically determines the first distance between this node and each destined node and the
Two distances.
Alternatively, the CDN node determine the first distance between this node and each destined node with
And after second distance, methods described also includes：
The CDN node updates this node locally preserved and each destined node according to record period
Between second distance.
Alternatively, the CDN node is according to the second distance between this node and each destined node,
Or according to the second distance between this node and each destined node and other one or more
Second distance between CDN node and corresponding destined node, it is determined that accessing the optimal road of corresponding domain name
Footpath, including：
The CDN node is according to second between this node of local newest preservation and each destined node
Distance, it is determined that accessing the optimal path of corresponding domain name；Or
The CDN node obtains other described CDN nodes most from other one or more CDN nodes
Itself second distance between corresponding destined node newly preserved；The CDN node is according to local
Other of second distance and acquisition between this node of newest preservation and each destined node or
Second distance between multiple CDN nodes and corresponding destined node, it is determined that accessing corresponding domain name most
Shortest path.
Alternatively, the CDN node is according to the second distance between this node and each destined node,
Or according to the second distance between this node and each destined node and other one or more
Second distance between CDN node and corresponding destined node, it is determined that accessing the optimal road of corresponding domain name
Footpath, including：
The CDN node according to the second distance between this node and each destined node, or, root
According to the second distance between this node and each destined node and other one or more CDN nodes with
Second distance between corresponding destined node, determines this node to corresponding domain name using dijkstra's algorithm
Source station optimal path；
When the corresponding source station of domain name, the CDN node by described this node determined extremely
The optimal path of the source station is defined as the optimal path by this node visit domain name；
When corresponding at least two source station of domain name, the CDN node is from described this section determined
Point selects the optimal of the second distance sum minimum into the optimal path of each source station of the domain name
Path is as the optimal path by this node visit domain name.
Alternatively, this node that the CDN node is determined using dijkstra's algorithm to source station most
The node hop count that shortest path includes is less than or equal to default hop count.
The embodiment of the present application also provides the access accelerator of CDN a kind of, is arranged at CDN node, bag
Include：
Apart from determining module, for first between the CDN node where determining and each destined node
Distance and second distance, wherein, the second distance between the CDN node and the destined node is
According between the CDN node and the destined node currently determined first distance and it is true before
What fixed N number of first distance obtained, the N is integer more than or equal to 1, the destined node
Including source station and/or other CDN nodes；
Path determination module, for according to second between the CDN node and each destined node away from
From, or, according to the second distance between the CDN node and each destined node and other one
Second distance between individual or multiple CDN nodes and corresponding destined node, it is determined that accessing corresponding domain name
Optimal path；
Transport module, for when receiving the access request to the domain name, according to the optimal of the determination
Path, forward the access request to the domain name.
Alternatively, it is described determined in the following manner apart from determining module the CDN node with it is each pre-
Determine the first distance between node：
For each destined node, when acquisition accesses the response for the detection address that the destined node is set
Between, determine the response time as the first distance between the CDN node and the destined node.
Alternatively, it is described determined in the following manner apart from determining module the CDN node with it is each pre-
Determine the second distance between node：
For each destined node, determined according to following formula between the CDN node and the destined node
Jitter compensation value Devnew：
Devnew={ (1- β) × Devold+β×(Dcur-Dold)/2,
Wherein, DevoldTrembling between the preceding CDN node once determined and the destined node
Dynamic offset, DoldFor second between the preceding CDN node once determined and the destined node
Distance, DcurFor the first distance between the CDN node currently determined and the destined node, β
Span be more than 0 and less than or equal to 1；
The first distance between the CDN node and the destined node currently determined is less than or waited
During second distance between the preceding CDN node once determined and the destined node, under
Formula determines the second distance D between presently described CDN node and the destined nodenew：
Dnew=(1- α) × Dold+Dcur× α,
Wherein, α span is more than 0 and less than or equal to 1；
The first distance between the CDN node and the destined node currently determined is more than previous
During second distance between the CDN node of secondary determination and the destined node, determined according to following formula
Second distance D between presently described CDN node and the destined nodenew：
Dnew=(1- α) × Dold+Dcur×α+Devnew/8。
Alternatively, it is described to be used to periodically determine between this node and each destined node apart from determining module
The first distance and second distance.
Alternatively, described device also includes：Memory module, for according to record period, updating preservation
Second distance between the CDN node and each destined node.
Alternatively, the path determination module is used for：
According between the CDN node of the newest preservation of the memory module and each destined node
Two distances, it is determined that accessing the optimal path of corresponding domain name；Or
Itself of the newest preservation of other described CDN nodes is obtained from other one or more CDN nodes
With the second distance between corresponding destined node；According to the newest preservation of the memory module
Other one or more CDN of second distance and acquisition between CDN node and each destined node
Second distance between node and corresponding destined node, it is determined that accessing the optimal path of corresponding domain name.
Alternatively, the path determination module is used for：
According to the second distance between the CDN node and each destined node, or, according to described
Second distance and other one or more CDN nodes between CDN node and each destined node with
Second distance between corresponding destined node, the CDN node is determined extremely using dijkstra's algorithm
The optimal path of the source station of corresponding domain name；
When the corresponding source station of domain name, by the CDN node determined to the source
The optimal path stood is defined as accessing the optimal path of the domain name by the CDN node；
When corresponding at least two source station of domain name, from the CDN node determined to this
In the optimal path of each source station of domain name, select the minimum optimal path of the second distance sum and make
To access the optimal path of the domain name by the CDN node.
Alternatively, the path determination module uses the CDN node that dijkstra's algorithm is determined
The node hop count that optimal path to source station includes is less than or equal to default hop count.
In addition, the embodiment of the present application also provides a kind of computer-readable recording medium, being stored with computer can
Execute instruction, the computer executable instructions realize above-mentioned CDN access accelerated method when being performed.
In the embodiment of the present application, transit node is served as using CDN node, passes through phase between CDN node
Mutually cooperation, determined according to current network quality between CDN node, between CDN node and source station
Distance, optimal time source link is extrapolated according to the range information of determination.Moreover, occur in inter-node link
During problem, source link can be switched back into time.
After reading and understanding accompanying drawing and being described in detail, it can be appreciated that other aspects.
Brief description of the drawings
The flow chart for the access accelerated method that Fig. 1 is the CDN that the embodiment of the present application one provides；
The schematic diagram for the access accelerator that Fig. 2 is the CDN that the embodiment of the present application one provides；
Fig. 3 is the application scenarios schematic diagram of the embodiment of the present application two.
Embodiment
The embodiment of the present application is described in detail below in conjunction with accompanying drawing, it will be appreciated that described below
Embodiment is merely to illustrate and explained the application, is not used to limit the application.
If it should be noted that not conflicting, each feature in the embodiment of the present application and embodiment can
To be combined with each other, within the protection domain of the application.Patrolled in addition, though showing in flow charts
Volume order, but in some cases, can be shown or described to be performed different from order herein
Step.
The flow chart for the access accelerated method that Fig. 1 is the CDN that the embodiment of the present application one provides.Such as Fig. 1
It is shown, the access accelerated method for the CDN that the present embodiment provides, comprise the following steps：
Step 101：CDN node determines the first distance and second between this node and each destined node
Distance, wherein, the second distance between the CDN node and the destined node is according to current true
The first distance between the fixed CDN node and the destined node and determine before N number of the
What one distance obtained, the N is integer more than or equal to 1, the destined node include source station and/
Or other CDN nodes.
In the present embodiment, the destined node can include multiple source stations, or, the destined node
Other multiple CDN nodes can be included, or, the destined node can include one or more sources
Stand and other one or more CDN nodes.The present embodiment is not limited this.For example, CDN is saved
Point can according to packet of the CDN configuration center to CDN node determine corresponding to destined node which includes
A little CDN nodes.In addition, destined node corresponding to each CDN node can be identical, also may be used
To be different.The present embodiment is not limited this.For example, destined node corresponding to CDN node 1
CDN node 2, CDN node 3 and source station 1 can be included, then made a reservation for corresponding to CDN node 2
Node can include CDN node 1, CDN node 3 and source station 1, pre- corresponding to CDN node 3
CDN node 1, CDN node 2 and source station 1 can be included by determining node.
Alternatively, CDN node determines between this node and each destined node in the following manner
One distance：
For each destined node, CDN node, which obtains, accesses the detection address that the destined node is set
Response time, determine the response time as first between this node and the destined node away from
From.
Wherein, CDN node is with transmission control protocol (TCP, Transmission Control Protocol)
Mode is detected to obtain detection range (i.e. the first distance) respectively to other CDN nodes and source station.
Each CDN node and source station can set detection address (CheckUrl), and CheckUrl size is 2KB.
The CheckUrl that any one CDN node accesses other CDN nodes or source station can meet with a response time Rt,
In this, as 2 points (CDN node and other CDN nodes, or the CDN node and source station)
The distance between.Because response time Rt includes packet loss, round-trip delay (RTT, Round-Trip
Time), therefore, can be as the criterion of distance between two points.In this, the unit of the first distance
For millisecond (ms).
In the present embodiment, because the network condition between 2 points (CDN node and destined nodes) is
It is uncertain, therefore, determine based on the first distance for currently detecting between obtain 2 points and before
N number of first distance between 2 points fitting result (fitting before i.e. between once determine 2 points away from
From), it is determined that the fitting distance (i.e. second distance) between current 2 points.Wherein, N is to be more than or wait
In 1 integer.For example, distance measurement process can determine the first distance between 2 points, M every time
Second distance between 2 points of secondary detection process determination is currently to detect first between 2 points obtained
The fitting result of distance and the first distance of the L times to the M-1 times determination.Now, N=M-L, M
For the integer more than or equal to 2, L is the integer more than or equal to 1 and less than M.Wherein, M, L
Value can be determined according to being actually needed.In this, the unit of second distance is also millisecond (ms).
Wherein, for each destined node, CDN node it is determined that 2 points (this CDN node with it is predetermined
Node) between second distance when, it is necessary to calculate the jitter compensation value between current 2 points, it is current really
When the first distance between fixed 2 points is less than or equal to the second distance between preceding 2 points once determined,
Second distance between current 2 points be according to the first distance between currently determine 2 points and it is preceding once
What the second distance between 2 points determined determined；The first distance between 2 points currently determined is more than
During second distance between preceding 2 points once determined, consider effect of jitter, i.e., it is current 2 points between the
Two distances be according to currently measure between 2 points obtained first between, preceding 2 points once determined
Second distance and it is current 2 points between jitter compensation value determine, so, it is possible to find network in time
The situation of variation.Wherein, the jitter compensation value between current 2 points be according to 2 points during preceding one-shot measurement it
Between jitter compensation value, currently measure the first distance between 2 points obtained and preceding one-shot measurement obtains
2 points between second distance determine.
Alternatively, CDN node determines between this node and each destined node in the following manner
Two distances：
For each destined node, CDN node according to following formula determine this node and the destined node it
Between jitter compensation value Devnew：
Devnew={ (1- β) × Devold+β×(Dcur-Dold)/2,
Wherein, DevoldTrembling between the preceding CDN node once determined and the destined node
Dynamic offset, DoldFor second between the preceding CDN node once determined and the destined node
Distance, DcurFor the first distance between the CDN node currently determined and the destined node, β
Span be more than 0 and less than or equal to 1；
The first distance between the CDN node and the destined node currently determined is less than or waited
It is described during second distance between the preceding CDN node once determined and the destined node
CDN node determines current second distance D between this node and the destined node according to following formulanew：
Dnew=(1- α) × Dold+Dcur× α,
Wherein, α span is more than 0 and less than or equal to 1；
The first distance between the CDN node and the destined node currently determined is more than previous
During second distance between the CDN node of secondary determination and the destined node, the CDN sections
Point determines current second distance D between this node and the destined node according to following formulanew：
Dnew=(1- α) × Dold+Dcur×α+Devnew/8。
Wherein, CDN node can it is determined that between this node and destined node first distance after,
Directly determine the second distance between this node and destined node, and then determine this node with it is next
The first distance and second distance between destined node, or, CDN node can first determine this node
The first distance between each destined node, then determine successively between this node and each destined node
Second distance.However, the present embodiment is not limited this.
Wherein, CDN node need according to the history matching result of the first distance determine current second away from
From therefore, the CDN node is during second of distance measurement process and follow-up distance measurement
Current second distance is determined according to the calculating formula of above second distance.In addition, CDN node is with making a reservation for
The initial value of jitter compensation value between node could be arranged to 0.
In the present embodiment, α is, for example, that 3/8, β is, for example, 1/4.However, the present embodiment to this not
Limit.In practical application, α and β value can be adjusted according to the fitting effect being actually needed.
Alternatively, step 101 includes：CDN node periodically determines this node and each destined node
Between the first distance and second distance.
Wherein, CDN node can according to detection cycle, carry out periodic distance detection, every time away from
From determined in detection process between this node and each destined node first with a distance from and second distance.So
And the present embodiment is not limited this.CDN node can also for example meet corresponding detection triggering
Condition carries out distance measurement when receiving probe instructions, determine this node and it is each it is predetermined between first
Distance and second distance.
Wherein, the detection cycle of different CDN nodes can be with identical or different.The present embodiment to this not
Limit.
Step 102：CDN node according to the second distance between this node and each destined node, or,
According to the second distance between this node and each destined node and other one or more CDN nodes
With the second distance between corresponding destined node, it is determined that accessing the optimal path of corresponding domain name.
Alternatively, CDN node can be true according to the second distance between this node and each destined node
Surely the optimal path of corresponding domain name is accessed.For example, correspond to multiple sources in the domain name that user terminal requests access
When standing, CDN node can be according to corresponding with the domain name more according to this node that step 101 is determined
Second distance between individual source station, it is determined that accessing the optimal path of the domain name.
Alternatively, CDN node can according to the second distance between this node and each destined node with
And the second distance between other one or more CDN nodes and corresponding destined node, it is determined that accessing
The optimal path of corresponding domain name.For example, correspond to one or more sources in the domain name that user terminal requests access
When standing, CDN node can be according to according to this node that step 101 is determined corresponding with the domain name one
Second distance between individual or multiple source stations, and other CDN nodes are determined according to step 101
Second distance between itself one or more source station corresponding with the domain name, it is determined that accessing the domain name most
Shortest path.
Alternatively, after step 101, before step 102, methods described also includes：
CDN node is updated between this node locally preserved and each destined node according to record period
Second distance.
Wherein, record period is more than or equal to the detection cycle of the CDN node.For example, detection week
Phase is 5 seconds (s), and record period is 1 minute (min), i.e. CDN node enters line-spacing every 5s
From detection determine between this node and each destined node first with a distance from and second distance, the CDN
Node carries out data preservation every 1min, records between newest this obtained node and each destined node
Second distance.
Wherein, the record period of different CDN nodes can be with identical or different.The present embodiment to this not
Limit.
Alternatively, step 102 includes：
CDN node according to second between this node of local newest preservation and each destined node away from
From it is determined that accessing the optimal path of corresponding domain name；Or
CDN node obtains the newest guarantor of other described CDN nodes from other one or more CDN nodes
Itself second distance between corresponding destined node deposited；The CDN node is according to local newest
Other one or more of second distance and acquisition between this node and each destined node for preserving
Second distance between CDN node and corresponding destined node, it is determined that accessing the optimal road of corresponding domain name
Footpath.
Wherein, each CDN node can be by second between newest this obtained node and destined node
Distance is stored in the file under local predetermined directories.In this way, any CDN node can pass through visit
Ask that other CDN nodes of the file acquisition under the predetermined directories of other CDN nodes determine itself with
Second distance between corresponding default node.
In the present embodiment, when the link fails between CDN node and other CDN nodes,
The CDN node can not obtain other CDN nodes preservation itself with it is corresponding preset node between
Second distance, then, the CDN node do not take into account that link fails it is determined that during optimal path
Other CDN nodes, so that it is guaranteed that the real-time effectiveness for the optimal path that the CDN node determines.And
And can be when there is link failure in the CDN node, timely handoff links.
Alternatively, step 102 includes：
CDN node according to the second distance between this node and each destined node, or, according to this
Second distance and other one or more CDN nodes between node and each destined node with it is corresponding
Destined node between second distance, determine this node to the source of corresponding domain name using dijkstra's algorithm
The optimal path stood；
When the corresponding source station of domain name, the CDN node by described this node determined extremely
The optimal path of the source station is defined as the optimal path by this node visit domain name；
When corresponding at least two source station of domain name, the CDN node is from described this section determined
Point selects the optimal of the second distance sum minimum into the optimal path of each source station of the domain name
Path is as the optimal path by this node visit domain name.
Wherein, the CDN node is using the optimal of this node that dijkstra's algorithm is determined to source station
The node hop count that path includes is less than or equal to default hop count.
Wherein, dijkstra's algorithm is a kind of single source invented by Dutch computer scientist Dick Si Tela
Shortest path first, it is mainly characterized by centered on starting point outwards extending layer by layer, until expanding to terminal
Untill.Dijkstra's algorithm is known to those skilled in the art, therefore is repeated no more in this
Dijkstra's algorithm.
In the present embodiment, CDN node determines this node to the source of corresponding domain name using dijkstra's algorithm
During the optimal path stood, during abducent with start node, extension can be not only calculated
The second distance sum in path, the node hop count of extensions path can also be judged, in extensions path
When node hop count is more than or equal to default hop count, this extensions path is abandoned.Therefore, the CDN sections
The node hop count that the optimal path that point is determined includes is less than or equal to default hop count, moreover, described optimal
Path is the path for meeting that the second distance sum of above-mentioned node hop count condition is minimum.
Step 103：CDN node is when receiving the access request to the domain name, according to the determination
Optimal path, forward the access request to the domain name.
In the present embodiment, transit node is served as using CDN node, by mutually being assisted between CDN node
Make, optimal time source link, possible direct Hui Yuan, it is also possible to logical are extrapolated according to current network quality
Cross in other CDN nodes and go back to source.Moreover, when inter-node link goes wrong, can cut in time
Gain source link.
Fig. 2 is the access accelerator for the CDN that the embodiment of the present application one provides.As shown in Fig. 2 this
The access accelerator for the CDN that embodiment provides, is arranged at CDN node, described device includes：
Apart from determining module, for first between the CDN node where determining and each destined node
Distance and second distance, wherein, the second distance between the CDN node and the destined node is
According between the CDN node and the destined node currently determined first distance and it is true before
What fixed N number of first distance obtained, the N is integer more than or equal to 1, the destined node
Including source station and/or other CDN nodes；
Path determination module, for according to second between the CDN node and each destined node away from
From, or, according to the second distance between the CDN node and each destined node and other one
Second distance between individual or multiple CDN nodes and corresponding destined node, it is determined that accessing corresponding domain name
Optimal path；
Transport module, for when receiving the access request to the domain name, according to the optimal of the determination
Path, forward the access request to the domain name.
Alternatively, it is described determined in the following manner apart from determining module the CDN node with it is each pre-
Determine the first distance between node：
For each destined node, when acquisition accesses the response for the detection address that the destined node is set
Between, determine the response time as the first distance between the CDN node and the destined node.
Alternatively, it is described determined in the following manner apart from determining module the CDN node with it is each pre-
Determine the second distance between node：
For each destined node, determined according to following formula between the CDN node and the destined node
Jitter compensation value Devnew：
Devnew={ (1- β) × Devold+β×(Dcur-Dold)/2,
Wherein, DevoldTrembling between the preceding CDN node once determined and the destined node
Dynamic offset, DoldFor second between the preceding CDN node once determined and the destined node
Distance, DcurFor the first distance between the CDN node currently determined and the destined node, β
Span be more than 0 and less than or equal to 1；
The first distance between the CDN node and the destined node currently determined is less than or waited
During second distance between the preceding CDN node once determined and the destined node, under
Formula determines the second distance D between presently described CDN node and the destined nodenew：
Dnew=(1- α) × Dold+Dcur× α,
Wherein, α span is more than 0 and less than or equal to 1；
The first distance between the CDN node and the destined node currently determined is more than previous
During second distance between the CDN node of secondary determination and the destined node, determined according to following formula
Second distance D between presently described CDN node and the destined nodenew：
Dnew=(1- α) × Dold+Dcur×α+Devnew/8。
Alternatively, it is described to be used to periodically determine between this node and each destined node apart from determining module
The first distance and second distance.
Alternatively, described device also includes：Memory module, for according to record period, updating preservation
Second distance between the CDN node and each destined node.
Alternatively, the path determination module is used for：
According between the CDN node of the newest preservation of the memory module and each destined node
Two distances, it is determined that accessing the optimal path of corresponding domain name；Or
Itself of the newest preservation of other described CDN nodes is obtained from other one or more CDN nodes
With the second distance between corresponding destined node；According to the newest preservation of the memory module
Other one or more CDN of second distance and acquisition between CDN node and each destined node
Second distance between node and corresponding destined node, it is determined that accessing the optimal path of corresponding domain name.
Alternatively, the path determination module is used for：
According to the second distance between the CDN node and each destined node, or, according to described
Second distance and other one or more CDN nodes between CDN node and each destined node with
Second distance between corresponding destined node, the CDN node is determined extremely using dijkstra's algorithm
The optimal path of the source station of corresponding domain name；
When the corresponding source station of domain name, by the CDN node determined to the source
The optimal path stood is defined as accessing the optimal path of the domain name by the CDN node；
When corresponding at least two source station of domain name, from the CDN node determined to this
In the optimal path of each source station of domain name, select the minimum optimal path of the second distance sum and make
To access the optimal path of the domain name by the CDN node.
Wherein, the CDN node that the path determination module is determined using dijkstra's algorithm is extremely
The node hop count that the optimal path of source station includes is less than or equal to default hop count.
In addition, the specific handling process on said apparatus is with described in above-mentioned embodiment of the method, therefore in this not
Repeat again.
In practical application, described apart from determining module, path determination module is, for example, that processor etc. has
The element of information processing capability, transport module are, for example, that receiver and/or transmitter etc. have information transfer
The element of ability, memory module are, for example, the element that memory etc. has information storage capability.However, this
Embodiment is not limited this.In other embodiment, the function of above-mentioned module can also pass through processor
Execution is stored in the program/instruction in memory to realize.
Fig. 3 is the application scenarios schematic diagram of the embodiment of the present application two.In the present embodiment, user terminal example
Such as it is mobile phone or PC.Source station A and source station B corresponds to a domain name.CDN node A is received
The access request to the domain name that user terminal is sent, and the method dynamic according to according to embodiment one
The optimal path of selection forwards the access request.
In the present embodiment, included with destined node corresponding to CDN node A：CND nodes B,
Illustrated exemplified by CDN node C, source station A and source station B.However, the present embodiment to this not
Limit.
In the present embodiment, every detection cycle, CDN node A can be according in embodiment one
The description of step 101 determine between this node and each destined node second distance (that is, be fitted away from
From), newest this obtained node is made a reservation for section by every record period, CDN node A with each
Second distance between point is write in the file under local predetermined directories.In this, CDN node A is preserved
Second distance such as table 1 in the first row data.It should be noted that the N in table 1 represents empty
(Null), i.e., node to node itself without second distance.The unit of data is millisecond (ms) in table 1.
Table 1
| CDN node A | CDN node B | CDN node C | Source station A | Source station B | |
| CDN node A | N | 5 | 6 | 30 | 20 |
| CDN node B | 3 | N | 4 | 10 | 5 |
| CDN node C | 6 | 4 | N | 50 | 20 |
In the present embodiment, CDN node A, can be from CDN when it is determined that accessing the optimal path of domain name
Node B obtains second distance (second in such as table 1 between CDN node B and corresponding destined node
Row data), second between CDN node C and corresponding destined node is obtained from CDN node C
Distance (the third line data in such as table 1).In this way, CDN node A can integrate what is locally preserved
Second distance and the second distance obtained from other CDN nodes obtain a second distance matrix, i.e.,
Table 1.
In the present embodiment, data of the CDN node A based on table 1, limited using with node hop count
Dijkstra's algorithm determine CDN node A to source station A optimal path, and CDN node A
To source station B optimal path.In this, CDN node A can determine that this node is optimal to source station A
Path is：CDN node A->CDN node B->Source station A；Second distance corresponding to this path it
With for 15ms.CDN node A can determine that this node to source station B optimal path are：CDN is saved
Point A->CDN node B->Source station B, second distance sum corresponding to this path are 10ms.
From the foregoing, it will be observed that the second distance sum of CDN node A to source station B optimal path is less than CDN
Node A to source station A optimal path second distance sum.Therefore, visited by CDN node A
The optimal path for asking domain name corresponding to source station A and source station B is：CDN node A->CDN node B->
Source station B.That is, the access request that the user terminal received is sent can be transmitted to CDN by CDN node A
Node B.
In the present embodiment, between CDN node A and CDN node B and CDN node C
When link breaks down, CDN node A can not be obtained from CDN node B CDN node B with it is corresponding
Destined node between second distance, also can not obtain CDN node C and phase from CDN node C
Second distance between the destined node answered.Now, CDN node A it is determined that domain name access it is optimal
The path for including CDN node B and CDN node C will not be selected during path.That is, CDN node A
Can be according to the second distance between source station A and source station B that nearest detection obtains (as shown in table 2,
The unit of data is millisecond (ms) in table 2), determine the optimal path of domain name access.According to table 2
Understand, CDN node A to source station A second distance (30ms) is more than CDN node A to source station
B second distance (20ms), therefore, B pairs of source station A and source station are accessed by CDN node A
The optimal path for the domain name answered is：CDN node A->Source station B.That is, CDN node A will be received
The access request that user terminal is sent is directly forwarded to source station B.
Table 2
| Source station A | Source station B | |
| CDN node A | 30 | 20 |
In addition, the embodiment of the present invention also provides a kind of computer-readable recording medium, being stored with computer can
Execute instruction, the computer executable instructions realize that above-mentioned CDN acceleration is visited when being executed by processor
Ask method.
In a typical configuration, computing device includes one or more processors (CPU), input
/ output interface, network interface and internal memory.Internal memory may include computer-readable recording medium in it is non-forever
The forms such as long property memory, random access memory (RAM) and/or Nonvolatile memory, it is such as read-only
Memory (ROM) or flash memory (flash RAM).Internal memory is the example of computer-readable recording medium.
Computer-readable recording medium includes permanent and non-permanent, removable and non-removable media, can be with
Realize that information stores by any method or technique.Information can be computer-readable instruction, data structure,
The module of program or other data.The example of computer-readable recording medium includes but is not limited to：In phase transformation
Deposit (PRAM), static RAM (SRAM), dynamic random access memory (DRAM),
Other kinds of random access memory (RAM), read-only storage (ROM), electric erasable can
Program read-only memory (EEPROM), fast flash memory bank or other memory techniques, read-only optical disc are read-only
Memory (CD-ROM), digital versatile disc (DVD) or other optical storages, magnetic box type magnetic
Band, magnetic tape type disk storage or other magnetic storage apparatus or any other non-transmission medium, available for depositing
Store up the information that can be accessed by a computing device.
One of ordinary skill in the art will appreciate that all or part of step in the above method can pass through journey
Sequence instructs the related hardware (such as processor) to complete, and described program can be stored in computer-readable deposit
In storage media, such as read-only storage, disk or CD.Alternatively, the whole of above-described embodiment or portion
It can also be realized step by step using one or more integrated circuits.Correspondingly, it is each in above-described embodiment
Module/unit can be realized in the form of hardware, such as realize its corresponding function by integrated circuit,
It can also be realized in the form of software function module, such as be stored in by computing device in memory
Program/instruction realize its corresponding function.The application is not restricted to the hardware of any particular form and soft
The combination of part.
The advantages of general principle and principal character and the application of the application has been shown and described above.This Shen
It please be not restricted to the described embodiments, simply explanation the application described in above-described embodiment and specification
Principle, on the premise of the application spirit and scope are not departed from, the application also has various changes and modifications,
These changes and improvements are both fallen within the range of claimed the application.
Claims (16)
- A kind of 1. Content Distribution Network CDN access accelerated method, it is characterised in that including：CDN node determines the first distance and the second distance between this node and each destined node, its In, the second distance between the CDN node and the destined node is according to currently determining Between CDN node and the destined node first distance and determine before it is N number of first distance Arrive, the N is the integer more than or equal to 1, and the destined node includes source station and/or other CDN Node；The CDN node according to the second distance between this node and each destined node, or, root According to the second distance between this node and each destined node and other one or more CDN nodes with Second distance between corresponding destined node, it is determined that accessing the optimal path of corresponding domain name；The CDN node is when receiving the access request to the domain name, according to the optimal of the determination Path, forward the access request to the domain name.
- 2. according to the method for claim 1, it is characterised in that the CDN node passes through following Mode determines the first distance between this node and each destined node：For each destined node, the CDN node, which obtains, accesses the detection that the destined node is set The response time of address, determine the response time as first between this node and the destined node Distance.
- 3. according to the method for claim 1, it is characterised in that the CDN node passes through following Mode determines the second distance between this node and each destined node：For each destined node, the CDN node determines this node and the predetermined section according to following formula Jitter compensation value Dev between pointnew：Devnew={ (1- β) × Devold+β×(Dcur-Dold)/2,Wherein, DevoldTrembling between the preceding CDN node once determined and the destined node Dynamic offset, DoldFor second between the preceding CDN node once determined and the destined node Distance, DcurFor the first distance between the CDN node currently determined and the destined node, β Span be more than 0 and less than or equal to 1；The first distance between the CDN node and the destined node currently determined is less than or waited It is described during second distance between the preceding CDN node once determined and the destined node CDN node determines current second distance D between this node and the destined node according to following formulanew：Dnew=(1- α) × Dold+Dcur× α,Wherein, α span is more than 0 and less than or equal to 1；The first distance between the CDN node and the destined node currently determined is more than previous During second distance between the CDN node of secondary determination and the destined node, the CDN sections Point determines current second distance D between this node and the destined node according to following formulanew：Dnew=(1- α) × Dold+Dcur×α+Devnew/8。
- 4. according to the method for claim 1, it is characterised in that the CDN node determines this section The first distance and second distance between point and each destined node, including：The CDN node periodically determines the first distance between this node and each destined node and the Two distances.
- 5. the method according to claim 1 or 4, it is characterised in that the CDN node determines After the first distance and second distance between this node and each destined node, methods described is also wrapped Include：The CDN node updates this node locally preserved and each destined node according to record period Between second distance.
- 6. according to the method for claim 5, it is characterised in that the CDN node is according to this section Second distance between point and each destined node, or, according between this node and each destined node Second distance and other one or more CDN nodes and corresponding destined node between second away from From, it is determined that the optimal path of corresponding domain name is accessed, including：The CDN node is according to second between this node of local newest preservation and each destined node Distance, it is determined that accessing the optimal path of corresponding domain name；OrThe CDN node obtains other described CDN nodes most from other one or more CDN nodes Itself second distance between corresponding destined node newly preserved；The CDN node is according to local Other of second distance and acquisition between this node of newest preservation and each destined node or Second distance between multiple CDN nodes and corresponding destined node, it is determined that accessing corresponding domain name most Shortest path.
- 7. according to the method for claim 1, it is characterised in that the CDN node is according to this section Second distance between point and each destined node, or, according between this node and each destined node Second distance and other one or more CDN nodes and corresponding destined node between second away from From, it is determined that the optimal path of corresponding domain name is accessed, including：The CDN node according to the second distance between this node and each destined node, or, root According to the second distance between this node and each destined node and other one or more CDN nodes with Second distance between corresponding destined node, determines this node to corresponding domain name using dijkstra's algorithm Source station optimal path；When the corresponding source station of domain name, the CDN node by described this node determined extremely The optimal path of the source station is defined as the optimal path by this node visit domain name；When corresponding at least two source station of domain name, the CDN node is from described this section determined Point selects the optimal of the second distance sum minimum into the optimal path of each source station of the domain name Path is as the optimal path by this node visit domain name.
- 8. according to the method for claim 7, it is characterised in that the CDN node uses Dijkstra The node hop count that this node that algorithm is determined to the optimal path of source station includes is less than or equal to default jump Number.
- 9. a kind of Content Distribution Network CDN access accelerator, is arranged at CDN node, it is special Sign is, including：Apart from determining module, for first between the CDN node where determining and each destined node Distance and second distance, wherein, the second distance between the CDN node and the destined node is According between the CDN node and the destined node currently determined first distance and it is true before What fixed N number of first distance obtained, the N is integer more than or equal to 1, the destined node Including source station and/or other CDN nodes；Path determination module, for according to second between the CDN node and each destined node away from From, or, according to the second distance between the CDN node and each destined node and other one Second distance between individual or multiple CDN nodes and corresponding destined node, it is determined that accessing corresponding domain name Optimal path；Transport module, for when receiving the access request to the domain name, according to the optimal of the determination Path, forward the access request to the domain name.
- 10. device according to claim 9, it is characterised in that described to pass through apart from determining module In the following manner determines the first distance between the CDN node and each destined node：For each destined node, when acquisition accesses the response for the detection address that the destined node is set Between, determine the response time as the first distance between the CDN node and the destined node.
- 11. device according to claim 9, it is characterised in that described to pass through apart from determining module In the following manner determines the second distance between the CDN node and each destined node：For each destined node, determined according to following formula between the CDN node and the destined node Jitter compensation value Devnew：Devnew={ (1- β) × Devold+β×(Dcur-Dold)/2,Wherein, DevoldTrembling between the preceding CDN node once determined and the destined node Dynamic offset, DoldFor second between the preceding CDN node once determined and the destined node Distance, DcurFor the first distance between the CDN node currently determined and the destined node, β Span be more than 0 and less than or equal to 1；The first distance between the CDN node and the destined node currently determined is less than or waited During second distance between the preceding CDN node once determined and the destined node, under Formula determines the second distance D between presently described CDN node and the destined nodenew：Dnew=(1- α) × Dold+Dcur× α,Wherein, α span is more than 0 and less than or equal to 1；The first distance between the CDN node and the destined node currently determined is more than previous During second distance between the CDN node of secondary determination and the destined node, determined according to following formula Second distance D between presently described CDN node and the destined nodenew：Dnew=(1- α) × Dold+Dcur×α+Devnew/8。
- 12. device according to claim 9, it is characterised in that described to be used for apart from determining module Periodically determine the first distance and the second distance between this node and each destined node.
- 13. the device according to claim 9 or 12, it is characterised in that described device also includes： Memory module, for according to record period, updating the CDN node of preservation and each destined node Between second distance.
- 14. device according to claim 13, it is characterised in that the path determination module is used In：According between the CDN node of the newest preservation of the memory module and each destined node Two distances, it is determined that accessing the optimal path of corresponding domain name；OrItself of the newest preservation of other described CDN nodes is obtained from other one or more CDN nodes With the second distance between corresponding destined node；According to the newest preservation of the memory module Other one or more CDN of second distance and acquisition between CDN node and each destined node Second distance between node and corresponding destined node, it is determined that accessing the optimal path of corresponding domain name.
- 15. device according to claim 9, it is characterised in that the path determination module is used for：According to the second distance between the CDN node and each destined node, or, according to described Second distance and other one or more CDN nodes between CDN node and each destined node with Second distance between corresponding destined node, the CDN node is determined extremely using dijkstra's algorithm The optimal path of the source station of corresponding domain name；When the corresponding source station of domain name, by the CDN node determined to the source The optimal path stood is defined as accessing the optimal path of the domain name by the CDN node；When corresponding at least two source station of domain name, from the CDN node determined to this In the optimal path of each source station of domain name, select the minimum optimal path of the second distance sum and make To access the optimal path of the domain name by the CDN node.
- 16. device according to claim 15, it is characterised in that the path determination module is adopted The node hop count included with the CDN node that dijkstra's algorithm is determined to the optimal path of source station Less than or equal to default hop count.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610408230.0A CN107493232B (en) | 2016-06-12 | 2016-06-12 | CDN access acceleration method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610408230.0A CN107493232B (en) | 2016-06-12 | 2016-06-12 | CDN access acceleration method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107493232A true CN107493232A (en) | 2017-12-19 |
| CN107493232B CN107493232B (en) | 2020-12-01 |
Family
ID=60642221
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610408230.0A Active CN107493232B (en) | 2016-06-12 | 2016-06-12 | CDN access acceleration method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107493232B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108712335A (en) * | 2018-05-14 | 2018-10-26 | 平安科技（深圳）有限公司 | Dispatching method, system, equipment and the storage medium that network accesses |
| CN109495568A (en) * | 2018-11-19 | 2019-03-19 | 北京金山云网络技术有限公司 | A kind of data capture method, data acquisition facility, server and storage medium |
| CN109660624A (en) * | 2018-12-26 | 2019-04-19 | 网宿科技股份有限公司 | Planing method, server and the storage medium of content distributing network resource |
| CN109951738A (en) * | 2017-12-21 | 2019-06-28 | 腾讯数码（天津）有限公司 | Transmission path acquisition methods, the first electronic equipment and readable storage medium storing program for executing |
| CN110875941A (en) * | 2018-09-03 | 2020-03-10 | 阿里巴巴集团控股有限公司 | Source station access flow adjusting method and device, electronic device and storage device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120041970A1 (en) * | 2010-08-12 | 2012-02-16 | Cdnetworks Co., Ltd. | Distributed data cache for on-demand application acceleration |
| CN102790798A (en) * | 2012-05-23 | 2012-11-21 | 蓝汛网络科技（北京）有限公司 | Transparent proxy implementation method, device and system in content distribution network |
| CN103532817A (en) * | 2013-10-12 | 2014-01-22 | 无锡云捷科技有限公司 | CDN (content delivery network) dynamic acceleration system and method |
| CN103747112A (en) * | 2013-12-24 | 2014-04-23 | 乐视网信息技术（北京）股份有限公司 | CDN back-to-source method, first server and system thereof |
| CN104954219A (en) * | 2014-03-27 | 2015-09-30 | 北京奇虎科技有限公司 | CDN (Content Delivery Network) access path optimization method, device and system |
-
2016
- 2016-06-12 CN CN201610408230.0A patent/CN107493232B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120041970A1 (en) * | 2010-08-12 | 2012-02-16 | Cdnetworks Co., Ltd. | Distributed data cache for on-demand application acceleration |
| CN102790798A (en) * | 2012-05-23 | 2012-11-21 | 蓝汛网络科技（北京）有限公司 | Transparent proxy implementation method, device and system in content distribution network |
| CN103532817A (en) * | 2013-10-12 | 2014-01-22 | 无锡云捷科技有限公司 | CDN (content delivery network) dynamic acceleration system and method |
| CN103747112A (en) * | 2013-12-24 | 2014-04-23 | 乐视网信息技术（北京）股份有限公司 | CDN back-to-source method, first server and system thereof |
| CN104954219A (en) * | 2014-03-27 | 2015-09-30 | 北京奇虎科技有限公司 | CDN (Content Delivery Network) access path optimization method, device and system |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109951738A (en) * | 2017-12-21 | 2019-06-28 | 腾讯数码（天津）有限公司 | Transmission path acquisition methods, the first electronic equipment and readable storage medium storing program for executing |
| CN109951738B (en) * | 2017-12-21 | 2022-02-01 | 腾讯数码（天津）有限公司 | Transmission path acquisition method, first electronic device, and readable storage medium |
| CN108712335A (en) * | 2018-05-14 | 2018-10-26 | 平安科技（深圳）有限公司 | Dispatching method, system, equipment and the storage medium that network accesses |
| CN110875941A (en) * | 2018-09-03 | 2020-03-10 | 阿里巴巴集团控股有限公司 | Source station access flow adjusting method and device, electronic device and storage device |
| CN109495568A (en) * | 2018-11-19 | 2019-03-19 | 北京金山云网络技术有限公司 | A kind of data capture method, data acquisition facility, server and storage medium |
| CN109495568B (en) * | 2018-11-19 | 2021-06-18 | 北京金山云网络技术有限公司 | Data acquisition method, data acquisition device, server and storage medium |
| CN109660624A (en) * | 2018-12-26 | 2019-04-19 | 网宿科技股份有限公司 | Planing method, server and the storage medium of content distributing network resource |
| CN109660624B (en) * | 2018-12-26 | 2022-05-17 | 网宿科技股份有限公司 | Planning method, server and storage medium for content distribution network resources |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107493232B (en) | 2020-12-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107493232A (en) | A kind of access accelerating method and device of CDN | |
| EP3472697B1 (en) | Dynamic acceleration in content delivery network | |
| US10116593B1 (en) | Transmission and storage of routing path information and routing topology information using a single routing protocol | |
| US9374304B2 (en) | End-to end route tracing over a named-data network | |
| US9325609B2 (en) | Segmented source routing in a network | |
| EP2996309B1 (en) | Interest keep alives at intermediate routers in a ccn | |
| CN109218200B (en) | Message processing method and device | |
| CN105721311A (en) | System and method for efficient name-based content routing using link-state information in information-centric networks | |
| US10715592B2 (en) | Network node, endpoint node and method of receiving an interest message | |
| JP6601784B2 (en) | Method, network component, and program for supporting context-aware content requests in an information-oriented network | |
| EP3883210B1 (en) | Method and apparatus for determining forwarding port in information centeric network | |
| US20180302490A1 (en) | Dynamic content delivery network (cdn) cache selection without request routing engineering | |
| CN108769252B (en) | ICN network pre-caching method based on request content relevance | |
| JP2001290787A (en) | Data distribution method and storage medium with data distribution program stored therein | |
| US10536368B2 (en) | Network-aware routing in information centric networking | |
| Suwannasa et al. | Vicinity-based replica finding in named data networking | |
| US8601151B2 (en) | Apparatus and method for receiving data | |
| CN109218182B (en) | Method and device for synchronizing routing information | |
| CN109274781B (en) | ARP table item refreshing method and device | |
| WO2016177112A1 (en) | Method and device for implementing link state message refresh | |
| US10602416B2 (en) | Seamless consumer mobility in information centric networks using forwarding labels | |
| JP2015220699A (en) | Method for searching cache node | |
| CN107493231A (en) | A kind of CDN dynamic routing method and device | |
| CN112866106B (en) | Interest packet caching method, device, equipment and storage medium | |
| CN114363236B (en) | Flow control method based on explicit path and related equipment |
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 | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: DE Ref document number: 1248412 Country of ref document: HK |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |