A proposed P2P Kurdistan Academic Network Backbone (KANB), Based on Random Linear Network Coding

The current rate of growth in computer network usage is a problematic issue motivates the inspiration to investigate less conventional solutions, similar to Network Coding (NC) which has attracted a lot of attention lately, to improve the bandwidth utilization and latency in computer networks. The objective of this paper is to show that the usage of Network coding is possible on enhancing the execution of Kurdistan Academic Network Backbone (KANB) to associate the primary ten urban communities in Kurdistan Region that almost contains a greater part of academic institutions. The proposed model applies peer to peer (P2P) multicasting on KANB, which does not require any centralized knowledge about the topology of the network. The Random Linear Network Coding (RLNC) has been utilized for its superior properties to address the problems of delay, throughput and lake of security associated with store-and-forward based classical networks. Simulation results point out the advantages of using network coding over the classical (store and forward) technique in term of improving the throughput gain and latency reduction. Hawler city the capital and greatest city in Kurdistan Region have been chosen as a source node while Slemani city has been elected as a sink, node. Thus, Network coding is applied at intermediate nodes

Enhancing Block-Wise Transfer with Network Coding in CoAP

CoAP (Constrained Application Protocol) with block-wise transfer (BWT) option is a known protocol choice for large data transfer in general lossy IoT network environments. Lossy transmission environments on the other hand lead to CoAP resending multiple blocks, which creates overheads. To tackle this problem, we design a BWT with network coding (NC), with the goal to reducing the number of unnecessary retransmissions. The results show the reduction in the number of block retransmissions for different values of blocksize, implying the reduced transfer time. For the maximum blocksize of 1024 bytes and total probability loss of 0.5, CoAP with NC can resend up to 5 times less blocks.Comment: 4 pages, 2 figures, submitted to Euro-Par 201

Network Coded TCP (CTCP) Performance over Satellite Networks

We show preliminary results for the performance of Network Coded TCP (CTCP) over large latency networks. While CTCP performs very well in networks with relatively short RTT, the slow-start mechanism currently employed does not adequately fill the available bandwidth when the RTT is large. Regardless, we show that CTCP still outperforms current TCP variants (i.e., Cubic TCP and Hybla TCP) for high packet loss rates (e.g., >2.5%). We then explore the possibility of a modified congestion control mechanism based off of H-TCP that opens the congestion window quickly to overcome the challenges of large latency networks. Preliminary results are provided that show the combination of network coding with an appropriate congestion control algorithm can provide gains on the order of 20 times that of existing TCP variants. Finally, we provide a discussion of the future work needed to increase CTCP's performance in these networks.Comment: 4 pages, 4 figures, Accepted at SPACOMM 201

When Network Coding and Dirty Paper Coding meet in a Cooperative Ad Hoc Network

We develop and analyze new cooperative strategies for ad hoc networks that are more spectrally efficient than classical DF cooperative protocols. Using analog network coding, our strategies preserve the practical half-duplex assumption but relax the orthogonality constraint. The introduction of interference due to non-orthogonality is mitigated thanks to precoding, in particular Dirty Paper coding. Combined with smart power allocation, our cooperation strategies allow to save time and lead to more efficient use of bandwidth and to improved network throughput with respect to classical RDF/PDF.Comment: 7 pages, 7 figure