An Efficient and Reliable Data Transmission Service using Network Coding Algorithms in Peer-to-Peer Network

Network coding is a progressive enhancement in natural network routing that increases throughput and reliability for unicast, multicast, and even broadcast transmissions. P2P networks are ideal for implementing network coding algorithms for two reasons: I. A P2P network's topology isn't predetermined. As a result, designing a topology that is compatible with the network coding algorithm is much easier. II. Every peer is an end host in this network.  As a result, instead of saving and sending the message, complex network coding operations, such as encoding and decoding, are now easier to perform. The objective of this work is to use the best features of network coding algorithms and properly apply them to P2P networks to create an efficient and reliable data transmission service. The goal of the network coding algorithm is to make better use of network resources and thus increase P2P network capacity. An encoding algorithm that enables an intermediate peer to produce output messages by encoding (that is, computing a function of the data it receives. The decoder's role is to obtain enough encoded packets so that the original information can be recovered. This research work has measured an amount of hypothetical and applied consequences in which the network coding procedure or a variation of it is used to improve performance parameters such as throughput and reliability in P2P network data transmission based on network coding. The comparison of data transmission between network routing and network coding algorithms was the main focus of this paper.  According to our simulations, the new network coding systems can reach 15% to 20% upper throughput than supplementary P2P network routing systems

Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys

It is common in the study of secure multicast network coding in the presence of an eavesdropper that has access to z network links, to assume that the source node is the only node that generates random keys. In this setting, the secure multicast rate is well understood. Computing the secure multicast rate, or even the secure unicast rate, in the more general setting in which all network nodes may generate (independent) random keys is known to be as difficult as computing the (non-secure) capacity of multiple-unicast network coding instances — a well known open problem. This work treats an intermediate model of secure unicast in which only one node can generate random keys, however that node need not be the source node. The secure communication rate for this setting is characterized again with an eavesdropper that has access to z network links

Single-Unicast Secure Network Coding and Network Error Correction are as Hard as Multiple-Unicast Network Coding

This paper reduces multiple-unicast network coding to single-unicast secure network coding and single-unicast network error correction. Specifically, we present reductions that map an arbitrary multiple-unicast network coding instance to a unicast secure network coding instance in which at most one link is eavesdropped, or a unicast network error correction instance in which at most one link is erroneous, such that a rate tuple is achievable in the multiple-unicast network coding instance if and only if a corresponding rate is achievable in the unicast secure network coding instance, or in the unicast network error correction instance. Conversely, we show that an arbitrary unicast secure network coding instance in which at most one link is eavesdropped can be reduced back to a multiple-unicast network coding instance. In addition, we show that the capacity of a unicast network error correction instance in general is not (exactly) achievable

Single-Unicast Secure Network Coding and Network Error Correction are as Hard as Multiple-Unicast Network Coding

This paper reduces multiple-unicast network coding to single-unicast secure network coding and single-unicast network error correction. Specifically, we present reductions that map an arbitrary multiple-unicast network coding instance to a unicast secure network coding instance in which at most one link is eavesdropped, or a unicast network error correction instance in which at most one link is erroneous, such that a rate tuple is achievable in the multiple-unicast network coding instance if and only if a corresponding rate is achievable in the unicast secure network coding instance, or in the unicast network error correction instance. Conversely, we show that an arbitrary unicast secure network coding instance in which at most one link is eavesdropped can be reduced back to a multiple-unicast network coding instance. In addition, we show that the capacity of a unicast network error correction instance in general is not (exactly) achievable

Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys

It is common in the study of secure multicast network coding in the presence of an eavesdropper that has access to z network links, to assume that the source node is the only node that generates random keys. In this setting, the secure multicast rate is well understood. Computing the secure multicast rate, or even the secure unicast rate, in the more general setting in which all network nodes may generate (independent) random keys is known to be as difficult as computing the (non-secure) capacity of multiple-unicast network coding instances — a well known open problem. This work treats an intermediate model of secure unicast in which only one node can generate random keys, however that node need not be the source node. The secure communication rate for this setting is characterized again with an eavesdropper that has access to z network links