<html><body style="word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space; "><br><div><br><div>Begin forwarded message:</div><br class="Apple-interchange-newline"><blockquote type="cite"><div><div style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; "><font face="Helvetica" size="3" color="#000000" style="font: 12.0px Helvetica; color: #000000"><b>From: </b></font><font face="Helvetica" size="3" style="font: 12.0px Helvetica">Yaping Zhu <<a href="mailto:yapingz@CS.Princeton.EDU">yapingz@CS.Princeton.EDU</a>></font></div><div style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; "><font face="Helvetica" size="3" color="#000000" style="font: 12.0px Helvetica; color: #000000"><b>Date: </b></font><font face="Helvetica" size="3" style="font: 12.0px Helvetica">October 7, 2009 6:55:55 PM PDT</font></div><div style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; "><font face="Helvetica" size="3" color="#000000" style="font: 12.0px Helvetica; color: #000000"><b>To: </b></font><font face="Helvetica" size="3" style="font: 12.0px Helvetica"><a href="mailto:ens@lists.cs.princeton.edu">ens@lists.cs.princeton.edu</a></font></div><div style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; "><font face="Helvetica" size="3" color="#000000" style="font: 12.0px Helvetica; color: #000000"><b>Subject: </b></font><font face="Helvetica" size="3" style="font: 12.0px Helvetica"><b>[ens] talk about blackhole identification by Italo Cunha, Nov 11 11am, CS 302</b></font></div><div style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; min-height: 14px; "><br></div> </div><div>hi all,<br>Italo Cunha from UPMC Paris Universitas is visiting Princeton on Nov 11. He will be giving a talk at 11am in CS 302 (title and abstract below). please let me know if you'd like to meet with him in person.<br><br>thanks,<br>Yaping<br><br>Title: Measurement Methods for Fast and Accurate Blackhole<br>Identification with Binary Tomography<br><br>Abstract: Binary tomography--the process of identifying faulty network<br>links through coordinated end-to-end probes--is a promising method for<br>detecting failures that the network does not automatically mask (e.g.,<br>network "blackholes"). Because tomography is sensitive to the quality of<br>the input, however, naive end-to-end measurements can introduce<br>inaccuracies. This paper develops two methods for generating inputs to<br>binary tomography algorithms that improve their inference speed and<br>accuracy. Failure confirmation is a per-path probing technique to<br>distinguish packet losses caused by congestion from persistent link or<br>node failures. Aggregation strategies combine path measurements from<br>unsynchronized monitors into a set of consistent observations. When used<br>in conjunction with existing binary tomography algorithms, our methods<br>identify all failures that are longer than two measurement cycles, while<br>inducing relatively few false alarms. In two wide-area networks, our<br>techniques decrease the number of alarms by as much as two orders of<br>magnitude. Compared to the state of the art in binary tomography, our<br>techniques increase the identification rate and avoid hundreds of false<br>alarms.<br><br>Bio: Ítalo Cunha received the B.Sc. degree in computer science and the<br>M.Sc. degree in computer science from Universidade Federal de Minas<br>Gerais, Brazil, in 2004 and 2007, respectively. He is currently a second<br>year Ph.D. candidate in UPMC Paris Universitas, doing his research with<br>Thomson, Paris, France. His research interests are in network<br>measurement, troubleshooting, and management.<br>_______________________________________________<br>ens mailing list<br><a href="mailto:ens@lists.cs.princeton.edu">ens@lists.cs.princeton.edu</a><br>https://lists.cs.princeton.edu/mailman/listinfo/ens<br></div></blockquote></div><br></body></html>