Network tomography on general topologies

In this paper we consider the problem of inferring link-level loss rates from end-to-end multicast measurements taken from a collection of trees. We give conditions under which loss rates are identifiable on a specified set of links. Two algorithms are presented to perform the link-level inferences for those links on which losses can be identified. One, the minimum variance weighted average (MVWA) algorithm treats the trees separately and then averages the results. The second, based on expectation-maximization (EM) merges all of the measurements into one computation. Simulations show that EM is slightly more accurate than MVWA, most likely due to its more efficient use of the measurements. We also describe extensions to the inference of link-level delay, inference from end-to-end unicast measurements, and inference when some measurements are missing.

[1]  New York Dover,et al.  ON THE CONVERGENCE PROPERTIES OF THE EM ALGORITHM , 1983 .

[2]  G. McLachlan,et al.  The EM algorithm and extensions , 1996 .

[3]  Donald F. Towsley,et al.  Multicast-based inference of network-internal loss characteristics , 1999, IEEE Trans. Inf. Theory.

[4]  Donald F. Towsley,et al.  Multicast-based inference of network-internal characteristics: accuracy of packet loss estimation , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[5]  Azer Bestavros,et al.  Robust identification of shared losses using end-to-end unicast probes , 2000, Proceedings 2000 International Conference on Network Protocols.

[6]  Robert Nowak,et al.  Network Loss Inference Using Unicast End-to-End Measurement , 2000 .

[7]  Don Towsley,et al.  The use of end-to-end multicast measurements for characterizing internal network behavior , 2000, IEEE Commun. Mag..

[8]  Mary Baker,et al.  Measuring link bandwidths using a deterministic model of packet delay , 2000, SIGCOMM.

[9]  Donald F. Towsley,et al.  Tree Layout for Internal Network Characterizations in Multicast Networks , 2001, Networked Group Communication.

[10]  Avishai Wool,et al.  Computing the unmeasured: an algebraic approach to Internet mapping , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[11]  Moshe Sidi,et al.  Estimating one-way delays from cyclic-path delay measurements , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[12]  Donald F. Towsley,et al.  Inferring link loss using striped unicast probes , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[13]  Donald F. Towsley,et al.  Network Delay Tomography from End-to-End Unicast Measurements , 2001, IWDC.

[14]  Robert Nowak,et al.  Sequential Monte Carlo Inference of Internal Delays in Nonstationary Communication Networks , 2002 .

[15]  Robert D. Nowak,et al.  Sequential Monte Carlo inference of internal delays in nonstationary data networks , 2002, IEEE Trans. Signal Process..

[16]  Donald F. Towsley,et al.  Multicast-based inference of network-internal delay distributions , 2002, TNET.

[17]  Donald F. Towsley,et al.  Multicast-based loss inference with missing data , 2002, IEEE J. Sel. Areas Commun..