A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Achieving fast, precise, and scalable fault localization has long been a highly desired feature in all-optical mesh networks. Monitoring tree (m-tree) is an interesting method that has been introduced as the most general monitoring structure for achieving unambiguous failure localization (UFL). Ideally, with J m-trees one can monitor up to 2 J − 1 links when a single failure has to be located. Such a logarithmic behavior has also been observed in numerous case studies of real life networkdoi:10.1109/infcom.2010.5462251 dblp:conf/infocom/TapolcaiRH10 fatcat:c3xp4bfq5bdcfhhuvo4rpev6hm