CN101917334A - Transmission network generation method by network coding of part of nodes - Google Patents
Transmission network generation method by network coding of part of nodes Download PDFInfo
- Publication number
- CN101917334A CN101917334A CN2010102438385A CN201010243838A CN101917334A CN 101917334 A CN101917334 A CN 101917334A CN 2010102438385 A CN2010102438385 A CN 2010102438385A CN 201010243838 A CN201010243838 A CN 201010243838A CN 101917334 A CN101917334 A CN 101917334A
- Authority
- CN
- China
- Prior art keywords
- node
- network
- nodes
- packet
- path
- 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 51
- 230000005540 biological transmission Effects 0.000 title claims abstract description 41
- 230000008569 process Effects 0.000 claims description 10
- 230000008859 change Effects 0.000 claims description 3
- 239000012141 concentrate Substances 0.000 claims description 3
- 230000007547 defect Effects 0.000 abstract 1
- 230000010365 information processing Effects 0.000 description 8
- 238000004891 communication Methods 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 6
- 238000013459 approach Methods 0.000 description 3
- 238000011161 development Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 238000006424 Flood reaction Methods 0.000 description 2
- 230000015572 biosynthetic process Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000004927 fusion Effects 0.000 description 2
- 230000008901 benefit Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a transmission network generation method by the network coding of a part of nodes, solving the defects of high cost and low network utilization rate of a traditional information transmission method. The transmission network generation method comprises the steps of setting coding nodes in a network and establishing a multicast network, wherein, a method for setting coding nodes in the network comprises the following steps of: setting backbone nodes in the network, initializing a threshold value and an absolute difference value of each distance, selecting the coding nodes in the network, counting the number of the coding nodes and calculating an absolute difference value between the number of the coding nodes and the number of coding nodes needed to be set; and a method for setting the multicast network comprises the following steps of: finding paths from a sending node to a receiving node and selecting a path between the sending node and the receiving node. By using network coding in the method, the multicast network can reach the maximum transmission so as to improve the efficiency of information transmission.
Description
Technical field
The invention belongs to networking technology area, relate to the transmission network generation method that a kind of part of nodes carries out network code.
Background technology
21 century, the whole world has entered the information age, the generation of information and transmit very fast.Network has influenced different social sectors.
Along with the continuous development of diverse network application and data service,, become more and more nervous no matter be the bandwidth resources of cable network or the band resource of wireless network.Contradiction between the network application of fast development and business and the finite bandwidth resource is more and more outstanding.In the case, how efficiently to utilize these limited communication resources, become one of focus of development communication technologies.Studies show that network code can make full use of Internet resources, do not increasing under the system bandwidth situation, can effectively resist the dynamic change of network, improving the bandwidth availability ratio of transmission network greatly, is one of optimization technique of extensive information multicast transmission, also is the effective way of alleviating this contradiction.
Network code is frontier science and technology of network communication field.Before network code occurred, wireline communication network and cordless communication network all were to adopt to store the transmission that the mechanism of transmitting realizes data, and promptly message transmission all is to pass through intermediate node by sending node, and the mode of transmitting with storage is sent to receiving node.In general node in the network, does not need to do any data processing except duplicating the data that receive.The mode of information transmission is similar to the postal delivery system like this, is the most natural communication mode.But, under the situation that amount of information sharply increases,, be easy to generate the problem of network congestion as real-time video transmission.
Network code, be characterized in the fusion of route switching technology and information coding techniques, its core concept is that each node in the network is after the information in each path of receiving, carry out linearity or nonlinear processing, be transmitted to other node then, intermediate node is played the part of the effect of encoder or signal processor.According to maximum flow minimum cut theorem in the graph theory, data transmitting node and receiving node can not surpass max-flow (or minimal cut), if use traditional multicast mode, the general inaccessiable upper limit, by using network code, multicast transmission can reach max-flow, thereby has improved information transmission efficiency.
Network code is a kind of message-switching technique that merges coding and route, on the method for routing basis that conventional store is transmitted, merges by allowing that a plurality of packets that receive are carried out coded message, increases the amount of information of single transmission, improves overall performance of network.But network code requires the upgrading of overall network equipment.By the method for the big node employing network code of partial information flow, approach even reach the effect of whole nodes employing network codes, thereby reduced the fund input of the upgrading of hardware device effectively.
Summary of the invention
The objective of the invention is at the deficiencies in the prior art, the transmission network generation method that provides a kind of part of nodes to carry out network code, this method is a target with the multicast transmission that realizes taking less Internet resources and finish data.
Used network code in the method provided by the invention.Network code, be characterized in the fusion of route switching technology and information coding techniques, its core concept be each node in the network after the information in each path of receiving, carry out linearity or nonlinear processing, be transmitted to neighbor node then.At this moment, intermediate node is played the part of the effect of encoder or signal processor.According to maximum flow minimum cut theorem in the graph theory, data transmitting node and receiving node can not surpass max-flow (or minimal cut), if use traditional multicast mode, the general inaccessiable upper limit, by using network code, multicast transmission can reach max-flow, thereby has improved information transmission efficiency.The application network coding can reduce the Internet resources that multicast transmission takies, and promotes the efficiency of transmission of network.
The problem that the present invention mainly solves is the link of how selecting between sending node and the receiving node.
The inventive method also provides a kind of strategy of distinguishing path priority, when utilizing network code, reduces the occupancy of network link as far as possible.
The inventive method comprises two steps:
The one, the setting of coding nodes in the network, by the maximum bandwidth of node in the specified network structure is analyzed, the ratio that the network code node is set as required is provided with the coding nodes in the network, and coding nodes is carried out the upgrading of hardware;
The node of network can be divided into following three classes, and the one, routing node, the total bandwidth of this category node is less, and only possesses the function of routing forwarding in information processing; The 2nd, backbone node, the total bandwidth of this category node is bigger, and only possesses the forwarding capability of router in information processing; The 3rd, coding nodes, the total bandwidth of this category node is bigger, and possesses the function of network code in information processing.
The maximum information treating capacity that the main thought of coding nodes is set is by computing node is provided with coding nodes, and coding nodes is distributed in the network uniformly.
The concrete steps that coding nodes is set are:
(1) backbone node in the network is set.Backbone node has the function of stronger information processing and transmission.Concrete generation method is:
1. node and carries out descending according to the size of the information maximum transmitted amount of node in the unit interval to whole nodes in the maximum transmitted amount of unit interval internal information in the computing network, forms the descending table.
2. choose the top n node as backbone node in the descending table, N is the several times that need the coding nodes quantity of generation.
The threshold value of (2) initialization distance, and absolute difference.This threshold value is represented the distance between any two backbone nodes, and absolute difference is represented the absolute value of coding nodes quantity with the difference of the coding nodes quantity of needs setting of selected scheme.
The initial value of the threshold value of distance determines that method is:
1. choose a backbone node in the network arbitrarily, calculate the beeline of this backbone node to other backbone node.Beeline between the node, the i.e. minimum value of the number of links that mutual signal post need take between two nodes.
2. calculate the mean value of this backbone node, as the initial value of the threshold value of distance to the shortest path of other backbone node.
Definite method of absolute difference is: will need the initial value of the quantity of the network code node set as absolute difference.
(3) coding nodes in the network is set.Coding nodes not only has the forwarding information function of router, also has the encoding function of packet simultaneously, can carry out network code.The distribution of coding nodes in network is more even, and concerning any two coding nodes, beeline between the two will be greater than the threshold value of distance.The concrete choosing method of coding nodes is:
1. choose any one backbone node in the network, this backbone node is set to coding nodes.With this coding nodes is Centroid, calculates the beeline of this coding nodes to other backbone node.Choose the backbone node of beeline between threshold value ± 1 of distance, and calculate the distance of these backbone nodes to other coding nodes.If there be the backbone node of beeline greater than the threshold value of distance, setting this backbone node so is coding nodes.
2. be Centroid with the new coding nodes of determining, repeating step 1..
Absolute difference between the quantity of the encoded point that (4) statistical coding number of nodes, and calculation code number of nodes and needs are set.
(5) if, illustrating the quantity of a scheme coding nodes quantity of setting and the coding nodes that needs to set greater than initial value, absolute difference differs minimum, so select a last scheme.If absolute difference is less than initial value, the quantity that this scheme coding nodes quantity of setting and the coding nodes that needs to set are described differs minimum, the possibility that has the littler scheme of absolute difference in addition, so upgrade the initial value of absolute difference, and step (3) again of the mode by changing distance threshold.If the quantity of coding nodes then can be by increasing the quantity that threshold value reduce coding nodes, so threshold value was adding 1 on original basis more than the quantity of the encoded point of needs setting.If the quantity of coding nodes then can increase the quantity of coding nodes by reducing threshold value less than the quantity of the encoded point of needs setting, so threshold value was subtracting 1 on original basis.Repeated multiple times is calculated the quantity of the encoded point approach setting like this, up to the scheme of the quantity of the encoded point that draws the most approaching setting.
The 2nd, set up multicast network, in network, existed part of nodes to have the function of network code,, the better utilization network code reduces the purpose that multicast takies the size of Internet resources for thereby reaching, by sending node being analyzed to the path between the receiving node and it being divided priority level, make up the multicast transmission network on this basis.The foundation of multicast network comprises two parts content: sending node is to the path discovery between the receiving node, and sending node is to the Path selection between the receiving node.
1, sending node is to the path discovery between the receiving node
The mode that employing floods is looked for sending node to all possible path between the receiving node, and concrete steps are:
(1) sending node sends and seeks the path data bag to all neighbor nodes.
Seek the path data bag and comprise five partial informations: the 1. header of packet, represent that this packet is the packet that sending node is sought the path of receiving node; 2. the unique identifying number of packet; 3. the nodal information of packet process comprises the unique identifying number that sends and transmit the node of this packet; 4. bandwidth information, minimum link bandwidth in all links of this packet process of expression transmission; 5. time delay information, the summation of the time delay of all links of expression packet from sending node to the receiving node process, promptly packet transmits needed total time from the sending node to the receiving node.
(2) intermediate node receives the searching path data bag that neighbor node sends.
The first, in the nodal information of packet, inquire about, whether comprise self node unique identifying number.If the identification number of intermediate node has been present in the nodal information of packet, the forwarding of this packet ends at this intermediate node so.
The second, if the identification number of intermediate node is inquired about the number of nodes that comprises in the nodal information of this packet so not in the nodal information of packet.If number of nodes has reached the threshold value of default, promptly packet has reached the max-forwards number of times of default, and this intermediate node is not the receiving node of target, and the forwarding of this packet ends at this intermediate node so.
The 3rd, if number of nodes less than the threshold value of default, promptly packet does not reach the max-forwards number of times of default, carries out following operation so: the 1. unique identifying number of new data packets more; 2. the identification number with intermediate node adds in the nodal information of packet; If the smallest link bandwidth that 3. last one node that sends or transmit this packet is represented less than the bandwidth information in the packet to link bandwidth between the intermediate node is with the former value bandwidth information in the new data packets more; 4. the time delay information of new data packets more; 5. the searching path data bag after neighbor node transmit to upgrade.
(3) receiving node is received the searching path data bag that neighbor node sends.
At first, receiving node upgrades local available path collection.
Secondly, inquire about the number of nodes that comprises in the nodal information of this packet.If number of nodes has reached the threshold value of default, promptly packet has reached the max-forwards number of times of default, and the forwarding of this packet ends at this receiving node so.If number of nodes is less than the threshold value of default, promptly packet does not reach the max-forwards number of times of default, carries out following operation so: the 1. unique identifying number of new data packets more; 2. the identification number with receiving node adds in the nodal information of packet; If the smallest link bandwidth that 3. last one node of transmitting this packet is represented less than the bandwidth information in the packet to link bandwidth between the receiving node is with the former value bandwidth information in the new data packets more; 4. the time delay information of new data packets more; 5. the searching path data bag after neighbor node transmit to upgrade.
2, sending node is to the Path selection between the receiving node.
Consider the formation of multicast network, should utilize the network code node as far as possible, conserve network resources as much as possible again simultaneously is so carry out in two steps.
(1) chooses a receiving node arbitrarily, select the path between sending node and the receiving node.Concrete steps are as follows:
1. calculate sending node to the shortest path between the receiving node;
2. be provided with that the link sum equals the shortest path number and be one-level through the priority in the path of coding nodes
The priority that 3. path of satisfying following two conditions is set is secondary;
Condition a. takies link sum≤shortest path number+δ, and the value of δ is by the decision of network size;
Condition b. is through coding nodes;
4. according to taking link sum order from small to large, the priority in path is set, takies the few path of number of links, priority is higher;
5. choose the higher path of priority and be used to make up multicast network.Every interpolation one paths checks promptly whether the minimal cut of multicast network equals multicast speed in multicast network.When the minimal cut of multicast network equaled multicast speed, the structure of multicast network stopped.
6. the routing information in the multicast network is sent to sending node;
7. sending node link that multicast network is comprised adds in the set of choosing link, and this set is sent to other receiving node.
(2), all carry out choosing of path according to following steps for other receiving node:
1. calculate the link sum that the receiving node available path concentrates each path to take.If the link in certain path has appeared in the set of choosing link, this link is not counted in the link sum so;
2. according to taking link sum order from small to large, the priority in path is set, takies the few path of number of links, priority is higher;
3. choose the higher path of priority and be used to make up multicast network;
4. the routing information in the multicast network is sent to sending node;
5. sending node link that multicast network is comprised adds in the set of choosing link, and this set is sent to other receiving node.
Advantage of the present invention:
(1) in the network coding nodes is set, might reaches the upper limit of multicast speed when making actual multicast application, more traditional route transmission has improved the efficient of transmission.
(2) the network code number of nodes is limited, and all node carries out network code, and the infrastructure device that need upgrade has still less reduced the input of fund.
(3) adopt to distinguish the mode of link priority level, guaranteed that multicast network can make full use of can demote the again occupancy of Internet resources of network code.
Description of drawings
Fig. 1 is the schematic diagram of network three category nodes;
Fig. 2 is that sending node is to the path discovery flow chart between the receiving node.
Fig. 3 is the selection flow chart of sending node to the path of receiving node
Embodiment
The invention will be further described below in conjunction with accompanying drawing.
The inventive method comprises that the setting, sending node of coding nodes in the network are to the path discovery between the receiving node, three partial contents of Path selection.
1, the setting of coding nodes in the network
There are three category nodes in the setting network, the one, routing node, the total bandwidth of this category node is less, and only possesses the function of the forwarding of router in information processing; The 2nd, common backbone node, the total bandwidth of this category node is bigger, and only possesses the forwarding capability of router in information processing; The 3rd, coding nodes, the total bandwidth of this category node is bigger, and possesses the function of network code in information processing.Fig. 1 is the schematic diagram of network three category nodes, and node 101, node 102, node 103 are coding nodes, and node 301, node 302 are backbone node, and other node is a routing node.
The maximum information treating capacity that the main thought of coding nodes is set is by computing node is provided with coding nodes, and coding nodes is distributed in the network uniformly.
The concrete steps that coding nodes is set are:
(1) backbone node in the network is set.Backbone node has stronger information processing, the function of transmission.Concrete generation method is:
1. node and carries out descending according to the size of the information maximum transmitted amount of node in the unit interval to whole nodes in the maximum transmitted amount of unit interval internal information in the computing network, forms the descending table.
2. choose the top n node as backbone node in the descending table, N is 2～3 times of the coding nodes quantity that need to generate.
The threshold value of (2) initialization distance, and absolute difference.This threshold value is represented the distance between any two backbone nodes, and absolute difference is represented the absolute value of coding nodes quantity with the difference of the coding nodes quantity of needs setting of selected scheme.
The initial value of the threshold value of distance determines that method is:
1. choose a backbone node in the network, as choose the node of the information maximum transmitted amount maximum in the unit interval, calculate the beeline of this backbone node to other backbone node.Beeline between the node, the i.e. minimum value of the number of links that mutual signal post need take between two nodes.
2. calculate the mean value of this backbone node, as the initial value of the threshold value of distance to the shortest path of other backbone node.
Definite method of absolute difference is: need the quantity of the network code node of setting, as the initial value of absolute difference.
(3) coding nodes in the network is set.Coding nodes not only has the forwarding information function of router, also has the encoding function of packet simultaneously, can carry out network code.The distribution of coding nodes in network is more even, and concerning any two coding nodes, beeline between the two will be greater than the threshold value of distance.The concrete choosing method of coding nodes is:
1. choose a backbone node in the network, as choose the node of the information maximum transmitted amount maximum in the unit interval, this backbone node is set to coding nodes.With this coding nodes is Centroid, calculates the beeline of this coding nodes to other backbone node.Choose the backbone node of beeline between threshold value ± 1 of distance, and calculate the distance of these backbone nodes to other coding nodes.If there be the backbone node of beeline greater than the threshold value of distance, setting this backbone node so is coding nodes.
2. be Centroid with the new coding nodes of determining, repeating step 1..
With Fig. 1 is example, chooses node 101 as coding nodes.With node 101 is Centroid, and by calculating, setting node 102 is coding nodes.Again with coding nodes 102 be the center repeating step 1., be coding nodes by calculate setting node 103.
Absolute difference between the quantity of the encoded point that (4) statistical coding number of nodes, and calculation code number of nodes and needs are set.
(5) if, illustrating the quantity of this scheme coding nodes quantity of setting and the coding nodes that needs to set greater than initial value, absolute difference differs bigger, so select a last scheme.If absolute difference is less than initial value, the quantity that this scheme coding nodes quantity of setting and the coding nodes that needs to set are described differs minimum, the possibility that has the littler scheme of absolute difference in addition, so upgrade the initial value of absolute difference, and step (3) again of the mode by changing distance threshold.Repeated multiple times is calculated the quantity of the encoded point approach setting like this, up to the scheme of the quantity of the encoded point that draws the most approaching setting.
The foundation that distance threshold changes is:
If the quantity of principle a. coding nodes then can be by increasing the quantity that threshold value reduce coding nodes, so threshold value was adding 1 on original basis more than the quantity of the encoded point of needs setting.
If the quantity of principle b. coding nodes then can increase the quantity of coding nodes by reducing threshold value less than the quantity of the encoded point of needs setting, so threshold value was subtracting 1 on original basis.
With Fig. 1 is example, and system requirements is set 4 backbone nodes.When the setpoint distance threshold value was 3, the coding nodes quantity of setting was 2, and absolute difference is 2.At this moment, the quantity of coding nodes is less than the quantity of the encoded point of needs setting.Therefore upgrade the initial value of absolute difference with numerical value 2, and basis principle b reduces distance threshold to 2.By step (3), the coding nodes quantity that obtains is 3, and absolute difference is 1.Absolute difference is less than initial value, and the scheme the when scheme that obtains when distance threshold is 2 is better than distance threshold and is 3 is described.Simultaneously, there is the possibility of the littler scheme of absolute difference in addition, thus the initial value of absolute difference upgraded with numerical value 1, and basis principle b reduces distance threshold to 1.Again step (3), the coding nodes quantity that obtains is 6, absolute difference is 2.This moment, absolute difference was greater than initial value, and the scheme the when scheme that obtains when distance threshold is 2 is better than distance threshold and is 1 is described.The chosen distance threshold value is that 2 o'clock scheme is that final coding nodes is set scheme.
2, sending node is to the path discovery between the receiving node
Fig. 2 is the searching process of sending node to all possible paths of receiving node.
In the discovery stage in path, each node all adopts the mode that floods, and looks for sending node to the possible path of going between the receiving node, and concrete steps are:
(1) sending node sends and seeks the path data bag to all neighbor nodes.
Seek the path data bag and comprise five partial informations: the 1. header of packet, represent that this packet is the packet that sending node is sought the path of receiving node; 2. the unique identifying number of packet; 3. the nodal information of packet process comprises the unique identifying number that sends and transmit the node of this packet; 4. bandwidth information, minimum link bandwidth in all links of this packet process of expression transmission; 5. time delay information, the summation of the time delay of all links of expression packet from sending node to the receiving node process, promptly packet transmits needed total time from the sending node to the receiving node.
(2) intermediate node receives the searching path data bag that neighbor node sends.
The first, in the nodal information of packet, inquire about, whether comprise self node unique identifying number.If the identification number of intermediate node has been present in the nodal information of packet, the forwarding of this packet ends at this intermediate node so.
The second, if the identification number of intermediate node is inquired about the number of nodes that comprises in the nodal information of this packet so not in the nodal information of packet.If number of nodes has reached the threshold value of default, promptly packet has reached the max-forwards number of times of default, and this intermediate node is not the receiving node of target, and the forwarding of this packet ends at this intermediate node so.
The 3rd, if number of nodes less than the threshold value of default, promptly packet does not reach the max-forwards number of times of default, carries out following operation so: the 1. unique identifying number of new data packets more; 2. the identification number with intermediate node adds in the nodal information of packet; If the smallest link bandwidth that 3. last one node that sends or transmit this packet is represented less than the bandwidth information in the packet to link bandwidth between the intermediate node is with the former value bandwidth information in the new data packets more; 4. the time delay information of new data packets more; 5. the searching path data bag after neighbor node transmit to upgrade.
(3) receiving node is received the searching path data bag that neighbor node sends.
At first, receiving node upgrades local available path collection.
Secondly, inquire about the number of nodes that comprises in the nodal information of this packet.If number of nodes has reached the threshold value of default, promptly packet has reached the max-forwards number of times of default, and the forwarding of this packet ends at this receiving node so.If number of nodes is less than the threshold value of default, promptly packet does not reach the max-forwards number of times of default, carries out following operation so: the 1. unique identifying number of new data packets more; 2. the identification number with receiving node adds in the nodal information of packet; If the smallest link bandwidth that 3. last one node of transmitting this packet is represented less than the bandwidth information in the packet to link bandwidth between the receiving node is with the former value bandwidth information in the new data packets more; 4. the time delay information of new data packets more; 5. the searching path data bag after neighbor node transmit to upgrade.
3, sending node is to the Path selection between the receiving node.
Fig. 3 is the selection course of sending node to the path of receiving node.
Consider the formation of multicast network, should utilize the network code node as far as possible, conserve network resources as much as possible again simultaneously, so, carry out in two steps.
(1) chooses a receiving node arbitrarily, select the path between sending node and the receiving node.Concrete steps are as follows:
1. calculate sending node to the shortest path between the receiving node;
2. be provided with that the link sum equals the shortest path number and be one-level through the priority in the path of coding nodes
The priority that 3. path of satisfying following two conditions is set is secondary;
Condition a. takies link sum≤shortest path number+δ, and the value of δ is by the decision of network size;
Condition b. is through coding nodes;
4. according to taking link sum order from small to large, the priority in path is set, takies the few path of number of links, priority is higher;
5. choose the higher path of priority and be used to make up multicast network.Every interpolation one paths checks promptly whether the minimal cut of multicast network equals multicast speed in multicast network.When the minimal cut of multicast network equaled multicast speed, the structure of multicast network stopped.
6. the routing information in the multicast network is sent to sending node;
7. sending node link that multicast network is comprised adds in the set of choosing link, and this set is sent to other receiving node.
(2), all carry out choosing of path according to following steps for other receiving node:
1. calculate the link sum that the receiving node available path concentrates each path to take.If the link in certain path has appeared in the set of choosing link, this link is not counted in the link sum so;
2. according to taking link sum order from small to large, the priority in path is set, takies the few path of number of links, priority is higher;
3. choose the higher path of priority and be used to make up multicast network;
4. the routing information in the multicast network is sent to sending node;
5. sending node link that multicast network is comprised adds in the set of choosing link, and this set is sent to other receiving node.
Claims (10)
1. a part of nodes carries out the transmission network generation method of network code, it is characterized in that this method comprises coding nodes to be set in the network and to set up multicast network;
The concrete steps that coding nodes in the network is set are:
Step (1) is provided with the backbone node in the network;
The threshold value and the absolute difference of step (2) initialization distance;
Step (3) is chosen the coding nodes in the network;
Step (4) statistical coding number of nodes, and the absolute difference between the quantity of the encoded point of calculation code number of nodes and needs setting; If absolute difference less than initial value, then upgrades the initial value of absolute difference, and the threshold value of change distance, repeating step (3);
The concrete steps of setting up multicast network are:
Step (5) sending node is to the path discovery between the receiving node, and concrete grammar is:
Step a, sending node send seeks the path data bag to all neighbor nodes;
Step b, intermediate node receive the searching path data bag that neighbor node sends;
Step c, receiving node are received the searching path data bag that neighbor node sends;
Step (6) sending node is to the Path selection between the receiving node, and concrete grammar is:
Steps d, choose a receiving node arbitrarily, select the path between sending node and the receiving node;
Step e, choose other receiving node path.
2. a kind of part of nodes according to claim 1 carries out the transmission network generation method of network code, it is characterized in that the backbone node concrete grammar that is provided with in the network described in the step (1) is:
1-1. node is in the maximum transmitted amount of unit interval internal information in the computing network, and according to the size of the information maximum transmitted amount of node in the unit interval whole nodes carried out descending, forms the descending table;
1-2. choose the top n node as backbone node in the descending table, N is the several times that need the coding nodes quantity of generation.
3. a kind of part of nodes according to claim 1 carries out the transmission network generation method of network code, it is characterized in that the threshold value of the initialization distance described in the step (2) and absolute difference concrete grammar are:
The initial value of the threshold value of distance determines that method is:
2-1. choose a backbone node in the network arbitrarily, calculate the beeline of this backbone node to other backbone node;
2-2. calculate the mean value of this backbone node, with the initial value of this mean value as the threshold value of distance to the shortest path of other backbone node;
Definite method of absolute difference is: will need the initial value of the quantity of the network code node set as absolute difference.
4. a kind of part of nodes according to claim 1 carries out the transmission network generation method of network code, it is characterized in that the coding nodes concrete grammar of choosing in the network described in the step (3) is:
3-1. choose any one backbone node in the network, this backbone node is set to coding nodes, is Centroid with this coding nodes, calculates the beeline of this coding nodes to other backbone node; Choose the backbone node of beeline between threshold value ± 1 of distance, and calculate the distance of these backbone nodes to other coding nodes; If there be the backbone node of beeline greater than the threshold value of distance, setting this backbone node so is coding nodes;
3-2. with the new coding nodes of determining is Centroid, repeating step 3-1.
5. a kind of part of nodes according to claim 1 carries out the transmission network generation method of network code, it is characterized in that the threshold value concrete grammar of the change distance described in the step (4) is:
If the quantity of the encoded point that the quantity of coding nodes is set more than needs, then threshold value adds 1 and reduces the quantity of coding nodes with this; If the quantity of the encoded point that the quantity of coding nodes is set less than needs, then threshold value subtracts 1 and increases the quantity of coding nodes with this.
6. a kind of part of nodes according to claim 1 carries out the transmission network generation method of network code, it is characterized in that the searching path data bag described in the step a comprises five partial informations: first is the header of packet, represents that this packet is the packet that sending node is sought the path of receiving node; Second is the unique identifying number of packet; The 3rd is the nodal information of packet process, comprises the unique identifying number that sends and transmit the node of this packet; The 4th is bandwidth information, minimum link bandwidth in all links of this packet process of expression transmission; The 5th is time delay information, the summation of the time delay of all links of expression packet from sending node to the receiving node process, and promptly packet transmits needed total time from the sending node to the receiving node.
7. a kind of part of nodes according to claim 1 carries out the transmission network generation method of network code, it is characterized in that the searching path data bag concrete grammar that the intermediate node reception neighbor node described in the step b sends is:
B-1. in the nodal information of packet, look into to, whether comprise self node unique identifying number, if the identification number of intermediate node has been present in the nodal information of packet, the forwarding of this packet ends at this intermediate node so;
B-2. not in the nodal information at packet under this situation, inquire about the number of nodes that comprises in the nodal information of this packet at the identification number of intermediate node; If number of nodes has reached the threshold value of default, promptly packet has reached the max-forwards number of times of default, and this intermediate node is not the receiving node of target, and the forwarding of this packet ends at this intermediate node so;
B-3. under the threshold value situation of number of nodes less than default, promptly packet does not reach the max-forwards number of times of default, carries out following operation: I. the unique identifying number of new data packets more; II. the identification number of intermediate node is added in the nodal information of packet; If III. the smallest link bandwidth that last one node that sends or transmit this packet is represented less than the bandwidth information in the packet to link bandwidth between the intermediate node, with the former value bandwidth information in the new data packets more; IV. the time delay information of new data packets more; V. the searching path data bag after neighbor node is transmitted renewal.
8. a kind of part of nodes according to claim 1 carries out the transmission network generation method of network code, it is characterized in that the searching path data bag concrete grammar that the receiving node described in the step c receives that neighbor node sends is:
C-1. receiving node upgrades local available path collection;
C-2. inquire about the number of nodes that comprises in the nodal information of this packet, if number of nodes has reached the threshold value of default, promptly packet has reached the max-forwards number of times of default, and the forwarding of this packet ends at this receiving node so; If number of nodes is less than the threshold value of default, promptly the packet end reaches the max-forwards number of times of default, carries out following operation so: the 1) unique identifying number of new data packets more; 2) identification number with receiving node adds in the nodal information of packet; 3) if the smallest link bandwidth that last one node of transmitting this packet is represented less than the bandwidth information in the packet to link bandwidth between the receiving node, with the former value bandwidth information in the new data packets more; 4) the time delay information of new data packets more; 5) the searching path data bag after neighbor node is transmitted renewal.
9. a kind of part of nodes according to claim 1 carries out the transmission network generation method of network code, it is characterized in that the path concrete grammar between selection sending node described in the steps d and the receiving node is:
D-1. calculate sending node to the shortest path between the receiving node;
D-2. be provided with that the link sum equals the shortest path number and be one-level through the priority in the path of coding nodes
D-3., the priority that the path of satisfying following two conditions is set is secondary;
Condition a. takies link sum≤shortest path number+δ, and the value of δ is by the decision of network size;
Condition b. is through coding nodes;
D-4. according to taking link sum order from small to large, the priority in path is set, takies the few path of number of links, priority is higher;
D-5. choose the higher path of priority and be used to make up multicast network, every interpolation one paths checks whether the minimal cut of multicast network equals multicast speed in multicast network; When the minimal cut of multicast network equaled multicast speed, the structure of multicast network stopped;
D-6. the routing information in the multicast network is sent to sending node;
D-7. sending node link that multicast network is comprised adds in the set of choosing link, and this set is sent to other receiving node.
10. a kind of part of nodes according to claim 1 carries out the transmission network generation method of network code, it is characterized in that the concrete grammar of choosing other receiving node path described in the step e is:
E-1. calculate the link sum that the receiving node available path concentrates each path to take, if the link in certain path has appeared in the set of choosing link, this link is not counted in the link sum so;
E-2. according to taking link sum order from small to large, the priority in path is set, takies the few path of number of links, priority is higher;
E-3. choose the higher path of priority and be used to make up multicast network;
E-4. the routing information in the multicast network is sent to sending node;
E-5. sending node link that multicast network is comprised adds in the set of choosing link, and this set is sent to other receiving node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102438385A CN101917334B (en) | 2010-08-03 | 2010-08-03 | Transmission network generation method by network coding of part of nodes |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102438385A CN101917334B (en) | 2010-08-03 | 2010-08-03 | Transmission network generation method by network coding of part of nodes |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101917334A true CN101917334A (en) | 2010-12-15 |
| CN101917334B CN101917334B (en) | 2012-05-23 |
Family
ID=43324728
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010102438385A Expired - Fee Related CN101917334B (en) | 2010-08-03 | 2010-08-03 | Transmission network generation method by network coding of part of nodes |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101917334B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102347908A (en) * | 2011-11-18 | 2012-02-08 | 中国科学技术大学 | Multi-cast route constructing method based on network coding |
| CN104704760A (en) * | 2012-09-24 | 2015-06-10 | 北京大学深圳研究生院 | Method and apparatus for multi-source dynamic network coding |
| CN114884617A (en) * | 2022-05-07 | 2022-08-09 | 杭州复杂美科技有限公司 | Block transfer method, computer device, and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101146049A (en) * | 2007-10-31 | 2008-03-19 | 北京航空航天大学 | Radio Ad hoc data transmission method based on network coding |
| CN101267450A (en) * | 2008-03-18 | 2008-09-17 | 上海大学 | Multicast routing method for distributed network application layer based on network coding |
| CN101325556A (en) * | 2008-06-23 | 2008-12-17 | 南京大学 | Multi-path routing method for wireless network based on network encoding |
| CN101562556A (en) * | 2008-04-15 | 2009-10-21 | 华为技术有限公司 | Method, device and system for reducing network coding cost |
| WO2010019082A1 (en) * | 2008-08-15 | 2010-02-18 | Telefonaktiebolaget L M Ericsson (Publ) | Relay node selection for network coding |
-
2010
- 2010-08-03 CN CN2010102438385A patent/CN101917334B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101146049A (en) * | 2007-10-31 | 2008-03-19 | 北京航空航天大学 | Radio Ad hoc data transmission method based on network coding |
| CN101267450A (en) * | 2008-03-18 | 2008-09-17 | 上海大学 | Multicast routing method for distributed network application layer based on network coding |
| CN101562556A (en) * | 2008-04-15 | 2009-10-21 | 华为技术有限公司 | Method, device and system for reducing network coding cost |
| CN101325556A (en) * | 2008-06-23 | 2008-12-17 | 南京大学 | Multi-path routing method for wireless network based on network encoding |
| WO2010019082A1 (en) * | 2008-08-15 | 2010-02-18 | Telefonaktiebolaget L M Ericsson (Publ) | Relay node selection for network coding |
Non-Patent Citations (1)
| Title |
|---|
| 《北京邮电大学学报》 20100228 廖勇等 无线Mesh网络下的网络编码机制 第27-32页 1-10 第33卷, 第1期 2 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102347908A (en) * | 2011-11-18 | 2012-02-08 | 中国科学技术大学 | Multi-cast route constructing method based on network coding |
| CN102347908B (en) * | 2011-11-18 | 2013-12-18 | 中国科学技术大学 | Multi-cast route constructing method based on network coding |
| CN104704760A (en) * | 2012-09-24 | 2015-06-10 | 北京大学深圳研究生院 | Method and apparatus for multi-source dynamic network coding |
| CN104704760B (en) * | 2012-09-24 | 2018-01-05 | 北京大学深圳研究生院 | The method and device of multiple source dynamic network coding |
| CN114884617A (en) * | 2022-05-07 | 2022-08-09 | 杭州复杂美科技有限公司 | Block transfer method, computer device, and storage medium |
| CN114884617B (en) * | 2022-05-07 | 2023-12-26 | 深圳北宸博裕科技有限公司 | Block transmission method, computer device and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101917334B (en) | 2012-05-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104767694B (en) | A kind of stream compression forwarding method towards Fat Tree data center network architectures | |
| CN101267450B (en) | Multicast routing method for distributed network application layer based on network coding | |
| CN105227481A (en) | The SDN congestion control method for routing of cost minimization is dispatched based on path cost and stream | |
| CN103843297A (en) | Method, device and system for providing and selecting candidate nodes for live streaming services | |
| CN102006221A (en) | Method for optimizing quality of service of stream media | |
| CN110351780A (en) | A kind of communication means based on code cache, system and storage medium | |
| CN103297174A (en) | High-speed mobile ad hoc network data transmission method based on dynamic network codes | |
| CN101917334B (en) | Transmission network generation method by network coding of part of nodes | |
| CN103442412A (en) | Network selection method based on weighted optimal bipartite graph matching | |
| CN103856560B (en) | A kind of P2P stream media scheduling system and methods based on coding coupling | |
| CN111314223A (en) | Routing interface ranking-based forwarding method in NDN (named data networking) | |
| CN102364962A (en) | Scalable layered coding based multi-path transmission scheme | |
| CN102790803A (en) | Streaming media service multi-stream concurrent transmission method based on multi-terminal fusion | |
| CN105049347A (en) | Routing method of DTN (Delay Tolerant Network) based on social network task distribution model | |
| CN104994508A (en) | Cognitive radio mesh network resource distribution and routing method | |
| CN110086870A (en) | The parallel method for reliable transmission of the multipath of data-oriented central site network | |
| CN106105282B (en) | The system and method for carrying out traffic engineering using link buffer zone state | |
| CN108111991B (en) | D2D network building method based on scalable video streaming user experience quality | |
| CN104821881A (en) | Compression-and-error-correction-coding-based safety data fusion method of sensing layer of internet of things | |
| CN103685020A (en) | Genetic algorithm based minimum-cost optical multicast tree routing method | |
| CN101931543A (en) | Method for efficiently managing dynamic node based on overlay network multicast system | |
| CN102118310B (en) | Hierarchical network coding streaming media multicast-based resource scheduling method | |
| CN102694623A (en) | Method for distributing speed rate in multi-hop wireless network based on network coding among sessions | |
| CN103166861A (en) | Method of solving layering multicast maximum throughput of optical network | |
| Torre et al. | Network-coded multigeneration protocols in heterogeneous cellular networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20120523 Termination date: 20140803 |
|
| EXPY | Termination of patent right or utility model |