DMCA
On the Success of Network Topology Inference using a Markov Random Walk Model for Nested Routing Policies
BibTeX
@MISC{Balzano_onthe,
author = {Laura Balzano and Robert Nowak and Matthew Roughan},
title = {On the Success of Network Topology Inference using a Markov Random Walk Model for Nested Routing Policies},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Network topology inference is a topic of ongoing interest, as researchers continue to try to identify the topology of the internet, other networks, and our own networks for maintenance purposes. In this paper we explain why a simple algorithm based on network co-occurrence measurements and a Markov random walk model for routing enables perfect topology reconstruction, despite the seeming model mismatch to real network routing. We show that topology measurement and inference based on this model allows detection of routing bugs, misconfiguration, or even routers that deliberately misreport routing data. 1.
