CN108965479B - Domain collaborative caching method and device based on content-centric network - Google Patents
Domain collaborative caching method and device based on content-centric network Download PDFInfo
- Publication number
- CN108965479B CN108965479B CN201811020944.XA CN201811020944A CN108965479B CN 108965479 B CN108965479 B CN 108965479B CN 201811020944 A CN201811020944 A CN 201811020944A CN 108965479 B CN108965479 B CN 108965479B
- Authority
- CN
- China
- Prior art keywords
- node
- packet
- cache
- data
- content
- 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.)
- Active
Links
Images
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
Abstract
According to the domain collaborative caching method and device based on the content center network, provided by the invention, the data is cached in a certain collaborative region by adopting a collaborative caching mode, the caching space of the non-path node in the collaborative region is fully utilized, meanwhile, only one copy is cached in the collaborative region, the redundancy of the data is reduced, the hardware resources in the network topology are fully utilized, and a reasonable collaborative caching strategy is adopted, so that the aims of improving the cache hit rate, reducing the route hop count and reducing the request delay are achieved, the network congestion is reduced while the pressure of a server is relieved to a certain extent, and better data service is provided for network users in the CCN.
Description
Technical Field
The invention relates to the field of content-centric networking, in particular to a domain collaborative caching method and a domain collaborative caching device based on a content-centric networking.
Background
Compared with the traditional host-centric connection-oriented network model, the CCN is more concerned about the content requested by the user, and the name of the content is used as the mark of network transmission to replace the current IP address. And the transmission mode is changed from push to pull, the intention and the request of the user are used as driving factors for information transmission, and the data routing transmission, the data positioning and the like are directly carried out by naming the content, so that the requirements of the current user are met. In the CCN, one of the most important features is node caching, data is cached on the relevant routing node, and when the same request is sent out, the node directly responds without sending to the server, so that the request delay of the user is reduced and the pressure of the server is relieved.
Currently, the main caching strategy is a centralized path caching strategy, that is, caching data on a path node through which a transmission packet passes, and there are several typical strategies, which are: 1. and caching the data on all routing nodes of the transmission packet passing through the path by using a cache [1] everywhere. 2. The probability cache [2] is an improvement of everywhere caching, when a transmission packet passes through a routing node, data is cached according to a certain probability, the redundancy of the data can be reduced to a certain extent 3. a downstream node cache [3] caches the packet only on an edge node requested by a user, the redundancy of the data can be reduced to a large extent 4. a node centrality cache [4] caches the transmission packet in a network topological graph, and on the routing node with a large node centrality value, the importance of the node is fully considered and meanwhile the data redundancy is reduced.
In the CCN, the selection of the cache policy directly affects the communication quality, most of the current various cache policies are in the research stage, and the implemented policies are weak in data redundancy processing, request delay reduction, and the like, so the main purpose of the present invention is to improve the cache efficiency of the CCN, improve the data hit rate and reduce the request delay by fully considering the communication topology and dynamically adjusting the user request.
At present, a centralized path caching strategy is mainly adopted in the CCN, data is cached in a router through which a data packet passes, and as a result, a plurality of identical data copies exist in a network, only a node which is close to a user request caches data can be accessed by the user, a large number of remote copies become redundant information, storage space is wasted, and through related optimization, caching of data only on a part of nodes in the network can cause problems of low hit rate, frequent core node data replacement and the like.
Disclosure of Invention
In view of this, embodiments of the present invention provide a domain collaborative caching method and apparatus based on a content centric network, which can reduce data redundancy, save storage space, improve cache hit rate, reduce request delay, and provide better data service for network users.
In a first aspect, the present invention provides a domain collaborative caching method based on a content-centric network, where the method includes:
determining intermediary center values of all nodes in a network topology, and dividing the network topology according to the intermediary center values of the nodes to obtain a plurality of cooperative cache domains, wherein each cooperative cache domain comprises a core node and a common node, the node with the largest intermediary center value corresponds to the core node, and the node directly connected with the core node is the common node;
adding a cache processing flag bit in a transmission packet, and configuring a central value attribute of a transmission node of the transmission packet in a node forwarding model on the cache flag bit;
and configuring a cooperation value table CVT in the node forwarding model, matching the cache flag bit with the cooperation value table after the node receives the transmission packet, and performing corresponding processing on the transmission packet according to the matching result.
Optionally, the transmission packet includes a data packet and an interest packet, the interest packet has a name of the content of interest, a selector, a random field, and a first cache flag bit, and the data packet has a name of the content of data, a digital signature, flag information, data, and a second cache flag bit.
Optionally, the method further comprises:
initializing an intermediate center value of an interest packet to zero when the interest packet is generated, comparing the intermediate center value of the interest packet with the intermediate center value of a target node before forwarding the interest packet each time, storing a larger intermediate center value in the interest packet, and storing the maximum intermediate center value of all nodes on a routing path by the interest packet when the interest packet reaches the target node of a data reply;
and transmitting the maximum value to a data packet, comparing the maximum value with the intermediate center value of the corresponding node after the data packet arrives at each node during returning, and storing the data in the data packet when the comparison result is equal.
Optionally, the determining the broker center values of all nodes in the network topology, and dividing the network topology according to the magnitude of the broker center values of the nodes to obtain a plurality of cooperative cache domains includes:
calculating the intermediary center values of all nodes in the network topology;
selecting a node with the maximum intermediary center value as a core node, and randomly selecting one of the nodes as the core node if a plurality of nodes have the maximum intermediary center value at the same time;
setting a core node as a common node in a one-hop or multi-hop range, wherein the core node and the surrounding common nodes form a collaborative cache domain;
and selecting the rest node sets except the partitioned collaborative cache domains as new processing objects again to be repeatedly executed until the node sets of the rest un-partitioned domains are empty, and obtaining a plurality of collaborative cache domains.
Optionally, the node forwarding model further includes an pending interest table, a forwarding information base, and a content storage table CS, where a cooperation value table is configured in the node forwarding model, the cooperation value table is configured in the node forwarding model, and after receiving a transmission packet, a node matches the cache flag bit with the cooperation value table, and performs corresponding processing on the transmission packet according to a matching result, including:
when an interest packet of a requesting user reaches a certain node in the network topology, searching a CS (circuit switched) entry of the current node, when the CS stores data content requested by the interest packet, directly discarding the interest packet and responding to a data packet carrying the requested data and returning the data packet to the requesting user along the opposite path of the arrival of the interest packet, and when the CS does not have the requested data corresponding to the request of the interest packet, searching whether content matched with the name of the interest content exists in the PIT;
if the core node is not the core node, searching whether the node type corresponding to the first cache flag bit of the interest packet is the core node or not in the CVT;
and when the node type is a common node, the core node inquires whether a corresponding common node in the managed cooperative cache domain stores the request data or not, if the corresponding common node exists, the corresponding common node returns the request data, the interest packet is discarded, and if the corresponding common node does not exist, the interest packet is forwarded to other nodes or the cooperative cache domain by using a preset routing strategy in the FIB, and an arrival interface of the interest packet is recorded in the FIB entry.
Optionally, matching the cache flag bit with the cooperation value table after the node receives the transmission packet, and performing corresponding processing on the transmission packet according to a matching result, including:
when a data packet arrives at a certain node of a network topology, inquiring whether a CS has a matched data packet according to the naming of the data content, if so, discarding the newly arrived data packet, if not, matching the interest packet with a port in the PIT, and forwarding the data packet to the matched port;
and inquiring whether the node type corresponding to the second cache flag bit of the data packet is a core node or not by using the CVT, if so, inquiring the cache benefit of the common node according to the residual cache benefit of the core node and the messages fed back by the common nodes, selecting the node with the maximum cache benefit for caching, and if so, forwarding the data packet to the core node of the cooperative cache domain where the common node is located, wherein the port information corresponds to the Tianjian in the CVT.
Optionally, after matching the interest packet with a port in the PIT, the method further includes:
and when the PIT does not have a corresponding entry, discarding the data packet.
In a second aspect, the present invention provides a domain collaborative caching apparatus based on a content-centric network, where the apparatus includes:
the network topology partitioning device comprises a partitioning unit, a cache unit and a cache unit, wherein the partitioning unit is used for determining intermediary center values of all nodes in a network topology, and partitioning the network topology according to the intermediary center values of the nodes to obtain a plurality of collaborative cache domains, each collaborative cache domain comprises a core node and a common node, the node with the largest intermediary center value corresponds to the core node, and the node directly connected with the core node is the common node;
an adding unit, configured to add a cache processing flag bit to a transmission packet, and configure a central value attribute of a transmission node of the transmission packet in a node forwarding model on the cache flag bit;
and the node forwarding unit is used for configuring a cooperation value table CVT in the node forwarding model, matching the cache flag bit with the cooperation value table after the node receives the transmission packet, and correspondingly processing the transmission packet according to the matching result.
According to the technical scheme, the embodiment of the invention has the following advantages:
according to the domain collaborative caching method and device based on the content center network, provided by the invention, the data is cached in a certain collaborative region by adopting a collaborative caching mode, the caching space of the non-path node in the collaborative region is fully utilized, meanwhile, only one copy is cached in the collaborative region, the redundancy of the data is reduced, the hardware resources in the network topology are fully utilized, and a reasonable collaborative caching strategy is adopted, so that the aims of improving the cache hit rate, reducing the route hop count and reducing the request delay are achieved, the network congestion is reduced while the pressure of a server is relieved to a certain extent, and better data service is provided for network users in the CCN.
Drawings
FIG. 1 is a flowchart of an embodiment of a domain collaborative caching method based on a content-centric network according to the present invention;
fig. 2 is a block diagram of a transmission packet according to an embodiment of the domain collaborative caching method based on the content-centric network provided by the present invention;
fig. 3 is a schematic diagram of collaborative cache domain partitioning according to an embodiment of the content-centric network-based domain collaborative caching method provided in the present invention;
fig. 4 is a flowchart of collaborative cache domain division according to an embodiment of the content-centric network-based domain collaborative caching method provided by the present invention;
FIG. 5 is a flowchart of interest packet forwarding according to an embodiment of the method for domain collaborative caching based on a content-centric network provided in the present invention;
fig. 6 is a flowchart of packet forwarding according to an embodiment of the domain collaborative caching method based on the content-centric network provided in the present invention;
FIG. 7 is a schematic simulation diagram of an embodiment of a domain collaborative caching method based on a content-centric network according to the present invention;
FIG. 8 is a schematic simulation diagram of an embodiment of a domain collaborative caching method based on a content-centric network according to the present invention;
fig. 9 is a simulation diagram of an embodiment of a domain collaborative caching method based on a content-centric network according to the present invention.
Detailed Description
In order to make the technical solutions of the present invention better understood, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The terms "first," "second," "third," "fourth," and the like in the description and in the claims, as well as in the drawings, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It will be appreciated that the data so used may be interchanged under appropriate circumstances such that the embodiments described herein may be practiced otherwise than as specifically illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
Referring to fig. 1, the present invention provides a domain collaborative caching method based on a content-centric network, where the method includes:
s101, determining intermediary center values of all nodes in a network topology, dividing the network topology according to the intermediary center values of the nodes to obtain a plurality of cooperative cache domains, wherein each cooperative cache domain comprises a core node and a common node, the node with the largest intermediary center value corresponds to the core node, and the node directly connected with the core node is the common node.
S102, adding a caching processing flag bit in a transmission packet, and configuring the central value attribute of the transmission packet in a node forwarding model on the caching flag bit.
S103, configuring a cooperation value table CVT in the node forwarding model, matching the cache flag bit with the cooperation value table after the node receives the transmission packet, and performing corresponding processing on the transmission packet according to the matching result.
According to the domain collaborative caching method based on the content center network, provided by the invention, data is cached in a certain collaborative region by adopting a collaborative caching mode, the caching space of a non-path node in the collaborative region is fully utilized, meanwhile, only one copy is cached in the collaborative region, the redundancy of the data is reduced, hardware resources in a network topology are fully utilized, and a reasonable collaborative caching strategy is adopted, so that the purposes of improving the cache hit rate, reducing the route hop count and reducing the request delay are achieved, the network congestion is reduced while the pressure of a server is relieved to a certain extent, and better data service is provided for network users in a CCN.
In conjunction with fig. 2, the importance of a node may be measured by the Betweenness center of the node, and in a network topology, the Betweenness center of v nodes refers to the sum of the number of paths passing through v nodes in all shortest paths from a source node s to a destination node t (excluding v nodes themselves) and the total number of shortest paths in the topology. The communication in the content-centric networking CCN is driven by the user side, and the transmission packets during the transmission process mainly include two types of data, i.e., an entertaining packet and a data packet. The interest packet mainly comprises a name of interest content, a selector and a random field; the data packet comprises the parts of naming, digital signature, mark information, data and the like of data contents, a cache processing mark bit is added on an original structure, an intermediate center value of each node is obtained through a Dijkstra algorithm, the intermediate center value is stored in the cache mark bit of each node, the interest packet corresponds to a first cache mark bit, and the data packet corresponds to a second cache mark bit.
Since the transmission packets need to be transmitted between the nodes, the newly added domain needs to be correspondingly encoded and decoded for transmission. If the intermediate center value is initialized to zero when the interest packet is generated, and simultaneously the intermediate center value in the interest packet is compared with the center value of the arriving node before forwarding the interest packet each time, a larger value is stored in the interest packet, so that when the interest packet arrives at a node or a server of a data reply, the value which is the maximum value of the center values of all nodes on the routing path is stored, the value is transmitted to the data packet, the data packet is compared with the center value of the corresponding node after arriving at each node in the process of returning, the data is stored when the values are equal, and the data is stored on the node with the maximum path intermediate center value, namely, the basic node centrality caching strategy is realized. However, the domain cooperation strategy provided by the invention can only store data on the nodes on the transmission path, and can cause the problems of waste of other node cache spaces, unbalanced load and the like. The basic transmission packet is added with a cache flag processing bit, so that the central value attribute of the node can be transmitted in a node forwarding model for the packet, and the purpose of transferring the transmission packet to the corresponding node is achieved.
In conjunction with fig. 3 and 4, in step S102, the cooperative cache domain is divided for all nodes in the network topology, and specifically, the network topology may be modeled as an undirected graph G ═ V, E, where V is a set of network nodes and E is a set of edges connected in the network. The cooperative domain is divided to fully utilize the cache space of all the nodes, and meanwhile, a cooperation range indication and an importance mark of the node are provided for a cooperation value table in a forwarding model of the node. According to an actual communication topological graph, on the basis of a node intermediate center value obtained through calculation, a node with a larger intermediate center value is selected as a core node, nodes directly connected around the node are selected as common nodes, and the topological graph is roughly divided into a plurality of domains with the core node as a guide, and the specific steps comprise the following steps:
s1, calculating the intermediate center values of all nodes in the network topology;
s2, selecting the node with the maximum intermediary center value as a core node, and if a plurality of nodes have the maximum intermediary center value at the same time, randomly selecting one of the nodes as the core node;
s3, setting the core node as a common node in a one-hop or multi-hop range, and enabling the core node and the surrounding common nodes to form a cooperative cache domain;
and S4, selecting the rest node set except the collaborative cache domain as a new processing object again to repeatedly execute S2 and S3 until the node set of the rest un-partitioned domain is empty, and obtaining a plurality of collaborative cache domains.
As shown in fig. 5, in step S103, the node Forwarding model further includes a Pending Interest Table (PIT), a Forwarding Information Base (FIB), and a Content Store Table (CS), and a Forwarding procedure for the Interest packet may be as follows:
when an interest packet of a requesting user reaches a certain node in the network topology, searching a CS (circuit switched) entry of the current node, when the CS stores data content requested by the interest packet, directly discarding the interest packet and responding to a data packet carrying the requested data and returning the data packet to the requesting user along the opposite path of the arrival of the interest packet, when the CS does not have the requested data corresponding to the request of the interest packet, searching whether content matched with the name of the interest content exists in a PIT (packet Internet protocol), and performing matching search by adopting a named longest prefix matching algorithm during searching;
if the core node is not the core node, searching whether the node type corresponding to the first cache flag bit of the interest packet is the core node or not in the CVT;
and when the node type is a common node, the core node inquires whether a corresponding common node in the managed cooperative cache domain stores the request data or not, if the corresponding common node exists, the corresponding common node returns the request data, the interest packet is discarded, and if the corresponding common node does not exist, the interest packet is forwarded to other nodes or the cooperative cache domain by using a preset routing strategy in the FIB, and an arrival interface of the interest packet is recorded in the FIB entry.
Referring to fig. 6, in step S103, after receiving the interest packet, the node searches for a data packet according to the request data of the interest packet and returns the data packet, where the forwarding process of the data packet may include the following steps:
when a data packet arrives at a certain node of a network topology, inquiring whether a CS has a matched data packet according to the naming of the data content, if so, discarding the newly arrived data packet, if not, matching the interest packet with a port in the PIT, forwarding the data packet to the matched port, and performing matching search by adopting a named longest prefix matching algorithm during searching;
inquiring whether the node type corresponding to the second cache flag bit of the data packet inquired by using the CVT is a core node, if so, inquiring the cache benefit of the common node according to the residual cache benefit of the core node and by combining messages fed back by the common nodes, selecting the node with the maximum cache benefit to cache, if so, forwarding the data packet to the core node of a cooperative cache domain where the common node is located, and if not, discarding the data packet.
According to the domain collaborative caching method based on the content center network, the data are cached in a certain collaborative area in a collaborative caching mode, the caching space of the non-path node in the collaborative area is fully utilized, and meanwhile, only one copy of the copy is cached in the collaborative area, so that the redundancy of the data is reduced. Hardware resources in a network topology are fully utilized, a reasonable cooperative caching strategy is adopted, the aims of improving the cache hit rate, reducing the route hop count and reducing the request delay are achieved, the pressure of a server is relieved to a certain extent, meanwhile, network congestion is reduced, and better data service is provided for network users in the CCN.
The domain collaborative cache based on the content-centric network of the present invention is simulated by using a simulation platform, so as to better understand the effect of the present solution, specifically, the main parameters during simulation are set as follows: the network topology graph uses a typical represented GEANT2012, the simulation time is set to be 50s, the content request probability obeys Zipf distribution, a Least Recently Used (LRU) replacement strategy is used, an AppDelayTracer and a CS content storage table Tracer are installed, the sampling period is set to be 2s, wherein in the step 7, the intermediate center value of the GEANT2012 topology node is successfully calculated, in the step 8, a program is successfully compiled and run on an ndnSIM simulation platform, and in the step 9, the response data packet request is successfully tracked.
Through the simulation and the introduction of the scheme, in the content center network, the high-efficiency caching strategy can bring good user experience to a network user, and the information request trend of people in the future can be better met unlike the TCP/IP network communication. The new network communication architecture is in a research stage, so most of the caching strategies proposed based on the network communication architecture are in a research stage, and the mature caching technology is basically based on path centralized caching.
The invention departs the traditional centralized path cache strategy, expands the cache range to the domain, avoids the problem of unbalanced load distribution in the data cache process, simultaneously, the domain cooperative cache strategy can fully utilize the cache space of each node in the cooperative domain, can store more contents than the centralized path cache strategy under the same condition, and reduces the frequent replacement of data.
Meanwhile, the method has lower node cost overhead, is operated based on the original data structure, has better compatibility with the original emulation platform, cooperatively caches the content blocks with fine granularity on the basis of fully considering the network topology structure, ensures that the content blocks have only one copy in the current node domain, reduces the data redundancy in the communication process, reduces the route hop number, improves the hit rate of the content, can better relieve the pressure of the server and the network congestion, and brings good use experience to users.
Correspondingly, the invention also provides a domain collaborative caching device based on the content center network, and the device comprises:
the network topology partitioning device comprises a partitioning unit, a cache unit and a cache unit, wherein the partitioning unit is used for determining intermediary center values of all nodes in a network topology, and partitioning the network topology according to the intermediary center values of the nodes to obtain a plurality of collaborative cache domains, each collaborative cache domain comprises a core node and a common node, the node with the largest intermediary center value corresponds to the core node, and the node directly connected with the core node is the common node;
an adding unit, configured to add a cache processing flag bit to a transmission packet, and configure a central value attribute of a transmission node of the transmission packet in a node forwarding model on the cache flag bit;
and the node forwarding unit is used for configuring a cooperation value table CVT in the node forwarding model, matching the cache flag bit with the cooperation value table after the node receives the transmission packet, and correspondingly processing the transmission packet according to the matching result.
According to the domain collaborative caching method based on the content center network, the data are cached in a certain collaborative area in a collaborative caching mode, the caching space of the non-path node in the collaborative area is fully utilized, and meanwhile, only one copy of the copy is cached in the collaborative area, so that the redundancy of the data is reduced. Hardware resources in a network topology are fully utilized, a reasonable cooperative caching strategy is adopted, the aims of improving the cache hit rate, reducing the route hop count and reducing the request delay are achieved, the pressure of a server is relieved to a certain extent, meanwhile, network congestion is reduced, and better data service is provided for network users in the CCN.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
Those skilled in the art will appreciate that all or part of the steps in the methods of the above embodiments may be implemented by associated hardware instructed by a program, which may be stored in a computer-readable storage medium, and the storage medium may include: read Only Memory (ROM), Random Access Memory (RAM), magnetic or optical disks, and the like.
The above detailed description is provided for the domain collaborative caching method and apparatus based on the content centric network, and for those skilled in the art, the idea according to the embodiment of the present invention may be changed in the specific implementation and application scope.
Claims (6)
1. A domain collaborative caching method based on a content-centric network is characterized by comprising the following steps:
determining intermediary center values of all nodes in a network topology, and dividing the network topology according to the intermediary center values of the nodes to obtain a plurality of cooperative cache domains, wherein each cooperative cache domain comprises a core node and a common node, the node with the largest intermediary center value corresponds to the core node, and the node directly connected with the core node is the common node;
adding a cache zone bit in a transmission packet, and configuring a central value attribute of a transmission node of the transmission packet in a node forwarding model on the cache zone bit;
configuring a cooperation value table CVT in the node forwarding model, matching the cache flag bit with the cooperation value table after a node receives a transmission packet, and performing corresponding processing on the transmission packet according to a matching result;
the determining the intermediary center values of all nodes in the network topology, and dividing the network topology according to the intermediary center values of the nodes to obtain a plurality of cooperative cache domains includes:
calculating the intermediary center values of all nodes in the network topology;
selecting a node with the maximum intermediary center value as a core node, and randomly selecting one of the nodes as the core node if a plurality of nodes have the maximum intermediary center value at the same time;
setting a core node as a common node in a one-hop or multi-hop range, wherein the core node and the surrounding common nodes form a collaborative cache domain;
selecting the rest node set without the partitioned collaborative cache domains as a new processing object to be repeatedly executed until the node set of the rest un-partitioned domains is empty, and obtaining a plurality of collaborative cache domains;
the node forwarding model further comprises a pending interest table PIT, a forwarding information base FIB and a content storage table CS, wherein a cooperation value table is configured in the node forwarding model, after the node receives a transmission packet, the cache flag bit is matched with the cooperation value table, and the transmission packet is correspondingly processed according to a matching result, and the method comprises the following steps:
when an interest packet of a requesting user reaches a certain node in the network topology, searching a CS (circuit switched) entry of the current node, when the CS stores data content requested by the interest packet, directly discarding the interest packet and responding to a data packet carrying request data and returning the data packet to the requesting user along the opposite path of the arrival of the interest packet, and when the CS does not have the request data corresponding to the interest packet request, searching whether content matched with the name of the content of the interest packet exists in the PIT;
if the core node is not the core node, searching whether the node type corresponding to the first cache flag bit of the interest packet is the core node or not in the CVT;
and when the node type is a common node, the core node inquires whether a corresponding common node in the managed cooperative cache domain stores the request data or not, if the corresponding common node exists, the corresponding common node returns the request data, the interest packet is discarded, and if the corresponding common node does not exist, the interest packet is forwarded to other nodes or the cooperative cache domain by using a preset routing strategy in the FIB, and an arrival interface of the interest packet is recorded in the FIB entry.
2. The content-centric network-based domain collaborative caching method according to claim 1, wherein the transport packet comprises a data packet and an interest packet, the interest packet has a name, a selector, a random field, and a first cache flag bit of interest, and the data packet has a name, a digital signature, flag information, data, and a second cache flag bit of data content.
3. The content-centric network-based domain collaborative caching method according to claim 2, further comprising:
initializing an intermediate center value of an interest packet to zero when the interest packet is generated, comparing the intermediate center value of the interest packet with the intermediate center value of a target node before forwarding the interest packet each time, storing a larger intermediate center value in the interest packet, and storing the maximum intermediate center value of all nodes on a routing path by the interest packet when the interest packet reaches the target node of a data reply;
and transmitting the maximum value to a data packet, comparing the maximum value with the intermediate center value of the corresponding node after the data packet arrives at each node during returning, and storing the data in the data packet when the comparison result is equal.
4. The domain collaborative caching method based on the content-centric network according to claim 3, wherein the matching of the cache flag bit with the collaboration value table is performed after the node receives the transmission packet, and the corresponding processing of the transmission packet is performed according to the matching result, and comprises:
when a data packet arrives at a certain node of a network topology, inquiring whether a CS has a matched data packet according to the naming of the data content, if so, discarding the newly arrived data packet, if not, matching the interest packet with a port in the PIT, and forwarding the data packet to the matched port;
and inquiring whether the node type corresponding to the second cache flag bit of the data packet is a core node or not by using the CVT, if so, inquiring the cache benefit of the common node according to the residual cache benefit of the core node and the messages fed back by the common nodes, selecting the node with the maximum cache benefit for caching, adding corresponding port information in the CVT, and if so, forwarding the data packet to the core node of a cooperative cache domain where the common node is located.
5. The content-centric network-based domain collaborative caching method according to claim 4, wherein after matching the interest packet with a port in the PIT, the method further comprises:
and when the PIT does not have a corresponding entry, discarding the data packet.
6. A content-centric network-based domain collaborative caching apparatus using the content-centric network-based domain collaborative caching method according to claim 1, comprising:
the network topology partitioning device comprises a partitioning unit, a cache unit and a cache unit, wherein the partitioning unit is used for determining intermediary center values of all nodes in a network topology, and partitioning the network topology according to the intermediary center values of the nodes to obtain a plurality of collaborative cache domains, each collaborative cache domain comprises a core node and a common node, the node with the largest intermediary center value corresponds to the core node, and the node directly connected with the core node is the common node;
an adding unit, configured to add a cache flag bit to a transmission packet, and configure a central value attribute of a transmission node of the transmission packet in a node forwarding model on the cache flag bit;
and the node forwarding unit is used for configuring a cooperation value table CVT in the node forwarding model, matching the cache flag bit with the cooperation value table after the node receives the transmission packet, and correspondingly processing the transmission packet according to the matching result.
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 CN108965479A (en) | 2018-12-07 |
| CN108965479B true 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) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109951390B (en) * | 2019-03-08 | 2021-01-19 | 西安交通大学 | Network device based on PopBetw strategy and cooperative route caching method thereof |
| CN110365801B (en) * | 2019-08-26 | 2021-12-17 | 陕西师范大学 | Partition-based cooperative caching method in information center network |
| CN111614771B (en) * | 2020-05-25 | 2021-07-13 | 北京邮电大学 | Content caching method for content-centric Internet of things |
| CN114401317B (en) * | 2022-03-25 | 2022-07-05 | 山东省计算中心（国家超级计算济南中心） | Ocean buoy-oriented multipoint cooperative active cache networking method and system |
Citations (5)
| 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) |
| 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 |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9276840B2 (en) * | 2013-10-30 | 2016-03-01 | Palo Alto Research Center Incorporated | Interest messages with a payload for a named data network |
| CN105656788B (en) * | 2015-12-25 | 2019-08-06 | 中国科学院信息工程研究所 | CCN content buffering method based on popularity statistics |
-
2018
- 2018-09-03 CN CN201811020944.XA patent/CN108965479B/en active Active
Patent Citations (5)
| 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) |
| 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 |
|---|
| Intra-AS cooperative caching for content-centric networkks;Wang J M等;《Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking》;20130831;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108965479A (en) | 2018-12-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108965479B (en) | Domain collaborative caching method and device based on content-centric network | |
| KR101607879B1 (en) | Adaptive multi-interface use for content networking | |
| Zhang et al. | A survey of caching mechanisms in information-centric networking | |
| CN104753797B (en) | A kind of content center network dynamic routing method based on selectivity caching | |
| CN103581019B (en) | A kind of information centre's network mobility management method of content-based popularity | |
| US10587513B2 (en) | Method, apparatus and system for determining content acquisition path and processing request | |
| CN110313162A (en) | Promote in a network environment to the system and method for the content delivery of multiple recipients | |
| CN103905332B (en) | A kind of method and apparatus for determining cache policy | |
| CN108900570B (en) | Cache replacement method based on content value | |
| Nour et al. | A distributed cache placement scheme for large-scale information-centric networking | |
| CN103329487A (en) | Method and router for service named routing | |
| WO2013130359A1 (en) | A method for collaborative caching for content-oriented networks | |
| KR20140067881A (en) | Method for transmitting packet of node and content owner in content centric network | |
| JP2003209567A (en) | System and method for switching packet, routing device, packet data, and method for generating the packet data | |
| CN105872008A (en) | System and method for on-demand content exchange with adaptive naming in information-centric networks | |
| Alghamdi et al. | A novel fog computing based architecture to improve the performance in content delivery networks | |
| Kalghoum et al. | Fcr-ns: a novel caching and forwarding strategy for named data networking based on software defined networking | |
| Ascigil et al. | A native content discovery mechanism for the information-centric networks | |
| CN109450795A (en) | A kind of service router and service network system of service-oriented network | |
| CN105656788A (en) | CCN (Content Centric Network) content caching method based on popularity statistics | |
| Banerjee et al. | Characteristic time routing in information centric networks | |
| Nguyen et al. | Adaptive caching for beneficial content distribution in information-centric networking | |
| CN107404438A (en) | Network route method and network route system | |
| CN106130912B (en) | A kind of routing node and method for routing | |
| CN107302571A (en) | Information centre's network route and buffer memory management method based on drosophila algorithm |
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 |