Network monitoring in multicast networks using network coding
- 1 January 2005
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1977-1981
- https://doi.org/10.1109/isit.2005.1523691
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 monitoringPublished by Association for Computing Machinery (ACM) ,2004
- Loss inference in wireless sensor networks based on data aggregationPublished by Association for Computing Machinery (ACM) ,2004
- An algebraic approach to network codingIEEE/ACM Transactions on Networking, 2003
- The benefits of coding over routing in a randomized settingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Merging logical topologies using end-to-end measurementsPublished by Association for Computing Machinery (ACM) ,2003
- Multicast topology inference from measured end-to-end lossIEEE Transactions on Information Theory, 2002
- Network Delay Tomography from End-to-End Unicast MeasurementsPublished by Springer Science and Business Media LLC ,2001
- Network information flowIEEE Transactions on Information Theory, 2000