@techreport{TD:585N2C,
	att_abstract={{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  {em minimum variance weighted average (MVWA) algorithm} treats the trees  separately and then averages the results. The second, based on {em  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. To appear in Proceedings ACM Sigmetrics 2002 }},
	att_authors={nd1321},
	att_categories={},
	att_copyright={{ACM}},
	att_copyright_notice={{}},
	att_donotupload={false},
	att_private={false},
	att_projects={},
	att_tags={},
	att_techdoc={true},
	att_techdoc_key={TD:585N2C},
	att_url={http://web1.research.att.com:81/techdocs_downloads/TD:585N2C_DS1_2010-08-18T15:14:38.308Z.pdf},
	author={Nicholas Duffield and Tian Bu and Francesco Lo Presti and Don Towsley},
	institution={{Proceedings ACM Sigmetrics 2002}},
	month={March},
	title={{Network tomography on general topologies}},
	year=2002,
}