Method of redundancy and loss data recovering in global networks
DOI: 10.31673/2412-4338.2020.010411
Abstract
A new method of redundant packet formation for data transmission in global networks, as well as a technology of their usage for restoring of lost and damaged data packets is proposed. The method for guaranteed restoring not more then three lost and damaged data packets is presented. Mathematical and technical justification of the proposed method is given. Each of the redundant reserve packet proposed to form as the logical sum of certain subsets of data packets. Formed reserve packets are transmitted together with information packets. The rules of redundancy packets formed whose ensures of the existence of an orthogonal system of equations, which solves the process of reconstruction of lost information packets are mathematically rigorously proven. Based on obtained theoretical results the technologies for redundant packet formation for data transmission in global networks has been developed.
To accelerate the reconstruction of lost packets, the method involves the usage of special pre-computational tables. The technology of forming such tables whose contained specifications for lost packets restoring for different variants packets (main or redundancy) loss is described in detail. Each reconstructed packet is restoring as the logical sum of predefined by specification subsets of data and redundant reserve no loss packets. The developed method for specification forming ensured the low calculation complexity of packets restoring process.
The main advantage of the proposed method for restoring of lost data packets in global networks in comparison with known methods consist of accelerating of packets reconstruction process by using simple transformation. This provides the possibility of reconstruction lost data packet in global networks in real time. The proposed method ensured high efficiency for hardware implementations.
Keywords: global network, data security, recovery codes, recovery of lost packages, line codes, reconstruction codes, pre-computation.
References
1. Leong D., Qureshi A., and Ho T. (2013). On Coding Real-Time Streaming under Packet Erasure. Proc. IEEE International Symposium Information Theory (ISIT). Vienna. Austria. Jul. 2013. 1012-1016.
2. Stirenko S.G., and Gabinet A. V., and Kostenko J. V. (2015). Ensure Continuous Video Streaming on Peer-to-Peer Network Using Erasure Codes. Proceeding of National Technical University of Ukraine “КPI” Informatica, Control and Computer Technic. 62. 105-110.
3. Johnny M., and Aref M. R. (2019). A Multi-Lavel Encoding and Decoding Strategy for Binary Erasure Channel. IEEE Transaction on Information Theory. V.65. No.7. 4143-4151.
4. Czap L., Fragouli C., Phabhakaran V., and Diggavi S. (2015). Secure Network Coding with Erasures and Feedback. IEEE Transaction on Information Theory. V.61. No.4. 1667-1686.
5. Gluesing-Luessen H., and Horlemann-Trautmann A. L. (2019). Symbol Erasure Correction in Random Network with Spread Codes. IEEE Transaction on Information Theory. V.65. No.4. 2075-2091.
6. Fan X., Kosut O., and Wagner A. B. (2018). Variable Packet-Error Coding. IEEE Transaction on Information Theory. V.64. No.3. 1530-1547.
7. Mortuza A., and Kuijper M. A. (2011). Parametric Approach to List Decoding of Reed-Solomon Codes Using Interpolation. IEEE Transactions on information theory. V.57. No.10. 6718-6728.
8. Wing Q., and Jaggi S. (2018). End-to-End Error-Correcting Codes on Networks with Wors-Case Bit Errors. IEEE Transaction on Information Theory. V.64. No.6. 4467-4479.
9. Adler N., and Cassuto Y. (2017). Burs-Erasure Correcting Codes with Optimal Average Delay. IEEE Transaction on Information Theory. V.63. No.5. 2848-2865.
10. Bardis N. G., Markovskyi O. P., and Koliada K. V. (2019). Usage of Linear Erasure Codes for Increasing Reliability and Efficiency of Information Delivery on the Internet. International Journal of Circuits, System and Signal Processing. V.13. 585-592.
