scholarly journals Robust Communication Protocol Over Lossy Network

2020 ◽  
pp. 272-277
Author(s):  
Kaustubh Chandorkar ◽  
Gajendra Dhaytadak ◽  
Siddhant Negi ◽  
Subodh Karve
Keyword(s):  
Computer Network ◽  
Window Size ◽  
Sliding Window ◽  
Low Latency ◽  
Operating Characteristics ◽  
Linear Network ◽  
Data Packets ◽  
Linear Network Coding ◽  
Lossy Links ◽  
The Individual

A computer network is the infrastructure that allows two or more computers (called hosts) to communicate with each other. The network achieves this by providing a set of rules for communication, called protocols, which should be observed by all participating hosts. The need for a protocol should be obvious: it allows different computers from different vendors and with different operating characteristics to ‘speak the same language’. Communication protocols are formal descriptions of digital message formats and rules. They are required to exchange messages in or between computing systems and are required in telecommunications When two computer system (server and client) communicate with each other they may encounter data loss due to many obstructions like thick walls,jammers etc. these may cause the data packets to be lost while transmission. We used a protocol to minimize or avoid this loss. This can be done by intelligently routing the data packets via paths that are not jammed and time effective as well.If the messages or data packets are not delivered to the receiver the protocol will resend the data packet. If there is traffic means data packets are delayed due to some obstacles then the server will choose feasible route to deliver the data packets. We use random linear network coding (RLNC) based scheme for multipath communication in the presence of lossy links with different delay characteristics to obtain ultra-reliability and low latency. A sliding window version of RLNC is proposed where the coded packets are generated using packets in a window size and are inserted among systematic packets in different paths. The packets are scheduled in the paths in a round robin fashion proportional to the data rates. We use finite encoding and decoding window size and do not rely on feedback for closing the sliding window. Our implementation of two paths with LTE and WiFi characteristics shows that the proposed sliding window scheme achieves better latency compared to the block RLNC code. It is also shown that the proposed scheme achieves low latency communication through multiple paths compared to the individual paths for bursty traffic by translating the throughput on both the paths into latency gain.

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

2017 ◽  
Vol 2 (3) ◽  
pp. 50-55
Author(s):  
Raghad Z. Yousif ◽  
Rami S. Youeel ◽  
Ferman I Kareem
Keyword(s):  
Network Coding ◽  
Computer Network ◽  
Kurdistan Region ◽  
Bandwidth Utilization ◽  
Linear Network ◽  
Linear Network Coding ◽  
Random Linear Network Coding ◽  
Academic Network ◽  
Network Backbone ◽  
Store And Forward

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.

Low-latency Sliding-window Recoding

2021 ◽  
Author(s):  
Elif Tasdemir ◽  
Mate Tomoskozi ◽  
Hani Salah ◽  
Frank H.P. Fitzek
Keyword(s):  
Sliding Window ◽  
Low Latency

Sliding Window RLNC on Multi-Hop Communication for Low Latency

2021 ◽  
Author(s):  
Elif Tasdemir ◽  
Juan A. Cabrera ◽  
Frank Gabriel ◽  
Dongho You ◽  
Frank H. P. Fitzek
Keyword(s):  
Sliding Window ◽  
Low Latency

On the Optimal Linear Network Coding Design for Information Theoretically Secure Unicast Streaming

2016 ◽  
Vol 18 (6) ◽  
pp. 1149-1162 ◽  
Author(s):  
Jin Wang ◽  
Jianping Wang ◽  
Kejie Lu ◽  
Yi Qian ◽  
Naijie Gu
Keyword(s):  
Network Coding ◽  
Linear Network ◽  
Linear Network Coding ◽  
Optimal Linear

scholarly journals Semantically Secure Symmetric Encryption with Error Correction for Distributed Storage

2017 ◽  
Vol 2017 ◽  
pp. 1-10
Author(s):  
Juha Partala
Keyword(s):  
Error Correction ◽  
Network Coding ◽  
Linear Combination ◽  
Distributed Storage ◽  
Homomorphic Encryption ◽  
Error Correcting Codes ◽  
Symmetric Encryption ◽  
Goppa Codes ◽  
Linear Network ◽  
Linear Network Coding

A distributed storage system (DSS) is a fundamental building block in many distributed applications. It applies linear network coding to achieve an optimal tradeoff between storage and repair bandwidth when node failures occur. Additively homomorphic encryption is compatible with linear network coding. The homomorphic property ensures that a linear combination of ciphertext messages decrypts to the same linear combination of the corresponding plaintext messages. In this paper, we construct a linearly homomorphic symmetric encryption scheme that is designed for a DSS. Our proposal provides simultaneous encryption and error correction by applying linear error correcting codes. We show its IND-CPA security for a limited number of messages based on binary Goppa codes and the following assumption: when dividing a scrambled generator matrix G^ into two parts G1^ and G2^, it is infeasible to distinguish G2^ from random and to find a statistical connection between G1^ and G2^. Our infeasibility assumptions are closely related to those underlying the McEliece public key cryptosystem but are considerably weaker. We believe that the proposed problem has independent cryptographic interest.

Sign in / Sign up

Export Citation Format

Share Document