Linear network coding

From HandWiki
Short description: Computer Networking Program

In computer networking, linear network coding is a program in which intermediate nodes transmit data from source nodes to sink nodes by means of linear combinations.

Linear network coding may be used to improve a network's throughput, efficiency, and scalability, as well as reducing attacks and eavesdropping. The nodes of a network take several packets and combine for transmission. This process may be used to attain the maximum possible information flow in a network.

It has been proven that, theoretically, linear coding is enough to achieve the upper bound in multicast problems with one source.[1] However linear coding is not sufficient in general; even for more general versions of linearity such as convolutional coding and filter-bank coding.[2] Finding optimal coding solutions for general network problems with arbitrary demands is a hard problem, which can be NP-hard[3][4] and even undecidable.[5][6]

Encoding and decoding

In a linear network coding problem, a group of nodes [math]\displaystyle{ P }[/math] are involved in moving the data from [math]\displaystyle{ S }[/math] source nodes to [math]\displaystyle{ K }[/math] sink nodes. Each node generates new packets which are linear combinations of past received packets by multiplying them by coefficients chosen from a finite field, typically of size [math]\displaystyle{ GF(2^s) }[/math].

More formally, each node, [math]\displaystyle{ p_k }[/math] with indegree, [math]\displaystyle{ InDeg(p_k) = S }[/math], generates a message [math]\displaystyle{ X_k }[/math] from the linear combination of received messages [math]\displaystyle{ \{M_i\}_{i = 1}^S }[/math] by the formula:

[math]\displaystyle{ X_k = \sum_{i=1}^S g_k^i\cdot M_i }[/math]

Where the values [math]\displaystyle{ g_k^i }[/math] are coefficients selected from [math]\displaystyle{ GF(2^s) }[/math]. Since operations are computed in a finite field, the generated message is of the same length as the original messages. Each node forwards the computed value [math]\displaystyle{ X_k }[/math] along with the coefficients, [math]\displaystyle{ g_k^i }[/math], used in the [math]\displaystyle{ k^\text{th} }[/math] level, [math]\displaystyle{ g_k^i }[/math].

Sink nodes receive these network coded messages, and collect them in a matrix. The original messages can be recovered by performing Gaussian elimination on the matrix.[7] In reduced row echelon form, decoded packets correspond to the rows of the form [math]\displaystyle{ e_i=[0 ... 0 1 0 ... 0] }[/math]

Background

A network is represented by a directed graph [math]\displaystyle{ \mathcal{G}=(V, E, C) }[/math]. [math]\displaystyle{ V }[/math] is the set of nodes or vertices, [math]\displaystyle{ E }[/math] is the set of directed links (or edges), and [math]\displaystyle{ C }[/math] gives the capacity of each link of [math]\displaystyle{ E }[/math]. Let [math]\displaystyle{ T(s, t) }[/math] be the maximum possible throughput from node [math]\displaystyle{ s }[/math] to node [math]\displaystyle{ t }[/math]. By the max-flow min-cut theorem, [math]\displaystyle{ T(s, t) }[/math] is upper bounded by the minimum capacity of all cuts, which is the sum of the capacities of the edges on a cut, between these two nodes.

Karl Menger proved that there is always a set of edge-disjoint paths achieving the upper bound in a unicast scenario, known as the max-flow min-cut theorem. Later, the Ford–Fulkerson algorithm was proposed to find such paths in polynomial time. Then, Edmonds proved in the paper "Edge-Disjoint Branchings"[which?] the upper bound in the broadcast scenario is also achievable, and proposed a polynomial time algorithm.

However, the situation in the multicast scenario is more complicated, and in fact, such an upper bound can't be reached using traditional routing ideas. Ahlswede et al. proved that it can be achieved if additional computing tasks (incoming packets are combined into one or several outgoing packets) can be done in the intermediate nodes.[8]

The Butterfly Network

Butterfly Network.

The butterfly network[8] is often used to illustrate how linear network coding can outperform routing. Two source nodes (at the top of the picture) have information A and B that must be transmitted to the two destination nodes (at the bottom). Each destination node wants to know both A and B. Each edge can carry only a single value (we can think of an edge transmitting a bit in each time slot).

If only routing were allowed, then the central link would be only able to carry A or B, but not both. Supposing we send A through the center; then the left destination would receive A twice and not know B at all. Sending B poses a similar problem for the right destination. We say that routing is insufficient because no routing scheme can transmit both A and B to both destinations simultaneously. Meanwhile, it takes four time slots in total for both destination nodes to know A and B.

Using a simple code, as shown, A and B can be transmitted to both destinations simultaneously by sending the sum of the symbols through the two relay nodes – encoding A and B using the formula "A+B". The left destination receives A and A + B, and can calculate B by subtracting the two values. Similarly, the right destination will receive B and A + B, and will also be able to determine both A and B. Therefore, with network coding, it takes only three time slots and improves the throughput.

Random Linear Network Coding

Random linear network coding[9] (RLNC) is a simple yet powerful encoding scheme, which in broadcast transmission schemes allows close to optimal throughput using a decentralized algorithm. Nodes transmit random linear combinations of the packets they receive, with coefficients chosen randomly, with a uniform distribution from a Galois field. If the field size is sufficiently large, the probability that the receiver(s) will obtain linearly independent combinations (and therefore obtain innovative information) approaches 1. It should however be noted that, although random linear network coding has excellent throughput performance, if a receiver obtains an insufficient number of packets, it is extremely unlikely that they can recover any of the original packets. This can be addressed by sending additional random linear combinations until the receiver obtains the appropriate number of packets.

Operation and key parameters

