CN106533733A - CCN collaborative cache method and device based on network clustering and Hash routing - Google Patents

CCN collaborative cache method and device based on network clustering and Hash routing Download PDF

Info

Publication number
CN106533733A
CN106533733A CN201610787121.4A CN201610787121A CN106533733A CN 106533733 A CN106533733 A CN 106533733A CN 201610787121 A CN201610787121 A CN 201610787121A CN 106533733 A CN106533733 A CN 106533733A
Authority
CN
China
Prior art keywords
node
cluster
content
cache
egress
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
Application number
CN201610787121.4A
Other languages
Chinese (zh)
Other versions
CN106533733B (en
Inventor
李唯源
李杨
辛永辉
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Institute of Information Engineering of CAS
Original Assignee
Institute of Information Engineering of CAS
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Institute of Information Engineering of CAS filed Critical Institute of Information Engineering of CAS
Priority to CN201610787121.4A priority Critical patent/CN106533733B/en
Publication of CN106533733A publication Critical patent/CN106533733A/en
Application granted granted Critical
Publication of CN106533733B publication Critical patent/CN106533733B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/12—Discovery or management of network topologies
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14—Network analysis or design
    • H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
    • 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/46—Cluster building
    • 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/74—Address processing for routing
    • H04L45/742—Route cache; Operation thereof

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer And Data Communications (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention provides a CCN collaborative cache method and device based on network clustering and Hash routing. The method comprises the steps that the information of each node and the egress traffic of an egress node in a topology structure are acquired; a network clustering model is generated according to the node information and the egress traffic of the egress node; the node cluster information is calculated according to the network clustering model; when the egress node receives a content request, a corresponding node cluster is judged; a corresponding intra-cluster cache node is acquired according to the node cluster information and a content request; the content request is forwarded to the intra-cluster cache node; and if the requested content exists in the intra-cluster cache node, the content is returned. According to the CCN collaborative cache method and device based on network clustering and Hash routing, the network clustering model is established for nodes in the topology structure; a simulation annealing algorithm is used to acquire the node cluster; a Hash algorithm is used to find the intra-cluster cache node; and in the process of content request forwarding, routing and cache are jointly considered to ensure efficient content distribution.

Description

The CCN collaboration caching methods being route based on network cluster dividing and Hash and device
Technical field
The present invention relates to networking technology area, more particularly to a kind of CCN collaborations based on network cluster dividing and Hash route are slow Deposit method and device.
Background technology
Growing network size and user's request bring lot of challenges to internet, wherein with content of multimedia Growth, current Generation Internet exposes its inefficiencies in content distribution.User generally more concerned with their demands what Content, rather than the position of these contents, existing communication pattern end to end therewith and are mismatched.How from network structure, The aspect such as protocol architecture and service mode tackles these challenges, will become important directions of future network research.In content Heart network (CCN, Content Centric Network) is more significant a solution in many research, and it is one The brand-new network architecture based on content is planted, its main difference is based on the name of content, the road based on content name By with embedded caching (In-network Caching) etc..
In CCN, the built-in store function of router, for caching the packet (Data) of process, to accelerate other use The response time of family access cache packet, while the flow in network can be reduced.When a router receives user's request Interest bag (Interest), carries out longest prefix match lookup using name, has three key data structures to complete forwarding：CS (Content Store)、PIT(Pending Interest Table)、FIB(Forwarding Interest Base)。CS Can the bag of Buffer forwarding for a long time as far as possible, so that other consumers use.The interest bag that PIT records have been forwarded, be Allow the packet of response to reach its requestor.The FIB of the similar IP of FIB.When an interest bag is reached, CS is matched first, such as Fruit has, then respond and abandon interest bag, and secondly matching PIT, finally matches FIB, abandon if not matching.When packet is arrived Reach, then need to decide whether to be buffered in router CS according to cache policy.
There are two problems demands to solve in CCN designs：How router judges whether data cached bag；If router does not have Have and meet how interest bag forwards the interest bag to neighbor node.The cache decision of CCN and forwarding decision are broadly divided into two at present Class：Along road (On-path) and disengaging path (Off-path).Along road, caching means that packet is stored on request path. Cache decision LCE (Leave Copy Everywhere) of CCN acquiescences is exactly along road cache policy, when the content of request is returned When, all nodes on the way all cache the copy of content, it is clear that this mode causes to cache redundancy, reduce spatial cache and utilize Rate.Even if researchers propose some can reduce cache redundancy along road buffering scheme, such as select a certain on path Individual node or node set are cached, or determine the priority of cache contents, but these schemes pair according to content popularit The raising of network performance is than relatively limited.In addition, interest bag is typically forwarded to neighbor node in the way of flooding, request is hit and is " by chance "；If joint considers the forwarding strategy that caching is placed, the retransmission protocol for needing some complicated caches section to interact Storage information between point, these can all reduce network performance.
Conversely, Off-path cache decisions are then by content caching to specified node according to predefined rule, interest Wrap and forwarded to specified node according to identical rule, it is clear that Off-path cachings can make full use of spatial cache, significantly carry High network hit rate.Hash route (Hash-routing) is a solution for wherein projecting the most, and this motion is also main Concern Hash route, will Hash route technology be incorporated in CCN, by hash function by content designator be mapped to caching section Point, and cache decision and request forwarding are united, optimize cyberspace service efficiency, maximize cache hit rate.
Although CCN can greatly improve cache hit rate after introducing Hash route technology, this is to be surrounded by need with interest More multi-hop to be forwarded is just hit as cost, and then is caused to download link load in time delay and domain and increased.As shown in figure 4, Assume couple in router R8Receive the request to content A (interest bag), usual R8To can ask along shortest path R7-R4-R9To Egress router R10Forwarding, obtains the content of request from respective server.However, R8Router is known by calculating hash function R11(node specified) is responsible for cache contents A, and then request path is R7-R11.If router R11Really content A has been cached, So content A is along path R7-R11User is returned to, otherwise, continues to ask along path R4-R9To egress router R10Turn Send out,, than jumping along shortest path forwarding is more by one, which is referred to as path and extends (Path stretch) for this.Path how is avoided to prolong Exhibition is also to introduce the ultimate challenge that Hash route is faced below.
Lorenzo Saino et al. propose a kind of caching mechanism routeing based on Hash, and the mechanism depends on Hash letter The calculated cache node position of number and egress router position, dynamic select content return path.If cache node Without on shortest paths, it is assumed that cache node is R11, content A will be along shortest path R10-R9-R4-R7- R8 most returns to user soon, while also can be along reverse request path R10-R9-R15-R11 in specified cache node cache contents Copy.
Sen Wang et al. are proposed and are divided the collaboration caching mechanism routeing with Hash based on content space, are drawn by intelligence Point content space, the mechanism can operative constraint extended by path caused by Hash route.Therefore, need when division of teaching contents is carried out Meet worst path to extend (worst path stretch, wps) and all requests of covering as much as possible.As shown in figure 4, If wps is set to a jump, then the content produced from outlet R14 is allocated to node R 3, R4, R5, R7, R14 (cluster- R14), the content for producing from outlet R10 is allocated to node R 4, R9, R10, R13 (cluster-R10).
Lorenzo Saino et al. propose content return path with request path be it is asymmetric, and do not apply to CCN it is emerging The natural symmetric path environment of interest bag and packet.
The constraint worst path that Sen Wang et al. are proposed extends based on every paths to realize, lacks the overall situation and examines Amount, resulting even in some nodes free time is not arranged cache contents.Also some nodes are had while belonging to multiple divisions, this On a little nodes for sharing, content is frequently replaced, and causes hit rate to decline.Additionally, when dividing content space, not accounting for difference The flow difference that egress router can be serviced, causes the frequent replacement of multiplexer node spatial cache, so as to reduce internetworking Energy.
The content of the invention
The present invention provides a kind of CCN collaboration caching methods routeing based on network cluster dividing and Hash and device, for solving In prior art in network topology structure route distribution content inefficiency problem.
In a first aspect, the present invention provides a kind of CCN collaboration caching methods routeing based on network cluster dividing and Hash, including：
Obtain the topological structure of a network；
The rate of discharge of each nodal information and Egress node is obtained according to the topological structure；
Network cluster dividing model is generated according to the rate of discharge of the nodal information and the Egress node；
Calculated according to network cluster dividing model and obtain node cluster information；
After Ingress node receives content requests, judge to determine corresponding node cluster according to the content requests；
Cache node in corresponding cluster is obtained according to node cluster information and content requests；
Content requests are forwarded to into cache node in cluster, if there being the content of request in cluster in cache node, content Return.
Preferably, the network cluster dividing model, including：
nj=n tj, j=1,2 ..., | ER | (5)
Wherein, Egress node set of the ER for topological structure, Ingress node set of the IR for topological structure, V are saved for i-th Point, ERjFor j-th Egress node, IRkFor k-th Ingress node, sizes of | the ER | for egress router set, njFor j-th The size of cluster, tjFor the rate of discharge of j-th Egress node.
Preferably, described calculating according to network cluster dividing model obtains node cluster information, including：Adopted according to network cluster dividing model Calculated with simulated annealing and obtain node cluster information, the node cluster information includes the number of node cluster, and each node The nodal information of cluster.
Preferably, it is described that cache node in corresponding cluster is obtained according to node cluster information and content requests, including：According to section Point cluster information and content requests obtain cache node in corresponding cluster using hash function.
Preferably, also include：Content requests are forwarded to into cache node in cluster, if there not being request in cluster in cache node Content, then continue to Egress node forward.
Second aspect, the present invention provide a kind of CCN collaboration buffer storages routeing based on network cluster dividing and Hash, including：
First acquisition module, for obtaining the topological structure of a network；
Second acquisition module, for obtaining the outlet stream of each nodal information and Egress node according to the topological structure Amount；
Generation module, for generating network cluster dividing mould according to the rate of discharge of the nodal information and the Egress node Type；
Computing module, obtains node cluster information for calculating according to network cluster dividing model；
First choice module, for, after Ingress node receives content requests, judging to determine according to the content requests Corresponding node cluster；
Second selecting module, for obtaining cache node in corresponding cluster according to node cluster information and content requests；
Forwarding module, for content requests are forwarded to cache node in cluster, if there is request in cache node in cluster Content, then return content.
Preferably, the network cluster dividing model, including：
nj=n tj, j=1,2 ..., | ER | (5)
Wherein, Egress node set of the ER for topological structure, Ingress node set of the IR for topological structure, V are saved for i-th Point, ERjFor j-th Egress node, IRkFor k-th Ingress node, sizes of | the ER | for egress router set, njFor j-th The size of cluster, tjFor the rate of discharge of j-th Egress node.
Preferably, the computing module specifically for：Calculated using simulated annealing according to network cluster dividing model and obtained Node cluster information, the node cluster information include the number of node cluster, and the nodal information of each node cluster.
Preferably, second selecting module specifically for：Hash function is adopted according to node cluster information and content requests Obtain cache node in corresponding cluster.
Preferably, the forwarding module is additionally operable to：Content requests are forwarded to into cache node in cluster, if cache node in cluster In do not have the content of request, then continue to Egress node to forward.
As shown from the above technical solution, a kind of CCN being route based on network cluster dividing and Hash that the present invention is provided cooperates with slow Method and device is deposited, and by network cluster dividing model being set up to the node in topological structure, and is saved using simulated annealing Point cluster, then cache node in cluster is searched out using hash algorithm, in content requests repeating process, realize route and cache joint Consider, it is ensured that efficient content distribution.
Description of the drawings
Fig. 1 is the flow process that the CCN being route based on network cluster dividing and Hash that the embodiment of the present invention 1 is provided cooperates with caching method Schematic diagram；
Fig. 2 is the schematic diagram of content caching provided in an embodiment of the present invention and request path；
Fig. 3 is the structure that the CCN being route based on network cluster dividing and Hash that the embodiment of the present invention 2 is provided cooperates with buffer storage Schematic diagram；
Fig. 4 is the schematic diagram of content caching and request path in prior art.
Specific embodiment
With reference to the accompanying drawings and examples, the specific embodiment of the present invention is described in further detail.Hereinafter implement Example is for illustrating the present invention, but is not limited to the scope of the present invention.
Fig. 1 shows that the embodiment of the present invention 1 provides a kind of CCN collaborations caching side routeing based on network cluster dividing and Hash Method, including：
S11, the topological structure for obtaining a network.
In this step, it should be noted that obtaining the topological structure in AS domains, net is carried out for the topological structure to AS domains Network node (router) sub-clustering.
S12, the rate of discharge for obtaining each nodal information and Egress node according to the topological structure.
In this step, need to set up network cluster dividing model it should be noted that carrying out topological structure node clustering, build Formwork erection type first has to the information needed for during acquisition is set up.For a topological structure, its each node for existing is believed Breath can be obtained.Nodal information may include the number of Ingress node, Egress node and intermediate node and position relationship.
In addition, the size of cluster intuitively reflects the service ability of a cluster, and how many request flow is directly sent out Giving certain outlet means this cluster needs how many flows carried.
Therefore this method carries out sub-clustering and need to realize reasonable employment network by the size according to rate of discharge dynamic adjustment cluster The target of cache resources, therefore need to be by calculating the rate of discharge for obtaining each Egress node.
S13, according to the rate of discharge of the nodal information and the Egress node generate network cluster dividing model.
In this step, it should be noted that first having to set up network cluster dividing model, can be defined as follows the variable of table 1：
Table 1 is expressed as node variable
Variable Definition
G Topological structure
ER Egress node set
IR Ingress node set
Vi I-th node
ERj J-th Egress node
IRk K-th Ingress node
|ER| The size of Egress node set
nj The size of j-th cluster
tj The rate of discharge of j-th Egress node
In assuming CCN, any AS caches topological structure, is represented by non-directed graph G=(V, E), and the figure has n summit and m Bar side.Network is divided into by corresponding cluster according to outlet, that is, determines node ViWhether belong to cluster j, be specifically expressed as follows：
Wherein node is node, and cluster is cluster.
Give one group of Egress node and Ingress node, the target of the optimization problem be will figure G to be divided into size limited | ER | individual cluster, at the same minimize specify node to correspondence outlet distance and specified node to all entrances distance with.That is network Clustering Model is：
nj=n tj, j=1,2 ..., | ER | (5)
Wherein, first constraint means that all nodes all have to be divided into some cluster, without omitting, will not so go out Existing idle node；Second constraint then shows that a node can only belong to a cluster, otherwise on the node shared by multiple clusters The content of caching frequently can be replaced, and cause cache hit rate to decline；The size of the 3rd constraint explanation each cluster is limited, formula (5) The size for then further illustrating cluster is proportional to rate of discharge, it is possible to according to the size of rate of discharge dynamic adjustment cluster.
S14, according to network cluster dividing model calculate obtain node cluster information.
In this step, node is obtained it should be noted that calculating using simulated annealing according to network cluster dividing model Cluster information, the node cluster information include the number of node cluster, and the nodal information of each node cluster.
In this method, optimal dividing be defined as divide after between cache node and Ingress node and Egress node always away from From minimum.Therefore, this motion adopts simulated annealing, and the algorithm is a kind of greedy algorithm, might not find the overall situation Optimal solution, but can be than finding the approximate optimal solution of problem faster, if parameter setting is proper, simulated annealing search effect Rate is higher than the method for exhaustion.Algorithm detailed process is as follows：
Algorithm first makees starting with the sub-clustering state of one in search space given cluster size (being proportional to rate of discharge)：Often Once by exchanging two nodes for belonging to two different clusters selecting " neighbours " sub-clustering state, if new sub-clustering state There is less total distance, then receive current solution；Receive a ratio otherwise with certain probability and currently solve poor solution, and this Individual probability is elapsed over time and is gradually lowered (be gradually lowered and could tend to stable).Therefore simulated annealing is a kind of random calculation Method, it is possible to can jump out the optimal solution of this local, reaches the optimal solution of the overall situation.
It is understood that the embodiment of the present invention is not limited to the optimal solution that above-mentioned algorithm obtains the overall situation.For can be with Other algorithms for obtaining globally optimal solution can be used.Such as ant group algorithm, genetic algorithm etc..
Network cluster dividing model is solved by above-mentioned algorithm, the node cluster in topological structure is obtained, each node Include multiple nodes in cluster.
S15, after Ingress node receives content requests, judge to determine corresponding node cluster according to the content requests.
In this step, it should be noted that after sub-clustering, one and only one Egress node in each cluster.Therefore, from this Egress node is only cached in corresponding cluster to the content that content source is forwarded.When Ingress node is received to certain content requests interest bag When, judge to produce from which outlet according to the content designator of request first, and then find corresponding cluster, each section in cluster Point has a cluster interior label.
S16, cache node in corresponding cluster is obtained according to node cluster information and content requests.
In this step, it should be noted that after step S15 determines node cluster, then determine that this is interior by hash function Hold the specific cache location in cluster, and Hash route is carried out in cluster.Determine that the content has in cluster by hash function The cache location of body is more ripe technology, be will not be described here.
S17, content requests are forwarded to into cache node in cluster, if there being the content of request in cluster in cache node, Content is returned.
In this step, it should be noted that by Hash calculation, content designator is mapped to cache node in cluster, Then the label of the cache node is added in interest bag prefix, directly interest bag is routed on specified node, saved along road Point need not simultaneously be inquired about.If the cache node has the content of request, content is returned to user；Otherwise, continue to Outlet forwarding, to obtain content from content source.
When request content is entered in AS domains from Egress node, user is returned to along reverse path, and in specified node Upper cache contents copy.Therefore, certain content is cached at most one node in cluster, if produce from different Egress nodes Content is isomery, then certain content is also at most cached on one node in the whole AS, so as to avoid caching redundancy, Spatial cache is able to more efficient utilization.In addition, routeing by Hash, it has been capable of achieving to route and cache joint consideration, it is ensured that Efficient content distribution.
Specific explanations explanation is carried out to said method with specific embodiment below：
By hash function, content designator is mapped to value xi:i∈[1,nj], wherein njIt is router number in cluster j. Any hash function may be used to this programme.State for convenience, now using mould Hash (key mould n).Mould Hash is extensively applied In routing forwarding and cache decision.In the method, key is content designator, and n is router number in cluster.
Topology is as illustrated in fig. 2, it is assumed that Egress node R14Flow is 70% total flow, Egress node R10Flow is remaining 30%.Can be obtained according to cluster algorithm：Node R6,R9,R10,R12And R13Belong to cluster (cluster)-R10, remaining 11 nodes Belong to cluster (cluster)-R14.Therefore, be worth (0,1,2,3,4) it is randomly assigned to cluster-R10, value (0,1,2 ..., 10) with Machine distributes to cluster-R14。cluster-R14Allocation result it is as shown in the table.Being required for of each Ingress node safeguards this The allocation map table of sample.
As shown in Fig. 2 when Ingress node R8 receives the request interest bag to content A, before inquiring about the request content title Sew and will appreciate that and which Egress node AS information will be left from, i.e. request will be gone out by this if being not met in AS Mouth simultaneously verifies that AS links are transmitted to corresponding contents source between corresponding field.Through inquiring about Egress node for R14, then the cache node specified Cluster cluster-R14 should be belonged to.Value 10 is obtained after Hash calculation, and 10 corresponding routers are R16 (specified for delaying Deposit the node of content A), then, interest bag is directly transmitted to the cache node R16 for specifying.If content A is buffered in node In R16, then user is returned to by entrance R8 directly.Otherwise, continue to outlet R14 forwardings, to obtain content from content source.
A kind of CCN collaboration caching methods being route based on network cluster dividing and Hash that the embodiment of the present invention 1 is provided, by right Node in topological structure sets up network cluster dividing model, and obtains node cluster using simulated annealing, then using hash algorithm Cache node in cluster is searched out, in content requests repeating process, realizes route and cache joint considering, it is ensured that efficient content Distribution.
Fig. 3 shows the CCN collaboration buffer storages routeing based on network cluster dividing and Hash that the embodiment of the present invention 2 is provided, Select including the first acquisition module 21, the second acquisition module 22, generation module 23, computing module 24, first choice module 25, second Module 26 and forwarding module 27 is selected, wherein：
First acquisition module 21, for obtaining the topological structure of a network；
Second acquisition module 22, for obtaining the outlet stream of each nodal information and Egress node according to the topological structure Amount；
Generation module 23, for generating network cluster dividing mould according to the rate of discharge of the nodal information and the Egress node Type；
Computing module 24, obtains node cluster information for calculating according to network cluster dividing model；
First choice module 25, for, after Ingress node receives content requests, judging true according to the content requests Fixed corresponding node cluster；
Second selecting module 26, for obtaining cache node in corresponding cluster according to node cluster information and content requests；
Forwarding module 27, for content requests are forwarded to cache node in cluster, if there is request in cache node in cluster Content, then content is returned.
In the process of implementation, the first acquisition module 21 obtains the topological structure of a network.Second acquisition module 22 is obtained should The rate of discharge of each nodal information of topological structure and Egress node.Generation module 23 goes out according to nodal information and Egress node Mouth flow sets up network cluster dividing model.Computing module 24 is carried out calculating to network cluster dividing model using simulated annealing and is saved Point cluster information.After Ingress node receives content requests, according to content requests, first choice module 25 judges that determination is corresponding Node cluster.Second selecting module 26 obtains caching section in corresponding cluster according to node cluster information and content requests using hash algorithm Point.Content requests are forwarded to cache node in cluster by forwarding module 27, if there being the content of request in cluster in cache node, Content is returned.If there not being the content of request in cluster in cache node, continue to Egress node to forward.
Due to 4 described device of the embodiment of the present invention it is identical with the principle of above-described embodiment methods described, in further detail Explanation content will not be described here.
It should be noted that can be by hardware processor (hardware processor) come real in the embodiment of the present invention Existing related function module.
A kind of CCN collaboration buffer storages being route based on network cluster dividing and Hash that the present invention is provided, by topology knot Node in structure sets up network cluster dividing model, and obtains node cluster using simulated annealing, then is searched out using hash algorithm Cache node in cluster, in content requests repeating process, realizes route and caches joint considering, it is ensured that efficient content distribution.
Although additionally, it will be appreciated by those of skill in the art that some embodiments described herein include other embodiments In some included features rather than further feature, but the combination of the feature of different embodiments means in of the invention Within the scope of and form different embodiments.For example, in the following claims, embodiment required for protection appoint One of meaning can in any combination mode using.
It should be noted that above-described embodiment the present invention will be described rather than limits the invention, and ability Field technique personnel can design alternative embodiment without departing from the scope of the appended claims.In the claims, Any reference symbol between bracket should not be configured to limitations on claims.Word "comprising" is not excluded the presence of not Element listed in the claims or step.Word "a" or "an" before element does not exclude the presence of multiple such Element.The present invention can come real by means of the hardware for including some different elements and by means of properly programmed computer It is existing.If in the unit claim for listing equipment for drying, several in these devices can be by same hardware branch To embody.The use of word first, second, and third does not indicate that any order.These words can be explained and be run after fame Claim.
One of ordinary skill in the art will appreciate that：Various embodiments above only to illustrate technical scheme, and It is non-which is limited；Although being described in detail to the present invention with reference to foregoing embodiments, one of ordinary skill in the art It should be understood that：Which still can be modified to the technical scheme described in foregoing embodiments, or to which part or All technical characteristic carries out equivalent；And these modifications or replacement, do not make the essence of appropriate technical solution depart from this Bright claim limited range.

Claims (10)

1. a kind of CCN being route based on network cluster dividing and Hash cooperates with caching method, it is characterised in that include：
Obtain the topological structure of a network；
The rate of discharge of each nodal information and Egress node is obtained according to the topological structure；
Network cluster dividing model is generated according to the rate of discharge of the nodal information and the Egress node；
Calculated according to network cluster dividing model and obtain node cluster information；
After Ingress node receives content requests, judge to determine corresponding node cluster according to the content requests；
Cache node in corresponding cluster is obtained according to node cluster information and content requests；
Content requests are forwarded to into cache node in cluster, if there being the content of request in cluster in cache node, content are returned.
2. method according to claim 1, it is characterised in that the network cluster dividing model, including：
m i n Σ i Σ j x i j ( d ( V i , ER j ) + Σ k d ( V i , IR k ) ) - - - ( 1 )
s . t . Σ i Σ j x i j = n - - - ( 2 )
Σ j x i j = 1 , i = 1 , 2 , ... , | V | - - - ( 3 )
Σ i x i j = n j , j = 1 , 2 , ... , | E R | - - - ( 4 )
nj=n tj, j=1,2 ..., | ER | (5)
Wherein, Egress node set of the ER for topological structure, Ingress node set of the IR for topological structure, V are i-th node, ERjFor j-th Egress node, IRkFor k-th Ingress node, sizes of | the ER | for egress router set, njFor j-th cluster Size, tjFor the rate of discharge of j-th Egress node.
3. method according to claim 1 and 2, it is characterised in that described calculating according to network cluster dividing model obtains node Cluster information, including：Calculated using simulated annealing according to network cluster dividing model and obtain node cluster information, the node cluster information Including the number of node cluster, and the nodal information of each node cluster.
4. method according to claim 3, it is characterised in that described corresponding with content requests acquisition according to node cluster information Cluster in cache node, including：Caching section in corresponding cluster is obtained using hash function according to node cluster information and content requests Point.
5. method according to claim 1, it is characterised in that also include：Content requests are forwarded to into cache node in cluster, If there not being the content of request in cluster in cache node, continue to Egress node to forward.
6. a kind of CCN being route based on network cluster dividing and Hash cooperates with buffer storage, it is characterised in that include：
First acquisition module, for obtaining the topological structure of a network；
Second acquisition module, for obtaining the rate of discharge of each nodal information and Egress node according to the topological structure；
Generation module, for generating network cluster dividing model according to the rate of discharge of the nodal information and the Egress node；
Computing module, obtains node cluster information for calculating according to network cluster dividing model；
First choice module, for, after Ingress node receives content requests, judging to determine correspondence according to the content requests Node cluster；
Second selecting module, for obtaining cache node in corresponding cluster according to node cluster information and content requests；
Forwarding module, for content requests are forwarded to cache node in cluster, if there being the content of request in cluster in cache node, Then content is returned.
7. device according to claim 6, it is characterised in that the network cluster dividing model, including：
m i n Σ i Σ j x i j ( d ( V i , ER j ) + Σ k d ( V i , IR k ) ) - - - ( 1 )
s . t . Σ i Σ j x i j = n - - - ( 2 )
Σ j x i j = 1 , i = 1 , 2 , ... , | V | - - - ( 3 )
Σ i x i j = n j , j = 1 , 2 , ... , | E R | - - - ( 4 )
nj=n tj, j=1,2 ..., | ER | (5)
Wherein, Egress node set of the ER for topological structure, Ingress node set of the IR for topological structure, V are i-th node, ERjFor j-th Egress node, IRkFor k-th Ingress node, sizes of | the ER | for egress router set, njFor j-th cluster Size, tjFor the rate of discharge of j-th Egress node.
8. the device according to claim 6 or 7, it is characterised in that the computing module specifically for：According to network cluster dividing Model is calculated using simulated annealing and obtains node cluster information, and the node cluster information includes the number of node cluster, and often The nodal information of individual node cluster.
9. method according to claim 8, it is characterised in that second selecting module specifically for：According to node cluster Information and content requests obtain cache node in corresponding cluster using hash function.
10. method according to claim 6, it is characterised in that the forwarding module is additionally operable to：Content requests are forwarded to Cache node in cluster, if there not being the content of request in cluster in cache node, continues to Egress node to forward.
CN201610787121.4A 2016-08-30 2016-08-30 The CCN collaboration caching method and device routed based on network cluster dividing and Hash Active CN106533733B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610787121.4A CN106533733B (en) 2016-08-30 2016-08-30 The CCN collaboration caching method and device routed based on network cluster dividing and Hash

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610787121.4A CN106533733B (en) 2016-08-30 2016-08-30 The CCN collaboration caching method and device routed based on network cluster dividing and Hash

Publications (2)

Publication Number Publication Date
CN106533733A true CN106533733A (en) 2017-03-22
CN106533733B CN106533733B (en) 2019-09-27

Family

ID=58344862

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610787121.4A Active CN106533733B (en) 2016-08-30 2016-08-30 The CCN collaboration caching method and device routed based on network cluster dividing and Hash

Country Status (1)

Country Link
CN (1) CN106533733B (en)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108449277A (en) * 2016-12-12 2018-08-24 华为技术有限公司 A kind of file transmitting method and device
CN108900599A (en) * 2018-06-26 2018-11-27 西安交通大学 A kind of the content center network device and its cluster cache decision method of software definition
CN110611688A (en) * 2018-06-15 2019-12-24 伊姆西Ip控股有限责任公司 Method, electronic device and computer program product for searching nodes
CN111404972A (en) * 2019-01-02 2020-07-10 中国移动通信有限公司研究院 Data processing method, device, equipment and storage medium
CN111510382A (en) * 2020-07-01 2020-08-07 南京航空航天大学 Real-time dynamic clustering method and system suitable for EXAta simulator
CN112052198A (en) * 2020-08-11 2020-12-08 大连理工大学 Hash route cooperative caching method based on node betweenness popularity under energy consumption monitoring platform
CN113965588A (en) * 2021-10-18 2022-01-21 北京航空航天大学 Autonomous intra-domain collaborative caching method for content-centric networking
CN114189468A (en) * 2021-11-02 2022-03-15 云端领航(北京)通信科技股份有限公司 Multi-identification network system routing method based on identification clustering

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0426599A2 (en) * 1989-10-30 1991-05-08 International Business Machines Corporation Method of clustering nodes in a distributed computer network
CN101472166A (en) * 2007-12-26 2009-07-01 华为技术有限公司 Method for caching and enquiring content as well as point-to-point medium transmission system
CN105898802A (en) * 2016-03-25 2016-08-24 西安电子科技大学 Cluster-based caching cooperation and sharing method in heterogeneous wireless network

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0426599A2 (en) * 1989-10-30 1991-05-08 International Business Machines Corporation Method of clustering nodes in a distributed computer network
CN101472166A (en) * 2007-12-26 2009-07-01 华为技术有限公司 Method for caching and enquiring content as well as point-to-point medium transmission system
CN105898802A (en) * 2016-03-25 2016-08-24 西安电子科技大学 Cluster-based caching cooperation and sharing method in heterogeneous wireless network

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108449277B (en) * 2016-12-12 2020-07-24 华为技术有限公司 Message sending method and device
CN108449277A (en) * 2016-12-12 2018-08-24 华为技术有限公司 A kind of file transmitting method and device
CN110611688B (en) * 2018-06-15 2022-04-12 伊姆西Ip控股有限责任公司 Method, electronic device and computer program product for searching nodes
CN110611688A (en) * 2018-06-15 2019-12-24 伊姆西Ip控股有限责任公司 Method, electronic device and computer program product for searching nodes
CN108900599A (en) * 2018-06-26 2018-11-27 西安交通大学 A kind of the content center network device and its cluster cache decision method of software definition
CN108900599B (en) * 2018-06-26 2020-05-22 西安交通大学 Software-defined content-centric network device and cluster cache decision method thereof
CN111404972A (en) * 2019-01-02 2020-07-10 中国移动通信有限公司研究院 Data processing method, device, equipment and storage medium
CN111510382A (en) * 2020-07-01 2020-08-07 南京航空航天大学 Real-time dynamic clustering method and system suitable for EXAta simulator
CN112052198A (en) * 2020-08-11 2020-12-08 大连理工大学 Hash route cooperative caching method based on node betweenness popularity under energy consumption monitoring platform
CN113965588A (en) * 2021-10-18 2022-01-21 北京航空航天大学 Autonomous intra-domain collaborative caching method for content-centric networking
CN113965588B (en) * 2021-10-18 2023-08-22 北京航空航天大学 Content-centric-network-oriented autonomous domain collaborative caching method
CN114189468A (en) * 2021-11-02 2022-03-15 云端领航(北京)通信科技股份有限公司 Multi-identification network system routing method based on identification clustering
CN114189468B (en) * 2021-11-02 2024-04-12 云端领航(北京)通信科技股份有限公司 Multi-identification network system routing method based on identification clustering

Also Published As

Publication number Publication date
CN106533733B (en) 2019-09-27

Similar Documents

Publication Publication Date Title
CN106533733A (en) CCN collaborative cache method and device based on network clustering and Hash routing
CN104753797B (en) A kind of content center network dynamic routing method based on selectivity caching
US20090052448A1 (en) Methods and systems to store state used to forward multicast traffic
CN104601485B (en) The distribution method of network flow and the method for routing for realizing network flow distribution
CN104780205B (en) The content requests and transmission method and system of content center network
CN102150148A (en) Differentiated services for unicast multicast frames in layer 2 topologies
CN104168620A (en) Route establishing method in wireless multi-hop backhaul network
CN106534360A (en) Content centric network routing method based on software definition
CN108366089B (en) CCN caching method based on content popularity and node importance
CN105656788B (en) CCN content buffering method based on popularity statistics
Zhang et al. An SDN-based caching decision policy for video caching in information-centric networking
CN111245722B (en) SDN data center network flow forwarding method based on genetic algorithm
CN105743804B (en) Data flow control method and system
Wu et al. MBP: A max-benefit probability-based caching strategy in information-centric networking
CN105681438A (en) Centralized caching decision strategy in content-centric networking
CN106210024B (en) The method realized in information centre's network based on the polymorphic ant colony algorithm of popularity
Lv et al. ACO-inspired ICN routing mechanism with mobility support
CN103457855B (en) Classless inter-domain routing table is established and the method and apparatus of message forwarding
Kamiyama et al. Dispersing content over networks in information-centric networking
CN107302571B (en) The routing of information centre's network and buffer memory management method based on drosophila algorithm
CN108809829B (en) SDN rule deployment method
CN109525494A (en) Opportunistic network routing mechanism implementation method based on message next-hop Dynamic Programming
Venkatasubramanian Optimal Cluster head selection-based Hybrid Moth Search Algorithm with Tree Seed algorithm for multipath routing in WSN
CN110324249A (en) A kind of dragonfly network architecture and its multicast route method
Xu et al. Minimizing bandwidth cost of CCN: a coordinated in-network caching approach

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