Subspace Properties of Network Coding and Their Applications

DOI10.1109/TIT.2012.2184656MaRDI QIDQ5271934zbMATH OpenOpenAlexFDO

Authors Mahdi Jafari Siavoshani, Christina Fragouli, Suhas N. Diggavi

Publication date 12 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1106.5387

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Applications of graph theory to circuits and networks (94C15)

Abstract: Systems that employ network coding for content distribution convey to the receivers linear combinations of the source packets. If we assume randomized network coding, during this process the network nodes collect random subspaces of the space spanned by the source packets. We establish several fundamental properties of the random subspaces induced in such a system, and show that these subspaces implicitly carry topological information about the network and its state that can be passively collected and inferred. We leverage this information towards a number of applications that are interesting in their own right, such as topology inference, bottleneck discovery in peer-to-peer systems and locating Byzantine attackers. We thus argue that, randomized network coding, apart from its better known properties for improving information delivery rate, can additionally facilitate network management and control.

Cited in

(2)

• scientific article; zbMATH DE number 4030953 (Why is no real title available?)
• Subexponential and Linear Subpacketization Coded Caching via Projective Geometry

This page was built for publication: Subspace Properties of Network Coding and Their Applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5271934)