There are three key parameters in RLNC. The first one is the generation size. In RLNC, the original data transmitted over the network is divided into packets. The source and intermediate nodes in the network can combine and recombine the set of original and coded packets. The original [math]\displaystyle{ M }[/math] packets form a block, usually called a generation. The number of original packets combined and recombined together is the generation size. The second parameter is the packet size. Usually, the size of the original packets is fixed. In the case of unequally-sized packets, these can be zero-padded if they are shorter or split into multiple packets if they are longer. In practice, the packet size can be the size of the maximum transmission unit (MTU) of the underlying network protocol. For example, it can be around 1500 bytes in an Ethernet frame. The third key parameter is the Galois field used. In practice, the most commonly used Galois fields are binary extension fields. And the most commonly used sizes for the Galois fields are the binary field [math]\displaystyle{ GF(2) }[/math] and the so-called binary-8 ([math]\displaystyle{ GF(2^8) }[/math]). In the binary field, each element is one bit long, while in the binary-8, it is one byte long. Since the packet size is usually larger than the field size, each packet is seen as a set of elements from the Galois field (usually referred to as symbols) appended together. The packets have a fixed amount of symbols (Galois field elements), and since all the operations are performed over Galois fields, then the size of the packets does not change with subsequent linear combinations.

The sources and the intermediate nodes can combine any subset of the original and previously coded packets performing linear operations. To form a coded packet in RLNC, the original and previously coded packets are multiplied by randomly chosen coefficients and added together. Since each packet is just an appended set of Galois field elements, the operations of multiplication and addition are performed symbol-wise over each of the individual symbols of the packets, as shown in the picture from the example.

To preserve the statelessness of the code, the coding coefficients used to generate the coded packets are appended to the packets transmitted over the network. Therefore, each node in the network can see what coefficients were used to generate each coded packet. One novelty of linear network coding over traditional block codes is that it allows the recombination of previously coded packets into new and valid coded packets. This process is usually called recoding. After a recoding operation, the size of the appended coding coefficients does not change. Since all the operations are linear, the state of the recoded packet can be preserved by applying the same operations of addition and multiplication to the payload and the appended coding coefficients. In the following example, we will illustrate this process.

Any destination node must collect enough linearly independent coded packets to be able to reconstruct the original data. Each coded packet can be understood as a linear equation where the coefficients are known since they are appended to the packet. In these equations, each of the original [math]\displaystyle{ M }[/math] packets is the unknown. To solve the linear system of equations, the destination needs at least [math]\displaystyle{ M }[/math] linearly independent equations (packets).

Example

Coding and recoding process in linear network coding. Each packet is seen as a set of elements from a Galois field. Therefore, multiplying and adding two packets means multiplying each of its symbols by a coding coefficient chosen from the Galois field and then adding the two packets together, symbol-wise.

In the figure, we can see an example of two packets linearly combined into a new coded packet. In the example, we have two packets, namely packet [math]\displaystyle{ f }[/math] and packet [math]\displaystyle{ e }[/math]. The generation size of our example is two. We know this because each packet has two coding coefficients ([math]\displaystyle{ C_{ij} }[/math]) appended. The appended coefficients can take any value from the Galois field. However, an original, uncoded data packet would have appended the coding coefficients [math]\displaystyle{ [0,1] }[/math] or [math]\displaystyle{ [1,0] }[/math], which means that they are constructed by a linear combination of zero times one of the packets plus one time the other packet. Any coded packet would have appended other coefficients. In our example, packet [math]\displaystyle{ f }[/math] for instance has appended the coefficients [math]\displaystyle{ [C_{11},C_{12}] }[/math]. Since network coding can be applied at any layter of the communication protocol, these packets can have a header from the other layers, which is ignored in the network coding operations.

Now, lets assume that the network node wants to produce a new coded packet combining packet [math]\displaystyle{ f }[/math] and packet [math]\displaystyle{ e }[/math]. In RLNC, it will randomly choose two coding coefficients, [math]\displaystyle{ d_1 }[/math] and [math]\displaystyle{ d_2 }[/math] in the example. The node will multiply each symbol of packet [math]\displaystyle{ f }[/math] by [math]\displaystyle{ d_1 }[/math], and each symbol of packet [math]\displaystyle{ e }[/math] by [math]\displaystyle{ d_2 }[/math]. Then, it will add the results symbol-wise to produce the new coded data. It will perform the same operations of multiplication and addition to the coding coefficients of the coded packets.

Misconceptions

Linear network coding is still a relatively new subject. However, the topic has been vastly researched over the last twenty years. Nevertheless, there are still some misconceptions that are no longer valid:

Decoding computational complexity: Network coding decoders have been improved over the years. Nowadays, the algorithms are highly efficient and parallelizable. In 2016, with Intel Core i5 processors with SIMD instructions enabled, the decoding goodput of network coding was 750 MB/s for a generation size of 16 packets and 250 MB/s for a generation size of 64 packets.[10] Furthermore, today's algorithms can be vastly parallelizable, increasing the encoding and decoding goodput even further.[11]

Transmission Overhead: It is usually thought that the transmission overhead of network coding is high due to the need to append the coding coefficients to each coded packet. In reality, this overhead is negligible in most applications. The overhead due to coding coefficients can be computed as follows. Each packet has appended [math]\displaystyle{ M }[/math] coding coefficients. The size of each coefficient is the number of bits needed to represent one element of the Galois field. In practice, most network coding applications use a generation size of no more than 32 packets per generation and Galois fields of 256 elements (binary-8). With these numbers, each packet needs [math]\displaystyle{ M * log_2(s) = 32 }[/math] bytes of appended overhead. If each packet is 1500 bytes long (i.e. the Ethernet MTU), then 32 bytes represent an overhead of only 2%.

Expected linearly dependent packets at different stages of transmission for a Galois field [math]\displaystyle{ GF(2) }[/math] and a generation size of 16 packets. At the beginning of the transmission, the linear dependencies are minimal. It is the last packet of the transmission that is more likely to be linearly dependent.
The expected number of linearly dependent packets per generation is practically independent of the generation size.

