Results 1 
5 of
5
A Network Coding Approach to Loss Tomography
, 2013
"... Network tomography aims at inferring internal network characteristics based on measurements at the edge of the network. In loss tomography, in particular, the characteristic of interest is the loss rate of individual links and multicast and/or unicast endtoend probes are typically used. Independen ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Network tomography aims at inferring internal network characteristics based on measurements at the edge of the network. In loss tomography, in particular, the characteristic of interest is the loss rate of individual links and multicast and/or unicast endtoend probes are typically used. Independently, recent advances in network coding have shown that there are advantages from allowing intermediate nodes to process and combine, in addition to just forward, packets. In this paper, we study the problem of loss tomography in networks with network coding capabilities. We design a framework for estimating link loss rates, which leverages network coding capabilities, and we show that it improves several aspects of tomography, including the identifiability of links, the tradeoff between estimation accuracy and bandwidth efficiency, and the complexity of probe path selection. We discuss the cases of inferring link loss rates in a tree topology and in a general topology. In the latter case, the benefits of our approach are even more pronounced compared to standard techniques but we also face novel challenges, such as dealing with cycles and multiple paths between sources and receivers. Overall, this work makes the connection between active network tomography and network coding.
APPROVED:
, 2011
"... This Dissertation (PhD) is brought to you for free and open access by the Graduate School of Biomedical Sciences at ..."
Abstract
 Add to MetaCart
This Dissertation (PhD) is brought to you for free and open access by the Graduate School of Biomedical Sciences at
A Deterministic Polynomial–Time Algorithm for Constructing a Multicast Coding Scheme for Linear Deterministic Relay Networks
"... We propose a new way to construct a multicast coding scheme for linear deterministic relay networks. Our construction can be regarded as a generalization of the wellknown multicast network coding scheme of Jaggi et al. to linear deterministic relay networks and is based on the notion of flow for a ..."
Abstract
 Add to MetaCart
(Show Context)
We propose a new way to construct a multicast coding scheme for linear deterministic relay networks. Our construction can be regarded as a generalization of the wellknown multicast network coding scheme of Jaggi et al. to linear deterministic relay networks and is based on the notion of flow for a unicast session that was introduced by the authors in earlier work. We present randomized and deterministic polynomial–time versions of our algorithm and show that for a network with g destinations, our deterministic algorithm can achieve the capacity in dlog(g + 1)e uses of the network. 1