Network tomography via network coding

In this work we show how existing network coding algorithms can be used to perform network tomography, i.e., estimate network topology. We first examine a simple variant of the popular distributed random network codes proposed by (Ho et al.) and show how it can enable each network node to passively estimate the network topology upstream of it at no cost to throughput. The delays introduced by each upstream node and link can also be similarly estimated. We then consider the scenario wherein an adversary hidden in the network wishes to disrupt the estimation of network topology. We show how network error-correcting codes can be used to reliably perform network tomography if the network has sufficient connectivity, and demonstrate that network tomography is impossible otherwise.

[1]  Suhas N. Diggavi,et al.  Subspace Properties of Randomized Network Coding , 2007, 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks.

[2]  P. Chou,et al.  Low complexity algebraic multicast network codes , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[3]  Fang Zhao,et al.  Minimum-cost multicast over coded packet networks , 2005, IEEE Transactions on Information Theory.

[4]  Sidharth Jaggi,et al.  Polynomial time algorithms for network code construction , 2005 .

[5]  Yonggang Wen,et al.  Network monitoring in multicast networks using network coding , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[6]  R. Koetter,et al.  Network coding from a network flow perspective , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[7]  Muriel Médard,et al.  An algebraic approach to network coding , 2003, TNET.

[8]  Tracey Ho,et al.  Resilient network coding in the presence of Byzantine adversaries , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[9]  Tracey Ho,et al.  A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.

[10]  Yunnan Wu,et al.  Network Coding for the Internet and Wireless Networks , 2007, IEEE Signal Processing Magazine.

[11]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[12]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[13]  Frank R. Kschischang,et al.  Coding for Errors and Erasures in Random Network Coding , 2008, IEEE Trans. Inf. Theory.

[14]  R. Koetter,et al.  The benefits of coding over routing in a randomized setting , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[15]  Sachin Katti,et al.  Embracing wireless interference: analog network coding , 2007, SIGCOMM.

[16]  Christina Fragouli,et al.  Bottleneck discovery and overlay management in network coded peer-to-peer systems , 2007, INM '07.

[17]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

[18]  Y. Vardi,et al.  Network Tomography: Estimating Source-Destination Traffic Intensities from Link Data , 1996 .

[19]  Muriel Medard,et al.  On Randomized Network Coding , 2003 .

[20]  Robert Nowak,et al.  Network Tomography: Recent Developments , 2004 .