Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/49345
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Conference paper |
Title: | On the predictive power of shortest-path weight inference |
Author: | Coyle, A. Kraetzl, M. Maennel, O. Roughan, M. |
Citation: | Proceedings of the 8th ACM SIGCOMM conference on Internet measurement, 2008:pp.305-310 |
Publisher: | ACM |
Publisher Place: | Greece |
Issue Date: | 2008 |
ISBN: | 9781605583341 |
Conference Name: | Internet Measurement Conference (2008 : Vouliagmeni, Greece) |
Editor: | Papagiannaki, K. Zhang, Z.-L. |
Statement of Responsibility: | Andrew Coyle, Miro Kraetzl, Olaf Maennel and Matthew Roughan |
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. |
Description: | Copyright © 2008 ACM |
DOI: | 10.1145/1452520.1452556 |
Published version: | http://dx.doi.org/10.1145/1452520.1452556 |
Appears in Collections: | Aurora harvest Mathematical Sciences publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.