CN107147696B - The method and apparatus of cache server are distributed in complex network - Google Patents
The method and apparatus of cache server are distributed in complex network Download PDFInfo
- Publication number
- CN107147696B CN107147696B CN201710225039.7A CN201710225039A CN107147696B CN 107147696 B CN107147696 B CN 107147696B CN 201710225039 A CN201710225039 A CN 201710225039A CN 107147696 B CN107147696 B CN 107147696B
- Authority
- CN
- China
- Prior art keywords
- node
- cache server
- dummy
- threshold
- shrinkable
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 24
- 239000011800 void material Substances 0.000 claims 2
- 230000005540 biological transmission Effects 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 230000008878 coupling Effects 0.000 description 2
- 238000010168 coupling process Methods 0.000 description 2
- 238000005859 coupling reaction Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000008602 contraction Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000000151 deposition Methods 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
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/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/90—Buffering arrangements
- H04L49/9005—Buffering arrangements using dynamic buffer space allocation
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The method and apparatus that the present invention provides a kind of to distribute cache server in complex network.The method of cache server is distributed in complex network, which comprises (a) selects start node；(b) select the neighbor node of the start node as shrinkable node；(c) the sum of the start node and flow of shrinkable node are calculated；If (d) the sum of calculated flow is greater than or equal to first threshold, the start node and shrinkable node are provided for the corporations of distribution cache server, wherein first threshold is related to the capacity of cache server.Buffer is adaptively distributed by the capacity based on each node in network, can be while guaranteeing the service quality of each node, the phenomenon that avoiding the occurrence of service redundant.
Description
Technical field
The method and apparatus that the present invention relates to a kind of to distribute cache server in complex network are more particularly related to
A kind of method and apparatus that the capacity in complex network based on cache server adaptively distributes cache server.
Background technique
With the development of internet technology, people can access various contents whenever and wherever possible, for example, webpage, music and stream
Media.However, with the sharp increase of user, the amount of access of network also rapid growth.The increase of network access quantity is to backbone network
Bring huge pressure.However, the information resources of actually 80% internet meeting repeated accesses 20%.
In order to mitigate the pressure of backbone network, content distributing network (CDN) is proposed.Content distributing network refers to by will be former
Site contents are issued to the network rack for disposing the application-oriented layer of hot spot apart from the closer cache server of user and in a distributed manner
Structure.The performance of content distributing network is heavily dependent on the deployment of cache server.If cache server deployment is not filled
Point, it will cause service quality declines.If cache server is excessively concentrated, it will cause service redundants and cost to improve.
It is therefore desirable to be able to which reasonably deployment is used for the method and dress of the cache server of content distribution in complex network
It sets.
Summary of the invention
Exemplary embodiment of the present invention is to provide a kind of method and dress for distributing cache server in complex network
It sets, the phenomenon that so as to avoid the occurrence of service redundant while guaranteeing the service quality of each node.
The one side of an exemplary embodiment of the present invention provides one kind and distributes cache server in complex network
Method, which comprises (a) select start node；(b) select the neighbor node of the start node as shrinkable section
Point；(c) the sum of the start node and flow of shrinkable node are calculated；If (d) the sum of calculated flow is greater than or waits
In first threshold, then the start node and shrinkable node are provided for the corporations of distribution cache server, wherein the
One threshold value is related to the capacity of cache server.
Selectively, the step of selecting start node can include: select the node of maximum flow as start node.
Selectively, the step of selecting start node can include: by the section of the node of maximum flow and the maximum flow
The most node of the shared neighbor node of point and the node more with the shared neighbor node quantity time of the node of the maximum flow merge
For dummy node, and start node is set by the dummy node.
Selectively, the step of neighbor node of the start node is as shrinkable node is selected can include: from described
It is selected in the neighbor node of start node with the highest node of start node similarity as shrinkable node.
Selectively, if the method may also include that the sum of (e) calculated flow is less than first threshold, by institute
It states start node and shrinkable node merges into dummy node, set start node for the dummy node, and execute step
(b)。
Selectively, step (e) can include: determine in complex network with the presence or absence of remaining node；If complex network
In there are remaining nodes, then for remaining node execute step (b).
Selectively, step (e) may also include that if there is no remaining nodes in complex network, be included within institute
Each node in dummy node is stated to be incorporated in the corporations adjacent with each node.
Selectively, each node being included in the dummy node is incorporated to the corporations adjacent with each node
In step can include: determination include the sum of flow of each node in the dummy node whether be less than second threshold,
Wherein, second threshold is less than first threshold and related to the capacity of cache server；If including in the dummy node
The sum of flow of each node is less than second threshold, then each node being included in the dummy node be incorporated to it is described each
The adjacent corporations of a node；If including that the sum of flow of each node in the dummy node is greater than or equal to the second threshold
Value, the then node being included in the dummy node are provided for the corporations of distribution cache server.
Selectively, step (d) can include: determine in complex network with the presence or absence of remaining node；If complex network
In there are remaining nodes, then for remaining node execute step (a).
The another aspect of an exemplary embodiment of the present invention provides one kind and distributes buffer service in complex network
The device of device, described device include: selecting unit, select start node and select the neighbor node of the start node as can
Shrink node；Computing unit calculates the sum of the start node and the flow of shrinkable node；Control unit, if calculated
The sum of flow be greater than or equal to first threshold, then the start node and shrinkable node are provided for distribution caching clothes
The corporations of business device, wherein first threshold is related to the capacity of cache server.
It, can be based on each node in network by using the method and apparatus of an exemplary embodiment of the present invention
Capacity adaptively distribute buffer, to avoid the occurrence of service redundant while guaranteeing the service quality of each node
The phenomenon that.
Part in following description is illustrated into the other aspect and/or advantage of present general inventive concept, there are also one
Dividing will be apparent by description, or can learn by the implementation of present general inventive concept.
Detailed description of the invention
By below with reference to be exemplarily illustrated an example attached drawing carry out description, above and other purpose of the invention and
Feature will become apparent, in which:
Fig. 1 is the method that cache server is distributed in complex network for showing an exemplary embodiment of the present invention
Flow chart；
Fig. 2 and Fig. 3 is the diagram for showing the topological structure of complex network of an exemplary embodiment of the present invention；
Fig. 4 is the device that cache server is distributed in complex network for showing an exemplary embodiment of the present invention
Block diagram.
Throughout the drawings, identical label, which is understood to be, indicates identical component, component and structure.
Specific embodiment
Now will be referring in particular to its exemplary exemplary embodiment be shown in the accompanying drawings, in the accompanying drawings, identical label begins
Similar element is indicated eventually.In this respect, the present exemplary embodiment can have different form, should not be construed as limited to explain herein
The description stated.Correspondingly, the various aspects of this specification are only explained below by exemplary embodiment is described with reference to.
About term as used herein, selected as much as possible in the case where considering the function in exemplary embodiment most wide
The general term used；However, these terms can change according to the appearance of the intention of those skilled in the art, legal precedent or new technology
Become.Some terms as used herein can arbitrarily be selected by applicant.In this case, these terms will be below by specifically fixed
Justice.Correspondingly, specific term as used herein should be understood based on its unique meaning and the whole context of this design.
It will be further understood that when using the terms "include", "comprise" and " having " herein, unless otherwise defined,
The term illustrates the presence of cited element, but is not excluded for the presence or addition of other elements.In addition, art as used herein
Language " unit " and " module " indicate the unit for handling at least one functions or operations, wherein the unit can be by hardware, soft
The combination of part or hardware and software is realized.
Exemplary embodiment is specifically described below with reference to accompanying drawings, so that those of ordinary skill in the art can be easily real
Existing present inventive concept.However, present inventive concept can be realized in many different ways, and should not be considered as limited to set forth herein
Exemplary embodiment.In addition, being shown the part unrelated with the description of exemplary embodiment is omitted in the accompanying drawings with being explicitly described
Example property embodiment, similar label will indicate similar element throughout the specification.
Fig. 1 is the method that cache server is distributed in complex network for showing an exemplary embodiment of the present invention
Flow chart.
Hereinafter, by being described with the example that content distributing network (CDN) is complex network.It should be understood, however, that according to this
The method and apparatus of the exemplary embodiment of invention is equally applicable to other kinds of complex network, for example, information centre's net
Network etc..
It, can be from including selecting start node in multiple nodes in complex network in step S101.It is according to the present invention
The node of maximum flow can be selected as start node by traversal whole network by exemplary embodiment.It is according to the present invention
Another exemplary embodiment may be selected arbitrary node, and the node of maximum flow in the preset range of the arbitrary node selected
For start node.
It in accordance with an alternative illustrative embodiment of the present invention, can be by the node of the maximum flow in network and the maximum flow
Node share the most node of neighbor node and share the more node of neighbor node quantity time with the node of the maximum flow and close
It and is dummy node, and set start node for the dummy node.More than two nodes are merged into a dummy node
The node contraction being referred to alternatively as in corporations.
Then, in step S103, the neighbor node of start node may be selected as shrinkable node.When there are it is multiple with it is first
When the adjacent neighbor node of beginning node, it can will be selected as initially in multiple neighbor nodes with the highest node of start node similarity
The shrinkable node of node.
Here, the similarity between node can be defined by following equation 1.
[equation 1]
Wherein, KiAnd KjThe degree of node i, j, N can be respectively indicatedijIndicate the quantity for the neighbor node that node i and j share.
Here, the degree of node can be defined as the quantity for the neighbor node connecting with the node.
An exemplary embodiment of the present invention, can be first by the node of the maximum flow in network and the maximum flow
Node share the most node of neighbor node and share the more node of neighbor node quantity time with the node of the maximum flow and close
And for dummy node and start node is set by the dummy node, and then select highest with the similarity of the start node
Node is as shrinkable node.In this way, similarity calculation institute can be effectively reduced by merging three nodes in the initial step
The operand of need and the topological structure for keeping former network.
In step S105, the sum of start node and the flow of shrinkable node can be calculated.In step S107, it may be determined that calculate
Whether the sum of flow out is greater than or equal to first threshold.
It, can be by start node and can in step S111 if the sum of calculated flow is greater than or equal to first threshold
Shrink the corporations that node is provided for distribution cache server.An exemplary embodiment of the present invention, first threshold and slow
The capacity for depositing server is related.For example, first threshold Φ=β × Ω, wherein β is the upper limit factor, and Ω is the appearance of cache server
Amount.In general, β can be set to the value between 0.6 to 1.
It, can be by start node and shrinkable section if the sum of calculated flow is less than first threshold in step S109
Point merges into dummy node.Here, union operation, which refers to using dummy node, substitutes the start node and shrinkable node,
By the dummy node with and the start node and the adjacent node of shrinkable node be connected.Exemplary implementation according to the present invention
Example can keep as far as possible former net by selecting the highest neighbor node of similarity as shrinkable node and merging
In the case where the topological structure of network, the corporations for distributing cache server are marked off.
Fig. 2 shows the network topology structures of an exemplary embodiment of the present invention.Assuming that the network node D in Fig. 2
For maximum flow node and be selected as start node, and node B is that the most node of neighbor node, section are shared with node D
Point A is that the more node of neighbor node time is shared with node D.An exemplary embodiment of the present invention, can by node D, node B and
Node A merges into dummy node V, and the network topology structure after merging is as shown in Figure 3.It can set dummy node V to just
Beginning node.Assuming that node F is and the highest neighbor node of node V similarity, that is, node F is the shrinkable node of node V.Such as
The sum of flow of fruit node F and node V is greater than or equal to first threshold, then node A, node B, node D and node F can be arranged
For the corporations for distributing cache server.If the sum of flow of node F and node V is less than first threshold, can be by node F
Dummy node V ' is merged into node V, and then selects the highest neighbor node of similarity as can receive for dummy node V '
Casing coupling point.
In step S115, it may be determined that with the presence or absence of the corporations being not configured to for distributing cache server in complex network
Remaining node.If it is determined that there are remaining nodes in complex network, then in step S117, set dummy node to just
Beginning node, and return to step S103, that is, select the neighbor node of the start node of setting as shrinkable node.
An exemplary embodiment of the present invention can be iteratively performed step S103, step S105, step S107, step
S109, step S115 and step S117 are until the sum of calculated flow is greater than first threshold or remaining node is not present.
After start node and shrinkable node are provided for the corporations of distribution cache server by step S111, In
Step S113, it may be determined that with the presence or absence of the remaining section for being not configured to the corporations for distributing cache server in complex network
Point.If there are remaining node, return step S101 in complex network, that is, reselect initial section from remaining node
Point.
Specifically, start node (step S101) can be reselected from remaining node.It is according to the present invention exemplary
Embodiment can select the node of maximum flow as start node from remaining node, to be arranged for remaining node
For distributing the corporations of cache server.It in accordance with an alternative illustrative embodiment of the present invention, can be by the flow in remaining node
The node of maximum node and the maximum flow shares the most node of neighbor node and is total to the node of the maximum flow
The node for having neighbor node quantity time more merges into dummy node, and sets start node for the dummy node.
An exemplary embodiment of the present invention, return step S115 then can will include if there is no remaining node
Each node in dummy node is incorporated in the corporations adjacent with each node.
Specifically, if there is no remaining node, then in step S119, it may be determined that including each in dummy node
Whether the sum of flow of node is less than second threshold.Second threshold is less than first threshold and related to the capacity of cache server.
For example, second thresholdWherein, α is the lower limit factor, and Ω is that cache server services saturation value.In general, can be by α
The value being set as between 0 to 0.5.
It, will in step S121 if including that the sum of flow of each node in dummy node is less than second threshold
The corporations adjacent with each node are incorporated to including each node in dummy node.If including in dummy node
The sum of flow of each node is greater than or equal to second threshold, then sets in the node that step S123 can be included in dummy node
It is set to the corporations for distributing cache server.
Buffer is adaptively distributed by the capacity based on each node in network, can guarantee each node
While service quality, the phenomenon that avoiding the occurrence of service redundant.
Fig. 4 shows the device 400 that cache server is distributed in complex network of an exemplary embodiment of the present invention
Block diagram.
Referring to Fig. 4, the device 400 for distributing cache server includes selecting unit 401, computing unit 403 and control
Unit 405.
An exemplary embodiment of the present invention, selecting unit 401 may be selected start node and select the start node
Neighbor node as shrinkable node.For example, selecting unit 401 can be from including selecting in multiple nodes in complex network
Start node.As an example, the node of maximum flow can be determined as initially saving by selecting unit 401 by traversal whole network
Point.As another example, selecting unit 401 may be selected arbitrary node, and by maximum flow in the preset range of the arbitrary node
Node be determined as start node.
In accordance with an alternative illustrative embodiment of the present invention, selecting unit 401 can by the node of the maximum flow in network, with
The node of the maximum flow shares the most node of neighbor node and shares neighbor node quantity time with the node of the maximum flow
More nodes merges into dummy node, and sets start node for the dummy node.In this way, by merging in the initial step
Three nodes, operand needed for similarity calculation can be effectively reduced and the topological structure for keeping former network.
An exemplary embodiment of the present invention, the neighbor node conduct that start node may be selected in selecting unit 401 can receive
Casing coupling point.When there are multiple adjacent with start node neighbor nodes, selecting unit 401 can will in multiple neighbor nodes and just
The beginning highest node of node similarity is selected as the shrinkable node of start node.Since the calculation method to similarity carries out
Description, therefore no longer Ao Shu herein.
In accordance with an alternative illustrative embodiment of the present invention, it is preferable that selecting unit 401 can first by the flow in network most
Big node, the node most with the shared neighbor node of node of the maximum flow and the shared neighbours of node with the maximum flow
The more node of number of nodes time merges into dummy node and sets start node for the dummy node, and then selects first with this
The highest node of the similarity of beginning node is as shrinkable node.An exemplary embodiment of the present invention, it is similar by selecting
Highest neighbor node is spent as shrinkable node and is merged, it can be in the feelings for the topological structure for keeping former network as far as possible
Under condition, the corporations for distributing cache server are marked off.
Computing unit 403 can calculate the sum of start node and the flow of shrinkable node, and by the sum of calculated flow
It is sent to control unit 405.Computing unit 403 can also calculate the sum of the flow including each node in dummy node.
Control unit 405 can determine whether the sum of calculated flow is greater than or equal to first threshold.If calculated
The sum of flow is greater than or equal to first threshold, then start node and shrinkable node can be provided for point by control unit 405
Corporations with cache server.Then, control unit 405 can determine to whether there is in complex network and be not configured to for distributing
The remaining node of the corporations of cache server.If there are remaining node in complex network, selecting unit 401 is calculated
Unit 403 and control unit 405 are directed to remaining node and execute the processing for marking off the corporations for distributing cache server.
In accordance with an alternative illustrative embodiment of the present invention, it if the sum of calculated flow is less than first threshold, controls
The start node and shrinkable node can be merged into dummy node by unit 405.At this point, control unit 405 can determine complexity
With the presence or absence of the remaining node for being not configured to the corporations for distributing cache server in network.If it is determined that complex network
In there are remaining node, then dummy node is set start node by control unit 405, and control selections unit 401 is from surplus
Select the neighbor node of the start node of setting as shrinkable node in remaining node.For example, the controllable choosing of control unit 405
Unit 401 is selected to select with the highest node of dummy node similarity of setting as shrinkable node.
That is, selecting unit 401, computing unit 403 and control unit 405 can be held for the node in complex network
Row is for marking off the iterative processing of the corporations for distributing cache server until there is no remaining nodes.
If the sum of calculated flow is less than first threshold and remaining node is not present, control unit 405 can be incited somebody to action
It is incorporated to including each node in dummy node in the corporations adjacent with each node.
Specifically, if including that there is no residues in the case that the sum of flow in dummy node is less than first threshold
Node, control unit 405 can determine including whether the sum of flow of each node in dummy node is less than second threshold.
If including that the sum of flow of each node in dummy node is less than second threshold, control unit 405 can be included within
Each node in dummy node is incorporated to the corporations adjacent with each node.If including each section in dummy node
The sum of flow of point is greater than or equal to second threshold, then the node that control unit 405 can be included in dummy node is set as
For distributing the corporations of cache server.
As described above, by using the method and apparatus of an exemplary embodiment of the present invention, it can be based in network
The capacity of each node adaptively distribute buffer, to be avoided out while guaranteeing the service quality of each node
The phenomenon that existing service redundant.
In addition, other exemplary embodiments can also by medium (for example, computer-readable medium)/on computer can
Code/instruction is read to realize, realizes any of above exemplary embodiment to control at least one processing element.Medium can be with permission
Any medium of storage and/or the transmission of computer-readable code is corresponding.Using including recording medium (such as, magnetic storage medium
(for example, ROM, floppy disk, hard disk etc.) and optical recording medium (for example, CD-ROM or DVD)) and transmission medium (such as, internet biography
Defeated medium) medium example, computer-readable code can be recorded on medium in various ways/transmit.Therefore, medium
Can be according to the such definition for including or carrying signal or information of one or more exemplary embodiments with it is measurable
Structure such as carries the device of bit stream.Medium can also be distributed network, so that computer-readable code is in a distributed manner
Mode is by storage/transmission and execution.In addition, processing element may include processor or computer processor, processing element can be distributed
And/or it is included in single device.
It should be understood that the exemplary embodiments described herein should be only considered with descriptive sense, rather than in order to limit
The purpose of system.The description of feature and aspect in each exemplary embodiment, which should be usually considered, can be used for other examples
Other similar features or aspect in property embodiment.Although describing one or more exemplary embodiments with reference to attached drawing,
It, can but those skilled in the art will appreciate that in the case where not departing from the spirit and scope being defined by the claims
Make various changes in form and details.
Claims (8)
1. a kind of method for distributing cache server in complex network, which comprises
(a) start node is selected；
(b) select the neighbor node of the start node as shrinkable node；
(c) the sum of the start node and flow of shrinkable node are calculated；
If (d) the sum of calculated flow is greater than or equal to first threshold, the start node and shrinkable node are set
It is set to the corporations for distributing cache server, wherein first threshold is related to the capacity of cache server,
Wherein, it selects the step of start node to include: to share neighbours by the node of maximum flow, with the node of the maximum flow
The most node of node and the node more with the shared neighbor node quantity time of node of the maximum flow merge into dummy node,
And start node is set by the dummy node.
2. the method for claim 1, wherein selecting the neighbor node of the start node as the step of shrinkable node
It suddenly include: to be selected from the neighbor node of the start node with the highest node of start node similarity as shrinkable
Node.
3. the method as described in claim 1, the method also includes:
If (e) the sum of calculated flow is less than first threshold, the start node and shrinkable node are merged into void
Quasi- node, sets start node for the dummy node, and execute step (b).
4. method as claimed in claim 3, wherein step (e) includes:
It determines in complex network with the presence or absence of remaining node；
If there are remaining nodes in complex network, step (b) is executed for remaining node.
5. method as claimed in claim 4, wherein step (e) further include:
If remaining node is not present in complex network, each node being included in the dummy node is incorporated to and institute
It states in the adjacent corporations of each node.
6. method as claimed in claim 5, wherein each node being included in the dummy node be incorporated to it is described each
Step in the adjacent corporations of a node includes:
Determination includes whether the sum of flow of each node in the dummy node is less than second threshold, wherein the second threshold
Value is less than first threshold and related to the capacity of cache server；
If including that the sum of flow of each node in the dummy node is less than second threshold, it is included within the void
Each node in quasi- node is incorporated to the corporations adjacent with each node；
If including that the sum of flow of each node in the dummy node is greater than or equal to second threshold, it is included within
Node in the dummy node is provided for the corporations of distribution cache server.
7. the method for claim 1, wherein step (d) includes:
It determines in complex network with the presence or absence of remaining node；
If there are remaining nodes in complex network, step (a) is executed for remaining node.
8. a kind of device for distributing cache server in complex network, described device include:
Selecting unit, shared by the node of maximum flow, with the node of the maximum flow the most node of neighbor node and with
The node of the maximum flow shares the more node of neighbor node quantity time and merges into dummy node, and the dummy node is arranged
For start node and select the neighbor node of the start node as shrinkable node；
Computing unit calculates the sum of the start node and the flow of shrinkable node；
Control unit, if the sum of calculated flow is greater than or equal to first threshold, by the start node and shrinkable
Node is provided for the corporations of distribution cache server, wherein first threshold is related to the capacity of cache server.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710225039.7A CN107147696B (en) | 2017-04-07 | 2017-04-07 | The method and apparatus of cache server are distributed in complex network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710225039.7A CN107147696B (en) | 2017-04-07 | 2017-04-07 | The method and apparatus of cache server are distributed in complex network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107147696A CN107147696A (en) | 2017-09-08 |
| CN107147696B true CN107147696B (en) | 2019-11-01 |
Family
ID=59774283
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710225039.7A Expired - Fee Related CN107147696B (en) | 2017-04-07 | 2017-04-07 | The method and apparatus of cache server are distributed in complex network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107147696B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110401731B (en) * | 2019-07-25 | 2024-05-07 | 北京百度网讯科技有限公司 | Method and apparatus for distributing content distribution nodes |
| CN113098917B (en) * | 2019-12-23 | 2024-06-04 | 华为云计算技术有限公司 | Method for migrating functional nodes and related equipment |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1557086A (en) * | 2002-01-18 | 2004-12-22 | �Ҵ���˾ | Master node selection in clustered node configurations |
| CN102722530A (en) * | 2012-05-17 | 2012-10-10 | 北京理工大学 | Community detection method in complex network |
| CN103546530A (en) * | 2013-06-20 | 2014-01-29 | 江苏大学 | Method and system for balancing loads on peer-to-peer network nodes on basis of group resource management |
| CN105430062A (en) * | 2015-11-04 | 2016-03-23 | 国家电网公司 | Mobile P2P network data prefetching method based on interest-relevance |
| CN106127595A (en) * | 2016-07-18 | 2016-11-16 | 安徽大学 | A kind of community structure detection method based on positive and negative side information |
| CN106487910A (en) * | 2016-10-26 | 2017-03-08 | 苏州大学 | A kind of content distributing network creation method |
-
2017
- 2017-04-07 CN CN201710225039.7A patent/CN107147696B/en not_active Expired - Fee Related
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1557086A (en) * | 2002-01-18 | 2004-12-22 | �Ҵ���˾ | Master node selection in clustered node configurations |
| CN102722530A (en) * | 2012-05-17 | 2012-10-10 | 北京理工大学 | Community detection method in complex network |
| CN103546530A (en) * | 2013-06-20 | 2014-01-29 | 江苏大学 | Method and system for balancing loads on peer-to-peer network nodes on basis of group resource management |
| CN105430062A (en) * | 2015-11-04 | 2016-03-23 | 国家电网公司 | Mobile P2P network data prefetching method based on interest-relevance |
| CN106127595A (en) * | 2016-07-18 | 2016-11-16 | 安徽大学 | A kind of community structure detection method based on positive and negative side information |
| CN106487910A (en) * | 2016-10-26 | 2017-03-08 | 苏州大学 | A kind of content distributing network creation method |
Non-Patent Citations (4)
| Title |
|---|
| Communicability graph and community structures in complex networks;ErnestoEstrada等;《Applied Mathematics and Computation》;20090815;全文 * |
| Detecting community structure in complex networks via node similarity;YingPanabDe等;《Physica A: Statistical Mechanics and its Applications》;20100715;全文 * |
| Identifying and evaluating community structure in complex networks;KarstenSteinhaeuser等;《Pattern Recognition Letters》;20100401;全文 * |
| NCSS: 一种快速有效的复杂网络社团划分算法;韩忠明等;《中国科学》;20161231;正文第页第12-15行，第435页，第436页第1-11行 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107147696A (en) | 2017-09-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8495013B2 (en) | Distributed storage system and method for storing objects based on locations | |
| US11296940B2 (en) | Centralized configuration data in a distributed file system | |
| CN105515864B (en) | Container resource-adaptive method of adjustment and system | |
| US6477522B1 (en) | Dynamic performance based server selection | |
| US9158460B2 (en) | Selecting data nodes using multiple storage policies in cloud storage system | |
| US11005921B2 (en) | Sharing a data management policy with a load balancer | |
| CN107302561B (en) | A kind of hot spot data Replica placement method in cloud storage system | |
| CN104050102B (en) | Object storage method and device in a kind of telecommunication system | |
| US9882775B1 (en) | Dependent network resources | |
| CN107147696B (en) | The method and apparatus of cache server are distributed in complex network | |
| US20150215379A1 (en) | Distributed processing device and distributed processing system as well as distributed processing method | |
| Wu et al. | Cloud-based image processing system with priority-based data distribution mechanism | |
| JP2009259007A (en) | Distributed storage method, distributed storage system and distributed storage device | |
| CN102142032A (en) | Method and system for reading and writing data of distributed file system | |
| Mohammadi et al. | Data replication mechanisms in the peer‐to‐peer networks | |
| JP4573732B2 (en) | Servant device | |
| CN107810501A (en) | Heterogeneous cache is filled | |
| CN107493309A (en) | File wiring method and device in a kind of distributed system | |
| CN105897828A (en) | Node cache mechanism determining method and system | |
| KR20190055023A (en) | Personalized topic network service method with tree structure of hashtag and system therefor | |
| CN115134410A (en) | Edge collaboration service field dividing method and device, electronic equipment and storage medium | |
| CN105897456A (en) | Content distributing method and system | |
| US20090006322A1 (en) | Method for Handling Web Search Results to Be Displayed on a Browser | |
| JP5487420B2 (en) | File duplication necessity determination method, communication apparatus, computer program, and peer-to-peer communication system | |
| Drebinger et al. | Reconstruct a distributed co-occurrence graph in a P2P network without overhead |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| EE01 | Entry into force of recordation of patent licensing contract | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20170908 Assignee: Beijing jiavalue Technology Trade Co.,Ltd. Assignor: BEIJING INFORMATION SCIENCE AND TECHNOLOGY University Contract record no.: X2020990000702 Denomination of invention: Method and device for allocating cache server in complex network Granted publication date: 20191101 License type: Common License Record date: 20201223 |
|
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20191101 |