Inferring Network Status from Partial Observations
| dc.contributor.author | Rangudu, Venkata Pavan Kumar | en |
| dc.contributor.committeechair | Marathe, Madhav Vishnu | en |
| dc.contributor.committeemember | Vullikanti, Anil Kumar S. | en |
| dc.contributor.committeemember | Bisset, Keith R. | en |
| dc.contributor.department | Computer Science | en |
| dc.date.accessioned | 2017-02-09T18:28:26Z | en |
| dc.date.available | 2017-02-09T18:28:26Z | en |
| dc.date.issued | 2017-02-09 | en |
| dc.description.abstract | In many network applications, such as the Internet and infrastructure networks, nodes fail or get congested dynamically, but tracking this information about all the nodes in a network where some dynamical processes are taking place is a fundamental problem. In this work, we study the problem of inferring the complete set of failed nodes, when only a sample of the node failures are known---we will be referring to this particular problem as prob{} . We consider the setting in which there exists correlations between node failures in networks, which has been studied in the case of many infrastructure networks. We formalize the prob{} problem using the Minimum Description Length (MDL) principle and we show that, in general, finding solutions that minimize the MDL cost is hard, and develop efficient algorithms with rigorous performance guarantees for finding near-optimal MDL cost solutions. We evaluate our methods on both synthetic and real world datasets, which includes the one from WAZE. WAZE is a crowd-sourced road navigation tool, that collects and presents the traffic incident reports. We found that the proposed greedy algorithm for this problem is able to recover $80%$, on average, of the failed nodes in a network for a given partial sample of input failures, which are sampled from the true set of failures at some predefined rate. Furthermore, we have also proved that this algorithm will find a solution that has MDL cost with an additive approximation guarantee of log(n) from the optimal. | en |
| dc.description.degree | Master of Science | en |
| dc.format.medium | ETD | en |
| dc.identifier.other | vt_gsexam:9523 | en |
| dc.identifier.uri | http://hdl.handle.net/10919/74983 | en |
| dc.publisher | Virginia Tech | en |
| dc.rights | In Copyright | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.subject | Network Topology Inference | en |
| dc.subject | Network Tomography | en |
| dc.subject | Minimum Description Length | en |
| dc.title | Inferring Network Status from Partial Observations | en |
| dc.type | Thesis | en |
| thesis.degree.discipline | Computer Science and Applications | en |
| thesis.degree.grantor | Virginia Polytechnic Institute and State University | en |
| thesis.degree.level | masters | en |
| thesis.degree.name | Master of Science | en |