CN106487910A - A kind of content distributing network creation method - Google Patents
A kind of content distributing network creation method Download PDFInfo
- Publication number
- CN106487910A CN106487910A CN201610948884.2A CN201610948884A CN106487910A CN 106487910 A CN106487910 A CN 106487910A CN 201610948884 A CN201610948884 A CN 201610948884A CN 106487910 A CN106487910 A CN 106487910A
- Authority
- CN
- China
- Prior art keywords
- user area
- user
- content distribution
- server
- distribution network
- 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
- 238000000034 method Methods 0.000 title claims abstract description 53
- 230000005540 biological transmission Effects 0.000 claims description 38
- 238000012216 screening Methods 0.000 claims description 12
- 238000011900 installation process Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 2
- 239000000835 fiber Substances 0.000 description 2
- 238000009434 installation Methods 0.000 description 2
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
-
- 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/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
-
- 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/51—Discovery or management thereof, e.g. service location protocol [SLP] or web services
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Transfer Between Computers (AREA)
Abstract
This application discloses a kind of content distributing network creation method, including：Step S11：Predetermined backup server cluster and user area cluster, and in advance source server is placed in one of user area cluster user area；Step S12：Not repeatedly filter out a user area as this region to be analyzed from all user areas currently also not disposing server every time, and utilize goal-selling function, calculate the corresponding target function value in each region to be analyzed respectively, obtain current object function value set；Step S13：Filter out the minimum target function value of numerical value, and arbitrary backup server is placed in and the user area corresponding to this target function value；Step S14：Reenter step S12, finish until all backup servers are all placed.The application achieves the purpose in user area, backup server rationally disposed, and defines more efficient content distributing network.
Description
Technical Field
The invention relates to the technical field of networks, in particular to a content distribution network creating method.
Background
At present, the rapid development of the internet technology brings more and more convenience to the daily life and work of people. Meanwhile, internet technicians also face the problems of increasing data transmission quantity, increasing data transmission delay and the like. To address this problem, content distribution network technologies have evolved in an effort to meet the strong social needs for efficient content distribution networks.
The white paper of cisco's year states that by 2018, the content distribution network will account for 55% of the entire global IP network traffic. It is also predicted that traffic in content distribution networks continues to increase at a rate of 34% per year. This has led to an increase in the demand for efficient content distribution networks. At present, how to reasonably deploy the backup server in the user area to form a more efficient content distribution network is a problem to be further solved.
Disclosure of Invention
In view of this, the present invention aims to provide a method for creating a content distribution network, so as to achieve the purpose of reasonably deploying a backup server in a user area and form a more efficient content distribution network. The specific scheme is as follows:
a content distribution network creation method, comprising:
step S11: the method comprises the steps that a backup server cluster needing to be arranged and a user area cluster needing to be arranged are determined in advance, and a source server is arranged in one user area of the user area cluster in advance;
step S12: repeatedly screening a user area from all user areas where servers are not arranged currently as a current area to be analyzed, and respectively calculating a target function value corresponding to each area to be analyzed by using a preset target function to obtain a current target function value set; wherein the preset objective function is:
wherein F represents an objective function value; n represents the user area cluster; s represents a set for all user areas for which servers have been currently located; s' represents the screened region to be analyzed; di,kA path distance representing the shortest path from the i-th user area in the user area cluster to the k-th area in the set S ∪ { S' };
step S13: screening out an objective function value with the minimum value from the current objective function value set, and arranging any backup server which is not arranged in the backup server cluster in a user area corresponding to the objective function value;
step S14: step S12 is re-entered until all backup servers in the backup server cluster are installed to form the content distribution network.
Preferably, the process of determining a shortest path from an i-th user area in the user area cluster to a k-th area in a set S { S' }, includes:
and searching the shortest path from the ith user area in the user area cluster to the kth area in the set S.sup.u { S' } by utilizing a Dijkstra algorithm.
Preferably, the content distribution network creation method further includes:
if the content distribution network is required to respond to the user request in the first user area, a server closest to the first user area is screened from all servers in the content distribution network and used as a first priority server; the first user area is any user area in the user area cluster;
responding to a user request on the first user zone with the first priority server.
Preferably, the content distribution network creation method further includes:
in the process that the first priority server responds to the user request on the first user area, if the corresponding content distribution bandwidth capacity is larger than the preset maximum content distribution bandwidth capacity, the server closest to the first user area is screened from all the remaining servers on the content distribution network to serve as a second priority server; wherein, the all remaining servers are all servers remaining after the first priority server is removed in the content distribution network;
responding to other remaining user requests on the first user zone with the second priority server.
Preferably, the maximum content distribution bandwidth capacity is a maximum content distribution bandwidth capacity allowed by each server in the content distribution network, and specifically includes:
in the formula, tuRepresenting the bandwidth requirements of all users on the u-th user area; a denotes the total number of all servers located on the content distribution network.
Preferably, the process of placing the source server in a user area of the user area cluster in advance includes:
the source server is positioned on a central area of the user area cluster.
Preferably, the content distribution network creation method further includes:
if the target server needs to respond to the user request in the second user area, the transmission link with the shortest link length is screened out from the target transmission link set to serve as a first priority link; wherein the target server is any one of all servers on the content distribution network, and the second user area is any one of the user areas in the user area cluster; the target transmission link set is all transmission links between the target server and the second user area;
and controlling the target server to provide a content distribution service to the second user area through the first priority link so as to respond to a user request on the second user area.
Preferably, the content distribution network creation method further includes:
in the process that the target server provides a content distribution service to the second user area through the first priority link, if the bandwidth capacity currently transmitted on the first priority link exceeds the preset maximum transmission capacity, selecting a transmission link with the shortest link length from all the remaining transmission links on the target transmission link set as a second priority link; wherein, all the remaining transmission links are all transmission links remaining after the first priority link is removed from the target transmission link set;
and controlling the target server to provide other remaining content distribution services to the second user area through the second priority link in response to other remaining user requests on the second user area.
In the invention, the content distribution network creating method comprises the following steps: step S11: the method comprises the steps that a backup server cluster needing to be arranged and a user area cluster needing to be arranged are determined in advance, and a source server is arranged in a user area in the user area cluster in advance; step S12: repeatedly screening a user area from all user areas where servers are not arranged currently as a current area to be analyzed, and respectively calculating a target function value corresponding to each area to be analyzed by using a preset target function to obtain a current target function value set; step S13: screening out an objective function value with the minimum value from the current objective function value set, and arranging any backup server which is not arranged in the backup server cluster in a user area corresponding to the objective function value; step S14: step S12 is re-entered until all backup servers in the cluster of backup servers are installed to form the content distribution network. Wherein, the preset objective function is:
wherein F represents an objective function value; n represents a user area cluster; s represents a set for all user areas for which servers have been currently located; s' represents the screened region to be analyzed; di,kRepresents the path distance from the i-th user area in the user area cluster to the k-th area in the set S ∪ { S' }.
It can be seen from the above that, when the backup servers are installed, the backup servers are installed through multiple rounds, only one backup server is installed in each round of installation process, and in any round of installation process, a user area with the minimum objective function value is screened out from all user areas where no server is installed by using the preset objective function determined based on the shortest path principle to serve as the installation position area of the backup server in the round, so that any subsequent server can provide content distribution service for the user area in the content distribution network by using a short transmission link, thereby achieving the purpose of reasonably deploying the backup servers in the user area and forming a more efficient content distribution network.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
Fig. 1 is a flowchart of a method for creating a content distribution network according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The embodiment of the invention discloses a method for creating a content distribution network, which is shown in figure 1 and comprises the following steps:
step S11: the method comprises the steps of determining a backup server cluster needing to be arranged and a user area cluster needing to be arranged with a server in advance, and arranging a source server in a user area in the user area cluster in advance.
It is understood that the user area cluster in this embodiment includes a plurality of user areas, each user area represents a geographic area where a user is located, and may be, for example, a town, a city, or a province. In addition, the area where the source server is installed in this embodiment is determined in advance, and may be any user area in the user area cluster. On the basis, the user area suitable for arranging the backup server is found out from the user area cluster. In the present embodiment, the backup server refers to a server that backs up all data in the source server.
Step S12: repeatedly screening a user area from all user areas where servers are not arranged currently as a current area to be analyzed, and respectively calculating a target function value corresponding to each area to be analyzed by using a preset target function to obtain a current target function value set; wherein, the preset objective function is:
wherein F represents an objective function value; n represents a user area cluster; s represents a set for all user areas for which servers have been currently located; s' represents the screened region to be analyzed; di,kRepresents the path distance from the i-th user area in the user area cluster to the k-th area in the set S ∪ { S' }.
It can be seen that, in this embodiment, each time the step S12 is performed, all user areas of the current user area cluster where the server has not been installed are screened out through one or more screening, and only one user area can be screened out as an area to be analyzed in each screening, that is, in step S12, the number of screening is the same as the number of areas of all user areas where the server has not been installed, which means that the number of function values included in the target function value set is also the same as the number of areas of all user areas where the server has not been installed.
In the above-mentioned predetermined objective function, di,kRepresenting from the ith user area to the set in a user area clusterPath distance of shortest path between kth areas in S ∪ { S' }, and mink∈S∪{s′}di,kIt means that the shortest path distance between each area in the set S ∪ { S' } and the ith user area is determined, and then the shortest path distance with the minimum value is screened from the shortest path distance set.
Step S13: and screening out the objective function value with the minimum value from the current objective function value set, and arranging any backup server which is not arranged in the backup server cluster in a user area corresponding to the objective function value.
That is, in step S13 of this embodiment, the area to be analyzed corresponding to the objective function value with the minimum value in the set of objective function values obtained in step S12 is used as the backup server placement area of this round.
It is understood that, in step S13, when a user area is installed with a backup server, the area is recorded in the set S for real-time updating of the set S.
Step S14: step S12 is re-entered until all backup servers in the cluster of backup servers are installed to form the content distribution network.
As can be seen from the above, in the embodiments of the present invention, when the backup servers are installed, only one backup server is installed in each installation process, and in any installation process, a user area with a minimum objective function value is selected from all user areas where no server is installed as an installation position area of the backup server in the current round by using the preset objective function determined based on the shortest path principle, so that any subsequent server can provide content distribution services for the user areas in the content distribution network with a shorter transmission link, thereby achieving the purpose of reasonably deploying the backup servers in the user areas, and forming a more efficient content distribution network.
The embodiment of the invention discloses a specific content distribution network creating method, and compared with the previous embodiment, the embodiment further explains and optimizes the technical scheme. Specifically, the method comprises the following steps:
as shown in the preset objective function in step S12 of the previous embodiment, the preset objective function includes the variable di,kIn the present embodiment, the shortest path from the i-th user area in the user area cluster to the k-th area in the set S ∪ { S '}, i.e. d, is determined from the i-th user area in the user area cluster to the k-th area in the set S ∪ { S' }i,kThe determining process of (2) may specifically include:
and searching the shortest path from the ith user area in the user area cluster to the kth area in the set S { S' } by utilizing the Dijkstra algorithm.
Further, the content distribution network creation method in the present embodiment may further include the following steps S21 to S22; wherein,
step S21: if the user request on the first user area needs to be responded by the content distribution network, a server closest to the first user area is screened from all servers on the content distribution network and serves as a first priority server; the first user area is any user area in the user area cluster;
step S22: a user request on the first user zone is responded to with the first priority server.
That is, the embodiment of the present invention preferentially uses the server closest to a certain user area to provide the content distribution service for the user in the user area. It is understood that, in this embodiment, the server closest to the first user area may be an origin server or a backup server.
In addition, the content distribution network creation method in the present embodiment may further include the following steps S23 to S24; wherein,
step S23: in the process that the first priority server responds to the user request on the first user area, if the corresponding content distribution bandwidth capacity is larger than the preset maximum content distribution bandwidth capacity, the server closest to the first user area is screened from all the rest servers on the content distribution network and used as a second priority server; wherein, all the remaining servers are all the servers remaining after the first priority server is removed in the content distribution network;
step S24: the other remaining user requests on the first user zone are responded to with the second priority server.
That is, when the server closest to the first user area cannot satisfy the user request of the area, the server next closest to the area may be screened from the entire content distribution network to provide the content distribution service for other users in the area.
It should be noted that the maximum content distribution bandwidth capacity is a maximum content distribution bandwidth capacity allowed by each server in the content distribution network, and specifically includes:
in the formula, tuRepresenting the bandwidth requirements of all users on the u-th user area; a denotes the total number of all servers located on the content distribution network. That is, in this embodiment, the maximum content distribution bandwidth capacities of the source server and any backup server are:
in step S11 of the previous embodiment, the source server needs to be located in a user area of the user area cluster in advance. In this embodiment, the source server may be preferentially located on the central area of the user area cluster. By central region of a user area cluster is meant a region geographically located at or closest to the center of the overall content distribution network.
Further, the content distribution network creating method in this embodiment may further include the following steps S31 to S32:
step S31: if the target server needs to respond to the user request in the second user area, the transmission link with the shortest link length is screened out from the target transmission link set to serve as a first priority link; the target server is any one of all servers on the content distribution network, and the second user area is any one of user areas in the user area cluster; the target transmission link set is all transmission links between the target server and the second user area;
step S32: the control target server provides a content distribution service to the second user area through the first priority link in response to a user request on the second user area.
In addition, the content distribution network creation method in the present embodiment may further include the following steps S33 and S34; wherein,
step S33: in the process that a target server provides content distribution service to a second user area through a first priority link, if the bandwidth capacity which is transmitted on the current first priority link exceeds the preset maximum transmission capacity, a transmission link with the shortest link length is screened out from all the remaining transmission links on a target transmission link set to serve as a second priority link; wherein, all the remaining transmission links are all transmission links remaining after the first priority link is removed from the target transmission link set;
step S34: the control target server provides other remaining content distribution services to the second user zone over the second priority link in response to other remaining user requests on the second user zone.
It should be further noted that the technical solutions disclosed in the foregoing embodiments involve low computational complexity, and can be widely applied to building content distribution networks. Of course, in addition to the above-disclosed technical solutions, the embodiment of the present invention may adopt a network building method with higher computational complexity but more reasonable deployment to build a content distribution network, where the method specifically includes: predetermining a backup server cluster needing to be arranged and a user area cluster needing to be arranged, randomly allocating all backup servers in the backup server cluster to any user area in the user area cluster to obtain a corresponding server allocation strategy set, then calculating an objective function value corresponding to each server allocation strategy in the server allocation strategy set by using a predetermined objective function, screening a server allocation strategy with the minimum objective function value from the server allocation strategy set, determining the server allocation strategy as an optimal allocation strategy, and finally respectively arranging all backup servers in the backup server cluster in the user area cluster in the corresponding user area according to the corresponding relation between the backup servers and the user areas in the optimal allocation strategy, to form a content distribution network; wherein, the predetermined objective function is specifically:
wherein F represents an objective function value, C represents a maximum content distribution bandwidth capacity allowed by each server in the content distribution network, N represents a user area cluster, and N represents a maximum content distribution bandwidth capacityiA set of neighbor areas representing the ith user area in the user area cluster,indicating when a cluster of backup servers is presentThe total amount of bandwidth, L, transmitted over the link (i, j) during the distribution of the content to the u-th user area by the backup server assigned to the v-th user areaijDenotes the physical distance of the link (i, j), cfiberRepresenting the speed of light in the fiber, α representing the weighting factor.
In addition, the constraint conditions of the predetermined objective function include a first constraint condition, a second constraint condition, a third constraint condition, a fourth constraint condition, a fifth constraint condition, a sixth constraint condition, a seventh constraint condition, an eighth constraint condition, a ninth constraint condition, and a tenth constraint condition; wherein,
the first constraint is:
wherein,and v ≠ u;
the second constraint is:
wherein,and u ═ v;
the third constraint is:
λvu≤Rva, wherein,v ∈ N, and v ≠ O;
the fourth constraint is:
∑v∈Nλvu≥tuwherein
the fifth constraint is:
∑u∈Nλvuc is less than or equal to C, wherein,
the sixth constraint is:
wherein,
the seventh constraint is:
wherein,and, u ≠ v;
the eighth constraint is:
wherein,and, u ≠ v, j ∈ Ni；
The ninth constraint is:
wherein,and, u ≠ v, j ∈ Ni；
The tenth constraint is:
∑v ∈ N, and v ≠ ORv≤A-1；
In the formula,representing the total amount of bandwidth transmitted over the link (j, i) during the distribution of the content to the u-th user area by the backup server assigned to the v-th user area in the backup server cluster; lambda [ alpha ]vuThe total bandwidth corresponding to the situation that the backup server distributed to the vth user area in the backup server cluster distributes the content to the uth user area is represented; rvA binary variable for indicating the server allocation status on the vth user area, when the vth user area is allocated with a backup server, then RvIs 1, otherwise is 0; Δ represents a positive infinity number; o represents a user area where the source server is located; t is tuRepresenting the bandwidth requirements of all users on the u-th user area; m represents the maximum allowed transmission capacity on each link; d represents the maximum time delay allowed when the server distributes the content to the user area;a binary variable for indicating a state in which a link (i, j) is occupied during distribution of content to a u-th user area by the backup server assigned to the v-th user area, and when there is any content passing through the link (i, j) during distribution of content to the u-th user area by the backup server assigned to the v-th user areaIs 1, otherwise is 0; a denotes the total number of backup servers in the backup server cluster.
It will be appreciated that under the constraint of the above ten constraints, based on the above pre-conditionsPre-determined objective functionAn optimal allocation strategy can be obtained. Just in view of the high computational complexity of this method and the difficulty in practical application, the present invention is more prone to building a content distribution network by using the technical solution disclosed in the foregoing embodiments.
Finally, it should also be noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
The content distribution network creation method provided by the present invention is described in detail above, and a specific example is applied in the text to explain the principle and the implementation of the present invention, and the description of the above embodiment is only used to help understanding the method of the present invention and the core idea thereof; meanwhile, for a person skilled in the art, according to the idea of the present invention, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present invention.
Claims (8)
1. A content distribution network creation method, comprising:
step S11: the method comprises the steps that a backup server cluster needing to be arranged and a user area cluster needing to be arranged are determined in advance, and a source server is arranged in one user area of the user area cluster in advance;
step S12: repeatedly screening a user area from all user areas where servers are not arranged currently as a current area to be analyzed, and respectively calculating a target function value corresponding to each area to be analyzed by using a preset target function to obtain a current target function value set; wherein the preset objective function is:
F＝∑i∈N(mink∈S∪{s′}di,k)；
wherein F represents an objective function value; n represents the user area cluster; s represents a set for all user areas for which servers have been currently located; s' represents the screened region to be analyzed; di,kA path distance representing the shortest path from the i-th user area in the user area cluster to the k-th area in the set S ∪ { S' };
step S13: screening out an objective function value with the minimum value from the current objective function value set, and arranging any backup server which is not arranged in the backup server cluster in a user area corresponding to the objective function value;
step S14: step S12 is re-entered until all backup servers in the backup server cluster are installed to form the content distribution network.
2. The content distribution network creation method according to claim 1, wherein a determination process of a shortest path from an i-th user zone in the user zone cluster to a k-th zone in a set S £ > { S' }, includes:
and searching the shortest path from the ith user area in the user area cluster to the kth area in the set S.sup.u { S' } by utilizing a Dijkstra algorithm.
3. The content distribution network creation method according to claim 1, characterized by further comprising:
if the content distribution network is required to respond to the user request in the first user area, a server closest to the first user area is screened from all servers in the content distribution network and used as a first priority server; the first user area is any user area in the user area cluster;
responding to a user request on the first user zone with the first priority server.
4. The content distribution network creation method according to claim 3, characterized by further comprising:
in the process that the first priority server responds to the user request on the first user area, if the corresponding content distribution bandwidth capacity is larger than the preset maximum content distribution bandwidth capacity, the server closest to the first user area is screened from all the remaining servers on the content distribution network to serve as a second priority server; wherein, the all remaining servers are all servers remaining after the first priority server is removed in the content distribution network;
responding to other remaining user requests on the first user zone with the second priority server.
5. The content distribution network creation method according to claim 4, wherein the maximum content distribution bandwidth capacity is a maximum content distribution bandwidth capacity allowed for each server in the content distribution network, and specifically includes: sigmau∈ Ntu/A；
In the formula, tuRepresenting the bandwidth requirements of all users on the u-th user area; a denotes the total number of all servers located on the content distribution network.
6. The content distribution network creation method according to claim 1, wherein the process of placing a source server in one of the user areas in the user area cluster in advance comprises:
the source server is positioned on a central area of the user area cluster.
7. The content distribution network creation method according to any one of claims 1 to 6, characterized by further comprising:
if the target server needs to respond to the user request in the second user area, the transmission link with the shortest link length is screened out from the target transmission link set to serve as a first priority link; wherein the target server is any one of all servers on the content distribution network, and the second user area is any one of the user areas in the user area cluster; the target transmission link set is all transmission links between the target server and the second user area;
and controlling the target server to provide a content distribution service to the second user area through the first priority link so as to respond to a user request on the second user area.
8. The content distribution network creation method according to claim 7, characterized by further comprising:
in the process that the target server provides a content distribution service to the second user area through the first priority link, if the bandwidth capacity currently transmitted on the first priority link exceeds the preset maximum transmission capacity, selecting a transmission link with the shortest link length from all the remaining transmission links on the target transmission link set as a second priority link; wherein, all the remaining transmission links are all transmission links remaining after the first priority link is removed from the target transmission link set;
and controlling the target server to provide other remaining content distribution services to the second user area through the second priority link in response to other remaining user requests on the second user area.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610948884.2A CN106487910B (en) | 2016-10-26 | 2016-10-26 | A kind of content distributing network creation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610948884.2A CN106487910B (en) | 2016-10-26 | 2016-10-26 | A kind of content distributing network creation method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106487910A true CN106487910A (en) | 2017-03-08 |
| CN106487910B CN106487910B (en) | 2019-07-19 |
Family
ID=58273017
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610948884.2A Active CN106487910B (en) | 2016-10-26 | 2016-10-26 | A kind of content distributing network creation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106487910B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107147696A (en) * | 2017-04-07 | 2017-09-08 | 北京信息科技大学 | The method and apparatus that caching server is distributed in complex network |
| CN111479137A (en) * | 2020-04-16 | 2020-07-31 | 广州酷狗计算机科技有限公司 | Method and device for providing line address, server and storage medium |
| CN115631529A (en) * | 2022-12-16 | 2023-01-20 | 成方金融科技有限公司 | Face feature privacy protection method, face recognition method and device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103227839A (en) * | 2013-05-10 | 2013-07-31 | 网宿科技股份有限公司 | Management system for regional autonomy of content distribution network server |
| CN104022911A (en) * | 2014-06-27 | 2014-09-03 | 哈尔滨工业大学 | Content route managing method of fusion type content distribution network |
| US20150208291A1 (en) * | 2014-01-20 | 2015-07-23 | Samsung Electronics Co., Ltd. | Mme, local server, mme-local server interface, and data transmission method for optimized data path in lte network |
| CN105376112A (en) * | 2015-11-24 | 2016-03-02 | 清华大学 | Heterogeneous network resource allocation method under intermediate treatment restriction |
| CN105577714A (en) * | 2014-10-13 | 2016-05-11 | 中兴通讯股份有限公司 | Method and system for realizing content delivery network based on software defined network |
-
2016
- 2016-10-26 CN CN201610948884.2A patent/CN106487910B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103227839A (en) * | 2013-05-10 | 2013-07-31 | 网宿科技股份有限公司 | Management system for regional autonomy of content distribution network server |
| US20150208291A1 (en) * | 2014-01-20 | 2015-07-23 | Samsung Electronics Co., Ltd. | Mme, local server, mme-local server interface, and data transmission method for optimized data path in lte network |
| CN104022911A (en) * | 2014-06-27 | 2014-09-03 | 哈尔滨工业大学 | Content route managing method of fusion type content distribution network |
| CN105577714A (en) * | 2014-10-13 | 2016-05-11 | 中兴通讯股份有限公司 | Method and system for realizing content delivery network based on software defined network |
| CN105376112A (en) * | 2015-11-24 | 2016-03-02 | 清华大学 | Heterogeneous network resource allocation method under intermediate treatment restriction |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107147696A (en) * | 2017-04-07 | 2017-09-08 | 北京信息科技大学 | The method and apparatus that caching server is distributed in complex network |
| CN107147696B (en) * | 2017-04-07 | 2019-11-01 | 北京信息科技大学 | The method and apparatus of cache server are distributed in complex network |
| CN111479137A (en) * | 2020-04-16 | 2020-07-31 | 广州酷狗计算机科技有限公司 | Method and device for providing line address, server and storage medium |
| CN111479137B (en) * | 2020-04-16 | 2022-02-18 | 广州酷狗计算机科技有限公司 | Method and device for providing line address, server and storage medium |
| CN115631529A (en) * | 2022-12-16 | 2023-01-20 | 成方金融科技有限公司 | Face feature privacy protection method, face recognition method and device |
| CN115631529B (en) * | 2022-12-16 | 2023-04-28 | 成方金融科技有限公司 | Face feature privacy protection method, face recognition method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106487910B (en) | 2019-07-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108965485B (en) | Container resource management method and device and cloud platform | |
| CN107465708B (en) | CDN bandwidth scheduling system and method | |
| CN112073542B (en) | Fog node scheduling method and device, computer equipment and storage medium | |
| CN106487910B (en) | A kind of content distributing network creation method | |
| JP6440284B2 (en) | Dissemination information processing method, apparatus and system | |
| CN108121512A (en) | A kind of edge calculations services cache method, system, device and readable storage medium storing program for executing | |
| CN105471759A (en) | Network traffic scheduling method and apparatus for data centers | |
| CN103532873B (en) | flow control policy applied to distributed file system | |
| CN109947551B (en) | Multi-turn task allocation method, edge computing system and storage medium thereof | |
| CN107707382A (en) | A kind of intelligent dispatching method and device | |
| CN106685762B (en) | Data back-to-source scheduling method and device and CDN (content delivery network) | |
| CN104320353B (en) | A kind of method and apparatus of station address management | |
| CN110995611A (en) | Distributed current limiting method for high concurrency request | |
| CN105183561A (en) | Resource distribution method and resource distribution system | |
| CN101427533A (en) | Broadband access network capacity management | |
| CN107528924B (en) | Distributed cluster metadata service deployment method and system | |
| WO2005018254A3 (en) | Provision of services by reserving resources in a communications network having resource management according to policy rules | |
| CN107135056B (en) | Anycast service resource allocation method for reducing frequency spectrum fragments and time delay | |
| CN113315836A (en) | File access request scheduling method and device, electronic equipment and storage medium | |
| CN101795233A (en) | Method and equipment for controlling quality of service (QoS) | |
| CN104065737B (en) | Determine the method and system of service node deployment scheme | |
| CN102088405A (en) | Status selection-based method and system for controlling network bandwidth | |
| Huang et al. | A hierarchical pseudonyms management approach for software-defined vehicular networks | |
| CN115562841B (en) | Cloud video service self-adaptive resource scheduling system and method | |
| Destounis et al. | Slice-based column generation for network slicing |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |