Best of Both Worlds: Prioritizing Network Coding without Increased Space Complexity
Key: 2016a40
Author: Roman Naumann, Stefan Dietzel, Björn Scheuermann
Date: November 2016
Kind: In proceedings
Publisher: IEEE
Book title: LCN '16: Proceedings of the 41th IEEE Conference on Local Computer Networks
Abstract: Random linear network coding simplifies routing decisions, improves throughput, and increases tolerance against packet loss. A substantial limitation, however, is delay: decoding requires as many independent linear combinations as data blocks. Hierarchical network coding purportedly solves this delay problem. It introduces layers to decode prioritized data blocks early, which may benefit video streaming applications or applications for sensor information collection. While hierarchical network coding reduces decoding delays, it introduces significant space complexity and additional decoding time. We propose a decoding algorithm that manages all prioritization layers in a joint decoder matrix. Analytical evaluation and performance measurements show that we maintain prioritization benefits without increased space complexity and improve decoding performance. With memory requirements independent of the number of layers, our algorithm facilitates more fine-grained prioritization layers to further the benefits of hierarchical network coding.

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, not withstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.