Abstract-In this paper we show how information contained in robust network codes can be used for passive inference of possible locations of link failures or losses in a network. For distributed randomized network coding, we bound the probability of being able to distinguish among a given set of failure events, and give some experimental results for one and two link failures in randomly generated networks. We also bound the required field size and complexity for designing a robust network code that distinguishes among a given set of failure events.
Passive inference of link loss rates has also been proposed in REF .
Network monitoring in multicast networks using network coding
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.
Computer Science