Text of Efﬁcient discovery of network topology and routing policy in
1. Efcient discovery of network topology and routing policy in the Internet Neil Timothy Spring A dissertation submitted in partial fulllment of the requirements for the degree of Doctor of Philosophy University of Washington 2004 Program Authorized to Offer Degree: Computer Science and Engineering
2. University of Washington Graduate School This is to certify that I have examined this copy of a doctoral dissertation by Neil Timothy Spring and have found that it is complete and satisfactory in all respects, and that any and all revisions required by the nal examining committee have been made. Co-Chairs of Supervisory Committee: David J. Wetherall Thomas E. Anderson Reading Committee: Thomas E. Anderson David J. Wetherall John Zahorjan Date:
3. In presenting this dissertation in partial fulllment of the requirements for the doctoral degree at the University of Washington, I agree that the Library shall make its copies freely available for inspection. I further agree that extensive copying of this dissertation is allowable only for scholarly purposes, consistent with fair use as prescribed in the U.S. Copyright Law. Requests for copying or reproduction of this dissertation may be referred to Bell and Howell Information and Learning, 300 North Zeeb Road, Ann Arbor, MI 48106-1346, to whom the author has granted the right to reproduce and sell (a) copies of the manuscript in microform and/or (b) printed copies of the manuscript made from microform. Signature Date
4. University of Washington Abstract Efcient discovery of network topology and routing policy in the Internet by Neil Timothy Spring Co-Chairs of Supervisory Committee: Associate Professor David J. Wetherall Department of Computer Science and Engineering Professor Thomas E. Anderson Department of Computer Science and Engineering Little is known about the structure and conguration of the ISP networks that constitute the Internet. This shortage of information is a consequence of a fundamental principle of the Internet architecture: that constituent ISPs are administered independently. ISP networks connect by a narrow interface that supports the delivery of data but hides the implemen- tation and behavior of a network from its neighbors. One consequence of this isolation between networks is that, although operators have inside information for their own net- works, it is difcult to recognize and x problems that span administrative boundaries. In this dissertation, I focus on what can be discovered by an outsider: a user or re- searcher without access to privileged information. I show that the network topologies and routing policies of ISP networks can be discovered despite the narrowness of the interface between them. To do this, I develop and evaluate techniques to measure structured, router- level ISP network topologies and infer intra-domain and peering routing policies. To make these techniques efcient, I use a philosophy of choosing to collect only measurements
5. likely to yield new information. This enables the techniques to run on a large network measurement platform, composed of hundreds of public traceroute servers, to produce an accurate result. I applied and evaluated my techniques to map ten diverse ISP networks and characterize the routing policies of 65 ISP networks. The results are a set of ISP topologies that are several times more complete than previous maps and the rst quantitative study of peering routing policy. This data highlights the diversity of ISP networks and can be used by others to better understand network operation and protocol design choices.