CN114124722A - Directed acyclic graph generation method, network coding method and network transmission method - Google Patents
Directed acyclic graph generation method, network coding method and network transmission method Download PDFInfo
- Publication number
- CN114124722A CN114124722A CN202111388854.8A CN202111388854A CN114124722A CN 114124722 A CN114124722 A CN 114124722A CN 202111388854 A CN202111388854 A CN 202111388854A CN 114124722 A CN114124722 A CN 114124722A
- Authority
- CN
- China
- Prior art keywords
- node
- network
- graph
- nodes
- directed acyclic
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 65
- 230000005540 biological transmission Effects 0.000 title claims description 17
- 239000011159 matrix material Substances 0.000 claims abstract description 36
- 238000011144 upstream manufacturing Methods 0.000 claims abstract description 17
- 238000001514 detection method Methods 0.000 claims description 6
- 238000012790 confirmation Methods 0.000 claims description 5
- 238000004891 communication Methods 0.000 abstract description 3
- 238000010276 construction Methods 0.000 abstract description 3
- 125000002015 acyclic group Chemical group 0.000 description 3
- 238000011160 research Methods 0.000 description 2
- 230000002457 bidirectional effect Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/18—Loop-free operations
-
- 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/32—Flooding
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a directed acyclic graph generating method, which comprises the steps of obtaining data information of a target network; the network node informs other nodes of the neighbor relation of the network node; constructing an initial graph; deleting the edges which can only be transmitted in one direction in the initial graph to obtain a first initial graph; checking each node in the first initial graph and deleting unqualified nodes to obtain a second initial graph; enumerating the node topology sequence according to the adjacency matrix corresponding to the second initial graph; confirming the upstream and downstream relation of each node according to the topological sequence of the nodes; and outputting the directed acyclic graph of the finally constructed target network. The invention also discloses a network coding method comprising the directed acyclic graph generation method, and a network communication method comprising the directed acyclic graph generation method and the network coding method. The method can realize the distributed construction of the directed acyclic graph, and has high reliability and good practicability.
Description
Technical Field
The invention belongs to the field of network communication, and particularly relates to a directed acyclic graph generation method, a network coding method and a network transmission method.
Background
Network coding theory proposes replacing routers with encoders to send evidence about information (evidences about the messages) rather than the entire information itself. The receiver (receiver) receives the evidence and then recombines and restores the information. In other words, the bits belonging to the same information do not need to be in the same packet as the current one. The network coding theory will automatically code different information and recombine when arriving at the destination, thus greatly improving the capacity and efficiency of the network.
The proposed concept of network coding points out a new direction of research for improving the throughput of communication networks. Meanwhile, the concept of network coding makes the coding originally used in the physical layer and the routing originally used in the network layer organically unified. By allowing the network intermediate node to encode different data stream data, the network encoding can realize the upper bound of the maximum stream transmission theory of the network, changes the role that the node in the traditional network only serves as data storage and forwarding, essentially breaks through the traditional data processing mode in the network, and overturns the classic conclusion that independent bits in the network can not be compressed any more.
A multipath transmission mode adopted by network coding brings new inspiration for network security research, data are dispersed to a plurality of paths for propagation, network eavesdropping attack can be effectively prevented, and some network coding-based secure transmission schemes are generated.
The above-mentioned secure transmission scheme based on network coding needs to construct a directed acyclic network in advance when applied, so as to operate the network coding strategy. However, there is no effective method for distributively constructing a directed acyclic network; this, of course, significantly hinders the application of network coding in secure transmission directions.
Disclosure of Invention
An object of the present invention is to provide a directed acyclic graph generation method that can implement distributed construction and has high reliability and good practicability.
The invention also aims to provide a network coding method comprising the directed acyclic graph generation method.
The invention also aims to provide a network transmission method comprising the directed acyclic graph generation method and the network coding method.
The directed acyclic graph generation method provided by the invention comprises the following steps:
s1, acquiring data information of a target network;
s2, each network node informs other nodes in the network of the neighbor relation of each network node;
s3, constructing an initial graph according to the neighbor relations of all the nodes;
s4, deleting the edges which can only be transmitted in one direction in the initial graph constructed in the step S3 to obtain a first initial graph;
s5, checking each node in the first initial graph obtained in the step S4, and deleting unqualified nodes to obtain a second initial graph;
s6, enumerating a node topological sequence according to the adjacent matrix corresponding to the second initial graph obtained in the step S5;
s7, confirming the upstream and downstream relation of each node according to the node topology sequence enumerated in the step S6;
and S8, after the confirmation is finished, outputting the finally constructed directed acyclic graph of the target network.
Step S5, where the step of checking each node in the first initial graph obtained in step S4 and deleting unqualified nodes to obtain a second initial graph specifically includes the following steps:
and (4) checking each node in the first initial graph obtained in the step (S4), and for the intermediate node v, if a path to the source node and a path to the sink node cannot be found at the same time and the path to the source node and the path to the sink node do not intersect, deleting all edges of the intermediate node v and the intermediate node v, thereby obtaining a second initial graph.
In step S6, the enumeration of the node topology order is performed according to the adjacency matrix corresponding to the second initial graph obtained in step S5, which specifically includes the following steps:
(1) traversing the graph corresponding to the adjacent matrix by a breadth first principle from the source node s; during the traversal, nodes with smaller numbers are preferentially traversed, and all traversal results are stored by using a queue List;
(2) detecting the traversal result stored in the step (1):
if the last node of the traversal result is not the sink node, deleting the traversal result; thereby completing the detection of the traversal result;
(3) and after the detection is finished, taking the traversal result stored in the queue List as the enumeration result of the node topology sequence.
Step S7, confirming the upstream and downstream relationship of each node according to the node topology sequence obtained in step S6, specifically including the following steps:
A. setting the cycle number i as 1;
B. selecting the ith topological order from the topological orders obtained in step S6;
C. b, arranging all nodes of the network in the topological sequence selected in the step B, and obtaining a corresponding adjacent matrix A';
D. zeroing the lower triangular part of the adjacency matrix A 'obtained in the step C, thereby obtaining an auxiliary matrix A';
E. and D, detecting the auxiliary matrix A' obtained in the step D:
determining the upstream-downstream relation of each intermediate node according to the selected ith topological order if all the intermediate nodes in the directed graph corresponding to the auxiliary matrix A' have at least one output link and at least one input link; defining a link connected with an upstream node as an input link and a link connected with a downstream node as an output link;
otherwise, increasing the value of the cycle number i by 1, and returning to the step B to carry out the cycle again until the upstream and downstream relation of each node is confirmed.
The invention also discloses a network coding method comprising the directed acyclic graph generating method, which further comprises the following steps:
and S9, performing network coding by adopting the directed acyclic graph of the target network obtained in the step S8.
The invention also discloses a network transmission method comprising the directed acyclic graph generation method and the network coding method, and the method also comprises the following steps:
and S10, carrying out network transmission according to the network coding result of the step S9.
The directed acyclic graph generation method, the network coding method and the network transmission method provided by the invention have the advantages that all nodes obtain the same global network topology through controllable flooding in a network with limited node number in a distributed generation mode, then each node selects the same directed acyclic graph according to the same operation rule, and determines the upstream and downstream nodes according to the position of the node, and finally generates the directed acyclic graph; therefore, the method can realize the distributed construction of the directed acyclic graph, and has high reliability and good practicability.
Drawings
Fig. 1 is a schematic flow chart of a method of generating a directed acyclic graph according to the present invention.
Fig. 2 is an initial network topology diagram of an embodiment of a directed acyclic graph generation method according to the present invention.
Fig. 3 is a schematic view of a directed graph topology corresponding to an auxiliary matrix in the directed acyclic graph generation method according to the embodiment of the present invention.
Fig. 4 is a schematic view of a directed graph topology corresponding to an auxiliary matrix in the directed acyclic graph generation method according to the embodiment of the present invention.
Fig. 5 is a flowchart illustrating a method of a network coding method according to the present invention.
Fig. 6 is a flowchart illustrating a method of a network transmission method according to the present invention.
Detailed Description
Fig. 1 is a schematic flow chart of a method of generating a directed acyclic graph according to the present invention: the directed acyclic graph generation method provided by the invention comprises the following steps:
s1, acquiring data information of a target network;
s2, each network node informs other nodes in the network of the neighbor relation of each network node;
s3, constructing an initial graph according to the neighbor relations of all the nodes;
s4, deleting the edges which can only be transmitted in one direction in the initial graph constructed in the step S3 to obtain a first initial graph;
s5, checking each node in the first initial graph obtained in the step S4, and deleting unqualified nodes to obtain a second initial graph; the method specifically comprises the following steps:
checking each node in the first initial graph obtained in the step S4, and for the intermediate node v, if a path to the source node and a path to the sink node cannot be found at the same time and the path to the source node and the path to the sink node do not intersect, deleting all edges of the intermediate node v and the intermediate node v, thereby obtaining a second initial graph;
s6, enumerating a node topological sequence according to the adjacent matrix corresponding to the second initial graph obtained in the step S5; the method specifically comprises the following steps:
(1) traversing the graph corresponding to the adjacent matrix by a breadth first principle from the source node s; during the traversal, nodes with smaller numbers are preferentially traversed, and all traversal results are stored by using a queue List;
(2) detecting the traversal result stored in the step (1):
if the last node of the traversal result is not the sink node, deleting the traversal result; thereby completing the detection of the traversal result;
(3) after the detection is finished, the traversal result stored in the queue List is used as the enumeration result of the node topology sequence;
in specific implementation, a pseudo code of the method is as follows:
inputting: adjacency matrix A, number of nodes N, and label v of source node ssReference v of the sink node ddAll the labels of the intermediate nodes form a list V from small to large;
defining the subfunction (list): i/input is a list
The main function is as follows:
initializing an empty list ORDER;
function([vs])；//[vs]is only provided with the reference sign vsList of
And (3) outputting: all possible topological ORDERs ORDER;
s7, confirming the upstream and downstream relation of each node according to the node topology sequence enumerated in the step S6; the method specifically comprises the following steps:
A. setting the cycle number i as 1;
B. selecting the ith topological order from the topological orders obtained in step S6;
C. b, arranging all nodes of the network in the topological sequence selected in the step B, and obtaining a corresponding adjacent matrix A';
D. zeroing the lower triangular part of the adjacency matrix A 'obtained in the step C, thereby obtaining an auxiliary matrix A';
E. and D, detecting the auxiliary matrix A' obtained in the step D:
determining the upstream-downstream relation of each intermediate node according to the selected ith topological order if all the intermediate nodes in the directed graph corresponding to the auxiliary matrix A' have at least one output link and at least one input link; defining a link connected with an upstream node as an input link and a link connected with a downstream node as an output link;
otherwise, increasing the value of the cycle number i by 1, and returning to the step B to carry out the cycle again until the upstream and downstream relation of each node is confirmed;
and S8, after the confirmation is finished, outputting the finally constructed directed acyclic graph of the target network.
The process of the invention is further illustrated below with reference to one example:
the initial network is shown in fig. 2; the network consists of 6 nodes, the labels of the source node and the sink node are respectively set as s and d for convenience, and the labels of other four intermediate nodes are as shown in the figure. The dotted arrow indicates that the link can only transmit data in the direction of the arrow, and the rest of the links are bidirectional links. Taking the node 3 as an example, the method for generating the distributed directed acyclic network provided by the present invention is specifically described.
Firstly, the node 3 sends the neighbor relation of the node to all nodes in the network, namely the node 3 can reach the node 1, the node 2, the node 4 and the node d; meanwhile, the neighbor relations of other nodes are received, for example, the following information is received from the node d: the node d can reach the node 1 and the node 2;
the node 3 constructs a graph G according to the neighbor relations of all the nodes, and the graph G is shown in FIG. 3;
deleting the edges which can only transmit in one direction, namely the dotted edges (v3, d);
examining node 5 in graph G, it was found that no matter how the path was chosen, the edges must be passed from node 5 to node s and to node d (v5, v1), thus eliminating node 5 and edges (v5, v 1); the pruned network adjacency matrix is (the topological order of the nodes is { s,1,2,3,4, d }):
according to an enumeration algorithm of the node topological order, enumerating several possible node topological orders { s,2,3,1,4, d }, { s,2,3,4,1, d } and { s,4,1,3,2, d };
making i equal to 1;
selecting a 1 st topological order, arranging an adjacent matrix A ' obtained by nodes according to the topological order { s,2,3,1,4, d } of the nodes, and setting a lower triangular part of the matrix A ' to zero to obtain a matrix A ' which is respectively as follows:
as shown in fig. 3, the directed graph corresponding to a ″ is checked to find that the node 4 has only an input link and no output link, so that i is set to 2, and the loop is repeated;
selecting a 2 nd topological order, arranging an adjacent matrix A ' obtained by nodes according to the topological order { s,2,3,4,1, d } of the nodes, and setting a lower triangular part of the matrix A ' to zero to obtain a matrix A ' which is respectively as follows:
a' corresponding graph is shown in FIG. 4, each intermediate node is checked and found to have at least one input link and one output link, and therefore the subsequent steps are carried out;
determining the upstream and downstream relation of the node 3 according to the 2 nd topological order, wherein links (v2, v3) connected with the upstream node 2 are input links, and links (v3, v4), (v3, v1) connected with the downstream node 4 and the node 1 are output links;
and finally, obtaining a final directed acyclic graph according to the confirmed link.
Fig. 5 is a schematic flow chart of the network coding method of the present invention: the network coding method comprising the directed acyclic graph generation method provided by the invention specifically comprises the following steps:
s1, acquiring data information of a target network;
s2, each network node informs other nodes in the network of the neighbor relation of each network node;
s3, constructing an initial graph according to the neighbor relations of all the nodes;
s4, deleting the edges which can only be transmitted in one direction in the initial graph constructed in the step S3 to obtain a first initial graph;
s5, checking each node in the first initial graph obtained in the step S4, and deleting unqualified nodes to obtain a second initial graph;
s6, enumerating a node topological sequence according to the adjacent matrix corresponding to the second initial graph obtained in the step S5;
s7, confirming the upstream and downstream relation of each node according to the node topology sequence enumerated in the step S6;
s8, after the confirmation is finished, outputting the finally constructed directed acyclic graph of the target network
And S9, performing network coding by adopting the directed acyclic graph of the target network obtained in the step S8.
Fig. 6 is a schematic flow chart of the network transmission method of the present invention: the network transmission method provided by the invention comprises the directed acyclic graph generation method and the network coding method, and specifically comprises the following steps:
s1, acquiring data information of a target network;
s2, each network node informs other nodes in the network of the neighbor relation of each network node;
s3, constructing an initial graph according to the neighbor relations of all the nodes;
s4, deleting the edges which can only be transmitted in one direction in the initial graph constructed in the step S3 to obtain a first initial graph;
s5, checking each node in the first initial graph obtained in the step S4, and deleting unqualified nodes to obtain a second initial graph;
s6, enumerating a node topological sequence according to the adjacent matrix corresponding to the second initial graph obtained in the step S5;
s7, confirming the upstream and downstream relation of each node according to the node topology sequence enumerated in the step S6;
s8, after the confirmation is finished, outputting a directed acyclic graph of the finally constructed target network;
s9, network coding is carried out by adopting the directed acyclic graph of the target network obtained in the step S8;
and S10, carrying out network transmission according to the network coding result of the step S9.
Claims (6)
1. A directed acyclic graph generation method comprises the following steps:
s1, acquiring data information of a target network;
s2, each network node informs other nodes in the network of the neighbor relation of each network node;
s3, constructing an initial graph according to the neighbor relations of all the nodes;
s4, deleting the edges which can only be transmitted in one direction in the initial graph constructed in the step S3 to obtain a first initial graph;
s5, checking each node in the first initial graph obtained in the step S4, and deleting unqualified nodes to obtain a second initial graph;
s6, enumerating a node topological sequence according to the adjacent matrix corresponding to the second initial graph obtained in the step S5;
s7, confirming the upstream and downstream relation of each node according to the node topology sequence enumerated in the step S6;
and S8, after the confirmation is finished, outputting the finally constructed directed acyclic graph of the target network.
2. The method of claim 1, wherein the step S5 of checking each node in the first initial graph obtained in the step S4 and deleting unqualified nodes to obtain a second initial graph includes the following steps:
and (4) checking each node in the first initial graph obtained in the step (S4), and for the intermediate node v, if a path to the source node and a path to the sink node cannot be found at the same time and the path to the source node and the path to the sink node do not intersect, deleting all edges of the intermediate node v and the intermediate node v, thereby obtaining a second initial graph.
3. The method of claim 2, wherein the step S6 is performed to enumerate a node topology order according to the adjacency matrix corresponding to the second initial graph obtained in the step S5, and specifically includes the following steps:
(1) traversing the graph corresponding to the adjacent matrix by a breadth first principle from the source node s; during the traversal, nodes with smaller numbers are preferentially traversed, and all traversal results are stored by using a queue List;
(2) detecting the traversal result stored in the step (1):
if the last node of the traversal result is not the sink node, deleting the traversal result; thereby completing the detection of the traversal result;
(3) and after the detection is finished, taking the traversal result stored in the queue List as the enumeration result of the node topology sequence.
4. The method of claim 3, wherein the step S7 of confirming the upstream and downstream relationship of each node according to the node topology order listed in the step S6 specifically comprises the steps of:
A. setting the cycle number i as 1;
B. selecting the ith topological order from the topological orders obtained in step S6;
C. b, arranging all nodes of the network in the topological sequence selected in the step B, and obtaining a corresponding adjacent matrix A';
D. zeroing the lower triangular part of the adjacency matrix A 'obtained in the step C, thereby obtaining an auxiliary matrix A';
E. and D, detecting the auxiliary matrix A' obtained in the step D:
determining the upstream-downstream relation of each intermediate node according to the selected ith topological order if all the intermediate nodes in the directed graph corresponding to the auxiliary matrix A' have at least one output link and at least one input link; defining a link connected with an upstream node as an input link and a link connected with a downstream node as an output link;
otherwise, increasing the value of the cycle number i by 1, and returning to the step B to carry out the cycle again until the upstream and downstream relation of each node is confirmed.
5. A network coding method comprising the directed acyclic graph generating method according to any one of claims 1 to 4, further comprising the steps of:
and S9, performing network coding by adopting the directed acyclic graph of the target network obtained in the step S8.
6. A method for generating a directed acyclic graph according to any one of claims 1 to 4 and a method for encoding a network according to claim 5, further comprising the steps of:
and S10, carrying out network transmission according to the network coding result of the step S9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111388854.8A CN114124722B (en) | 2021-11-22 | 2021-11-22 | Directed acyclic graph generation method, network coding method and network transmission method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111388854.8A CN114124722B (en) | 2021-11-22 | 2021-11-22 | Directed acyclic graph generation method, network coding method and network transmission method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114124722A true CN114124722A (en) | 2022-03-01 |
| CN114124722B CN114124722B (en) | 2024-01-19 |
Family
ID=80439744
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111388854.8A Active CN114124722B (en) | 2021-11-22 | 2021-11-22 | Directed acyclic graph generation method, network coding method and network transmission method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114124722B (en) |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070086358A1 (en) * | 2005-10-18 | 2007-04-19 | Pascal Thubert | Directed acyclic graph computation by orienting shortest path links and alternate path links obtained from shortest path computation |
| US20070208693A1 (en) * | 2006-03-03 | 2007-09-06 | Walter Chang | System and method of efficiently representing and searching directed acyclic graph structures in databases |
| US20090238097A1 (en) * | 2008-03-18 | 2009-09-24 | Canon Kabushiki Kaisha | Method and device for building of a network coding scheme for data transmission, corresponding computer program product and storage means |
| CN102546091A (en) * | 2011-08-31 | 2012-07-04 | 华中科技大学 | Passive dynamic network topology chromatography method based on network coding |
| US20180060396A1 (en) * | 2016-08-31 | 2018-03-01 | At&T Intellectual Property, I, L.P. | Database evaluation of anchored length-limited path expressions |
| CN109005115A (en) * | 2018-08-08 | 2018-12-14 | 佛山科学技术学院 | A kind of intelligent topological method and device of distributed sensor networks |
| CN110990642A (en) * | 2019-12-05 | 2020-04-10 | 国网湖南省电力有限公司 | Graph database construction method for CMDB business model of power system |
| CN113067669A (en) * | 2021-03-03 | 2021-07-02 | 伍仁勇 | Network coding method and security network |
| CN113285828A (en) * | 2021-05-19 | 2021-08-20 | 湖南经研电力设计有限公司 | Complex network key node identification method and power grid key node identification method |
| CN113347083A (en) * | 2021-05-31 | 2021-09-03 | 北京字跳网络技术有限公司 | Network path determination and switching method, device, equipment, medium and program product |
| CN113660116A (en) * | 2021-07-29 | 2021-11-16 | 西安电子科技大学 | Weak-connection directed acyclic scale-free network generation method |
-
2021
- 2021-11-22 CN CN202111388854.8A patent/CN114124722B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070086358A1 (en) * | 2005-10-18 | 2007-04-19 | Pascal Thubert | Directed acyclic graph computation by orienting shortest path links and alternate path links obtained from shortest path computation |
| US20070208693A1 (en) * | 2006-03-03 | 2007-09-06 | Walter Chang | System and method of efficiently representing and searching directed acyclic graph structures in databases |
| US20090238097A1 (en) * | 2008-03-18 | 2009-09-24 | Canon Kabushiki Kaisha | Method and device for building of a network coding scheme for data transmission, corresponding computer program product and storage means |
| CN102546091A (en) * | 2011-08-31 | 2012-07-04 | 华中科技大学 | Passive dynamic network topology chromatography method based on network coding |
| US20180060396A1 (en) * | 2016-08-31 | 2018-03-01 | At&T Intellectual Property, I, L.P. | Database evaluation of anchored length-limited path expressions |
| CN109005115A (en) * | 2018-08-08 | 2018-12-14 | 佛山科学技术学院 | A kind of intelligent topological method and device of distributed sensor networks |
| CN110990642A (en) * | 2019-12-05 | 2020-04-10 | 国网湖南省电力有限公司 | Graph database construction method for CMDB business model of power system |
| CN113067669A (en) * | 2021-03-03 | 2021-07-02 | 伍仁勇 | Network coding method and security network |
| CN113285828A (en) * | 2021-05-19 | 2021-08-20 | 湖南经研电力设计有限公司 | Complex network key node identification method and power grid key node identification method |
| CN113347083A (en) * | 2021-05-31 | 2021-09-03 | 北京字跳网络技术有限公司 | Network path determination and switching method, device, equipment, medium and program product |
| CN113660116A (en) * | 2021-07-29 | 2021-11-16 | 西安电子科技大学 | Weak-connection directed acyclic scale-free network generation method |
Non-Patent Citations (1)
| Title |
|---|
| 莫小雨: "《添加反向连边对有向无环网络一致性的影响》", 《硕士电子期刊》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114124722B (en) | 2024-01-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Kim et al. | Evolutionary Approaches To Minimizing Network Coding Resources. | |
| Shah et al. | A flexible class of regenerating codes for distributed storage | |
| CN1798068B (en) | Method and apparatus for providing a hop limited protection pathway in a network | |
| CN105450741A (en) | Supply server selection and restoration data transmission method in distributed storage system | |
| Huang et al. | Topology design in time-evolving delay-tolerant networks with unreliable links | |
| CN103248571A (en) | Computing method of optimal second route | |
| CN104601473A (en) | Route generating method and system for multi-target path with restriction | |
| CN110190926A (en) | Correcting and eleting codes restorative procedure, correcting and eleting codes update method and system based on network query function | |
| Khan et al. | Improved bounds on the decoding failure probability of network coding over multi-source multi-relay networks | |
| CN104469874A (en) | Message forwarding method of opportunistic network based on probability centrality | |
| Di Renzo et al. | Robust wireless network coding–An overview | |
| Kim et al. | An evolutionary approach to inter-session network coding | |
| CN110912816B (en) | Link rerouting method, device and storage medium | |
| CN114124722B (en) | Directed acyclic graph generation method, network coding method and network transmission method | |
| Sutcliffe et al. | Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing | |
| Buhrman et al. | Space-efficient routing tables for almost all networks and the incompressibility method | |
| CN111277495B (en) | Method for presetting fault protection path of bit index display copy multicast | |
| Sattari et al. | A network coding approach to loss tomography | |
| Song et al. | The complexity of network coding with two unit-rate multicast sessions | |
| Gerami et al. | Decentralized minimum-cost repair for distributed storage systems | |
| Wu et al. | A practical network coding and routing scheme based on maximum flow combination | |
| JP2011166360A (en) | Multicast-tree calculation device, calculation method, and network system | |
| Supittayapornpong et al. | A framework for reliability aware layered multi-cast in lossy networks with network coding | |
| CN110417666A (en) | A kind of grouping encapsulation and transmission method based on Head modify technology | |
| Jia et al. | Metro: An Efficient Traffic Fast Rerouting Scheme With Low Overhead |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |