Network monitoring in multicast networks using network coding
Authors:
- T. HoTHT. Ho
- B. LeongBLB. Leong
- Yu-Han ChangYCYu-Han Chang
- Yonggang WenYWYonggang Wen
- R. KoetterRKR. Koetter
- 1 January 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1977-1981
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 eventsKeywords
This publication has 13 references indexed in Scilit:
- A Random Linear Network Coding Approach to MulticastIEEE Transactions on Information Theory, 2006
- An Information-Theoretic View of Network ManagementIEEE Transactions on Information Theory, 2005
- An algebraic approach to practical and scalable overlay network monitoring2004
- Loss inference in wireless sensor networks based on data aggregation2004
- An algebraic approach to network codingIEEE/ACM Transactions on Networking, 2003
- The benefits of coding over routing in a randomized setting2003
- Merging logical topologies using end-to-end measurements2003
- Multicast topology inference from measured end-to-end lossIEEE Transactions on Information Theory, 2002
- Network Delay Tomography from End-to-End Unicast Measurements2001
- Network information flowIEEE Transactions on Information Theory, 2000