WO2014043908A1 - Procédé et appareil de codage de réseau dynamique multi-source - Google Patents

Procédé et appareil de codage de réseau dynamique multi-source Download PDF

Info

Publication number
WO2014043908A1
WO2014043908A1 PCT/CN2012/081820 CN2012081820W WO2014043908A1 WO 2014043908 A1 WO2014043908 A1 WO 2014043908A1 CN 2012081820 W CN2012081820 W CN 2012081820W WO 2014043908 A1 WO2014043908 A1 WO 2014043908A1
Authority
WO
WIPO (PCT)
Prior art keywords
path
node
source
paths
link
Prior art date
Application number
PCT/CN2012/081820
Other languages
English (en)
Chinese (zh)
Inventor
李挥
侯韩旭
冯俊秋
张华宇
朱兵
韩元波
Original Assignee
北京大学深圳研究生院
深圳市矽伟智科技有限公司
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 北京大学深圳研究生院, 深圳市矽伟智科技有限公司 filed Critical 北京大学深圳研究生院
Priority to PCT/CN2012/081820 priority Critical patent/WO2014043908A1/fr
Priority to CN201280075605.6A priority patent/CN104704760B/zh
Publication of WO2014043908A1 publication Critical patent/WO2014043908A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0076—Distributed coding, e.g. network coding, involving channel coding