Overhead due to linear dependencies: Since the coding coefficients are chosen randomly in RLNC, there is a chance that some transmitted coded packets are not beneficial to the destination because they are formed using a linearly dependent combination of packets. However, this overhead is negligible in most applications. The linear dependencies depend on the Galois fields' size and are practically independent of the generation size used. We can illustrate this with the following example. Let us assume we are using a Galois field of [math]\displaystyle{ q }[/math] elements and a generation size of [math]\displaystyle{ M }[/math] packets. If the destination has not received any coded packet, we say it has [math]\displaystyle{ M }[/math] degrees of freedom, and then almost any coded packet will be useful and innovative. In fact, only the zero-packet (only zeroes in the coding coefficients) will be non-innovative. The probability of generating the zero-packet is equal to the probability of each of the [math]\displaystyle{ M }[/math] coding coefficient to be equal to the zero-element of the Galois field. I.e., the probability of a non-innovative packet is of [math]\displaystyle{ \frac{1}{q^M} }[/math]. With each successive innovative transmission, it can be shown that the exponent of the probability of a non innovative packet is reduced by one. When the destination has received [math]\displaystyle{ M-1 }[/math] innovative packets (i.e., it needs only one more packet to fully decode the data). Then the probability of a non innovative packet is of [math]\displaystyle{ \frac{1}{q} }[/math]. We can use this knowledge to calculate the expected number of linearly dependent packets per generation. In the worst-case scenario, when the Galois field used contains only two elements ([math]\displaystyle{ q=2 }[/math]), the expected number of linearly dependent packets per generation is of 1.6 extra packets. If our generation size if of 32 or 64 packets, this represents an overhead of 5% or 2.5%, respectively. If we use the binary-8 field ([math]\displaystyle{ q=256 }[/math]), then the expected number of linearly dependent packets per generation is practically zero. Since it is the last packets the major contributor to the overhead due to linear dependencies, there are RLNC-based protocols such as tunable sparse network coding[12] that exploit this knowledge. These protocols introduce sparsity (zero-elements) in the coding coefficients at the beginning of the transmission to reduce the decoding complexity, and reduce the sparsity at the end of the transmission to reduce the overhead due to linear dependencies.

Applications

Over the years, multiple researchers and companies have integrated network coding solutions into their applications.[13] We can list some of the applications of network coding in different areas:

  • VoIP:[14] The performance of streaming services such as VoIP over wireless mesh networks can be improved with network coding by reducing the network delay and jitter.[citation needed]
  • Video[15] and audio[16] streaming and conferencing:[17][18] The performance of MPEG-4 traffic in terms of delay, packet loss, and jitter over wireless networks prone to packet erasures can be improved with RLNC.[15] In the case of audio streaming over wireless mesh networks, the packet delivery ratio, latency, and jitter performance of the network can be significantly increased when using RLNC instead of packet forwarding-based protocols such as simplified multicast forwarding and partial dominant pruning.[16] The performance improvements of network coding for video conferencing are not only theoretical. In 2016, the authors of [17] built a real-world testbed of 15 wireless Android devices to evaluate the feasibility of network-coding-based video conference systems. Their results showed large improvements in packet delivery ratio and overall user experience, especially over poor quality links compared to multicasting technologies based on packet forwarding.
  • Software-defined wide area networks (SD-WAN):[19][20][21][22] Large industrial IoT wireless networks can benefit from network coding. Researchers showed[19] that network coding and its channel bundling capabilities improved the performance of SD-WANs with a large number of nodes with multiple cellular connections. Nowadays, companies such as Barracuda are employing RLNC-based solutions due to their advantages in low latency, small footprint on computing devices, and low overhead.[21][22]
  • Channel bundling:[23] Due to the statelessness characteristics of RLNC, it can be used to efficiently perform channel bundling, i.e., the transmission of information through multiple network interfaces.[23] Since the coded packets are randomly generated, and the state of the code traverses the network together with the coded packets, a source can achieve bundling without much planning just by sending coded packets through all its network interfaces. The destination can decode the information once enough coded packets arrive, irrespectively of the network interface. A video demonstrating the channel bundling capabilities of RLNC is available at.[24]
  • 5G private networks:[25][26] RLNC can be integrated into the 5G NR standard to improve the performance of video delivery over 5G systems.[25] In 2018, a demo presented at the Consumer Electronics Show demonstrated a practical deployment of RLNC with NFV and SDN technologies to improve video quality against packet loss due to congestion at the core network.[26]
  • Remote collaboration.[27]
  • Augmented reality remote support and training.[28]
  • Remote vehicle driving applications.[29][30][31][32]
  • Connected cars networks.[33][34]
  • Gaming applications such as low latency streaming and multiplayer connectivity.[35][36][37][38]
  • Healthcare applications.[39][40][41]
  • Industry 4.0.[42][43][44]
  • Satellite networks.[45]
  • Agricultural sensor fields.[46][47][48]
  • In-flight enterteinment networks.[49]
  • Major security and firmware updates for mobile product families.[50][51]
  • Smart city infrastructure.[52][53]
  • Information-centric networking and named data networking.:[54] Linear network coding can improve the network efficiency of information-centric networking solutions by exploiting the multi-source multi-cast nature of such systems.[54] It has been shown, that RLNC can be integrated into distributed content delivery networks such as IPFS to increase data availability while reducing storage resources.[55]
  • Alternative to forward error correction and automatic repeat requests in traditional and wireless networks with packet loss, such as Coded TCP[56] and Multi-user ARQ[57]
  • Protection against network attacks such as snooping, eavesdropping, replay, or data corruption.[58][59]
  • Digital file distribution and P2P file sharing, e.g. Avalanche filesystem from Microsoft
  • Distributed storage[54][60][61]
  • Throughput increase in wireless mesh networks, e.g.: COPE,[62] CORE,[63] Coding-aware routing,[64] and B.A.T.M.A.N.[65]
  • Buffer and delay reduction in spatial sensor networks: Spatial buffer multiplexing[66]
  • Wireless broadcast:[67] RLNC can reduce the number of packet transmission for a single-hop wireless multicast network, and hence improve network bandwidth[67]
  • Distributed file sharing[68]
  • Low-complexity video streaming to mobile device[69]
  • Device-to-device extensions[70][71][72][73][74]

