CN108965479A - A kind of domain collaboration caching method and device based on content center network - Google Patents
A kind of domain collaboration caching method and device based on content center network Download PDFInfo
- Publication number
- CN108965479A CN108965479A CN201811020944.XA CN201811020944A CN108965479A CN 108965479 A CN108965479 A CN 108965479A CN 201811020944 A CN201811020944 A CN 201811020944A CN 108965479 A CN108965479 A CN 108965479A
- Authority
- CN
- China
- Prior art keywords
- node
- packet
- domain
- caching
- data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- 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/74—Address processing for routing
- H04L45/742—Route cache; Operation thereof
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Information Transfer Between Computers (AREA)
Abstract
Domain collaboration caching method and device provided by the invention based on content center network, by using the mode of collaboration caching, by data buffer storage in certain collaboration region, make full use of the spatial cache of the non-path node in cooperation domain, collaboration region only caches a copy simultaneously, reduce the redundancy of data, make full use of the hardware resource in network topology, take reasonable cooperation caching strategy, reach raising cache hit rate, reduce hop count, reduce request time delay purpose, network congestion is reduced while alleviating the pressure of server to a certain extent, better data service is provided for the network user in CCN.
Description
Technical field
The present invention relates to content center network field, in particular to a kind of domain based on content center network cooperates with caching side
Method and device.
Background technique
Compared to traditional connection-oriented network model centered on host, what CCN was focused more on is user's request
Content mark of the name as network transmission of content is replaced into current IP address.And transmission mode is changed into " pushing away " and is
" drawing ", the driving factors transmitted using the wish of user and request as information, and the road of data is directly carried out with the name of content
By transmitting and positioning, meet the demand of active user.In CCN, a most important characteristic is supporting node caching, will
Data buffer storage is directly responded by node on related routing node when identical request issues, without being sent to service
Device reaches the request time delay for reducing user while the pressure for mitigating server.
Current main cache policy is centralized path cache policy i.e. by data buffer storage in the path that transmission packet passes through
On node, have several typical strategies, be respectively: 1. cache [1] everywhere, by data buffer storage in transmission packet by all of path
On routing node.It is a kind of improvement to caching everywhere 2. probability caches [2], when transmission packet is by routing node, with certain
Probability caches data, can reduce 3. downstream node of the redundancy caching [3] of data to a certain extent, packet is only delayed
There are 4. node center of the redundancy cachings [4] that on the fringe node of user's request, can largely reduce data, will pass
Defeated packet is buffered in network topological diagram, on the big routing node of node center value, the importance of node is fully considered same
When caching not blindly, reduce data redundancy.
In CCN, the selection of cache policy will directly affect communication quality, and current various cache policies are also most of
In conceptual phase, the strategy having been carried out is weaker in terms of data redundancy processing, reducing request, therefore this hair
Bright main purpose is to improve the buffer efficiency of CCN, passes through the dynamic tune sufficiently considered and user requests to communication topology
It is whole, it improves data hit rate, reduce request time delay.
What is mainly taken in CCN at present is the path cache policy of centralization, and data buffer storage is passed through in data packet
On router, result, which will lead to, can have many identical data copies in network, and close section is only requested apart from user
Point cache data can be accessed by the user, and a large amount of distal end copy becomes redundancy, waste memory space, be optimized by correlation,
Data are only buffered on part of nodes therein and will lead to the problems such as hit rate is low, and the replacement of core node data is frequent.
Summary of the invention
In view of this, the embodiment of the invention provides a kind of, the domain based on content center network cooperates with caching method and dress
It sets, it is possible to reduce data redundancy saves memory space, improves cache hit rate, reduces request time delay, provides more for the network user
Good data service.
In a first aspect, the present invention provides a kind of domain collaboration caching method based on content center network, which comprises
The intermediary's central value for determining all nodes in network topology, according to the size of intermediary's central value of node to the net
Network topology is divided to obtain multiple collaboration cachings domain, and collaboration caching domain includes core node and ordinary node, wherein in
The maximum node of Jie's central value corresponds to core node, and the node being directly connected to the core node is ordinary node；
Caching process flag bit is added in the transport packet, and the transmission packet is configured on the cache tag position and is turned in node
Send out the center value attribute that node is transmitted in model；
Cooperation value table CVT is configured in the node forwarding model, marks the caching after node receives transmission packet
Will position is matched with the value table that cooperates, and is wrapped according to matching result to the transmission and carried out respective handling.
Optionally, the transmission packet includes data packet and interest packet, and the interest packet has the name of interest content, selection
Device, random field and the first cache tag position, the data packet have the name of data content, digital signature, flag information,
Data and the second cache tag position.
Optionally, the method also includes:
The intermediary's central value of itself is initialized as zero when interest contracts for fixed output quotas raw, it, will before forwarding the interest packet every time
Intermediary's central value of the interest packet is stored in interest compared with intermediary's central value of destination node, by biggish intermediary's central value
Bao Zhong, when interest packet reaches the destination node that data reply, on the interest packet storage routed path in all node intermediaries
The maximum value of center value；
Maximum value is passed into data packet, reaching in the data packet back will be described maximum after each node
Intermediary's central value of value and corresponding node is compared, and comparison result stores up the data in the data packet when being equal
It deposits.
Optionally, in the determining network topology all nodes intermediary's central value, according to intermediary's central value of node
Size divides the network topology to obtain multiple collaborations cachings domain, comprising:
Calculate intermediary's central value of all nodes in network topology；
The maximum node of intermediary's central value is chosen as core node, if wherein there are multiple nodes while there is maximum intermediary
Central value then randomly selects one of them as core node；
Be arranged within the scope of the jump of core node one or multi-hop is that ordinary node, then core node and the ordinary node of surrounding are constituted
One collaboration caches domain；
The removing remaining node set that divided collaboration has cached domain is chosen again to repeat as new process object
Until the node set in remaining unallocated domain is sky, then obtains multiple collaborations and cache domain.
Optionally, the node forwarding model further includes interest table, forwarding information storehouse and content storage table CS undetermined, institute
The configuration cooperation value table in the node forwarding model is stated, it is described that cooperation value table is configured in the node forwarding model, work as section
Point matches the cache tag position with the value table that cooperates after receiving transmission packet, and according to matching result to the biography
Defeated packet carries out respective handling, comprising:
When requesting the interest packet of user to reach some node in the network topology, the CS entry of present node is searched,
When the data content for being stored with the interest packet request in CS, then directly the described interest packet is abandoned and respond a carrying institute
The data packet for stating request data returns to request user along the reverse path that the interest packet arrives, described in not corresponding in CS
The request data of interest packet request then searches whether there is the content that the name with the interest content matches in PIT；
Then increase in the response entry of PIT if it exists and reach interface, and the interest packet is abandoned, then exists if it does not exist
Search whether node type corresponding with the first cache tag position of the interest packet is core node in CVT；
Collaboration where the interest packet is forwarded to the ordinary node when the node type is ordinary node caches
The core node in domain, when node type is core node, inquired by core node in managed collaboration caching domain whether
There is corresponding ordinary node to store the request data, corresponding ordinary node is then returned by corresponding ordinary node if it exists
The request data is returned, the interest packet is abandoned, corresponding ordinary node then utilizes predetermined routing policy in FIB if it does not exist
The interest packet is forwarded to other nodes or collaboration caching domain, and the arrival interface of the interest packet is recorded in the FIB
In entry.
Optionally, the cache tag position is matched with the value table that cooperates after node receives transmission packet, and
The transmission is wrapped according to matching result and carries out respective handling, comprising:
When data packet reach some node of network topology when, according to the data content name inquiry CS with the presence or absence of
The data packet matched if it does not exist then will be in the interest packet and the PIT if it exists then by the newly arrived data packet discarding
Port matched, the data packet is forwarded to the port that is matched to；
Inquire it is described using the CVT inquire the data packet the corresponding node type in the second cache tag position whether be
Core node then caches income according to the core node self residual if core node and feeds back in conjunction with each ordinary node
The caching income of the message inquiry ordinary node come, the node for choosing caching Income Maximum are cached, it is strong in the CVT
The data packet is then forwarded to the collaboration caching domain where the ordinary node if ordinary node by corresponding ports information
Core node.
Optionally, it is described the interest packet is matched with the port in the PIT after, the method also includes:
When there is no respective entries then to abandon the data packet in the PIT.
Second aspect, the present invention provide a kind of domain collaboration buffer storage based on content center network, and described device includes:
Division unit, for determining intermediary's central value of all nodes in network topology, according to intermediary's central value of node
Size divided to obtain multiple collaborations to the network topology and cache domain, it includes core node and general that the collaboration, which caches domain,
Logical node, wherein the maximum node of intermediary's central value corresponds to core node, and the node being directly connected to the core node is
Ordinary node；
Adding unit, for adding caching process flag bit in the transport packet, on the cache tag position described in configuration
Transmission packet transmits the center value attribute of node in node forwarding model；
Node retransmission unit, for configuring cooperation value table CVT in the node forwarding model, when node receives transmission
The cache tag position is matched with the value table that cooperates after packet, and transmission packet is carried out accordingly according to matching result
Processing.
As can be seen from the above technical solutions, the embodiment of the present invention has the advantage that
Domain collaboration caching method and device provided by the invention based on content center network, by using collaboration caching
Mode makes full use of the spatial cache of the non-path node in cooperation domain, simultaneously by data buffer storage in certain collaboration region
Collaboration region only caches a copy, reduces the redundancy of data, makes full use of the hardware resource in network topology, takes reasonable
Cooperation caching strategy reaches and improves cache hit rate, reduce hop count, reduce request time delay purpose, delays to a certain extent
Network congestion is reduced while solving the pressure of server, provides better data service for the network user in CCN.
Detailed description of the invention
Fig. 1 is a kind of process of embodiment of the domain collaboration caching method provided by the invention based on content center network
Figure；
Fig. 2 is a kind of embodiment transmission packet of the domain collaboration caching method provided by the invention based on content center network
Structural block diagram；
Fig. 3 is that a kind of collaboration of embodiment of the domain collaboration caching method provided by the invention based on content center network is slow
Deposit the schematic diagram of domain division；
Fig. 4 is that a kind of collaboration of embodiment of the domain collaboration caching method provided by the invention based on content center network is slow
Deposit the flow chart of domain division；
Fig. 5 is a kind of interest packet of embodiment of the domain collaboration caching method provided by the invention based on content center network
The flow chart of forwarding；
Fig. 6 is a kind of data packet of embodiment of the domain collaboration caching method provided by the invention based on content center network
The flow chart of forwarding；
Fig. 7 is a kind of embodiment emulation signal of the domain collaboration caching method provided by the invention based on content center network
Figure；
Fig. 8 is a kind of embodiment emulation signal of the domain collaboration caching method provided by the invention based on content center network
Figure；
Fig. 9 is a kind of embodiment emulation signal of the domain collaboration caching method provided by the invention based on content center network
Figure.
Specific embodiment
In order to enable those skilled in the art to better understand the solution of the present invention, below in conjunction in the embodiment of the present invention
Attached drawing, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described embodiment is only
The embodiment of a part of the invention, instead of all the embodiments.Based on the embodiments of the present invention, ordinary skill people
The model that the present invention protects all should belong in member's every other embodiment obtained without making creative work
It encloses.
Description and claims of this specification and term " first ", " second ", " third ", " in above-mentioned attached drawing
Four " etc. be to be used to distinguish similar objects, without being used to describe a particular order or precedence order.It should be understood that using in this way
Data be interchangeable under appropriate circumstances, so that the embodiments described herein can be in addition to illustrating herein or describing
Sequence other than appearance is implemented.In addition, term " includes " and " having " and their any deformation, it is intended that covering is non-exclusive
Include, for example, the process, method, system, product or equipment for containing a series of steps or units are not necessarily limited to clearly arrange
Those of out step or unit, but may include be not clearly listed or it is solid for these process, methods, product or equipment
The other step or units having.
As shown in connection with fig. 1, the present invention provides a kind of domain collaboration caching method based on content center network, the method packet
It includes:
S101, the intermediary's central value for determining all nodes in network topology, according to the size pair of intermediary's central value of node
The network topology is divided to obtain multiple collaborations cachings domain, and it includes core node and ordinary node that the collaboration, which caches domain,
Wherein, the maximum node of intermediary's central value corresponds to core node, and the node being directly connected to the core node is common section
Point.
S102, caching process flag bit is added in the transport packet, the transmission packet is configured on the cache tag position and is existed
The center value attribute of node is transmitted in node forwarding model.
S103, cooperation value table CVT is configured in the node forwarding model, it will be described slow after node receives transmission packet
It deposits flag bit to be matched with the value table that cooperates, and the transmission is wrapped according to matching result and carries out respective handling.
Domain provided by the invention based on content center network cooperates with caching method, by using the mode of collaboration caching,
By data buffer storage in certain collaboration region, the spatial cache of the non-path node in cooperation domain is made full use of, is cooperated simultaneously
Region only caches a copy, reduces the redundancy of data, makes full use of the hardware resource in network topology, takes reasonable cooperation
Cache policy reaches and improves cache hit rate, reduce hop count, reduce request time delay purpose, alleviates clothes to a certain extent
Network congestion is reduced while the pressure of business device, provides better data service for the network user in CCN.
As shown in connection with fig. 2, the importance of node can be by the Betweenness Centrality (Betweenness of node
Centrality it) measures, in a network topological diagram, the Betweenness Centrality of v node refers to by source node s to destination node
By shortest path item number total in the number of passes and topology of v node in t (removing v node itself) all shortest paths
The sum of ratio.And communication is driven by user terminal in content center network CCN, transmission packet mainly includes two classes in transmission process
Data type, i.e. interest packet and data packet.Interest packet is mainly made of the name of interest content, selector and random field；
And data packet then includes the parts such as name, digital signature, flag information and the data of data content, the present invention is in prototype structure
On be added to caching process flag bit, intermediary's central value of each node is acquired by Dijkstra's algorithm, and will be in intermediary
Center value is stored into the cache tag position of each node, and corresponding interest packet is the first cache tag position, and data packet is corresponding to be
Second cache tag position.
It needs to be transmitted among the nodes due to transmission packet, newly added domain is needed to carry out corresponding volume
Code and decoding just can be carried out transmission.If by its intermediary, central value is initialized as zero when interest contracts for fixed output quotas raw, while
Every time before forwarding interest packet, by Jie's central value in interest packet compared with the central value for reaching node, biggish value is stored in
In interest packet, in this way when interest packet reaches the node or server that data reply, wherein what is stored will be its routed path
Upper all maximum values of node center value, are transmitted to data packet for the value, allow data packet when returning, reach each node it
The central value of the value and corresponding node is compared afterwards, stores data when equal, is thus stored data in
On the maximum node of path intermediary central value, i.e. the node center cache policy of optimized integration.But the strategy can only be by data
It is stored on the node in transmission path, waste and load imbalance of other great deal of nodes spatial caches etc. can be generated and asked
Topic, domain collaborative strategy proposed by the present invention are then to advanced optimize on the basis of Jie's central value strategy in the implementation, will be saved
The node that dot center's value reaches a certain level carries out the division in collaboration domain, carries out collaboration processing to it, reaches to the efficient of data
Caching.Basic transmission packet addition cache tag is handled into position, the center of node can be transmitted in node forwarding model for packet
Value attribute achievees the purpose that transmission packet being transferred to corresponding node.
In conjunction with shown in Fig. 3 and 4, in step s 102, caching domain is cooperateed with to all node divisions of network topology kind, specifically
Ground, network topological diagram can be modeled as a non-directed graph G=(V, E), and wherein V is set of network nodes, and E is to connect in network
Line set.Divide collaboration domain is the spatial cache in order to make full use of all nodes, while in the forwarding model of node
Cooperation value table provides the importance label of the instruction of cooperation range and node.According to actual communication topology figure, to be calculated
Node intermediary central value based on, choose wherein the biggish node of intermediary's central value as core node, around directly connect
The node connect as ordinary node, by a topological diagram be roughly divided into it is multiple with core node be guidance domain, specific step
Include the following:
S1, the intermediary's central value for calculating all nodes in network topology；
S2, the maximum node of intermediary's central value is chosen as core node, if wherein there are multiple nodes while there is maximum
Intermediary's central value then randomly selects one of them as core node；
S3, setting core node one jump or multi-hop in for ordinary node, then the ordinary node of core node and surrounding
Constitute a collaboration caching domain；
The remaining node set that S4, again selection remove divided collaboration caching domain repeats to hold as new process object
Row S2 and S3 then obtain multiple collaborations and cache domain until the node set in remaining unallocated domain is sky.
As shown in connection with fig. 5, in step s 103, node forwarding model further includes interest table (Pending undetermined
Interest Table, PIT), forwarding information storehouse (Forwarding Information Base, FIB) and content storage table
(Content Store, CS), can be such that for the forwarding process of interest packet
When requesting the interest packet of user to reach some node in the network topology, the CS entry of present node is searched,
When the data content for being stored with the interest packet request in CS, then directly the described interest packet is abandoned and respond a carrying institute
The data packet for stating request data returns to request user along the reverse path that the interest packet arrives, described in not corresponding in CS
The request data of interest packet request then searches whether there is the content that the name with the interest content matches in PIT, looks into
Matched and searched is carried out using the longest prefix match algorithm of name when looking for；
Then increase in the response entry of PIT if it exists and reach interface, and the interest packet is abandoned, then exists if it does not exist
Search whether node type corresponding with the first cache tag position of the interest packet is core node in CVT；
Collaboration where the interest packet is forwarded to the ordinary node when the node type is ordinary node caches
The core node in domain, when node type is core node, inquired by core node in managed collaboration caching domain whether
There is corresponding ordinary node to store the request data, corresponding ordinary node is then returned by corresponding ordinary node if it exists
The request data is returned, the interest packet is abandoned, corresponding ordinary node then utilizes predetermined routing policy in FIB if it does not exist
The interest packet is forwarded to other nodes or collaboration caching domain, and the arrival interface of the interest packet is recorded in the FIB
In entry.
As shown in connection with fig. 6, in step s 103, it can be searched according to the request data of interest packet after node receives interest packet
Data packet returns, and the forwarding process of data packet may comprise steps of:
When data packet reach some node of network topology when, according to the data content name inquiry CS with the presence or absence of
The data packet matched if it does not exist then will be in the interest packet and the PIT if it exists then by the newly arrived data packet discarding
Port matched, the data packet is forwarded to the port that is matched to, when lookup using the longest of name before
Sew matching algorithm and carries out matched and searched；
Inquire it is described using the CVT inquire the data packet the corresponding node type in the second cache tag position whether be
Core node then caches income according to the core node self residual if core node and feeds back in conjunction with each ordinary node
The caching income of the message inquiry ordinary node come, the node for choosing caching Income Maximum are cached, it is strong in the CVT
The data packet is then forwarded to the collaboration caching domain where the ordinary node if ordinary node by corresponding ports information
Core node, when not having respective entries then to abandon the data packet in the PIT.
Domain provided by the invention based on content center network cooperates with caching method, by using the mode of collaboration caching,
By data buffer storage in certain collaboration region, the spatial cache of the non-path node in cooperation domain is made full use of, is cooperated simultaneously
Region only caches a copy, reduces the redundancy of data.It makes full use of the hardware resource in network topology, takes reasonable association
Make cache policy, reaches and improve cache hit rate, reduce hop count, reduce request time delay purpose, alleviate to a certain extent
Network congestion is reduced while the pressure of server, provides better data service for the network user in CCN.
The domain collaboration caching of the invention based on content center network is emulated using emulation platform below, so as to more
Good understands the effect of this programme, and specifically, major parameter when emulation is provided that network topological diagram use has
The GEANT2012 of Typical Representative, simulation time are set as 50s, and content requests probability obeys Zipf distribution, using at least making recently
With (LRU) replacement policy, AppDelayTracer, CS content storage table Tracer are installed, and the sampling period is set for 2s, wherein
Fig. 7 successfully calculates intermediary's central value of GEANT2012 topological node, and Fig. 8 success is compiled and run on ndnSIM emulation platform
Program, Fig. 9 successfully track the data packet request of response, the present invention by the ndnSIM emulation platform under linux system into
When row emulation experiment, it compared to current strategy, can effectively alleviate server stress, reduce network congestion, reduce network
The redundancy of storing data and cache contents hit rate is improved in communication process.
It can see by above-mentioned emulation and scheme introduction, in the content in heart network, efficient cache policy can be given
The user of network brings good user experience, is different from TCP/IP network communication, is more able to satisfy the following people to letter
Cease request trend.And this new network communication architectures is in conceptual phase, therefore be currently based on the network communication architectures and
The cache policy put forward is largely also at conceptual phase, and the caching technology of comparative maturity is substantially based on path now
Centralization caching.
The present invention casts aside traditional centralized path cache policy, and the range of caching is generalized to domain, avoids data buffer storage
The unbalanced problem of the load distribution occurred in the process can make full use of each of collaboration domain with time domain collaboration cache policy
The spatial cache of node can store more contents compared with centralized path cache policy under the same conditions, and reduce
The frequent replacement of data.
Meanwhile the present invention possesses lesser node cost expense, is operated based on original data structure, it is true with orthoform
Platform has preferable compatibility, on the basis of fully considering network topology structure, cooperates with to the content blocks of fine granularity
Caching guarantees content blocks only one copy in current nodes domains, reduces the data redundancy in communication process, reduces road
By while hop count improve content hit rate, can preferably alleviate the pressure of server and the congestion of network, be user with
Carry out good usage experience.
Correspondingly, the present invention also provides a kind of, and the domain based on content center network cooperates with buffer storage, and described device includes:
Division unit, for determining intermediary's central value of all nodes in network topology, according to intermediary's central value of node
Size divided to obtain multiple collaborations to the network topology and cache domain, it includes core node and general that the collaboration, which caches domain,
Logical node, wherein the maximum node of intermediary's central value corresponds to core node, and the node being directly connected to the core node is
Ordinary node；
Adding unit, for adding caching process flag bit in the transport packet, on the cache tag position described in configuration
Transmission packet transmits the center value attribute of node in node forwarding model；
Node retransmission unit, for configuring cooperation value table CVT in the node forwarding model, when node receives transmission
The cache tag position is matched with the value table that cooperates after packet, and transmission packet is carried out accordingly according to matching result
Processing.
Domain provided by the invention based on content center network cooperates with caching method, by using the mode of collaboration caching,
By data buffer storage in certain collaboration region, the spatial cache of the non-path node in cooperation domain is made full use of, is cooperated simultaneously
Region only caches a copy, reduces the redundancy of data.It makes full use of the hardware resource in network topology, takes reasonable association
Make cache policy, reaches and improve cache hit rate, reduce hop count, reduce request time delay purpose, alleviate to a certain extent
Network congestion is reduced while the pressure of server, provides better data service for the network user in CCN.
It is apparent to those skilled in the art that for convenience and simplicity of description, the system of foregoing description,
The specific work process of device and unit, can refer to corresponding processes in the foregoing method embodiment, and details are not described herein.
In several embodiments provided herein, it should be understood that disclosed system, device and method can be with
It realizes by another way.For example, the apparatus embodiments described above are merely exemplary, for example, the unit
It divides, only a kind of logical function partition, there may be another division manner in actual implementation, such as multiple units or components
It can be combined or can be integrated into another system, or some features can be ignored or not executed.Another point, it is shown or
The mutual coupling, direct-coupling or communication connection discussed can be through some interfaces, the indirect coupling of device or unit
It closes or communicates to connect, can be electrical property, mechanical or other forms.
The unit as illustrated by the separation member may or may not be physically separated, aobvious as unit
The component shown may or may not be physical unit, it can and it is in one place, or may be distributed over multiple
In network unit.It can select some or all of unit therein according to the actual needs to realize the mesh of this embodiment scheme
's.
It, can also be in addition, the functional units in various embodiments of the present invention may be integrated into one processing unit
It is that each unit physically exists alone, can also be integrated in one unit with two or more units.Above-mentioned integrated list
Member both can take the form of hardware realization, can also realize in the form of software functional units.
Those of ordinary skill in the art will appreciate that all or part of the steps in the various methods of above-described embodiment is can
It is completed with instructing relevant hardware by program, which can be stored in a computer readable storage medium, storage
Medium may include: read-only memory (ROM, Read Only Memory), random access memory (RAM, Random
Access Memory), disk or CD etc..
Above to it is provided by the present invention it is a kind of based on content center network domain collaboration caching method and device carry out
It is discussed in detail, for those of ordinary skill in the art, thought according to an embodiment of the present invention, in specific embodiment and application
There will be changes in range, in conclusion the contents of this specification are not to be construed as limiting the invention.
Claims (8)
1. a kind of domain based on content center network cooperates with caching method, which is characterized in that the described method includes:
The intermediary's central value for determining all nodes in network topology opens up the network according to the size of intermediary's central value of node
It puts oneself into row division and obtains multiple collaborations cachings domain, collaboration caching domain includes core node and ordinary node, wherein in intermediary
The maximum node of center value corresponds to core node, and the node being directly connected to the core node is ordinary node；
Caching process flag bit is added in the transport packet, and the transmission packet is configured on the cache tag position in node and forwards mould
The center value attribute of node is transmitted in type；
Cooperation value table CVT is configured in the node forwarding model, by the cache tag position after node receives transmission packet
It is matched with the value table that cooperates, and the transmission is wrapped according to matching result and carries out respective handling.
2. the domain according to claim 1 based on content center network cooperates with caching method, which is characterized in that the transmission
Packet includes data packet and interest packet, and the interest packet has name, selector, random field and the first caching of interest content
Flag bit, the data packet have name, digital signature, flag information, data and the second cache tag position of data content.
3. the domain according to claim 2 based on content center network cooperates with caching method, which is characterized in that the method
Further include:
The intermediary's central value of itself is initialized as zero when interest contracts for fixed output quotas raw, it, will be described before forwarding the interest packet every time
Intermediary's central value of interest packet is stored in interest packet compared with intermediary's central value of destination node, by biggish intermediary's central value
In, when interest packet reaches the destination node that data reply, all node intermediaries center on the interest packet storage routed path
It is worth maximum value；
Maximum value is passed into data packet, reached the maximum value in the data packet back after each node and
Intermediary's central value of corresponding node is compared, and comparison result stores the data in the data packet when being equal.
4. the domain according to claim 1 based on content center network cooperates with caching method, which is characterized in that the determination
Intermediary's central value of all nodes in network topology, draws the network topology according to the size of intermediary's central value of node
Get multiple collaboration cachings domain, comprising:
Calculate intermediary's central value of all nodes in network topology；
The maximum node of intermediary's central value is chosen as core node, if wherein there are multiple nodes while there is maximum intermediary center
Value, then randomly select one of them as core node；
Be arranged within the scope of the jump of core node one or multi-hop is that ordinary node, then core node and the ordinary node of surrounding constitute one
Collaboration caching domain；
The removing remaining node set that divided collaboration has cached domain is chosen again to be performed repeatedly until as new process object
The node set in remaining unallocated domain is sky, then obtains multiple collaboration cachings domain.
5. the domain according to claim 2 based on content center network cooperates with caching method, which is characterized in that the node
Forwarding model further includes interest table (PIT) undetermined, forwarding information storehouse FIB and content storage table CS, described to forward in the node
Cooperation value table is configured in model, it is described that cooperation value table is configured in the node forwarding model, after node receives transmission packet
The cache tag position is matched with the value table that cooperates, and the transmission is wrapped according to matching result and carries out corresponding position
Reason, comprising:
When requesting the interest packet of user to reach some node in the network topology, the CS entry of present node is searched, CS is worked as
In be stored with the data content of interest packet request, then directly the described interest packet is abandoned and is responded and asked described in a carrying
The reverse path for asking the data packet of data to arrive along the interest packet returns to request user, when the corresponding interest no in CS
The request data for wrapping request then searches whether there is the content that the name with the interest content matches in PIT；
Then increase in the response entry of PIT if it exists and reach interface, and the interest packet is abandoned, if it does not exist then in CVT
It is middle to search whether node type corresponding with the first cache tag position of the interest packet is core node；
Collaboration caching domain where the interest packet is forwarded to the ordinary node when the node type is ordinary node
Core node, whether when node type is core node, being inquired in managed collaboration caching domain by core node has pair
The ordinary node answered stores the request data, and corresponding ordinary node then returns to institute by corresponding ordinary node if it exists
Request data is stated, the interest packet is abandoned, corresponding ordinary node then utilizes predetermined routing policy by institute in FIB if it does not exist
It states interest packet and is forwarded to other nodes or collaboration caching domain, and the arrival interface of the interest packet is recorded in the FIB entry
In.
6. the domain according to claim 5 based on content center network cooperates with caching method, which is characterized in that when node connects
The cache tag position is matched with the value table that cooperates after receiving transmission packet, and the transmission is wrapped according to matching result
Carry out respective handling, comprising:
When data packet reaches some node of network topology, according to the name inquiry CS of the data content with the presence or absence of matched
Data packet, if it exists then by the newly arrived data packet discarding, if it does not exist then by the end in the interest packet and the PIT
Mouth is matched, and the data packet is forwarded to the port being matched to；
Inquire whether the corresponding node type in the second cache tag position that the data packet is inquired using the CVT is core
Node then caches income according to the core node self residual if core node and each ordinary node is combined to feed back
Message inquires the caching income of ordinary node, and the node for choosing caching Income Maximum is cached, it is strong in the CVT corresponds to
The data packet is then forwarded to the core in the collaboration caching domain where the ordinary node if ordinary node by port information
Node.
7. the domain according to claim 6 based on content center network cooperates with caching method, which is characterized in that described by institute
It states after interest packet matched with the port in the PIT, the method also includes:
When there is no respective entries then to abandon the data packet in the PIT.
8. a kind of domain based on content center network cooperates with buffer storage, which is characterized in that described device includes:
Division unit, for determining intermediary's central value of all nodes in network topology, according to the big of intermediary's central value of node
Small to be divided to obtain multiple collaborations cachings domain to the network topology, collaboration caching domain includes core node and common section
Point, wherein the maximum node of intermediary's central value corresponds to core node, and the node being directly connected to the core node is common
Node；
Adding unit configures the transmission on the cache tag position for adding caching process flag bit in the transport packet
Wrap the center value attribute that node is transmitted in node forwarding model；
Node retransmission unit, for configuring cooperation value table CVT in the node forwarding model, after node receives transmission packet
The cache tag position is matched with the value table that cooperates, and the transmission is wrapped according to matching result and carries out corresponding position
Reason.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811020944.XA CN108965479B (en) | 2018-09-03 | 2018-09-03 | Domain collaborative caching method and device based on content-centric network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811020944.XA CN108965479B (en) | 2018-09-03 | 2018-09-03 | Domain collaborative caching method and device based on content-centric network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108965479A true CN108965479A (en) | 2018-12-07 |
| CN108965479B CN108965479B (en) | 2021-04-20 |
Family
ID=64475695
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811020944.XA Active CN108965479B (en) | 2018-09-03 | 2018-09-03 | Domain collaborative caching method and device based on content-centric network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108965479B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109951390A (en) * | 2019-03-08 | 2019-06-28 | 西安交通大学 | A kind of network equipment and its cooperation route-caching method based on PopBetw strategy |
| CN110365801A (en) * | 2019-08-26 | 2019-10-22 | 陕西师范大学 | Based on the cooperation caching method of subregion in information centre's network |
| CN111614771A (en) * | 2020-05-25 | 2020-09-01 | 北京邮电大学 | Content caching method for content-centric Internet of things |
| CN114401317A (en) * | 2022-03-25 | 2022-04-26 | 山东省计算中心（国家超级计算济南中心） | Ocean buoy-oriented multipoint cooperative active cache networking method and system |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103001870A (en) * | 2012-12-24 | 2013-03-27 | 中国科学院声学研究所 | Collaboration caching method and system for content center network |
| CN103747083A (en) * | 2014-01-02 | 2014-04-23 | 北京邮电大学 | Content pushing method based on CCN (Content Centric Network) |
| US20150117253A1 (en) * | 2013-10-30 | 2015-04-30 | Palo Alto Research Center Incorporated | Interest messages with a payload for a named data network |
| CN105656788A (en) * | 2015-12-25 | 2016-06-08 | 中国科学院信息工程研究所 | CCN (Content Centric Network) content caching method based on popularity statistics |
| CN106982248A (en) * | 2017-03-01 | 2017-07-25 | 中国科学院深圳先进技术研究院 | The caching method and device of a kind of content center network |
| CN107343304A (en) * | 2017-05-15 | 2017-11-10 | 中国科学院信息工程研究所 | The cooperation caching method of content center network |
| CN108173903A (en) * | 2017-11-30 | 2018-06-15 | 南京邮电大学 | Application of the autonomous system cooperation caching strategy in CCN |
-
2018
- 2018-09-03 CN CN201811020944.XA patent/CN108965479B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103001870A (en) * | 2012-12-24 | 2013-03-27 | 中国科学院声学研究所 | Collaboration caching method and system for content center network |
| US20150117253A1 (en) * | 2013-10-30 | 2015-04-30 | Palo Alto Research Center Incorporated | Interest messages with a payload for a named data network |
| CN103747083A (en) * | 2014-01-02 | 2014-04-23 | 北京邮电大学 | Content pushing method based on CCN (Content Centric Network) |
| CN105656788A (en) * | 2015-12-25 | 2016-06-08 | 中国科学院信息工程研究所 | CCN (Content Centric Network) content caching method based on popularity statistics |
| CN106982248A (en) * | 2017-03-01 | 2017-07-25 | 中国科学院深圳先进技术研究院 | The caching method and device of a kind of content center network |
| CN107343304A (en) * | 2017-05-15 | 2017-11-10 | 中国科学院信息工程研究所 | The cooperation caching method of content center network |
| CN108173903A (en) * | 2017-11-30 | 2018-06-15 | 南京邮电大学 | Application of the autonomous system cooperation caching strategy in CCN |
Non-Patent Citations (1)
| Title |
|---|
| WANG J M等: "Intra-AS cooperative caching for content-centric networkks", 《PROCEEDINGS OF THE 3RD ACM SIGCOMM WORKSHOP ON INFORMATION-CENTRIC NETWORKING》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109951390A (en) * | 2019-03-08 | 2019-06-28 | 西安交通大学 | A kind of network equipment and its cooperation route-caching method based on PopBetw strategy |
| CN110365801A (en) * | 2019-08-26 | 2019-10-22 | 陕西师范大学 | Based on the cooperation caching method of subregion in information centre's network |
| CN110365801B (en) * | 2019-08-26 | 2021-12-17 | 陕西师范大学 | Partition-based cooperative caching method in information center network |
| CN111614771A (en) * | 2020-05-25 | 2020-09-01 | 北京邮电大学 | Content caching method for content-centric Internet of things |
| CN114401317A (en) * | 2022-03-25 | 2022-04-26 | 山东省计算中心（国家超级计算济南中心） | Ocean buoy-oriented multipoint cooperative active cache networking method and system |
| CN114401317B (en) * | 2022-03-25 | 2022-07-05 | 山东省计算中心（国家超级计算济南中心） | Ocean buoy-oriented multipoint cooperative active cache networking method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108965479B (en) | 2021-04-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR101607879B1 (en) | Adaptive multi-interface use for content networking | |
| CN108965479A (en) | A kind of domain collaboration caching method and device based on content center network | |
| US10574574B2 (en) | System and method for BGP sFlow export | |
| JP3875107B2 (en) | Packet switching system, packet switching method, routing device, packet data and generation method thereof | |
| EP2835942B1 (en) | Dynamic interest forwarding mechanism for information centric networking | |
| CN103329487A (en) | Method and router for service named routing | |
| CN104618243B (en) | Method for routing, apparatus and system, Scheduling of Gateway method and device | |
| CN103560959B (en) | Method and device for selecting static route | |
| CN104580165B (en) | A kind of cooperation caching method in wisdom contract network | |
| CN104429038A (en) | Route forwarding method, apparatus and system | |
| CN102035735A (en) | Device and method for providing forwarding and qos information | |
| US9979643B2 (en) | Communication apparatus, communication method, and computer-readable recording medium | |
| CN109743414B (en) | Method for improving address translation availability using redundant connections and computer readable storage medium | |
| CN106464745B (en) | Server, client and the method for data synchronization of DNS | |
| CN105991793B (en) | The method and apparatus of message forwarding | |
| CN108768878A (en) | A kind of SiteServer LBS, method, apparatus and load-balancing device | |
| CN104901996B (en) | The method and apparatus for avoiding content to repeat storage in distributed caching collaboration | |
| CN109450795A (en) | A kind of service router and service network system of service-oriented network | |
| CN103546375B (en) | content routing method and device | |
| US10536368B2 (en) | Network-aware routing in information centric networking | |
| CN103179161A (en) | Content acquisition method, device and network system | |
| CN112910785B (en) | NDN-based edge calculation routing table establishing and using method | |
| CN104737505A (en) | Routing method based on cache and route node | |
| CN110460526B (en) | Communication method for content-oriented networking data acquisition and distribution of Internet of things | |
| CN103139076B (en) | Distributed hashtable intercommunication network system, domain intermediate node and implementation method |
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 |