Robust Communication Protocol Over Lossy Network

Abstract

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.