CN108063726B - Information cache routing method, system and equipment in information center network - Google Patents
Information cache routing method, system and equipment in information center network Download PDFInfo
- Publication number
- CN108063726B CN108063726B CN201711294703.XA CN201711294703A CN108063726B CN 108063726 B CN108063726 B CN 108063726B CN 201711294703 A CN201711294703 A CN 201711294703A CN 108063726 B CN108063726 B CN 108063726B
- Authority
- CN
- China
- Prior art keywords
- information
- node
- target
- linear programming
- directed graph
- 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
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/14—Routing performance; Theoretical aspects
-
- 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/56—Routing software
-
- 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/68—Pseudowire emulation, e.g. IETF WG PWE3
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
The invention discloses an information cache routing method, a system, equipment and a computer storage medium in an information center network, wherein the method comprises the following steps: acquiring state parameters of an information center network, wherein the state parameters comprise source node parameters, intermediate node parameters, destination node parameters and a first content transmission relation among nodes; establishing a target linear programming model based on the state parameters and the target conditions; and solving a solution value of the target linear programming model, and acquiring a cache and routing method corresponding to the target condition based on the solution value. According to the information caching routing method in the information center network, the caching and routing method corresponding to the target condition is obtained by means of a linear programming method, and the technical problem of improving the applicability of a cooperative caching mode in the information center network is solved to a certain extent. The information caching routing system, the information caching routing equipment and the computer storage medium in the information center network also solve the corresponding technical problems.
Description
Technical Field
The present invention relates to the technical field of content distribution of network coding in an information center network, and more particularly, to a method, a system, and a device for information cache routing in an information center network.
Background
With the development of big data, the data traffic volume in the network is increased rapidly, especially the multimedia data is growing rapidly, and more reasonable utilization of network resources is required, which requires improvement of network architecture.
One existing network architecture is an information-centric network, which introduces the concept of naming content and allows caching by nodes within the network. The latest information center network information content caching method is cooperative caching, and in the caching mode, the intermediate content router and the neighbor nodes jointly determine how to cache information so as to effectively improve the caching efficiency.
However, in the prior art, there is no effective cooperative caching method, so that the caching and routing method selected by using the method can save network resources, reduce data acquisition delay, ensure data transmission security, and the like, and the applicability of the conventional cooperative caching method is low.
In summary, how to improve the applicability of the cooperative caching method in the information center network is a problem to be solved urgently by those skilled in the art.
Disclosure of Invention
The invention aims to provide an information caching routing method in an information center network, which can solve the technical problem of improving the applicability of a cooperative caching mode in the information center network to a certain extent. The invention also provides an information caching routing system, equipment and a computer storage medium in the information center network.
In order to achieve the above purpose, the invention provides the following technical scheme:
an information cache routing method in an information center network comprises the following steps:
acquiring state parameters of an information center network, wherein the state parameters comprise source node parameters, intermediate node parameters, destination node parameters and a first content transmission relation among nodes;
establishing a target linear programming model based on the state parameters and the target conditions;
and solving a solution value of the target linear programming model, and acquiring a caching and routing method corresponding to the target condition based on the solution value.
Preferably, the establishing a target linear programming model based on the state parameters and the target conditions includes:
constructing a virtual node, and establishing a second content transmission relation corresponding to the virtual node based on the state parameter;
and establishing a target linear programming model based on the state parameters, the second content transmission relation and the target condition.
Preferably, after the obtaining of the state parameter of the information center network and before the constructing of the virtual node, the method further includes:
representing the information-centric network as a first directed graph based on the state parameter;
wherein the format of the first directed graph comprises: g denotes the first directed graph, V denotes a set of a source node, an intermediate node, and a destination node, and E denotes an edge set corresponding to the first content transfer relationship;
after the establishing of the second content transmission relationship corresponding to the virtual node based on the state parameter, and before the establishing of the target linear programming model based on the state parameter, the second content transmission relationship and the target condition, the method further includes:
converting the first directed graph into a second directed graph based on the virtual node and the second content transmission relationship;
wherein the format of the second directed graph comprises: b denotes the second directed graph, X denotes the set of V and the virtual node, and Y denotes the set of E and the second content transfer relationship.
Preferably, the solving of the solution value of the target linear programming model includes:
describing the target linear programming model by means of AMPL language;
and solving a solution value of the target linear programming model described by the AMPL language by using a CPLEX solver.
An information caching routing system in an information-centric network, comprising:
the system comprises an acquisition module, a processing module and a display module, wherein the acquisition module is used for acquiring state parameters of an information center network, and the state parameters comprise source node parameters, intermediate node parameters, destination node parameters and a first content transmission relation among nodes;
the establishing module is used for establishing a target linear programming model based on the state parameters and the target conditions;
and the solving module is used for solving the solution value of the target linear programming model and acquiring the cache and routing method corresponding to the target condition based on the solution value.
Preferably, the establishing module includes:
the construction unit is used for constructing a virtual node and establishing a second content transmission relation corresponding to the virtual node based on the state parameter;
and the establishing unit is used for establishing a target linear programming model based on the state parameters, the second content transmission relation and the target conditions.
Preferably, the method further comprises the following steps:
the first directed graph module is used for representing the information center network as a first directed graph based on the state parameters after the acquisition module acquires the state parameters of the information center network and before the construction unit constructs a virtual node;
wherein the format of the first directed graph comprises: g denotes the first directed graph, V denotes a set of a source node, an intermediate node, and a destination node, and E denotes an edge set corresponding to the first content transfer relationship;
the second directed graph unit is used for converting the first directed graph into a second directed graph based on the virtual node and the second content transmission relation after the construction unit establishes the second content transmission relation corresponding to the virtual node based on the state parameter and before the establishment unit establishes a target linear programming model based on the state parameter, the second content transmission relation and a target condition;
wherein the format of the second directed graph comprises: b denotes the second directed graph, X denotes the set of V and the virtual node, and Y denotes the set of E and the second content transfer relationship.
Preferably, the obtaining module includes:
a description unit for describing the target linear programming model by means of the AMPL language;
and the solving unit is used for solving a solution value of the target linear programming model described by the AMPL language by using a CPLEX solver.
An information cache routing control device in an information centric network, comprising:
a memory for storing a computer program;
a processor, configured to implement the steps of the information cache routing method in the information-centric network as described in any above when the computer program is executed.
A computer storage medium having a computer program stored thereon, the computer program when executed by a processor implementing the steps of an information cache routing method in an information-centric network as described in any one of the above.
The invention provides an information cache routing method in an information center network, which comprises the steps of firstly obtaining state parameters of the information center network, wherein the state parameters comprise source node parameters, intermediate node parameters, destination node parameters and a first content transmission relation among nodes; then, establishing a target linear programming model based on the state parameters and the target conditions; and finally, solving a solution value of the target linear programming model, and acquiring a cache and routing method corresponding to the target condition based on the solution value. According to the information caching routing method in the information center network, the caching and routing method corresponding to the target condition is obtained by means of a linear programming method, and the technical problem of improving the applicability of a cooperative caching mode in the information center network is solved to a certain extent. The information caching routing system, the information caching routing equipment and the computer storage medium in the information center network also solve the corresponding technical problems.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
Fig. 1 is a flowchart of an information caching routing method in an information center network according to an embodiment of the present invention;
FIG. 2 is an exemplary diagram of content distribution in a network-coding based information-centric network;
fig. 3 is a schematic diagram of a first directed graph constructed by applying the information caching routing method in the information center network according to the embodiment of the present invention;
fig. 4 is a schematic diagram of a second directed graph constructed by applying the information caching routing method in the information center network according to the embodiment of the present invention;
FIG. 5 is a graph showing the results of a second objective function;
FIG. 6 is a graph showing the results of the third objective function;
FIG. 7 is a diagram illustrating the results of a cache routing method corresponding to a target condition;
fig. 8 is a schematic structural diagram of an information caching routing system in an information center network according to an embodiment of the present invention;
fig. 9 is a schematic structural diagram of an information cache routing control device in an information center network according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The action execution main body of each step in the information cache routing method in the information center network provided by the embodiment of the invention can be an information cache routing system in the information center network provided by the embodiment of the invention, and the system can be built in a computer, so that in the information cache routing method in the information center network provided by the embodiment of the invention, the action execution main body of each step can be a computer with the built-in system. For convenience of description, the action execution main body of each step in the information caching routing method in the information center network according to the embodiment of the present invention is set as an information caching routing system, which is referred to as a caching routing system for short, in the information center network according to the embodiment of the present invention.
The information center network is based on network coding. The attack model related by the invention is as follows: all intermediate nodes except the source node and the destination node in the information center network independently eavesdrop and analyze the coded packets passing through the intermediate nodes, and attempt to decode to obtain information related to the original file. The source node may be a server, etc., and the intermediate node and the destination node may be routers, etc.
Referring to fig. 1, fig. 1 is a flowchart of an information caching routing method in an information center network according to an embodiment of the present invention.
The information cache routing method in the information center network provided by the embodiment of the invention can comprise the following steps:
step S101: the method comprises the steps of obtaining state parameters of an information center network, wherein the state parameters comprise source node parameters, intermediate node parameters, destination node parameters and a first content transmission relation among nodes.
In practical application, a cache routing system firstly acquires state parameters of an information center network; the source node parameters comprise complete original file information stored by the source node; the intermediate node parameters comprise the cache capacity and the cache cost of each intermediate node; the destination node parameters comprise a set of destination nodes corresponding to each file; the first content transmission relationship between the nodes comprises the file transmission relationship and the bandwidth consumption cost between every two related nodes. In practical application, whether two nodes are related or not can be judged by judging whether a communication link exists between the two nodes, if the communication link exists between the two nodes, the two nodes are related, and if the communication link does not exist between the two nodes, the two nodes are unrelated.
Step S102: and establishing a target linear programming model based on the state parameters and the target conditions.
After the cache routing system obtains the state parameters of the information center network, a target linear programming model can be established based on the state parameters and the target conditions. The target condition mentioned here refers to a selection condition of the cache routing method, and the target condition may be determined according to actual needs, for example, the sum of cache cost and bandwidth consumption cost required for minimizing security content caching and routing in the whole information center network, and the sum of cache cost and bandwidth consumption cost mentioned here is: the sum of the product of the number of the coding blocks cached by each intermediate node and the cost of the coding block cached by the unit on the intermediate node is added with the sum of the product of the rate of the coding block actually transmitted by each two-phase joint point and the cost of the coding block transmitted by the unit between the two relevant nodes; the target linear programming model includes an objective function and a constraint condition corresponding to a state parameter and a target condition. The constraint conditions are used for ensuring the data flow conservation of the in-and-out intermediate nodes, ensuring the data flow conservation of the data sent by the source node and the data flow conservation received by the destination node, controlling the flow size between every two adjacent joint nodes to be non-negative and meeting the multicast property, ensuring that the quantity of the coded quantity packets received by each destination node is enough to analyze the original file, ensuring that the total quantity of the coded blocks cached on the intermediate nodes does not exceed the cache capacity of the coded blocks, and ensuring that the requirement of information theory safety can be met on each intermediate node which is possible to eavesdrop.
Here, taking the objective condition as the sum of the cache cost and the bandwidth consumption cost required for minimizing the security content cache and the routing in the whole information center network as an example, the objective condition in the embodiments described below is also this, and the process of establishing the linear programming model is described, which may include:
defining the state parameters;
variables are defined, where said variables are: the method comprises the steps that a source node generates the rate of random information blocks, the rate of coding blocks of each file actually transmitted between every two related nodes, the total number of the coding blocks of each file downloaded by each destination node, and the total number of the coding blocks of each file cached on each intermediate node;
constructing a constraint condition;
and constructing an objective function by using the objective condition, the defined state parameters and the defined variables, wherein the objective function and the constraint condition are linear programming models.
Step S103: and solving a solution value of the target linear programming model, and acquiring a cache and routing method corresponding to the target condition based on the solution value.
After solving the target linear programming model, the cache routing system can obtain a cache and routing method corresponding to the target condition based on the solution value, wherein the cache and routing method comprises a path for transmitting the file from the intermediate node to the target node and coding block information transmitted on each path.
The invention provides an information cache routing method in an information center network, which comprises the steps of firstly obtaining state parameters of the information center network, wherein the state parameters comprise source node parameters, intermediate node parameters, destination node parameters and a first content transmission relation among nodes; then, establishing a target linear programming model based on the state parameters and the target conditions; and finally, solving a solution value of the target linear programming model, and acquiring a cache and routing method corresponding to the target condition based on the solution value. According to the information caching routing method in the information center network, the caching and routing method corresponding to the target condition is obtained by means of a linear programming method, and the technical problem of improving the applicability of a cooperative caching mode in the information center network is solved to a certain extent.
In the method for caching and routing information in an information center network according to the embodiment of the present invention, step S102 is to establish a target linear programming model based on a state parameter and a target condition, and specifically may be:
constructing a virtual node, and establishing a second content transmission relation corresponding to the virtual node based on the state parameter;
and establishing a target linear programming model based on the state parameters, the second content transmission relation and the target conditions.
The second transmission relationship here refers to the sum of the transmission relationship between each node and the virtual node and the first content transmission relationship. The original many-to-one or many-to-many communication mode can be converted into an easily solved one-to-one or one-to-many communication mode by the aid of the virtual nodes, wherein the many-to-one mode refers to that one destination node downloads the same file from a plurality of intermediate nodes, and the many-to-many mode refers to that a plurality of destination nodes download the same file from a plurality of intermediate nodes; equivalently converting the problems of safe content caching and routing in the information center network based on the network coding into the problem of only considering safe content routing in the information center network based on the network coding; the calculation process can be simplified to a certain extent, and the efficiency of the method is further improved.
Referring to fig. 2, fig. 3, fig. 4, fig. 5, fig. 6 and fig. 7, fig. 2 is a diagram illustrating content distribution in a network-coding-based information-centric network; fig. 3 is a schematic diagram of a first directed graph constructed by applying the information caching routing method in the information center network according to the embodiment of the present invention; fig. 4 is a schematic diagram of a second directed graph constructed by applying the information caching routing method in the information center network according to the embodiment of the present invention; FIG. 5 is a graph showing the results of a second objective function; FIG. 6 is a graph showing the results of the third objective function; FIG. 7 is a diagram illustrating the results of the cache routing method corresponding to the target condition.
In the method for caching and routing information in an information center network according to the embodiment of the present invention, after obtaining a state parameter of the information center network and before constructing a virtual node, the method may further include:
representing the information-centric network as a first directed graph based on the state parameter;
wherein, the format of the first directed graph comprises: g denotes a first directed graph, V denotes a set of a source node, an intermediate node, and a destination node, and E denotes an edge set corresponding to the first content transfer relationship;
after establishing the second content transmission relationship corresponding to the virtual node based on the state parameter, and before establishing the target linear programming model based on the state parameter, the second content transmission relationship, and the target condition, the method may further include:
converting the first directed graph into a second directed graph based on the virtual node and the second content transmission relation;
wherein, the format of the second directed graph comprises: b denotes a second directed graph, X denotes a set of V and virtual nodes, and Y denotes a set of E and a second content transfer relationship.
In practical applications, the information center network can also be represented by a directed graph in order to analyze the information center network intuitively. The directed graph comprises all source nodes, intermediate nodes and destination nodes, and directed edges between every two nodes; for example, for the nodes a and B, if the node a transfers a file to the node B, a directed edge exists between the nodes a and B, and the direction of the directed edge is from a to B.
In practical application, the cache routing system may first establish a first objective function according to the first directed graph, then simplify the first objective function into a second objective function by means of the second directed graph, then construct a third objective function on the basis of the second objective function, and finally obtain a cache routing method corresponding to the target condition according to the second objective function and a solution of the third objective function.
The first objective function may be:
the constraints of the first objective function include:
the constraint conditions for ensuring that data transmission in the whole network meets the flow conservation law are as follows:
for ensuring that a directed edge e is traversed in case the information-centric network is network-coding basedi，jAbout the document fnIs greater than or equal to any one destination node vd∈DnDownload file fnThrough ei，jThe constraint of the flow rate of (1):
constraints that ensure that the destination node requesting the file has a sufficient number of code packets available to decode and recover the original file:
for ensuring intermediate nodes vkOn-cached files fnIs equal to the number of nodes vkFrom virtual node v0On-download files fnThe constraint on the number of coded blocks:
for securing request file fnDestination node of (2) non-cacheable file fnConstraint of the related coding block:
for ensuring that each intermediate node can satisfy the condition of information theory security requirement in the process of content distribution, namely, the file f cached on each intermediate nodenPlus the number of encoded blocks of f that pass through the nodenDoes not exceed rnThe constraint of (2):
for guaranteeing a node vkThe total number of the coding blocks cached on the node v does not exceed the constraint condition of the cache capacity of the node vkIs a file fnSource node of (1), file fnThe coded block of (a) is regarded as occupying no buffer capacity:
constraint conditions for ensuring that the value range of a variable is non-negative:
accordingly, the second objective function may be:
the constraint of the second objective function is:
the third objective function may be:
the constraint of the third objective function is:
wherein v is0Is a virtual node, V is a node set, SnAs a set of source nodes, DnFor the destination node set, In＝V-Sn-DnAs a set of intermediate nodes, fnThe epsilon F represents any file in a set F of files needing to be cached in the network, and the file FnIs divided into m of equal sizenBlock, edge set E, slave node viPointing to node vjDirected edge e ofi，j，ei，j∈E；ckFor any one intermediate node vkBuffer capacity of bkThe caching cost of the coding blocks of a caching unit amount; a isi，jAs a directed edge ei，jThe bandwidth consumption cost of the coding blocks of unit amount of upper transmission; r isnFor sum files f produced by the source nodenThe number of random information blocks encoded together with the data block of (a);
as a directed edge ei，jBy destination node vd∈DnDownload file fnThe network flow rate of the encoded blocks;
as a directed edge ei，jFile f actually transmittednThe network flow rate of the encoded blocks;
to achieve the purpose ofNode pointvdDownloaded file fnThe total number of coded blocks of (a);k，nis an intermediate node vkFiles f cached onnThe total number of coded blocks of (a); a is the optimal solution of the second objective function.
In the method for caching and routing information in an information center network provided by the embodiment of the invention, the solution of the target linear programming model is obtained, which specifically includes:
describing a target linear programming model by means of an AMPL language;
and solving the solution value of the target linear programming model described by the AMPL language by using a CPLEX solver.
In practical application, a solution value can be solved for a target linear Programming model by using an ampl (advanced markup language) language and a CPLEX solver, so that the solution value can be quickly solved, and the efficiency of the information cache routing method in the information center network provided by the embodiment of the invention is improved to a certain extent. The AMPL language referred to herein is a modeling language that describes and solves large-scale complex mathematical problems.
The invention also provides an information cache routing system in the information center network, which has the corresponding effect of the information cache routing method in the information center network provided by the embodiment of the invention. Referring to fig. 8, fig. 8 is a schematic structural diagram of an information caching and routing system in an information center network according to an embodiment of the present invention.
An information caching and routing system in an information center network provided by an embodiment of the present invention may include:
an obtaining module 101, configured to obtain a state parameter of an information center network, where the state parameter includes a source node parameter, an intermediate node parameter, a destination node parameter, and a first content transmission relationship between nodes;
an establishing module 102, configured to establish a target linear programming model based on the state parameters and the target conditions;
and the solving module 103 is configured to solve a solution value of the target linear programming model, and obtain a cache and a routing method corresponding to the target condition based on the solution value.
In an information caching routing system in an information center network provided by an embodiment of the present invention, an establishing module may include:
the construction unit is used for constructing a virtual node and establishing a second content transmission relation corresponding to the virtual node based on the state parameter;
and the establishing unit is used for establishing a target linear programming model based on the state parameters, the second content transmission relation and the target conditions.
The information caching routing system in the information center network provided by the embodiment of the invention can further comprise:
the first directed graph module is used for representing the information center network as a first directed graph based on the state parameters after the acquisition module acquires the state parameters of the information center network and before the construction unit constructs a virtual node;
wherein, the format of the first directed graph comprises: g denotes a first directed graph, V denotes a set of a source node, an intermediate node, and a destination node, and E denotes an edge set corresponding to the first content transfer relationship;
the second directed graph unit is used for converting the first directed graph into a second directed graph based on the virtual node and the second content transmission relation after the construction unit establishes the second content transmission relation corresponding to the virtual node based on the state parameter and before the establishment unit establishes the target linear programming model based on the state parameter, the second content transmission relation and the target condition;
wherein, the format of the second directed graph comprises: b denotes a second directed graph, X denotes a set of V and virtual nodes, and Y denotes a set of E and a second content transfer relationship.
In an information caching routing system in an information center network provided in an embodiment of the present invention, an obtaining module may include:
a description unit for describing the target linear programming model by means of the AMPL language;
and the solving unit is used for solving a solution value of the target linear programming model described by the AMPL language by using a CPLEX solver.
The invention also provides information cache routing control equipment and a computer storage medium in the information center network, which have the corresponding effects of the information cache routing method in the information center network provided by the embodiment of the invention. Referring to fig. 9, fig. 9 is a schematic structural diagram of an information cache routing control device in an information center network according to an embodiment of the present invention.
An information cache routing control device in an information center network provided by an embodiment of the present invention may include:
a memory 201 for storing a computer program;
the processor 202, when executing the computer program, is configured to implement the steps of the information cache routing method in the information center network as described in any of the above embodiments.
In the computer storage medium provided in the embodiments of the present invention, a computer program is stored on the computer storage medium, and when the computer program is executed by a processor, the steps of the information caching routing method in the information center network described in any one of the embodiments above are implemented.
For a description of relevant parts in an information caching routing system, an information caching routing device, and a computer storage medium in an information center network according to embodiments of the present invention, reference is made to detailed descriptions of corresponding parts in an information caching routing method in an information center network according to embodiments of the present invention, and details are not repeated here. In addition, parts of the above technical solutions provided in the embodiments of the present invention that are consistent with the implementation principles of the corresponding technical solutions in the prior art are not described in detail, so as to avoid redundant description.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (10)
1. An information cache routing method in an information center network is characterized by comprising the following steps:
acquiring state parameters of an information center network, wherein the state parameters comprise source node parameters, intermediate node parameters, destination node parameters and a first content transmission relation among nodes; the source node parameters comprise complete original file information stored by the source node; the intermediate node parameters comprise the cache capacity and the cache cost of each intermediate node; the destination node parameters comprise a set of destination nodes corresponding to each file; the first content transmission relationship between the nodes comprises the file transmission relationship and the bandwidth consumption cost between every two related nodes;
establishing a target linear programming model based on the state parameters and the target conditions;
solving a solution value of the target linear programming model, and acquiring a cache and routing method corresponding to the target condition based on the solution value; the caching and routing method comprises the path of the file from the intermediate node to the destination node and the coding block information transmitted on each path.
2. The method of claim 1, wherein the building a target linear programming model based on the state parameters and target conditions comprises:
constructing a virtual node, and establishing a second content transmission relation corresponding to the virtual node based on the state parameter;
and establishing a target linear programming model based on the state parameters, the second content transmission relation and the target condition.
3. The method of claim 2, wherein after obtaining the status parameters of the information-centric network and before constructing a virtual node, further comprising:
representing the information-centric network as a first directed graph based on the state parameter;
wherein the format of the first directed graph comprises: g denotes the first directed graph, V denotes a set of a source node, an intermediate node, and a destination node, and E denotes an edge set corresponding to the first content transfer relationship;
after the establishing of the second content transmission relationship corresponding to the virtual node based on the state parameter, and before the establishing of the target linear programming model based on the state parameter, the second content transmission relationship and the target condition, the method further includes:
converting the first directed graph into a second directed graph based on the virtual node and the second content transmission relationship;
wherein the format of the second directed graph comprises: b denotes the second directed graph, X denotes the set of V and the virtual node, and Y denotes the set of E and the second content transfer relationship.
4. The method of claim 1, wherein the evaluating the solution to the target linear programming model comprises:
describing the target linear programming model by means of AMPL language;
and solving a solution value of the target linear programming model described by the AMPL language by using a CPLEX solver.
5. An information cache routing system in an information centric network, comprising:
the system comprises an acquisition module, a processing module and a display module, wherein the acquisition module is used for acquiring state parameters of an information center network, and the state parameters comprise source node parameters, intermediate node parameters, destination node parameters and a first content transmission relation among nodes; the source node parameters comprise complete original file information stored by the source node; the intermediate node parameters comprise the cache capacity and the cache cost of each intermediate node; the destination node parameters comprise a set of destination nodes corresponding to each file; the first content transmission relationship between the nodes comprises the file transmission relationship and the bandwidth consumption cost between every two related nodes;
the establishing module is used for establishing a target linear programming model based on the state parameters and the target conditions;
the solving module is used for solving the solution value of the target linear programming model and acquiring a cache and routing method corresponding to the target condition based on the solution value; the caching and routing method comprises the path of the file from the intermediate node to the destination node and the coding block information transmitted on each path.
6. The system of claim 5, wherein the setup module comprises:
the construction unit is used for constructing a virtual node and establishing a second content transmission relation corresponding to the virtual node based on the state parameter;
and the establishing unit is used for establishing a target linear programming model based on the state parameters, the second content transmission relation and the target conditions.
7. The system of claim 6, further comprising:
the first directed graph module is used for representing the information center network as a first directed graph based on the state parameters after the acquisition module acquires the state parameters of the information center network and before the construction unit constructs a virtual node;
wherein the format of the first directed graph comprises: g denotes the first directed graph, V denotes a set of a source node, an intermediate node, and a destination node, and E denotes an edge set corresponding to the first content transfer relationship;
the second directed graph unit is used for converting the first directed graph into a second directed graph based on the virtual node and the second content transmission relation after the construction unit establishes the second content transmission relation corresponding to the virtual node based on the state parameter and before the establishment unit establishes a target linear programming model based on the state parameter, the second content transmission relation and a target condition;
wherein the format of the second directed graph comprises: b denotes the second directed graph, X denotes the set of V and the virtual node, and Y denotes the set of E and the second content transfer relationship.
8. The system of claim 5, wherein the evaluation module comprises:
a description unit for describing the target linear programming model by means of the AMPL language;
and the solving unit is used for solving a solution value of the target linear programming model described by the AMPL language by using a CPLEX solver.
9. An information cache routing control apparatus in an information-centric network, comprising:
a memory for storing a computer program;
processor for implementing the steps of a method for information cache routing in an information centric network according to any one of claims 1 to 4 when executing said computer program.
10. A computer storage medium, having stored thereon a computer program which, when being executed by a processor, carries out the steps of a method of information cache routing in an information-centric network according to any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711294703.XA CN108063726B (en) | 2017-12-08 | 2017-12-08 | Information cache routing method, system and equipment in information center network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711294703.XA CN108063726B (en) | 2017-12-08 | 2017-12-08 | Information cache routing method, system and equipment in information center network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108063726A CN108063726A (en) | 2018-05-22 |
| CN108063726B true CN108063726B (en) | 2020-11-10 |
Family
ID=62136464
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711294703.XA Active CN108063726B (en) | 2017-12-08 | 2017-12-08 | Information cache routing method, system and equipment in information center network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108063726B (en) |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102546025B (en) * | 2012-01-11 | 2014-05-28 | 苏州大学 | Optimal distribution method for optical network units in optical fiber wireless hybrid access network |
| CN103298060B (en) * | 2013-06-19 | 2016-01-27 | 苏州大学 | Wireless mesh network via node method for arranging centered by content |
| JP5888687B1 (en) * | 2015-02-20 | 2016-03-22 | 日本電信電話株式会社 | Distribution server or distribution route design device, distribution server or distribution route design method and program |
-
2017
- 2017-12-08 CN CN201711294703.XA patent/CN108063726B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN108063726A (en) | 2018-05-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Lin et al. | Task offloading for wireless VR-enabled medical treatment with blockchain security using collective reinforcement learning | |
| CN108769150B (en) | Data processing method and device of block chain network, cluster node and storage medium | |
| CN102263825B (en) | Cloud-position-based hybrid cloud storage system data transmission method | |
| CN110035401B (en) | Method and equipment for controlling QoS (quality of service) of default service | |
| CN111314339B (en) | Data transmission method and device | |
| CN111277511B (en) | Transmission rate control method, device, computer system and readable storage medium | |
| CN112613024A (en) | Data interaction method, device and system and storage medium | |
| CN103685554A (en) | Upgrading method, device and system | |
| CN102404387A (en) | Method, device and equipment for information synchronization with other nodes | |
| CN111953520B (en) | Method, device, equipment and medium for realizing group control through group virtual equipment | |
| CN109361762A (en) | A kind of document transmission method, apparatus and system | |
| CN110266766A (en) | A kind of construction method, system and the terminal device of attack resistance distributed network node | |
| Sattler et al. | Trends and advancements in deep neural network communication | |
| Liu et al. | Minimizing AoI with throughput requirements in multi-path network communication | |
| Zhang et al. | A rate-and-trust-based node selection model for block transmission in blockchain networks | |
| Wen et al. | An efficient content distribution network architecture using heterogeneous channels | |
| Aktas et al. | Scheduling and flexible control of bandwidth and in-transit services for end-to-end application workflows | |
| WO2016180284A1 (en) | Service node allocation method, device, cdn management server and system | |
| CN108063726B (en) | Information cache routing method, system and equipment in information center network | |
| CN105245464A (en) | Network acceleration method based on Android system | |
| CN111064568B (en) | Flow control method and device for quantum key distribution network | |
| JP2015109493A5 (en) | ||
| CN104168274A (en) | Data obtaining request processing method, client sides and server | |
| CN109218049A (en) | A kind of control method, relevant device and system | |
| CN106487694A (en) | A kind of data flow processing method and device |
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 |