One packet suffices - Highly efficient packetized Network Coding with finite memory
Name
Medard_One packet.pdf
Size
104.44 KB
Format
Adobe PDF
Checksum (MD5)
98e03395295f7a413c4c8a665b57aa8a
Author(s)
Haeupler, Bernhard
Medard, Muriel
Date Issued
October 2011
Journal
2011 IEEE International Symposium on Information Theory Proceedings
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Haeupler, Bernard and Muriel M´edard. "One packet suffices - Highly efficient packetized Network Coding with finite memory." 2011 IEEE International Symposium on Information Theory Proceedings, July - August 2011, St. Petersburg, Russia, Institute of Electrical and Electronics Engineers (IEEE), October 2011. © 2011 IEEE
Version
Author's final manuscript
Abstract
Random Linear Network Coding (RLNC) has emerged as a powerful tool for robust high-throughput multicast. Projection
analysis, a recently introduced technique, shows that the distributed packetized RLNC protocol achieves (order) optimal and perfectly pipelined information dissemination in many settings. In the original approach to RNLC intermediate nodes code together all available information. This requires intermediate nodes to keep considerable data available for coding. Moreover, it results in a coding complexity that grows linearly with the size of this data. While this has been identified as a problem, approaches that combine queuing theory and network coding have heretofore not provided a succinct representation of the memory needs of network coding at intermediates nodes. This paper shows the surprising result that, in all settings with a continuous stream of data, network coding continues to perform optimally even if only one packet per node is kept in active memory and used for computations. This leads to an extremely simple RLNC protocol variant with drastically reduced requirements on computational and memory resources. By extending the projection analysis, we show that in all settings in which the RLNC protocol was proven to be optimal its finite
memory variant performs equally well. In the same way as the original projection analysis, our technique applies in a wide variety of network models, including highly dynamic topologies that can change completely at any time in an adversarial fashion.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ISIT.2011.6033713