Definitions

  • the present invention relates to the field of network coding, and more particularly to a method and apparatus for multi-source dynamic network coding.
  • NC Network Coding
  • the routing switch on the traditional communication network node only performs the "store-and-forward" function, and regards the information as "goods", so that the information is considered to be non-superimposable.
  • This cognitive limitation makes it difficult for the network to achieve maximum streaming.
  • the NC indicates that if the routing switch is allowed to encode the input multiple streams of information before sending, the network communication can be maximized.
  • This type of network coding is called intra-session network coding.
  • the data output by the intermediate node is a linear combination of the input data.
  • the receiving node can decode when it receives enough independent coded packets.
  • This type of network coding is called multi-source network coding, also known as multi-session network. Encoding problems or inter-session networks give coding problems.
  • PA poison-antidote method
  • the PA tracks all sessions.
  • the coded packet is called a poison
  • the packet used for decoding is called an antidote. Every time a poison is produced, an antidote must be sent immediately; the PA uses an XOR encoding method.
  • the disadvantage of PA is its high complexity, which has a complexity of at least 0 ( ⁇ 1 £ 11 V I), where m is the number of sessions, k is the number of sessions allowed to encode, and does not take into account dynamic changes in the network.
  • the intermediate node uses selective random linear coding, and the coding coefficients are controlled by genetic algorithms. Its shortcomings ⁇ because the algorithm will become more complicated as the number of sessions increases, making the SRLC algorithm very complex, and does not consider the dynamic changes of the network.
  • PINC For the above two inter-session network coding algorithm PINC: PINC only allows encoding two data packets, the coding uses random linear network coding. The disadvantage is that the complexity is high, and only the encoding between the two sessions is allowed, and the throughput is reduced.
  • the technical problem to be solved by the present invention is to provide a multi-source dynamic network with low complexity and low data throughput, which is high in complexity of the above-mentioned coding and may reduce data throughput. Coding method and device.
  • the source node selects one or more data packets to be transmitted on multiple paths to the receiving node according to the encoded path data received by the source node;
  • the intermediate node encodes and transmits the data packets sent by different source nodes it receives to the receiving node.
  • step A) further includes:
  • A1 searching for a data transmission path from the source node to the receiving node according to the data request that the receiving node sends to the source node; and storing the found path set on the source node ;
  • the receiving node reversely routes to the source node, obtains multiple links included in each path, and stores the link parameters on the tail node of the link;
  • the link parameters include: a source node involved, a receiving node, a number of paths, and a path number of the link.
  • the step A) further includes:
  • step C) further includes:
  • step C1) judging whether the number of data packets
  • step C2) setting the path of the link from the source node to the receiving node as a non-encoding path, and jumping to step C4);
  • step D determining whether all paths from the source node to the receiving node in the session are set, and if so, performing step D); otherwise, repeating steps CI) - C4 for the remaining intermediate nodes.
  • the step D) further includes: if there is no coding path in all paths of the source node to the receiving node, the source node sends the same data packet on all paths; If there are A coding paths in all the paths from the source node to the receiving node, and the number of paths from the source node to the receiving node is greater than the number of the encoded paths, then the source node is in all
  • the steps A) - E) are performed on the changed receiving node and the source node requesting the data.
  • the intermediate node XORs the data packets from different source nodes and transmits the encoded data packets on the link.
  • the invention also relates to an apparatus for implementing the above method, comprising:
  • a pre-processing unit configured to perform pre-processing on a source node, a receiving node, and an intermediate node involved in the session for multiple sessions existing on the current network, so that the source node involved in the session obtains the current The path parameter of the session, and the tail node of the multiple links involved in the session obtains its link parameters;
  • An initial stage data packet sending unit configured to send the same data packet on all paths of a receiving node to which the source node currently requests data;
  • the encoding path setting unit is configured to sequentially determine the number of data packets transmitted from different sessions on each link in the path, for example, if there is only one data packet, setting a path involving the link in the session to a non-encoding path If the number of data packets transmitted from different sessions on the link is
  • - i paths are coded paths, the remaining path is a non-coded path, and the source node involved in the coded path is notified;
  • a packet transmitting unit is configured to cause the source node to receive the encoded path according to the source path Data, selecting one or more data packets to be respectively transmitted on multiple paths to the receiving node;
  • Coding unit configured to cause the intermediate node to encode and transmit a data packet sent by a different source node that it receives to the receiving node.
  • the pre-processing unit further includes:
  • a forward path search module configured to search for a data transmission path from the source node to the receiving node according to a data request that is sent by the receiving node to the source node; and on the source node Store the set of found paths;
  • the reverse path searching module is configured to: in turn, reversely route the receiving node to the source node according to the obtained path, obtain multiple links included in each path, and store the link on the tail node of the link.
  • the link parameter includes: a source node, a receiving node, a number of paths, and a path number of the link;
  • Initial Path Setup Module Used to set all paths to non-coded paths at the beginning. Further, the encoding path setting unit further includes:
  • a link receiving data packet judging module configured to determine whether the number of data packets
  • the non-coding path setting module is configured to: when the data packet received by the link is 1, set a path where the link is located, and the path from the source node to the receiving node is a non-encoding path;
  • An encoding path setting module configured to set, in the path of the different source node to the receiving node, the encoding path, and the remaining one is a non-encoding path, and notify the source node;
  • a setting completion judgment module configured to determine, by the source node to the receiving node in the session Whether all paths are set.
  • the method and apparatus for implementing the multi-source dynamic network coding of the present invention have the following beneficial effects: instead of performing network coding on all input data of a node, only performing network coding on the required data and using an exclusive OR coding method, The coding is less complex and does not reduce data throughput.
  • FIG. 1 is a flowchart of a method in a method and apparatus for multi-source dynamic network coding according to the present invention
  • FIG. 2 is a specific flowchart of a pre-processing step in the embodiment
  • Figure 3 is a flow chart showing the setting of the encoding path in the embodiment
  • Figure 5 is a schematic view showing a topology of the embodiment
  • Figure 6 is a schematic view showing another topology of the embodiment.
  • Figure 7 is a schematic structural view of the device in the embodiment.
  • the multi-source dynamic network coding method includes the following steps:
  • Step S11 performs pre-processing on the path between each source node and the receiving node according to the current data request:
  • the set of source nodes to the network is ⁇ s 1 s 2 , s h ⁇
  • the set of receiving nodes is ⁇ t 1 t 2
  • the multicast session is represented as ( Si , Ti).
  • i l, 2, ..., h.
  • Each multicast session (s i T is represented by
  • unicast sessions (s i tj), 7;, ⁇ 1,2,..., ⁇ 7; ⁇ .
  • is the number of elements of the set,
  • is also the maximum flow of the session (s i tj).
  • Each receiving node tj is described by three parameters (S(tj), L(tj), Rj).
  • S(tj) is a set of source nodes requested by the receiving node tj, and a path set from the source set S(tj) to the receiving node tj is represented by Rj
  • the set of links used by the receiving node tj when receiving the source is L(tj).
  • the set of receiving nodes that are using link e is denoted by T e .
  • Tail(e) indicates the tail node of the directed link e, and the number of sessions transmitted by link e is expressed as). Since the capacity of all links is unit capacity, any link does not transmit data or transmits a data amount per unit time.
  • Each intermediate node records some identification information, which is information that the source node uses its downlink and information that the source requested by the receiving node uses its link. All intermediate nodes only need to assign appropriate coding packets to their downlinks based on these identification information. The source node only needs to count the encoded information fed back from the intermediate node and allocate the packet on its path.
  • each session is processed according to the method of step S11-step S15, but for the convenience of description, it is not repeated one by one.
  • Step S12 The source node transmits the same data packet on each path to the receiving node: in this step, since each of the source nodes obtains a path capable of reaching the receiving node to which the data request is sent in the foregoing preprocessing step Therefore, a source node sends the same data packet on all paths of a receiving node that currently requests data; likewise, each source node is able to reach a data request to which it is sent in this step. The same packet is sent on the path of the receiving node.
  • the intermediate node on the path of step S13 sets the coding path according to the data packet parameters received by the node, and reports the source path to the source node.
  • the number of coding paths is the number of coding paths in the path set R ld .
  • each of the receiving nodes T e selects ( ⁇ R(e) ⁇ -l ) paths as encoding paths, the other is non-encoding paths, and the number of encoding paths Feedback to the corresponding source node.
  • the encoded packet has 1) 1 data packet to participate in the encoding, so an additional encoding packet that is not linearly related to it is needed to solve the encoded packet.
  • the intermediate node selects (wl-1) paths as the encoding path and feeds back to the corresponding source node, and then the source node allocates (( e )ll) to the receiving node that received the encoded packet.
  • the other is the encoding path. That is to say, in this step, the number of data packets from different sessions transmitted on each link in the path is determined in turn, for example, if there is only one data packet, the path related to the link in the session is set to be non-coded.
  • Step S14 The source node sends one or multiple data packets according to the encoding path parameter: In this step, a source node selects one or more data packets according to the encoded path data received by the source node respectively.
  • the node transmits to multiple paths of a receiving node; in fact, in this embodiment, one source node may need to send the same or different data packets for different receiving nodes, so, in this step, similarly, The above one source node may repeat the above operations for different receiving nodes respectively.
  • the session has IR l paths, where there are j encoding paths
  • the receiving node is enabled to decode the encoded packet transmitted in the encoding path, and the source node selects a non-encoding path for each encoding path, and transmits the same data packet in the encoding path and the non-encoding path. Therefore, it is possible to transmit (IR l- ⁇ ) different data packets in up to IR paths.
  • Step S15 encodes and transmits the data packet on the encoding path:
  • each intermediate node encodes the data packet sent by the different source node it receives and passes through the link where the link is located and where the link is located.
  • the path obtained in the above step is transmitted to the receiving node.
  • the data requirements of the receiving node to the source node are not static. In some cases, for example, if a newly added data request or a previous data request is completed, The path condition of the above network changes. In this case, only the above steps need to be performed for the changed part, and the data in the still existing path and the source node, the receiving node, and the intermediate node are not needed. Or re-acquire after the parameter is cleared. This allows for a smaller cost or overhead to be used when the network changes, again maximizing network throughput.
  • Step S21 Forward path search: In this step, path search of all current sessions is first performed, that is, according to each receiving node Or a data request submitted by a plurality of source nodes, respectively searching for a data transmission path of the source node to the receiving node by the one (in the case of multiple source nodes); and storing on the source node The set of paths found.
  • Step S22 performs reverse routing one by one according to the found path:
  • one receiving node sequentially reversely routes to the source source node to obtain multiple links included in each path. And storing the link parameter on the tail node of each link; wherein the link parameters include: a cell node involved, a receiving node, a number of paths, and a path number of the link.
  • the network includes multiple receiving nodes (or multiple receiving nodes that make data requests), each receiving node will perform this step separately.
  • Step S23 sets the initial state of all the paths: In this step, all the paths in the above session are set to be non-encoded paths due to the initialization requirements.
  • preprocessing it gets the tag information that the output is the session (s i tj) at the intermediate node.
  • the information is routed according to the directed graph, and all the achievable by Si is traversed. Nodes and links, the nodes that pass through are marked as Si.
  • each link connected to the receiving node tj is reversely routed to the source node Si according to the information of the previous node being marked as Si , and the tail(e) of all the links e passing through
  • Each link e is labeled e(Si, tj,
  • each link e is marked as e(st P
  • the overall path of the receiving node is divided into three parts: The first part is a set of discrete paths, and the set of paths is represented. The second part is a non-discrete path set and all receiving nodes can decode, using (3 ⁇ 4 to represent its path set.
  • the third part is a non-discrete path set and does not satisfy all receiving nodes can decode, called this part of the path set is not available
  • Decoding the path set the path set is represented by 13 ⁇ 4.
  • the non-encoding method can achieve the best throughput; the network coding can achieve the best of the second part of the path set throughput;
  • encoding does not improve throughput.
  • a non-encoded routing strategy is used to process this part of the path set, because network coding can not only improve throughput but also generate a large amount of delay.
  • the setting of the encoding path further includes the following steps: Step S31: The number of data packets received by the link is greater than 1, if yes, step S32 is performed; if not, step S33 is performed; In this step, it is determined whether the number of data packets received from a different source node and transmitted to the same receiving node is greater than 1, and if so, step S32 is performed; otherwise, step S33 is performed; When there are multiple links, multiple links will perform the above operations separately.
  • Step S32 Set one of the paths from the different source nodes to the current receiving node of the link to be a non-encoding path, and the rest are encoding paths: In this step, set the different source nodes where the link is located. The path to the receiving node (the total number of these paths is
  • Step S33 setting the path where the link is a non-encoded path: In this step, since there is only one data packet on the link, the data packet is not required to be encoded, so the path where the link is located is a non-encoded path. . After performing this step, go to step S35.
  • Step S34 transmitting the information of the encoding path to the source node:
  • the information of the encoding node set in the above step S32 is sent to the relevant source node, that is, the data packet is sent and passed through the chain.
  • the path is transmitted to the source node of the above receiving node.
  • Step S35 The path of all the links is set: In this step, it is determined whether all the links (of course, the link related to the current data transmission) are both judged and set, and if so, jump The process proceeds to step S14; otherwise, step S36 is performed.
  • Step S36 is ready to judge the next link: In this step, it is prepared to judge and set the next unset link, and after performing this step, return to step S31.
  • the network coding uses an exclusive OR operation instead of random network coding.
  • the data packets participating in the coding are all from different source nodes, and the probability that the same receiving node receives the same coded packet is extremely small, so the correlation of the coefficients is not considered.
  • the encoding node only needs to add a bit and then XOR code to the data participating in the encoding to ensure that the received two encoded packets are irrelevant. For example, two data packets ai ( a ⁇ ! a ⁇ ... a!, B ) and a 2 ( a 2; 1 a 2 , 2 ...
  • the length of the data packet is B bits.
  • the encoding process of another encoding packet is as follows: adding a bit ⁇ ' at the end of the packet a ⁇ header and a 2 respectively to obtain a data packet (Oawau ...a !, B ) and (a 2 1 a 2 , 2 ... a 2 , B 0 ) and XOR the two data packets.
  • the two encoding packets aea? and (Oa ⁇ au ... aw ) ⁇ ( a 2 1 a 2 , 2 ...
  • a 2 , B 0 are independent of each other, and the data packet a ⁇ a 2 can be decoded.
  • the source node transmits (
  • the source node and the intermediate node in the network constitute a dynamic multi-source network coding algorithm that interacts with each other.
  • Table 1 gives the meaning of the symbol representation in this embodiment. Table 1. Symbolic meaning.
  • T is using the set of receiving nodes of the link v k v k+1 s (t receiving the path set of the source set session (S tj ) requested by the node tj
  • the action in the recursive phase is: If
  • , the same data packet is transmitted on
  • the intermediate node it can also be roughly divided into an initialization phase and a recursive phase, wherein the actions of the initialization phase are:
  • R(v k v k+1 ) kJ ⁇ - ⁇ In(v k )f] ( ⁇ ( ⁇ ))).
  • the action of the recursive phase of the intermediate node is:
  • the path to which the intermediate node v k belongs is an encoding path and v k has multiple input links
  • the data packet S q received by v k is notified to the encoding node of the encoding path, and the encoding node can S q is encoded without increasing the number of encoding paths because the data packet S q in the encoded packet can be solved at the intermediate node V k .
  • the source node Si transmits the same data packets in its path, which ensures that the receiving node can decode immediately.
  • (IR - Pi, j) different data packets are transmitted according to the number of coding paths Pi, j.
  • the number of paths of the session (s i tj) is equal to the number of encoded paths, even if the packets transmitted on all the paths are the same, the receiving node cannot decode, so only one number of encoding paths can be reduced, so that Making full use of the network resources can enable the receiving node to decode the encoded packet immediately, reducing the delay.
  • the session requested by the receiving node changes over time. For this embodiment, only the receiving node that has requested the change needs to enter the initialization phase.
  • the embodiment can enter the iterative phase.
  • the iterative phase is the best phase. Both PA and SRLC require a large number of iterations to enter the optimal phase, and even enter the optimal phase within a reasonable time.
  • the number of transmissions of the source data packet that is, the transmission rate, is adjusted according to the coding condition of the path in the network. So this embodiment is dynamically adaptive.
  • the coding algorithm is distributed in each intermediate node, which reduces the burden on the source node. It is a distributed multi-source network coding algorithm. The low complexity of the algorithm is mainly the space of the intermediate node. Computational ability in exchange for.
  • a GM NC general multi-source network coding
  • GM NC does not network encode all of the node's input data, but only performs network coding on the required data.
  • the GM NC uses an XOR encoding method, and the conventional XOR encoding may reduce the throughput.
  • An XOR encoding method proposed in this embodiment makes all XOR encoding packets linearly independent. In this embodiment, all the received packets received by the receiving node are solvable. Because if any receiving node receives an encoding packet +& 2 +...+& £ , it comes from g different source nodes.
  • the coding node will select g-1 paths as the coding path, such as the source SbSz, . . ⁇ path, the corresponding g-1 letters
  • any encoded packets it receives @ a 2 ten... ⁇ 3 ⁇ 4 are solvable.
  • each chromosome is composed of all coding vectors, so its consumption is at least ( . folk, ⁇ 1 ⁇ 1 ⁇ / .
  • the number of nodes in the network is INI, Among them are INI/8 source nodes, INI/8 receiving nodes, each node has 5 uplinks and 5 downlinks.
  • GMNC is superior to PA method in consumption performance.
  • each coded packet is encoded by at most h original packets, so the header of the SRLC is Hq bit.
  • the header size encoded by the hash packets is h.
  • g packets ( , & 2 , g ⁇ h) in order to obtain two linear independent coding packets, a bit '0' needs to be added to the original data packet.
  • FIG. 5 is a topological structure of a network in this embodiment.
  • the source S ⁇ PS 2 is multicast to the receiving nodes ⁇ and t 2 .
  • 1,
  • 2.
  • the link V1 V 2 belongs to two paths of different sessions, so it is necessary to perform a network coding operation on the link V1 V 2 .
  • the path s ⁇ v ⁇ is the encoding path
  • the other path s ⁇ v ⁇ is the non-encoding path.
  • FIG. 6 is another topology structure in this embodiment.
  • three source nodes S1 , s 2, and s 3 are multicast to t 2 and t 3 respectively , and multicast to ⁇ , t 2 , t 3 , unicast to ⁇ . That is, the source sets requested by the receiving nodes t l t 2 and t 3 are respectively S 2 ⁇ .
  • the capacity of the receiving node ⁇ to the source nodes S1 , s 2 , s 3 is 3, the capacity of the receiving node t 2 to the source nodes S1 , s 2 is 2, and the capacity of the receiving node t 3 to the source node s 2 is 2. . Therefore, in theory, the receiving nodes ⁇ , t 2 and t 3 can respectively receive the requested source data packets 3, 2, and 2 in the unit transmission time. According to the GMNC algorithm, first find the discrete path of the respective session,
  • the intermediate node can encode the received data packets and enable all receiving nodes to decode.
  • all source nodes send the same packet on their path, and the intermediate node selects the appropriate packet encoding.
  • the coded packet transmitted by the link ⁇ 3 ⁇ 4 is @ and the path Si V3V is selected for the receiving node ⁇ , t 2 , t 3 , respectively.
  • S 2 V 3 V 4 V 5 V 6 t 3 is the encoding path.
  • Other nodes also send the appropriate data packets.
  • Source Sl, s 2 and s 3 packet are represented by a, b and c indicated in FIG. 6 by a, b, c respectively represent the source node s l s 2 and s 3 packets of.
  • the tag information of the intermediate node is as shown in Table 2. Table 2. All tag information for intermediate nodes.
  • Table 3 gives a comparison of the throughput performance of the different coding strategies in Figure 6.
  • inter-session network coding is limited to special cases between two unicast sessions, so only data from source nodes Si and s 2 or s 2 and s 3 can be on link v 3 v 4
  • the package is encoded. If the link v 3 v 4 transmits the encoded packets of a and b, the receiving node can not receive the data packet of the source s 3 and can only receive the two data packets of the source S1 and s 2 , and the total throughput of the network.
  • the network coding algorithm in the session allocates a subtree for each source, and each source node transmits a corresponding data packet according to its own subtree, and the throughput of the network coding algorithm in the session is also 6.
  • the source node to the receiving unicast t 3 the source s 2 to the receiving node unicast t 2, the source s 3 ⁇ unicast to the receiving node.
  • GMNC algorithm may be such that each of three receiving node receives a data packet corresponding to the source, but can not satisfy the request PINC t 3 at the same time request satisfies ⁇ and 12, that is, such that they can not be three
  • the receiving nodes simultaneously receive a corresponding one of the requested source data packets. Therefore, compared to previous studies, the GMNC algorithm has great advantages in terms of total throughput and simultaneous requests for different receiving nodes.
  • an apparatus for implementing the foregoing encoding method is further provided.
  • the apparatus includes: a pre-processing unit 71, an initial stage data packet transmitting unit 72, an encoding path setting unit 73, and a data packet sending unit.
  • the pre-processing unit 71 is configured to perform pre-processing on the source node, the receiving node, and the intermediate node involved in the session for the plurality of sessions existing on the current network, so that the message involved in the session is
  • the source node obtains the path parameter of the current session, and causes the tail node of the multiple links involved in the session to obtain its link parameter
  • the initial stage data packet sending unit 72 is configured to request data from the source node at present. The same data packet is sent on all paths of a receiving node;
  • the encoding path setting unit 73 is configured to sequentially determine the number of data packets transmitted from different sessions on each link in the path, for example, if there is only one data packet, the session is set.
  • the path involved in the link is a non-encoded path; as the number of packets transmitted from different sessions on the link
  • the pre-processing unit 71 further includes a forward path search module 711, a reverse path search module 712, and an initial path setting module 713.
  • the forward path search module 711 is configured to send the message according to the receiving node. a data request by the source node, respectively searching for a data transmission path from the source node to the receiving node; and storing the found path set on the source node;
  • the reverse path searching module 712 is configured to obtain a path, in which the receiving node reversely routes to the source node, obtains multiple links included in each path, and stores the link parameters on a tail node of the link; the link parameter
  • the method includes: a source node involved, a receiving node, a number of paths, and a path number of the link; and an initial path setting module 713 is configured to set all paths to non-encoded paths at the beginning.
  • the encoding path setting unit 73 further includes a link receiving data packet determining module 731, a non-coding path setting module 732, an encoding path setting module 733, and a setting completion determining module 734; wherein the link receives the data packet
  • the determining module 731 is configured to determine whether the number of data packets
  • the non-coding path setting module 732 is used to determine whether the number of data packets received from the different source nodes and transmitted to the same receiving node is greater than 1;
  • the encoding path setting module 733 is configured to set the link.
  • -1 in the path from the different source node to the receiving node is the encoding path, and the remaining one is the non-encoding path, and the source node is notified; the setting completion determining module 734 is used for judging Whether all paths from the source node to the receiving node in the session are set.
  • each unit and module in the foregoing apparatus may be disposed on the same physical carrier, or may be disposed on different physical carriers.
  • the above-described encoding path setting unit is disposed on the intermediate node
  • the pre-processing unit is disposed on the source node.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

La présente invention concerne la construction d'un procédé de codage de réseau dynamique multi-source comprenant les étapes consistant à : prétraiter un nœud source, un nœud de réception et un nœud intermédiaire mis en jeu lors d'une session ; le nœud source envoyant des paquets de données identiques sur la totalité des trajets du nœud de réception qui demande à l'instant courant des données au nœud source ; déterminer séquentiellement le nombre de paquets de données provenant de sessions différentes et transmis sur chaque liaison des trajets, fixer un trajet de codage et indiquer le trajet de codage du nœud source associé ; le nœud source sélectionnant un ou plusieurs paquets de données en fonction des données reçues du trajet de codage et transmettant le paquet de données par l'intermédiaire de multiples trajets au nœud de réception ; et le nœud intermédiaire codant le paquet de données reçu. La présente invention concerne également un appareil destiné à mettre en œuvre le procédé. La mise en œuvre du procédé et de l'appareil de codage de réseau dynamique multi-source conformément à la présente invention offre les avantages suivants : la complexité du codage est moindre et le débit de données n'est pas réduit.
PCT/CN2012/081820 2012-09-24 2012-09-24 Procédé et appareil de codage de réseau dynamique multi-source WO2014043908A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
PCT/CN2012/081820 WO2014043908A1 (fr) 2012-09-24 2012-09-24 Procédé et appareil de codage de réseau dynamique multi-source
CN201280075605.6A CN104704760B (zh) 2012-09-24 2012-09-24 多信源动态网络编码的方法及装置

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2012/081820 WO2014043908A1 (fr) 2012-09-24 2012-09-24 Procédé et appareil de codage de réseau dynamique multi-source

Publications (1)

Publication Number Publication Date
WO2014043908A1 true WO2014043908A1 (fr) 2014-03-27

Family

ID=50340560

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2012/081820 WO2014043908A1 (fr) 2012-09-24 2012-09-24 Procédé et appareil de codage de réseau dynamique multi-source

Country Status (2)

Country Link
CN (1) CN104704760B (fr)
WO (1) WO2014043908A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105515728B (zh) * 2015-11-24 2018-07-31 湖北经济学院 一种基于滑动窗口的网络编码方法

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101695056A (zh) * 2009-10-09 2010-04-14 魏昕 水声通信网络中基于会话间网络编码的路由方法
CN102118228A (zh) * 2011-01-19 2011-07-06 中国科学技术大学 一种基于压缩前传的多源单中继协作方法
CN102148664A (zh) * 2011-04-21 2011-08-10 上海大学 应用于多源多汇网络的组播间网络编码控制方法

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2106073B1 (fr) * 2008-03-28 2010-08-11 NTT DoCoMo, Inc. Procédé et appareil pour augmenter le débit dans un réseau de communication
CN101917334B (zh) * 2010-08-03 2012-05-23 浙江大学 一种部分节点进行网络编码的传输网络生成方法

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101695056A (zh) * 2009-10-09 2010-04-14 魏昕 水声通信网络中基于会话间网络编码的路由方法
CN102118228A (zh) * 2011-01-19 2011-07-06 中国科学技术大学 一种基于压缩前传的多源单中继协作方法
CN102148664A (zh) * 2011-04-21 2011-08-10 上海大学 应用于多源多汇网络的组播间网络编码控制方法

Also Published As

Publication number Publication date
CN104704760A (zh) 2015-06-10
CN104704760B (zh) 2018-01-05

Similar Documents

Publication Publication Date Title
Zhu et al. Practical network coding technologies and softwarization in wireless networks
Lin et al. SlideOR: Online opportunistic network coding in wireless mesh networks
Krigslund et al. CORE: COPE with MORE in wireless meshed networks
Ge et al. A cross-layer design approach to multicast in wireless networks
Wei et al. Multiple tree video multicast over wireless ad hoc networks
KR102139721B1 (ko) 다중 경로 프로토콜에서 이중으로 네트워크 코딩을 적용하는 방법 및 그 장치
CN103428803B (zh) 一种联合机会网络编码的机会路由方法
Dong et al. Delay minimization for relay-based cooperative data exchange with network coding
Nguyen et al. Hybrid ARQ-random network coding for wireless media streaming
Han et al. Coding-aware multi-path routing in multi-hop wireless networks
Oh et al. Robust MANET routing using adaptive path redundancy and coding
WO2008151567A1 (fr) Procédé et dispositif pour améliorer un rendement de transmission à diffusion multiple basé sur un codage de réseau aléatoire
CN102148664B (zh) 应用于多源多汇网络的组播间网络编码控制方法
US7827243B2 (en) Method for transmitting file based on multiplex forwarder
CN105187326A (zh) 一种两跳无线网络拓扑结构中的网络编码侦听管理方法
Zeng et al. Dynamic segmented network coding for reliable data dissemination in delay tolerant networks
WO2014043908A1 (fr) Procédé et appareil de codage de réseau dynamique multi-source
JP5719049B2 (ja) 光リングにおいてマルチキャスト転送を行う方法及び装置
CN102970117A (zh) 一种适用于随机线性网络编码的端到端自由度反馈的方法
Zeng et al. Segmented network coding for stream-like applications in delay tolerant networks
Mehta et al. Survey on multimedia transmission using network coding over wireless networks
Xing et al. Device-aware routing and scheduling in multi-hop Device-to-Device networks
Chen et al. Performance of network coding in Ad hoc network multipath routing protocol
Nargesi et al. Efficient multicast tree construction in wireless mesh networks
Tan et al. PNCRM: a novel real-time multicast scheme in MANETs based on partial network coding

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 12884983

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 12884983

Country of ref document: EP

Kind code of ref document: A1