CN105933226A - Content distributing method and system - Google Patents
Content distributing method and system Download PDFInfo
- Publication number
- CN105933226A CN105933226A CN201610248261.4A CN201610248261A CN105933226A CN 105933226 A CN105933226 A CN 105933226A CN 201610248261 A CN201610248261 A CN 201610248261A CN 105933226 A CN105933226 A CN 105933226A
- Authority
- CN
- China
- Prior art keywords
- node
- content
- distribution
- request
- shortest path
- 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/02—Topology update or discovery
-
- 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/124—Shortest path evaluation using a combination of metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
- H04L67/63—Routing a service request depending on the request content or context
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Transfer Between Computers (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a content distributing method and system. The method comprises: determining distance measurement values between all nodes; generating a collection tree of a plurality of shortest paths from edge nodes to a source node according to the distance measurement values between all the nodes and generating a router table; issuing the router table to all the edge nodes to generate a topological structure; and receiving a content distributing request from a request node, and distributing content, distribution of which is requested, to the request node according to the topological structure. The invention also provides the corresponding system. The method determines the shortest paths from all the edge nodes to the source node according to the distance measurement values between all the nodes, generates the router table on the basis of the shortest paths and issues the router table to all the edge nodes to generate the topological structure, so that the distance from each edge node to the source node is the shortest, and the time spent for a distributing node on distributing the content to the node requesting the content is the shortest. The method increases the speed of CDN content distribution and improves the system performance.
Description
Technical field
It relates to Internet technical field, particularly to a kind of content distribution method and system.
Background technology
The full name of CDN is Content Delivery Network, i.e. content distributing network.Its objective is to lead to
Cross one layer of new network architecture of increase in existing Internet, the content of website is published to closest to use
The network " edge " at family, makes user can obtain required content nearby, solves the congested shape of Internet network
Condition, improves user and accesses the response speed of website.
CDN technology is divided into dynamically to be accelerated and two kinds of technology of static acceleration, and being mostly of commonly using at present is static
Accelerate, i.e. dispose CDN node, when there being user to ask a certain service, CDN system at the edge of network
Unite by scheduling, i.e. GSLB (Global Server Load Balance, GSLB) strategy is by user
Being directed to a fringe node nearest away from it, this node is responsible for processing the request of user.If user please
The content asked has caching and effectively on this node, and the content of caching is issued this user, otherwise, this joint
Point proxy user can initiate back source request to other nodes or source station server, and source path is found back in scheduling,
Content according to returning source path acquirement user's request relays to user, completes the process asked specifically.
CDN topological structure traditionally, when source node is fringe node distribution content, is usually
Merely carry out based on static geographical position.This method does not has the calculating of Actual path length,
Not calculating shortest path with weight for element factor between two nodes, it is one-dimensional, does not examine
Consider the shortest path between any two point, draw simply by simple sequence.This CDN's
The method based on static geographical position distribution content that topological structure causes, actual conditions may be not exclusively
Accurately or accuracy is the highest, cause data transfer delay, and when the content of request is dispensed to a certain node
After, other nodes also need to when also accessing same content again from source station request content, cause user to visit
Ask relatively slow, affect user's experience.
Summary of the invention
The problem existed for above-mentioned prior art, the disclosure provides a kind of content distribution method and system.
On the one hand, present disclose provides a kind of content distribution method, including:
Determining each internodal distance metric value, described node includes source node and multiple fringe node；
The fringe node a plurality of shortest path to source node is generated according to all each distance metric value internodal
The sink tree in footpath, and generate routing table；
Issue described routing table to described all fringe nodes to generate topological structure；
Receive the content distribution request from requesting node, according to described topological structure by request distribution
Hold and be distributed to described requesting node.
On the other hand, the disclosure provides a kind of content delivering system, including:
Nodal distance determines unit, is used for determining each internodal distance metric value, and described node includes source
Node and multiple fringe node；
Routing table signal generating unit, for generating fringe node according to all each distance metric value internodal
To the sink tree of a plurality of shortest path of source node, and generate routing table；
Topological structure signal generating unit, is used for issuing described routing table and opens up to generate to described all fringe nodes
Flutter structure；
Content distribution unit, for receiving the content distribution request from requesting node, according to described topology
Structure is by the content distribution extremely described requesting node of request distribution.
The content distribution method of disclosure embodiment and system, all of node (bag in determining network
Include source node) between distance metric value after, determine often according to these the most internodal distance metric value
Individual fringe node is to the shortest path of source node, and generates routing table according to these shortest paths and be issued to
To generate topological structure in all of fringe node so that the distance of each fringe node to source node is
The shortest, and each fringe node is in the shortest path of source node, the node being positioned on shortest path it
Between path be also distance the shortest, thus obtained network topology enables in this network topology,
Distribution node is all minimum to the time used by the node distribution content of request content, this method increases
In CDN, the speed of content distribution, improves systematic function.
Accompanying drawing explanation
In order to be illustrated more clearly that the technical scheme of disclosure embodiment, institute in embodiment being described below
The accompanying drawing used is needed to be briefly described, it should be apparent that, the accompanying drawing in describing below is the disclosure
Some embodiments, for those of ordinary skill in the art, in the premise not paying creative work
Under, it is also possible to other accompanying drawing is obtained according to these accompanying drawings.
Fig. 1 is the flow chart of the content distribution method of the disclosure one embodiment；
Fig. 2 is the structural representation of the content delivering system of the disclosure one embodiment.
Detailed description of the invention
For making the purpose of disclosure embodiment, technical scheme and advantage clearer, below in conjunction with these public affairs
Open the accompanying drawing in embodiment, the technical scheme in disclosure embodiment be clearly and completely described,
Obviously, described embodiment is a part of embodiment of the disclosure rather than whole embodiments.Based on
Embodiment in the disclosure, those of ordinary skill in the art are obtained under not making creative work premise
The every other embodiment obtained, broadly falls into the scope of disclosure protection.
It should be noted that in the case of not conflicting, in embodiment in the application and embodiment
Feature can be mutually combined.
The disclosure can be used in numerous general or special purpose computing system environment or configuration.Such as: Ge Renji
Calculation machine, server computer, handheld device or portable set, laptop device, multicomputer system,
System based on microprocessor, set top box, programmable consumer-elcetronics devices, network PC, small-sized calculating
Machine, mainframe computer, the DCE including any of the above system or equipment etc..
The disclosure can described in the general context of computer executable instructions,
Such as program module.Usually, program module includes performing particular task or realizing specific abstract data class
The routine of type, program, object, assembly, data structure etc..Can also be in a distributed computing environment
Put into practice the disclosure, in these DCEs, by by communication network connected remotely
Reason equipment performs task.In a distributed computing environment, program module may be located at and includes storage device
In interior local and remote computer-readable storage medium.
Finally, in addition it is also necessary to explanation, in this article, the relational terms of such as first and second or the like
It is used merely to separate an entity or operation with another entity or operating space, and not necessarily requires
Or imply relation or the order that there is any this reality between these entities or operation.And, art
Language " includes ", " comprising ", not only include those key elements, but also other including being not expressly set out wanted
Element, or also include the key element intrinsic for this process, method, article or equipment.Do not having
In the case of more restrictions, statement " including ... " key element limited, it is not excluded that including described wanting
Process, method, article or the equipment of element there is also other identical element.
Fig. 1 is the flow chart of the content distribution method of the disclosure one embodiment.As it is shown in figure 1, the method
Including:
S101: determine each internodal distance metric value, described node includes source node and multiple edge joint
Point；
S102: generate a plurality of to source node of fringe node according to all each distance metric value internodal
The sink tree of shortest path, and generate routing table；
S103: issue described routing table to described all fringe nodes to generate topological structure；
S104: receive the content distribution request from requesting node, according to described topological structure by request point
The content distribution sent out is to described requesting node.
Content distribution method shown in disclosure embodiment, in determining network, all of node (includes
Source node) between distance metric value after, determine each according to these the most internodal distance metric value
Fringe node is to the shortest path of source node, and generates routing table according to these shortest paths and be issued to institute
To generate topological structure in some fringe nodes so that the distance of each fringe node to source node is
Short, and each fringe node is in the shortest path of source node, between the node on shortest path
Path be also distance the shortest, thus obtained network topology enables in this network topology, point
It is all minimum for sending out node to the time used by the node distribution content of request content, this method increases CDN
In network, the speed of content distribution, improves systematic function.
As the further optimization of embodiment of the method shown in Fig. 1, embodiment illustrated in fig. 1 step S101 determines
Each internodal distance metric value includes:
S1011: obtain internodal historic transmission information, described historic transmission information at least includes that data pass
At least one in defeated speed, two-way time and packet loss；
S1012: determine each euclidean distance between node pair metric according to internodal historic transmission information.
In the present embodiment, message transmission rate is the measurement of the speed carried out data transmission between two nodes,
Distance between message transmission rate the biggest explanation two node is the nearest, so message transmission rate and two nodes
Between distance be inversely proportional to；Two-way time is the time carrying out the most complete communication between two nodes, past
Time of returning the shortest explanation two euclidean distance between node pair is the nearest；Transmission information when packet loss is communication between two nodes
The tolerance of integrality, packet loss is the biggest, shows to transmit between two nodes the most imperfect of information, i.e. two joints
Distance between point is the biggest.
In certain embodiments, each euclidean distance between node pair metric is determined according to internodal historic transmission information
Process can be such that the inverse to described message transmission rate, two-way time and packet loss give respectively
First weight, the second weight, the 3rd weight；Inverse, two-way time and packet loss to message transmission rate
Rate is weighted the distance metric value obtaining between node of suing for peace；Raw according to the distance metric value between node
Become sink tree.Wherein the first weight, the second weight, the 3rd weight are according to the message transmission rate of its correspondence
Inverse, two-way time and packet loss adjustable on the size of the impact of internodal distance metric, and three
Sum is 1, has i.e. carried out normalized between three weights, in order to according to affecting between node
Three factors (inverse of message transmission rate, two-way time and packet loss) of metric range are the most right
Its proportion is adjusted by the size of metric range impact, more reasonably adjusts falling of message transmission rate
Number, proportion between two-way time and packet loss three, to obtain the most internodal distance degree
Value, thus each internodal distance is determined more accurately.
Message transmission rate in the present embodiment and be directly monitored two-way time obtaining；Wherein, come and go
Time is exactly sender in simple terms from the beginning of sending data, to receiving the confirmation institute from reciever
The time of experience, it is important performance indications in a computer network for it, represents and sends out from transmitting terminal
Sending data to start, (receiving terminal is soon sent out after receiving data to receive the confirmation from receiving terminal to transmitting terminal
Send confirmation), the time delay altogether experienced, RTT (Round-trip Time two-way time) value is by three parts
Determine: i.e. queuing in the caching processing time and router of the propagation time of link, end system
With the time of process.Packet loss (Loss Tolerance or Packet Loss Rate) refers to lost number in test
Account for the ratio of sent data group according to bag quantity, computational methods are: " [(incoming message-outgoing message)/input report
Literary composition] * 100% ", the packet loss in the present embodiment is that the data that first node sends deduct Section Point and receive
The data that send divided by first node of data be multiplied by very.
By considering two internodal message transmission rates, two-way time and packet loss in the present embodiment
Measure the distance between two nodes so that the distance value between two nodes finally determined is more reliable, from
And can be for distributing the coordinates measurement foundation that content provides more reliable quickly.
As the further optimization of embodiment of the method shown in Fig. 1, embodiment illustrated in fig. 1 step S104 receives
From the content distribution request of requesting node, according to described topological structure by the content distribution of request distribution extremely
Described requesting node includes:
S1041: determine the distribution node of the content being cached with described request distribution；
S1042: when described distribution node is positioned at described requesting node to the shortest path of source node, will
The content of the request distribution in described distribution node is distributed to described shortest path successively along described shortest path
On node in, until by the content distribution of described request distribution to described requesting node；Otherwise
S1043: by the content of the described request distribution in source node along described requesting node to described source node
Shortest path be distributed to described requesting node successively in the node in the shortest path of described source node,
Until by the content distribution of described request distribution to described requesting node.
In the present embodiment, first determine the distribution node being cached with distribution content, please when there being distribution node to be positioned at
When seeking node to the shortest path of source node, distribute content by distribution node to requesting node, than from
Source node is more time-consuming to requesting node distribution content.And during distribution, by content distribution extremely
The all nodes before requesting node are arrived along shortest path, can a certain node on this shortest path
When being accessed in a large number, other from this shortest path are distributed on the node of content and obtain in this distribution
Hold, decrease and again obtain accessing the content i.e. time of Hui Yuan from source node, and from this shortest path
Other nodes to obtain distributing the time used by content be also the shortest, accelerate the access speed of user.
As the further optimization of embodiment of the method shown in Fig. 1, embodiment illustrated in fig. 1 step S104 receives
From the content distribution request of requesting node, according to described topological structure by the content distribution of request distribution extremely
Described requesting node includes:
The shortest along described requesting node to described source node of content by the described request distribution in source node
Path is distributed to described requesting node successively in the node in the shortest path of described source node, until will
The content distribution of described request distribution is to described requesting node.
In the present embodiment, requesting node is had to ask when interstitial content is too many so that inquire about which nodal cache
Ask the content of distribution relatively time consuming laborious time, directly distribute content from source station to requesting node.And dividing
During Faing, by all nodes before content distribution to arrival requesting node along shortest path, permissible
A certain node on this shortest path is when being accessed in a large number, and other from this shortest path are distributed
Obtain this distribution content on the node of content, decrease and again obtain accessing content i.e. Hui Yuan from source node
Time, and other nodes from this shortest path to obtain distributing the time used by content be also the shortest,
Accelerate the access speed of user.
As the further optimization of disclosure embodiment, in disclosure embodiment, described requesting node is institute
State the fringe node that in a plurality of shortest path, source node described in distance is farthest.
In the present embodiment, owing to the distribution node of source node or non-source node is when content is distributed in request, please
Ask on the shortest path to source node at node place, along this shortest path from distribution node to request joint
Other nodes of point all can be distributed content, and therefore in requesting node is shortest path, distance source node is
During remote node, it is possible to all nodes on this shortest path are all distributed content so that this shortest path
On any one node when being accessed in a large number, can obtain on other all nodes from this shortest path
This distribution content, decreases the time of system Hui Yuan, and other nodes from this shortest path obtain
Time used by distribution content is also the shortest, is greatly accelerated the access speed of user.
It should be noted that for aforesaid each method embodiment, in order to be briefly described, therefore by its all table
Stating and merge for a series of action, but those skilled in the art should know, the disclosure is by being retouched
The restriction of the sequence of movement stated because according to the disclosure, some step can use other orders or with
Shi Jinhang.Secondly, those skilled in the art also should know, embodiment described in this description all belongs to
In preferred embodiment, necessary to involved action and the module not necessarily disclosure.
In the above-described embodiments, the description to each embodiment all emphasizes particularly on different fields, and does not has in certain embodiment
The part described in detail, may refer to the associated description of other embodiments.
Fig. 2 is the structural representation of the content delivering system of the disclosure one embodiment.Interior described in the disclosure
Hold distribution method to implement based on the content delivering system in the present embodiment.As in figure 2 it is shown, this system
Unit 201 routing table signal generating unit 202, topological structure signal generating unit 203 He is determined including nodal distance
Content distribution unit 204.
Nodal distance determine unit 201 for determining each internodal distance metric value, described node includes
Source node and multiple fringe node；
Routing table signal generating unit 202 is for generating edge joint according to all each distance metric value internodal
Point is to the sink tree of a plurality of shortest path of source node, and generates routing table；
Topological structure signal generating unit 203 is used for issuing described routing table to described all fringe nodes to generate
Topological structure；
Content distribution unit 204, for receiving the content distribution request from requesting node, is opened up according to described
Flutter the structure content distribution by request distribution to described requesting node.
In disclosure embodiment, determine that unit 201 determines the (bag of all of node in network at nodal distance
Include source node) between distance metric value after, routing table signal generating unit 202 is according between these two-by-two node
Distance metric value determine each fringe node shortest path to source node, and according to these shortest paths
Generate routing table, under the routing table that routing table signal generating unit 202 is generated by topological structure signal generating unit 203
Send in all of fringe node to generate topological structure so that the distance of each fringe node to source node
It is all the shortest, and each fringe node is in the shortest path of source node, the joint being positioned on shortest path
Path between point is also that distance is the shortest, and thus obtained network topology enables in this network topology
In, content distribution unit 204 is all minimum to the time used by the node distribution content of request content, should
Method adds the speed of content distribution in CDN, improves systematic function.
As the further optimization of embodiment illustrated in fig. 2, embodiment illustrated in fig. 2 interior joint distance determines list
Unit 201 is used for:
Obtain internodal historic transmission information, described historic transmission information at least include message transmission rate,
At least one in two-way time and packet loss；
Each euclidean distance between node pair metric is determined according to internodal historic transmission information.
By considering two internodal message transmission rates, two-way time and packet loss in the present embodiment
Measure the distance between two nodes so that nodal distance determine two nodes that unit 201 finally determines it
Between distance value more reliable such that it is able to provide more reliable coordinates measurement foundation for distributing content quickly.
As the further optimization of embodiment illustrated in fig. 2, embodiment illustrated in fig. 2 content distribution unit 204
For:
Determine the distribution node of the content being cached with described request distribution；
When described distribution node is positioned at described requesting node to the shortest path of source node, by described point
The content sending out the request distribution in node is distributed to the joint on described shortest path successively along described shortest path
In point, until by the content distribution of described request distribution to described requesting node；Otherwise
The shortest along described requesting node to described source node of content by the described request distribution in source node
Path is distributed to described requesting node successively in the node in the shortest path of described source node, until will
The content distribution of described request distribution is to described requesting node.
In the present embodiment, content distribution unit 204 first determines the distribution node being cached with distribution content, when
When having distribution node to be positioned at requesting node to the shortest path of source node, by content distribution unit 204
By the content distribution of distribution node to requesting node, more save to requesting node distribution content than from source node
Time.And during distribution, before content distribution to arrival requesting node on shortest path
All nodes, can a certain node on this shortest path when being accessed in a large number, from this shortest path
On other be distributed on the node of content and obtain this distribution content, decrease and again must visit from source node
Ask the content i.e. time of Hui Yuan, and other nodes from this shortest path obtain distributing content institute's used time
Between be also the shortest, accelerate the access speed of user.
As the further optimization of embodiment illustrated in fig. 2, embodiment illustrated in fig. 2 content distribution unit 204
For:
The shortest along described requesting node to described source node of content by the described request distribution in source node
Path is distributed to described requesting node successively in the node in the shortest path of described source node, until will
The content distribution of described request distribution is to described requesting node.
In the present embodiment, requesting node is had to ask when interstitial content is too many so that inquire about which nodal cache
Ask the content of distribution relatively time consuming laborious time, direct content distribution unit 204 is distributed from source station to requesting node
Content.And during distribution, before content distribution to arrival requesting node along shortest path
All nodes, can a certain node on this shortest path when being accessed in a large number, from this shortest path
Other on footpath have been distributed on the node of content and have obtained this distribution content, decrease and again obtain from source node
To accessing the content i.e. time of Hui Yuan, and other nodes from this shortest path obtain distributing content institute
Also it is the shortest with the time, accelerates the access speed of user.
As the further optimization of disclosure embodiment, in disclosure embodiment, described requesting node is institute
State the fringe node that in a plurality of shortest path, source node described in distance is farthest.
In the present embodiment, owing to the distribution node of source node or non-source node is when content is distributed in request, please
Ask on the shortest path to source node at node place, along this shortest path from distribution node to request joint
Other nodes of point all can be distributed content, and therefore in requesting node is shortest path, distance source node is
During remote node, it is possible to all nodes on this shortest path are all distributed content so that this shortest path
On any one node when being accessed in a large number, can obtain on other all nodes from this shortest path
This distribution content, decreases the time of system Hui Yuan, and other nodes from this shortest path obtain
Time used by distribution content is also the shortest, is greatly accelerated the access speed of user.
Disclosure embodiment can pass through hardware processor (hardware processor) and realize phase
Close functional module.
Embodiment of the method described above is only schematically, wherein said illustrates as separating component
Unit can be or may not be physically separate, the parts shown as unit can be or
Person may not be physical location, i.e. may be located at a place, or can also be distributed to multiple network
On unit.Some or all of module therein can be selected according to the actual needs to realize the present embodiment
The purpose of scheme.Those of ordinary skill in the art are not in the case of paying performing creative labour, the most permissible
Understand and implement.
Through the above description of the embodiments, those skilled in the art is it can be understood that arrive each reality
The mode of executing can add the mode of required general hardware platform by software and realize, naturally it is also possible to by firmly
Part.Based on such understanding, the portion that prior art is contributed by technique scheme the most in other words
Dividing and can embody with the form of software product, this computer software product can be stored in computer can
Read in storage medium, such as ROM/RAM, magnetic disc, CD etc., including some instructions with so that one
Computer equipment (can be personal computer, server, or the network equipment etc.) performs each to be implemented
The method described in some part of example or embodiment.
Those skilled in the art it should be appreciated that embodiment of the present disclosure can be provided as method, system,
Or computer program.Therefore, the disclosure can use complete hardware embodiment, complete software to implement
Mode or the form of the embodiment in terms of combining software and hardware.And, the disclosure can use one
Individual or multiple wherein include computer usable program code computer-usable storage medium (include but not
It is limited to magnetic disc store and optical memory etc.) form of the upper computer program implemented.
The disclosure is with reference to method, equipment (system) and the computer program according to disclosure embodiment
The flow chart of product and/or block diagram describe.It should be understood that flow process can be realized by computer program instructions
Flow process in each flow process in figure and/or block diagram and/or square frame and flow chart and/or block diagram
And/or the combination of square frame.Can provide these computer program instructions to all-purpose computer, special-purpose computer,
The processor of Embedded Processor or other programmable data processing device is to produce a machine so that logical
The instruction of the processor execution crossing computer or other programmable data processing device produces for realizing at stream
The function specified in one flow process of journey figure or multiple flow process and/or one square frame of block diagram or multiple square frame
Device.
These computer program instructions may be alternatively stored in and computer or the process of other programmable datas can be guided to set
In the standby computer-readable memory worked in a specific way so that be stored in this computer-readable memory
In instruction produce and include the manufacture of command device, this command device realize in one flow process of flow chart or
The function specified in multiple flow processs and/or one square frame of block diagram or multiple square frame.These computer programs
Instruction also can be loaded in computer or other programmable data processing device so that computer or other
On programmable device, execution sequence of operations step is to produce computer implemented process, thus at computer
Or the instruction performed on other programmable devices provides for realizing in one flow process of flow chart or multiple flow process
And/or the step of the function specified in one square frame of block diagram or multiple square frame.
Last it is noted that above example is only in order to illustrate the technical scheme of the disclosure, rather than to it
Limit；Although the disclosure being described in detail with reference to previous embodiment, the ordinary skill of this area
Personnel it is understood that the technical scheme described in foregoing embodiments still can be modified by it, or
Person carries out equivalent to wherein portion of techniques feature；And these amendments or replacement, do not make corresponding skill
The essence of art scheme departs from the spirit and scope of the disclosure each embodiment technical scheme.
Claims (10)
1. a content distribution method, including:
Determining each internodal distance metric value, described node includes source node and multiple fringe node；
The fringe node a plurality of shortest path to source node is generated according to all each distance metric value internodal
The sink tree in footpath, and generate routing table；
Issue described routing table to described all fringe nodes to generate topological structure；
Receive the content distribution request from requesting node, according to described topological structure by request distribution
Hold and be distributed to described requesting node.
Method the most according to claim 1, wherein, described determines each internodal distance metric value
Including:
Obtain internodal historic transmission information, described historic transmission information at least include message transmission rate,
At least one in two-way time and packet loss；
Each euclidean distance between node pair metric is determined according to internodal historic transmission information.
Method the most according to claim 2, wherein, described reception divides from the content of requesting node
Send out request, according to described topological structure, content distribution to the described requesting node of request distribution included:
Determine the distribution node of the content being cached with described request distribution；
When described distribution node is positioned at described requesting node to the shortest path of source node, by described point
The content sending out the request distribution in node is distributed to the joint on described shortest path successively along described shortest path
In point, until by the content distribution of described request distribution to described requesting node；Otherwise
The shortest along described requesting node to described source node of content by the described request distribution in source node
Path is distributed to described requesting node successively in the node in the shortest path of described source node, until will
The content distribution of described request distribution is to described requesting node.
Method the most according to claim 2, wherein, described reception divides from the content of requesting node
Send out request, according to described sink tree, content distribution to the described requesting node of request distribution included:
The shortest along described requesting node to described source node of content by the described request distribution in source node
Path is distributed to described requesting node successively in the node in the shortest path of described source node, until will
The content distribution of described request distribution is to described requesting node.
5. according to the method described in claim 3 or 4, wherein, described requesting node be described a plurality of
The fringe node that in short path, source node described in distance is farthest.
6. a content delivering system, including:
Nodal distance determines unit, is used for determining each internodal distance metric value, and described node includes source
Node and multiple fringe node；
Routing table signal generating unit, for generating fringe node according to all each distance metric value internodal
To the sink tree of a plurality of shortest path of source node, and generate routing table；
Topological structure signal generating unit, is used for issuing described routing table and opens up to generate to described all fringe nodes
Flutter structure；
Content distribution unit, for receiving the content distribution request from requesting node, according to described topology
Structure is by the content distribution extremely described requesting node of request distribution.
System the most according to claim 6, wherein, described nodal distance determine unit for:
Obtain internodal historic transmission information, described historic transmission information at least include message transmission rate,
At least one in two-way time and packet loss；
Each euclidean distance between node pair metric is determined according to internodal historic transmission information.
System the most according to claim 7, wherein, described content distribution unit is used for:
Determine the distribution node of the content being cached with described request distribution；
When described distribution node is positioned at described requesting node to the shortest path of source node, by described point
The content sending out the request distribution in node is distributed to the joint on described shortest path successively along described shortest path
In point, until by the content distribution of described request distribution to described requesting node；Otherwise
The shortest along described requesting node to described source node of content by the described request distribution in source node
Path is distributed to described requesting node successively in the node in the shortest path of described source node, until will
The content distribution of described request distribution is to described requesting node.
System the most according to claim 7, wherein, described content distribution unit is used for:
The shortest along described requesting node to described source node of content by the described request distribution in source node
Path is distributed to described requesting node successively in the node in the shortest path of described source node, until will
The content distribution of described request distribution is to described requesting node.
The most according to claim 8 or claim 9, system, wherein, described requesting node is described a plurality of
The fringe node that in shortest path, source node described in distance is farthest.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610248261.4A CN105933226A (en) | 2016-04-20 | 2016-04-20 | Content distributing method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610248261.4A CN105933226A (en) | 2016-04-20 | 2016-04-20 | Content distributing method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105933226A true CN105933226A (en) | 2016-09-07 |
Family
ID=56838620
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610248261.4A Pending CN105933226A (en) | 2016-04-20 | 2016-04-20 | Content distributing method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105933226A (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107864228A (en) * | 2017-12-22 | 2018-03-30 | 网宿科技股份有限公司 | Connection method for building up and system in a kind of content distributing network |
| CN108234319A (en) * | 2017-12-29 | 2018-06-29 | 北京奇虎科技有限公司 | The transmission method and device of a kind of data |
| CN108429682A (en) * | 2018-02-26 | 2018-08-21 | 湖南科技学院 | A kind of optimization method and system of network transmission link |
| CN108712335A (en) * | 2018-05-14 | 2018-10-26 | 平安科技（深圳）有限公司 | Network access scheduling method, system, device and storage medium |
| CN109660578A (en) * | 2017-10-11 | 2019-04-19 | 阿里巴巴集团控股有限公司 | CDN's returns source processing method and processing device, system |
| CN113300962A (en) * | 2021-01-26 | 2021-08-24 | 阿里巴巴集团控股有限公司 | Path acquisition method, access method, device and equipment |
| CN113596119A (en) * | 2021-07-16 | 2021-11-02 | 中移（杭州）信息技术有限公司 | Edge capability distribution method, system, device and computer readable storage medium |
| CN113660158A (en) * | 2021-08-05 | 2021-11-16 | 北京网聚云联科技有限公司 | Method, server and storage medium for scheduling dynamic routing of Overlay virtual link |
| CN115525302A (en) * | 2022-09-23 | 2022-12-27 | 北京大学 | Deployment method and device of large-scale digital object warehouse cluster |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1422468A (en) * | 2000-02-07 | 2003-06-04 | 内特里公司 | Method for high-performance delivery of web content |
| EP1322094A1 (en) * | 2001-12-21 | 2003-06-25 | Castify Holdings, Ltd | Process for selecting a server in a content delivery network |
| US20100036949A1 (en) * | 2006-03-28 | 2010-02-11 | Jun Li | Centralized Scheduler for Content Delivery Network |
| CN101860720A (en) * | 2009-04-10 | 2010-10-13 | 中兴通讯股份有限公司 | Content positioning method and content distribution network node |
| CN102118376A (en) * | 2010-01-06 | 2011-07-06 | 中兴通讯股份有限公司 | CDN server and content download method |
| CN102546381A (en) * | 2010-12-08 | 2012-07-04 | 中国科学院声学研究所 | Method of selecting IP (internet protocol) network data transmission path |
| CN104022911A (en) * | 2014-06-27 | 2014-09-03 | 哈尔滨工业大学 | Content route managing method of fusion type content distribution network |
| CN105450753A (en) * | 2015-11-27 | 2016-03-30 | 浪潮(北京)电子信息产业有限公司 | Data acquisition method, directory server and distributed file system |
-
2016
- 2016-04-20 CN CN201610248261.4A patent/CN105933226A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1422468A (en) * | 2000-02-07 | 2003-06-04 | 内特里公司 | Method for high-performance delivery of web content |
| EP1322094A1 (en) * | 2001-12-21 | 2003-06-25 | Castify Holdings, Ltd | Process for selecting a server in a content delivery network |
| US20100036949A1 (en) * | 2006-03-28 | 2010-02-11 | Jun Li | Centralized Scheduler for Content Delivery Network |
| CN101860720A (en) * | 2009-04-10 | 2010-10-13 | 中兴通讯股份有限公司 | Content positioning method and content distribution network node |
| CN102118376A (en) * | 2010-01-06 | 2011-07-06 | 中兴通讯股份有限公司 | CDN server and content download method |
| CN102546381A (en) * | 2010-12-08 | 2012-07-04 | 中国科学院声学研究所 | Method of selecting IP (internet protocol) network data transmission path |
| CN104022911A (en) * | 2014-06-27 | 2014-09-03 | 哈尔滨工业大学 | Content route managing method of fusion type content distribution network |
| CN105450753A (en) * | 2015-11-27 | 2016-03-30 | 浪潮(北京)电子信息产业有限公司 | Data acquisition method, directory server and distributed file system |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109660578A (en) * | 2017-10-11 | 2019-04-19 | 阿里巴巴集团控股有限公司 | CDN's returns source processing method and processing device, system |
| CN107864228A (en) * | 2017-12-22 | 2018-03-30 | 网宿科技股份有限公司 | Connection method for building up and system in a kind of content distributing network |
| CN108234319A (en) * | 2017-12-29 | 2018-06-29 | 北京奇虎科技有限公司 | The transmission method and device of a kind of data |
| CN108429682A (en) * | 2018-02-26 | 2018-08-21 | 湖南科技学院 | A kind of optimization method and system of network transmission link |
| CN108712335A (en) * | 2018-05-14 | 2018-10-26 | 平安科技（深圳）有限公司 | Network access scheduling method, system, device and storage medium |
| CN113300962A (en) * | 2021-01-26 | 2021-08-24 | 阿里巴巴集团控股有限公司 | Path acquisition method, access method, device and equipment |
| CN113596119A (en) * | 2021-07-16 | 2021-11-02 | 中移（杭州）信息技术有限公司 | Edge capability distribution method, system, device and computer readable storage medium |
| CN113660158A (en) * | 2021-08-05 | 2021-11-16 | 北京网聚云联科技有限公司 | Method, server and storage medium for scheduling dynamic routing of Overlay virtual link |
| CN113660158B (en) * | 2021-08-05 | 2023-06-30 | 北京网聚云联科技有限公司 | Scheduling method, server and storage medium for dynamic routing of Overlay virtual link |
| CN115525302A (en) * | 2022-09-23 | 2022-12-27 | 北京大学 | Deployment method and device of large-scale digital object warehouse cluster |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105933226A (en) | Content distributing method and system | |
| CN105933233A (en) | Topology structure generation method and system of CDN network | |
| CN105933234A (en) | Node management method and system in CDN network | |
| US10789089B2 (en) | Dynamic application migration between cloud providers | |
| CN105897845A (en) | CDN (Content Delivery Network) service node dispatching method and server | |
| US20190182168A1 (en) | Dynamic throttling thresholds | |
| CN105900396B (en) | Mobile cloud service architectural framework | |
| CN104618164B (en) | The management method of cloud computing platform application rapid deployment | |
| US20170171344A1 (en) | Scheduling method and server for content delivery network service node | |
| US20200034216A1 (en) | Router management by an event stream processing cluster manager | |
| CN105871612A (en) | Topological structure generator in CDN (Content Delivery Network) network | |
| CN105847380A (en) | UDP acceleration method and system in content distribution network | |
| CN105847159A (en) | CDN topological structure generating method and system | |
| CN107453900B (en) | Cloud analysis parameter setting management system and method for realizing parameter setting | |
| CN109726004A (en) | A kind of data processing method and device | |
| CN105897582A (en) | Inter-node distance measurement method and system | |
| CN105933399A (en) | Content distribution network implementation method and system based on SDN | |
| JP6265040B2 (en) | Processing program, processing system, and processing method | |
| CN108234638A (en) | A kind of data processing method and device based on content distributing network CDN | |
| CN105933398A (en) | Access request forwarding method and system in content distribution network | |
| CN105933400A (en) | TCP acceleration method and system in content distribution network, and server | |
| CN115298653A (en) | Adaptive state management for stateless services | |
| CN105978807A (en) | Method and system for measuring distance between nodes | |
| CN109495319A (en) | The fault message of CDN node determines method, device and equipment | |
| KR20230109694A (en) | Reconciliation of requests executed by scalable applications |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20160907 |