On the predictive power of shortest-path weight inference

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.

[1]  Antonio Nucci,et al.  IGP Link Weight Assignment for Operational Tier-1 Backbones , 2007, IEEE/ACM Transactions on Networking.

[2]  Brice Augustin,et al.  Measuring load-balanced paths in the internet , 2007, IMC '07.

[3]  Mikkel Thorup,et al.  Traffic engineering with estimated traffic matrices , 2003, IMC '03.

[4]  Mikkel Thorup,et al.  Robust optimization of OSPF/IS-IS weights , 2003 .

[5]  Hong Shen,et al.  Multicast-based inference of network-internal loss , 2004, 7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings..

[6]  Renata Teixeira,et al.  In search of path diversity in ISP networks , 2003, IMC '03.

[7]  Kavé Salamatian,et al.  Traffic matrix estimation: existing techniques and new directions , 2002, SIGCOMM '02.

[8]  Celso C. Ribeiro,et al.  A Memetic Algorithm for OSPF Routing , 2002 .

[9]  Antonio Nucci,et al.  IGP link weight assignment for operational Tier-1 backbones , 2007, TNET.

[10]  Randy H. Katz,et al.  Characterizing the Internet hierarchy from multiple vantage points , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[11]  Donald F. Towsley,et al.  Multicast topology inference from measured end-to-end loss , 2002, IEEE Trans. Inf. Theory.

[12]  TaftNina,et al.  The problem of synthetically generating IP traffic matrices , 2005 .

[13]  Lixin Gao,et al.  On inferring and characterizing Internet routing policies , 2003, Journal of Communications and Networks.

[14]  Lixin Gao,et al.  On the evaluation of AS relationship inferences [Internet reachability/traffic flow applications] , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[15]  Carsten Lund,et al.  An information-theoretic approach to traffic matrix estimation , 2003, SIGCOMM '03.

[16]  Ratul Mahajan,et al.  The causes of path inflation , 2003, SIGCOMM '03.

[17]  Matthew Roughan,et al.  Simplifying the synthesis of internet traffic matrices , 2005, CCRV.

[18]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, SIGCOMM 2002.

[19]  Anja Feldmann,et al.  Building an AS-topology model that captures route diversity , 2006, SIGCOMM 2006.

[20]  Antonio Nucci,et al.  The problem of synthetically generating IP traffic matrices: initial recommendations , 2005, CCRV.

[21]  Ratul Mahajan,et al.  Colt ? ? ? ? ? ? ◦ DTAG ? ◦ • ◦ ? ? ? ? ! ◦ ? ? ? ◦ ◦ ? ? Eqip ? ? ? ? ? ? , 2003 .

[22]  Christophe Diot,et al.  Traffic matrix estimation: existing techniques and new directions , 2002, SIGCOMM 2002.