z-logo
open-access-imgOpen Access
The linear network coding optimization in hybrid ARQ/FEC system to counteract head-of-line blocking in queue
Author(s) -
N. V. Britvin,
E. O. Karpukhin
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1515/3/032019
Subject(s) - computer science , linear network coding , algorithm , coding (social sciences) , queue , packet loss , network packet , code rate , upper and lower bounds , mathematics , computer network , decoding methods , statistics , mathematical analysis
The problems of systematic linear network coding optimization and generic matrix generation methods are considered in this article. The most efficient generation method is a random matrix filling with prime numbers. A model of data transfer system was developed that allowed to assess the telecommunication system packet loss rate using various methods. The first method involves a packet loss rate calculation using the binomial distribution law. In order to find the optimal length of the information and coding sequences, the enumeration of the possibilities based on the calculation results is made. The optimality criteria are maximum code rate and minimum coding sequence length upon the condition that packet loss rate is zero. This method provides high accuracy and allows to quickly obtain a large number of optimal lengths of the information and coding sequences. However, the method cannot be modified to be used for the packet correlated loss calculation in case of the network overload and data transfer pending via wireless connection. The second method relies on the simulation models which allow to find the optimal lengths of the information and coding sequences using multiple test data transmission in the simulation environment with different characteristics (modulation methods, coding, channel models).

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here