Measuring ISP topologies with rocketfuel
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Traffic matrix estimation: existing techniques and new directions
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
An information-theoretic approach to traffic matrix estimation
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
On inferring and characterizing internet routing policies
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Traffic engineering with estimated traffic matrices
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
In search of path diversity in ISP networks
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
The problem of synthetically generating IP traffic matrices: initial recommendations
ACM SIGCOMM Computer Communication Review
Simplifying the synthesis of internet traffic matrices
ACM SIGCOMM Computer Communication Review
Building an AS-topology model that captures route diversity
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
IGP link weight assignment for operational Tier-1 backbones
IEEE/ACM Transactions on Networking (TON)
Measuring load-balanced paths in the internet
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Multicast-based inference of network-internal loss characteristics
IEEE Transactions on Information Theory
Multicast topology inference from measured end-to-end loss
IEEE Transactions on Information Theory
| Hi-index | 0.01 |
Reverse engineering of the Internet is a valuable activity. Apart from providing scientific insight, the resulting datasets are invaluable in providing realistic network scenarios for other researchers. The Rocketfuel project attempted this process, but it is surprising how little effort has been made to validate its results. This paper concentrates on validating a particular inference methodology used to obtain link weights on a network. There is a basic difficulty in assessing the accuracy of such inferences in that a non-unique set of link-weights may produce the same routing, and so simple measurements of accuracy (even where ground truth data are available) do not capture the usefulness of a set of inferred weights. We propose a methodology based on predictive power to assess the quality of the weight inference. We used this to test Rocketfuel's algorithm, and our tests suggest that it is reasonably good particularly on certain topologies, though it has limitations when its underlying assumptions are incorrect.