On the predictive power of shortest-path weight inference
Date
2008
Authors
Coyle, A.
Kraetzl, M.
Maennel, O.
Roughan, M.
Editors
Papagiannaki, K.
Zhang, Z.-L.
Zhang, Z.-L.
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement, 2008:pp.305-310
Statement of Responsibility
Andrew Coyle, Miro Kraetzl, Olaf Maennel and Matthew Roughan
Conference Name
Internet Measurement Conference (2008 : Vouliagmeni, Greece)
Abstract
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.
School/Discipline
Dissertation Note
Provenance
Description
Copyright © 2008 ACM