See also

References

  1. ↑ S. Li, R. Yeung, and N. Cai, "Linear Network Coding"(PDF), in IEEE Transactions on Information Theory, Vol 49, No. 2, pp. 371–381, 2003
  2. ↑ R. Dougherty, C. Freiling, and K. Zeger, "Insufficiency of Linear Coding in Network Information Flow" (PDF), in IEEE Transactions on Information Theory, Vol. 51, No. 8, pp. 2745-2759, August 2005 ( erratum)
  3. ↑ Rasala Lehman, A.; Lehman, E. (2004). "Complexity classification of network information flow problems". 15th ACM-SIAM SODA. pp. 142–150. 
  4. ↑ Langberg, M.; Sprintson, A.; Bruck, J. (2006). "The encoding complexity of network coding". IEEE Transactions on Information Theory 52 (6): 2386–2397. doi:10.1109/TIT.2006.874434. https://resolver.caltech.edu/CaltechAUTHORS:LANieeetit06. 
  5. ↑ Li, C. T. (2023). "Undecidability of Network Coding, Conditional Information Inequalities, and Conditional Independence Implication". IEEE Transactions on Information Theory 69 (6): 1. doi:10.1109/TIT.2023.3247570. 
  6. ↑ Kühne, L.; Yashfe, G. (2022). "Representability of Matroids by c-Arrangements is Undecidable". Israel Journal of Mathematics 252: 95–147. doi:10.1007/s11856-022-2345-z. 
  7. ↑ Chou, Philip A.; Wu, Yunnan; Jain, Kamal (October 2003), "Practical network coding", Allerton Conference on Communication, Control, and Computing, "Any receiver can then recover the source vectors using Gaussian elimination on the vectors in its h (or more) received packets" .
  8. ↑ 8.0 8.1 Ahlswede, Rudolf; N. Cai; S.-Y. R. Li; R. W. Yeung (2000). "Network Information Flow". IEEE Transactions on Information Theory 46 (4): 1204–1216. doi:10.1109/18.850663. 
  9. ↑ T. Ho, R. Koetter, M. Médard, D. R. Karger and M. Effros, "The Benefits of Coding over Routing in a Randomized Setting" in 2003 IEEE International Symposium on Information Theory. doi:10.1109/ISIT.2003.1228459
  10. ↑ Sørensen, Chres W.; Paramanathan, Achuthan; Cabrera, Juan A.; Pedersen, Morten V.; Lucani, Daniel E.; Fitzek, Frank H.P. (April 2016). "Leaner and meaner: Network coding in SIMD enabled commercial devices". 2016 IEEE Wireless Communications and Networking Conference. pp. 1–6. doi:10.1109/WCNC.2016.7565066. ISBN 978-1-4673-9814-5. https://www.researchgate.net/publication/314198052. 
  11. ↑ Wunderlich, Simon; Cabrera, Juan A.; Fitzek, Frank H. P.; Reisslein, Martin (August 2017). "Network Coding in Heterogeneous Multicore IoT Nodes With DAG Scheduling of Parallel Matrix Block Operations". IEEE Internet of Things Journal 4 (4): 917–933. doi:10.1109/JIOT.2017.2703813. ISSN 2327-4662. https://faculty.engineering.asu.edu/mre/wp-content/uploads/sites/31/2020/04/NCMC.pdf. 
  12. ↑ Feizi, Soheil; Lucani, Daniel E.; Sørensen, Chres W.; Makhdoumi, Ali; Médard, Muriel (June 2014). "Tunable sparse network coding for multicast networks". 2014 International Symposium on Network Coding (NetCod). pp. 1–6. doi:10.1109/NETCOD.2014.6892129. ISBN 978-1-4799-6217-4. https://ieeexplore.ieee.org/document/6892129. 
  13. ↑ "Coding the Network: Next Generation Coding for Flexible Network Operation | IEEE Communications Society". https://www.comsoc.org/publications/ctn/coding-network-next-generation-coding-flexible-network-operation. 
  14. ↑ Lopetegui, I.; Carrasco, R.A.; Boussakta, S. (July 2010). "VoIP design and implementation with network coding schemes for wireless networks". 2010 7th International Symposium on Communication Systems, Networks & Digital Signal Processing (CSNDSP 2010). Newcastle upon Tyne: IEEE. pp. 857–861. doi:10.1109/CSNDSP16145.2010.5580304. ISBN 978-1-4244-8858-2. https://ieeexplore.ieee.org/document/5580304. 
  15. ↑ 15.0 15.1 Shrimali, R.; Narmawala, Z. (December 2012). "A survey on MPEG-4 streaming using network coding in wireless networks". 2012 Nirma University International Conference on Engineering (NUiCONE). pp. 1–5. doi:10.1109/NUICONE.2012.6493203. ISBN 978-1-4673-1719-1. https://ieeexplore.ieee.org/document/6493203. 
  16. ↑ 16.0 16.1 Saeed, Basil; Lung, Chung-Horng; Kunz, Thomas; Srinivasan, Anand (October 2011). "Audio streaming for ad hoc wireless mesh networks using network coding". 2011 IFIP Wireless Days (WD). pp. 1–5. doi:10.1109/WD.2011.6098167. ISBN 978-1-4577-2028-4. https://ieeexplore.ieee.org/document/6098167. 
  17. ↑ 17.0 17.1 Wang, Lei; Yang, Zhen; Xu, Lijie; Yang, Yuwang (July 2016). "NCVCS: Network-coding-based video conference system for mobile devices in multicast networks" (in en). Ad Hoc Networks 45: 13–21. doi:10.1016/j.adhoc.2016.03.002. https://linkinghub.elsevier.com/retrieve/pii/S1570870516300713. 
  18. ↑ Wang, Hui; Chang, Ronald Y.; Kuo, C.-C. Jay (June 2009). "Wireless Multi-party video conferencing with network coding". 2009 IEEE International Conference on Multimedia and Expo. pp. 1492–1495. doi:10.1109/ICME.2009.5202786. ISBN 978-1-4244-4290-4. https://ieeexplore.ieee.org/document/5202786. 
  19. ↑ 19.0 19.1 Rachuri, Sri Pramodh; Ansari, Ahtisham Ali; Tandur, Deepaknath; Kherani, Arzad A.; Chouksey, Sameer (December 2019). "Network-Coded SD-WAN in Multi-Access Systems for Delay Control". 2019 International Conference on contemporary Computing and Informatics (IC3I). Singapore, Singapore: IEEE. pp. 32–37. doi:10.1109/IC3I46837.2019.9055565. ISBN 978-1-7281-5529-6. https://ieeexplore.ieee.org/document/9055565. 
  20. ↑ Ansari, Ahtisham Ali; Rachuri, Sri Pramodh; Kherani, Arzad A.; Tandur, Deepaknath (December 2019). "An SD-WAN Controller for Delay Jitter Minimization in Coded Multi-access Systems". 2019 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS). pp. 1–6. doi:10.1109/ANTS47819.2019.9117981. ISBN 978-1-7281-3715-5. https://ieeexplore.ieee.org/document/9117981. 
  21. ↑ 21.0 21.1 "Steinwurf's next-gen FECs aren't a choice for SD-WAN, they're an imperative." (in en). https://www.linkedin.com/pulse/steinwurfs-next-gen-fecs-arent-choice-sd-wan-theyre-videb%C3%A6k-pedersen. 
  22. ↑ 22.0 22.1 "Barracuda Networks optimizes SD-WAN traffic with patented erasure correction technology from Steinwurf" (in en-GB). https://www.steinwurf.com/blog/barracuda-networks. 
  23. ↑ 23.0 23.1 Pedersen, Morten V.; Lucani, Daniel E.; Fitzek, Frank H. P.; Sorensen, Chres W.; Badr, Arash S. (September 2013). "Network coding designs suited for the real world: What works, what doesn't, what's promising". 2013 IEEE Information Theory Workshop (ITW). Sevilla: IEEE. pp. 1–5. doi:10.1109/ITW.2013.6691231. ISBN 978-1-4799-1321-3. https://ieeexplore.ieee.org/document/6691231. 
  24. ↑ (in en) Channel Bundling Using Random Linear Network Coding, https://www.youtube.com/watch?v=mTBRdU8Rc-0, retrieved 2022-06-06 
  25. ↑ 25.0 25.1 Vukobratovic, Dejan; Tassi, Andrea; Delic, Savo; Khirallah, Chadi (April 2018). "Random Linear Network Coding for 5G Mobile Video Delivery" (in en). Information 9 (4): 72. doi:10.3390/info9040072. ISSN 2078-2489. 
  26. ↑ 26.0 26.1 Gabriel, Frank; Nguyen, Giang T.; Schmoll, Robert-Steve; Cabrera, Juan A.; Muehleisen, Maciej; Fitzek, Frank H.P. (January 2018). "Practical deployment of network coding for real-time applications in 5G networks". 2018 15th IEEE Annual Consumer Communications & Networking Conference (CCNC). Las Vegas, NV: IEEE. pp. 1–2. doi:10.1109/CCNC.2018.8319320. ISBN 978-1-5386-4790-5. https://ieeexplore.ieee.org/document/8319320. 
  27. ↑ Magli, Enrico; Wang, Mea; Frossard, Pascal; Markopoulou, Athina (August 2013). "Network Coding Meets Multimedia: A Review". IEEE Transactions on Multimedia 15 (5): 1195–1212. doi:10.1109/TMM.2013.2241415. ISSN 1520-9210. https://ieeexplore.ieee.org/document/6416071. 
  28. ↑ Torres Vega, Maria; Liaskos, Christos; Abadal, Sergi; Papapetrou, Evangelos; Jain, Akshay; Mouhouche, Belkacem; Kalem, Gökhan; Ergüt, Salih et al. (October 2020). "Immersive Interconnected Virtual and Augmented Reality: A 5G and IoT Perspective" (in en). Journal of Network and Systems Management 28 (4): 796–826. doi:10.1007/s10922-020-09545-w. ISSN 1064-7570. https://link.springer.com/10.1007/s10922-020-09545-w. 
  29. ↑ De Jonckere, Olivier; Chorin, Jean; Feldmann, Marius (September 2017). "Simulation Environment for Network Coding Research in Ring Road Networks". 2017 6th International Conference on Space Mission Challenges for Information Technology (SMC-IT). Alcala de Henares: IEEE. pp. 128–131. doi:10.1109/SMC-IT.2017.29. ISBN 978-1-5386-3462-2. https://ieeexplore.ieee.org/document/8227552. 
  30. ↑ Jamil, Farhan; Javaid, Anam; Umer, Tariq; Rehmani, Mubashir Husain (November 2017). "A comprehensive survey of network coding in vehicular ad-hoc networks" (in en). Wireless Networks 23 (8): 2395–2414. doi:10.1007/s11276-016-1294-z. ISSN 1022-0038. http://link.springer.com/10.1007/s11276-016-1294-z. 
  31. ↑ Park, Joon-Sang; Lee, Uichin; Gerla, Mario (May 2010). "Vehicular communications: emergency video streams and network coding" (in en). Journal of Internet Services and Applications 1 (1): 57–68. doi:10.1007/s13174-010-0006-7. ISSN 1867-4828. 
  32. ↑ Noor-A-Rahim, Md; Liu, Zilong; Lee, Haeyoung; Khyam, M. Omar; He, Jianhua; Pesch, Dirk; Moessner, Klaus; Saad, Walid; Poor, H. Vincent (2022-05-01). "6G for Vehicle-to-Everything (V2X) Communications: Enabling Technologies, Challenges, and Opportunities". arXiv:2012.07753 [cs.IT].
  33. ↑ Achour, Imen; Bejaoui, Tarek; Busson, Anthony; Tabbane, Sami (October 2017). "Network Coding scheme behavior in a Vehicle-to-Vehicle safety message dissemination". 2017 IEEE International Conference on Communications Workshops (ICC Workshops). Paris, France: IEEE. pp. 441–446. doi:10.1109/ICCW.2017.7962697. ISBN 978-1-5090-1525-2. https://ieeexplore.ieee.org/document/7962697. 
  34. ↑ Wang, Shujuan; Lu, Shuguang; Zhang, Qian (April 2019). "Instantly decodable network coding–assisted data dissemination for prioritized services in vehicular ad hoc networks" (in en). International Journal of Distributed Sensor Networks 15 (4): 155014771984213. doi:10.1177/1550147719842137. ISSN 1550-1477. 
  35. ↑ Dammak, Marwa; Andriyanova, Iryna; Boujelben, Yassine; Sellami, Noura (2018-03-29). "Routing and Network Coding over a Cyclic Network for Online Video Gaming". arXiv:1803.11102 [cs.IT].
  36. ↑ Lajtha, Balázs; Biczók, Gergely; Szabó, Róbert (2010). "Enabling P2P Gaming with Network Coding". in Aagesen, Finn Arve; Knapskog, Svein Johan (in en). Networked Services and Applications - Engineering, Control and Management. Lecture Notes in Computer Science. 6164. Berlin, Heidelberg: Springer. pp. 76–86. doi:10.1007/978-3-642-13971-0_8. ISBN 978-3-642-13971-0. 
  37. ↑ Dammak, Marwa (2018-11-20). Network coding application for online games platformes (phdthesis thesis). Université de Cergy Pontoise ; École nationale d'ingénieurs de Sfax (Tunisie).
  38. ↑ Lajtha, Balázs; Biczók, Gergely; Szabó, Róbert (2010), Aagesen, Finn Arve; Knapskog, Svein Johan, eds., "Enabling P2P Gaming with Network Coding", Networked Services and Applications - Engineering, Control and Management, Lecture Notes in Computer Science (Berlin, Heidelberg: Springer Berlin Heidelberg) 6164: pp. 76–86, doi:10.1007/978-3-642-13971-0_8, ISBN 978-3-642-13970-3 
  39. ↑ Ilyas, Mohammad; Alwakeel, Sami S.; Alwakeel, Mohammed M.; Aggoune, el-Hadi M. (2014). "Exploiting Network Coding for Smart Healthcare". Sensor networks for sustainable development. Boca Raton, FL. doi:10.1201/b17124-13. ISBN 978-1-4665-8207-1. OCLC 881429695. https://www.taylorfrancis.com/chapters/edit/10.1201/b17124-13/exploiting-network-coding-smart-healthcare-elli-kartsakli-angelos-antonopoulos-christos-verikoukis. 
  40. ↑ Kartsakli, Elli; Antonopoulos, Angelos; Alonso, Luis; Verikoukis, Christos (2014-03-10). "A Cloud-Assisted Random Linear Network Coding Medium Access Control Protocol for Healthcare Applications" (in en). Sensors 14 (3): 4806–4830. doi:10.3390/s140304806. ISSN 1424-8220. PMID 24618727. Bibcode: 2014Senso..14.4806K. 
  41. ↑ Taparugssanagorn, Attaphongse; Ono, Fumie; Kohno, Ryuji (September 2010). "Network coding for non-invasive Wireless Body Area Networks". 2010 IEEE 21st International Symposium on Personal, Indoor and Mobile Radio Communications Workshops. pp. 134–138. doi:10.1109/PIMRCW.2010.5670413. ISBN 978-1-4244-9117-9. https://ieeexplore.ieee.org/document/5670413. 
  42. ↑ Peralta, Goiuri; Iglesias-Urkia, Markel; Barcelo, Marc; Gomez, Raul; Moran, Adrian; Bilbao, Josu (May 2017). "Fog computing based efficient IoT scheme for the Industry 4.0". 2017 IEEE International Workshop of Electronics, Control, Measurement, Signals and their Application to Mechatronics (ECMSM). Donostia, San Sebastian, Spain: IEEE. pp. 1–6. doi:10.1109/ECMSM.2017.7945879. ISBN 978-1-5090-5582-1. https://ieeexplore.ieee.org/document/7945879. 
  43. ↑ Peralta, Goiuri; Garrido, Pablo; Bilbao, Josu; Agüero, Ramón; Crespo, Pedro (2019-04-08). "On the Combination of Multi-Cloud and Network Coding for Cost-Efficient Storage in Industrial Applications" (in en). Sensors 19 (7): 1673. doi:10.3390/s19071673. ISSN 1424-8220. PMID 30965629. Bibcode: 2019Senso..19.1673P. 
  44. ↑ Zverev, Mihail; Agüero, Ramón; Garrido, Pablo; Bilbao, Josu (2019-10-22). "Network Coding for IIoT Multi-Cloud Environments". Proceedings of the 9th International Conference on the Internet of Things. IoT 2019. New York, NY, USA: Association for Computing Machinery. pp. 1–4. doi:10.1145/3365871.3365903. ISBN 978-1-4503-7207-7. https://doi.org/10.1145/3365871.3365903. 
  45. ↑ "DLR - Institute of Communications and Navigation - NEXT - Network Coding Satellite Experiment". https://www.dlr.de/kn/en/desktopdefault.aspx/tabid-12748/22264_read-26607/. 
  46. ↑ Hsu, Hsiao-Tzu; Wang, Tzu-Ming; Kuo, Yuan-Cheng (2018-11-05). "Implementation of Agricultural Monitoring System Based on the Internet of Things". Proceedings of the 2018 2nd International Conference on Education and E-Learning. ICEEL 2018. New York, NY, USA: Association for Computing Machinery. pp. 212–216. doi:10.1145/3291078.3291098. ISBN 978-1-4503-6577-2. https://doi.org/10.1145/3291078.3291098. 
  47. ↑ Syed, Abid Husain; Ali, Syed Zakir (2021-08-11). Towards Transforming Agriculture for Challenges of 21st Century by Optimizing Resources Using IOT, Fuzzy Logic and Network Coding. doi:10.20944/preprints202108.0262.v1. https://www.preprints.org/manuscript/202108.0262/v1. 
  48. ↑ Camilli, Alberto; Cugnasca, Carlos E.; Saraiva, Antonio M.; Hirakawa, André R.; Corrêa, Pedro L. P. (2007-08-01). "From wireless sensors to field mapping: Anatomy of an application for precision agriculture" (in en). Computers and Electronics in Agriculture. Precision Agriculture in Latin America 58 (1): 25–36. doi:10.1016/j.compag.2007.01.019. ISSN 0168-1699. https://www.sciencedirect.com/science/article/pii/S0168169907000610. 
  49. ↑ , Wladyslaw Jan & Tracy Raymond Trent"Systems and methods for prioritizing wireless communication of aircraft" patent US8401021B2, issued 2013-03-19
  50. ↑ Tonyali, Samet; Akkaya, Kemal; Saputro, Nico; Cheng, Xiuzhen (July 2017). "An Attribute & Network Coding-Based Secure Multicast Protocol for Firmware Updates in Smart Grid AMI Networks". 2017 26th International Conference on Computer Communication and Networks (ICCCN). Vancouver, BC, Canada: IEEE. pp. 1–9. doi:10.1109/ICCCN.2017.8038415. ISBN 978-1-5090-2991-4. https://ieeexplore.ieee.org/document/8038415. 
  51. ↑ Jalil, Syed Qaisar; Chalup, Stephan; Rehmani, Mubashir Husain (2019). "A Smart Meter Firmware Update Strategy Through Network Coding for AMI Network". in Pathan, Al-Sakib Khan; Fadlullah, Zubair Md.; Guerroumi, Mohamed (in en). Smart Grid and Internet of Things. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering. 256. Cham: Springer International Publishing. pp. 68–77. doi:10.1007/978-3-030-05928-6_7. ISBN 978-3-030-05928-6. https://link.springer.com/chapter/10.1007/978-3-030-05928-6_7. 
  52. ↑ Kumar, Vaibhav; Cardiff, Barry; Flanagan, Mark F. (October 2017). "Physical-layer network coding with multiple antennas: An enabling technology for smart cities". 2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC). Montreal, QC: IEEE. pp. 1–6. doi:10.1109/PIMRC.2017.8292785. ISBN 978-1-5386-3529-2. https://ieeexplore.ieee.org/document/8292785. 
  53. ↑ Darif, Anouar; Chaibi, Hasna; Saadane, Rachid (2020), Ben Ahmed, Mohamed; Boudhir, Anouar Abdelhakim; Santos, Domingos et al., eds., "Network Coding for Energy Optimization of SWIMAC in Smart Cities Using WSN Based on IR-UWB" (in en), Innovations in Smart Cities Applications Edition 3, Lecture Notes in Intelligent Transportation and Infrastructure (Cham: Springer International Publishing): pp. 663–674, doi:10.1007/978-3-030-37629-1_48, ISBN 978-3-030-37628-4, http://link.springer.com/10.1007/978-3-030-37629-1_48, retrieved 2022-06-06 
  54. ↑ 54.0 54.1 54.2 Bilal, Muhammad (2019). "Network-Coding Approach for Information-Centric Networking". IEEE Systems Journal 13 (2): 1376–1385. doi:10.1109/JSYST.2018.2862913. Bibcode: 2019ISysJ..13.1376B. 
  55. ↑ Zimmermann, Sandra; Rischke, Justus; Cabrera, Juan A.; Fitzek, Frank H. P. (December 2020). "Journey to MARS: Interplanetary Coding for relieving CDNS". GLOBECOM 2020 - 2020 IEEE Global Communications Conference. Taipei, Taiwan: IEEE. pp. 1–6. doi:10.1109/GLOBECOM42002.2020.9322478. ISBN 978-1-7281-8298-8. https://ieeexplore.ieee.org/document/9322478. 
  56. ↑ Kim, Minji (2012). "Network Coded TCP (CTCP)". arXiv:1212.2291 [cs.NI].
  57. ↑ Larsson, P.; Johansson, N. (2006). "Multi-User ARQ". 2006 IEEE 63rd Vehicular Technology Conference. 4. Melbourne, Australia: IEEE. pp. 2052–2057. doi:10.1109/VETECS.2006.1683207. ISBN 0-7803-9392-9. https://ieeexplore.ieee.org/document/1683207. 
  58. ↑ "Welcome to Network Coding Security - Secure Network Coding". http://securenetworkcoding.wikidot.com/. 
  59. ↑ http://home.eng.iastate.edu/~yuzhen/publications/ZhenYu_INFOCOM_2008.pdf[yes|permanent dead link|dead link}}][|permanent dead link|dead link}}]
  60. ↑ Acedański, Szymon; Deb, Supratim; Médard, Muriel; Koetter, Ralf. "How Good is Random Linear Coding Based Distributed Networked Storage?". http://web.mit.edu/~medard/www/page2/mpapers/netcod2005_accek.pdf. 
  61. ↑ Dimakis, Alexandros (2007). "Network Coding for Distributed Storage Systems". arXiv:cs/0702015.
  62. ↑ Katti, Sachin; Rahul, Hariharan; Hu, Wenjun; Katabi, Dina; Médard, Muriel; Crowcroft, Jon (2006-08-11). "XORs in the air". Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications. SIGCOMM '06. New York, NY, USA: Association for Computing Machinery. pp. 243–254. doi:10.1145/1159913.1159942. ISBN 978-1-59593-308-9. http://nms.csail.mit.edu/~sachin/papers/copesc.pdf. 
  63. ↑ Krigslund, Jeppe; Hansen, Jonas; Hundeboll, Martin; Lucani, Daniel E.; Fitzek, Frank H. P. (2013). "CORE: COPE with MORE in Wireless Meshed Networks". 2013 IEEE 77th Vehicular Technology Conference (VTC Spring). pp. 1–6. doi:10.1109/VTCSpring.2013.6692495. ISBN 978-1-4673-6337-2. 
  64. ↑ Sengupta, S.; Rayanchu, S.; Banerjee, S. (May 2007). "An Analysis of Wireless Network Coding for Unicast Sessions: The Case for Coding-Aware Routing". IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications. pp. 1028–1036. doi:10.1109/INFCOM.2007.124. ISBN 978-1-4244-1047-7. https://ieeexplore.ieee.org/document/4215706. 
  65. ↑ "NetworkCoding - batman-adv - Open Mesh". http://www.open-mesh.org/projects/batman-adv/wiki/NetworkCoding. Retrieved 2015-10-28. 
  66. ↑ Bhadra, S.; Shakkottai, S. (April 2006). "Looking at Large Networks: Coding vs. Queueing". Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications. pp. 1–12. doi:10.1109/INFOCOM.2006.266. ISBN 1-4244-0221-2. https://ieeexplore.ieee.org/document/4146919/;jsessionid=Vf_H7NM8pJZkcL5tUwrvGHQd45FXGbWGEGG9OyMg__IVxRlWxF8t!-1723551334. 
  67. ↑ 67.0 67.1 Dong Nguyen; Tuan Tran; Thinh Nguyen; Bose, B. (2009). "Wireless Broadcast Using Network Coding". IEEE Transactions on Vehicular Technology 58 (2): 914–925. doi:10.1109/TVT.2008.927729. 
  68. ↑ Firooz, Mohammad Hamed; Roy, Sumit (24 March 2012). "Data Dissemination in Wireless Networks with Network Coding". IEEE Communications Letters 17 (5): 944–947. doi:10.1109/LCOMM.2013.031313.121994. ISSN 1089-7798. 
  69. ↑ Fiandrotti, Attilio; Bioglio, Valerio; Grangetto, Marco; Gaeta, Rossano; Magli, Enrico (11 October 2013). "Band Codes for Energy-Efficient Network Coding With Application to P2P Mobile Streaming". IEEE Transactions on Multimedia 16 (2): 521–532. doi:10.1109/TMM.2013.2285518. ISSN 1941-0077. https://ieeexplore.ieee.org/document/6630050. 
  70. ↑ Wu, Yue; Liu, Wuling; Wang, Siyi; Guo, Weisi; Chu, Xiaoli (June 2015). "Network coding in device-to-device (D2D) communications underlaying cellular networks". 2015 IEEE International Conference on Communications (ICC). pp. 2072–2077. doi:10.1109/ICC.2015.7248631. ISBN 978-1-4673-6432-4. https://ieeexplore.ieee.org/document/7248631. 
  71. ↑ Zhao, Yulei; Li, Yong; Ge, Ning (December 2015). "Physical Layer Network Coding Aided Two-Way Device-to-Device Communication Underlaying Cellular Networks". 2015 IEEE Global Communications Conference (GLOBECOM). pp. 1–6. doi:10.1109/GLOCOM.2015.7417590. ISBN 978-1-4799-5952-5. https://ieeexplore.ieee.org/document/7417590. 
  72. ↑ Abrardo, Andrea; Fodor, Gábor; Tola, Besmir (2015). "Network coding schemes for Device-to-Device communications based relaying for cellular coverage extension". 2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC). pp. 670–674. doi:10.1109/SPAWC.2015.7227122. ISBN 978-1-4799-1931-4. http://www.diva-portal.org/smash/get/diva2:795210/FULLTEXT01.pdf. 
  73. ↑ Gao, Chuhan; Li, Yong; Zhao, Yulei; Chen, Sheng (October 2017). "A Two-Level Game Theory Approach for Joint Relay Selection and Resource Allocation in Network Coding Assisted D2D Communications". IEEE Transactions on Mobile Computing 16 (10): 2697–2711. doi:10.1109/TMC.2016.2642190. ISSN 1558-0660. https://eprints.soton.ac.uk/414039/1/NC_D2D.pdf. 
  74. ↑ Zhou, Ting; Xu, Bin; Xu, Tianheng; Hu, Honglin; Xiong, Lei (1 February 2015). "User‐specific link adaptation scheme for device‐to‐device network coding multicast". IET Communications 9 (3): 367–374. doi:10.1049/iet-com.2014.0323. ISSN 1751-8636. 
  • Fragouli, C.; Le Boudec, J. & Widmer, J. "Network coding: An instant primer" in Computer Communication Review, 2006. https://doi.org/10.1145/1111322.1111337
  • Ali Farzamnia, Sharifah K. Syed-Yusof, Norsheila Fisa "Multicasting Multiple Description Coding Using p-Cycle Network Coding", KSII Transactions on Internet and Information Systems, Vol 7, No 12, 2013. doi:10.3837/tiis.2013.12.009

External links



Retrieved from "https://handwiki.org/wiki/index.php?title=Linear_network_coding&oldid=3368278"