Subspace Properties of Network Coding and Their Applications
- 31 January 2012
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 58 (5) , 2599-2619
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 toward 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.Keywords
All Related Versions
This publication has 27 references indexed in Scilit:
- On Locating Byzantine Attackers2008
- Comprehensive view of a live network coding P2P system2006
- Network Error Correction Coding in Packetized Networks2006
- A Network Coding Approach to Energy Efficient Broadcasting: From Theory to Practice2006
- Network Error Correction, II: Lower BoundsCommunications in Information and Systems, 2006
- Network Error Correction, I: Basic Concepts and Upper BoundsCommunications in Information and Systems, 2006
- Network coding for large scale content distribution2005
- Byzantine modification detection in multicast networks using randomized network coding2004
- An algebraic approach to network codingIEEE/ACM Transactions on Networking, 2003
- Network information flowIEEE Transactions on Information Theory, 2000