Type of Document	Thesis
Author	Sun, Bo
URN	etd-06302009-215500
Title	Probabilistic Diagnosis Of Link Loss Using End-To-End Path Measurements And Maximum Likelihood Estimation
Degree	Master of Science
Department	Computer Science, Department of
Advisory Committee	Advisor Name Title Zhenghao Zhang Committee Chair Feifei Li Committee Member Zhenhai Duan Committee Member
Keywords	Link Loss DIAGNOSIS Maximum Likelihood Estimation
Date of Defense	2009-06-05
Availability	unrestricted
Abstract Internet fault diagnosis has attracted much attention in recent years. In this paper, we focus on the problem of finding the Link Pass Ratios (LPRs) when the Path Pass Ratios (PPRs) of a set of paths are given. Usually, given the PPRs of the paths, the LPRs of a significant percentage of the links cannot be uniquely determined because the system is under-constrained. We consider the Maximum Likelihood Estimation of the LPRs of such links. We prove that the problem of finding the Maximum Likelihood Estimation is NP-hard, then propose a simple algorithm based on divide-and-conquer. We first estimate the number of faulty links on a path, then use the global information to assign LPRs to the links. We conduct simulations on networks of various sizes and the results show that our algorithm performs very well in terms of identifying faulty links.
Files	Filename       Size       Approximate Download Time (Hours:Minutes:Seconds)     28.8 Modem   56K Modem   ISDN (64 Kb)   ISDN (128 Kb)   Higher-speed Access    Sun_B_Thesis_2009r.pdf 4.73 Mb 00:21:54 00:11:15 00:09:51 00:04:55 00:00:25