ACM Home Page
Please provide us with feedback. Feedback
Building an AS-topology model that captures route diversity
Full text PdfPdf (530 KB)
Source Applications, Technologies, Architectures, and Protocols for Computer Communication archive
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications table of contents
Pisa, Italy
SESSION: Measurement table of contents
Pages: 195 - 206  
Year of Publication: 2006
ISBN:1-59593-308-5
Also published in ...
Authors
Wolfgang Mühlbauer  TU München
Anja Feldmann  TU München
Olaf Maennel  University of Adelaide
Matthew Roughan  University of Adelaide
Steve Uhlig  Université catholique de Louvain
Sponsors
SIGCOMM: ACM Special Interest Group on Data Communication
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 90,   Citation Count: 22
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1159913.1159937
What is a DOI?

ABSTRACT

An understanding of the topological structure of the Internet is needed for quite a number of networking tasks, e. g., making decisions about peering relationships, choice of upstream providers, inter-domain traffic engineering. One essential component of these tasks is the ability to predict routes in the Internet. However, the Internet is composed of a large number of independent autonomous systems (ASes) resulting in complex interactions, and until now no model of the Internet has succeeded in producing predictions of acceptable accuracy.We demonstrate that there are two limitations of prior models: (i) they have all assumed that an Autonomous System (AS) is an atomic structure - it is not, and (ii) models have tended to oversimplify the relationships between ASes. Our approach uses multiple quasi-routers to capture route diversity within the ASes, and is deliberately agnostic regarding the types of relationships between ASes. The resulting model ensures that its routing is consistent with the observed routes. Exploiting a large number of observation points, we show that our model provides accurate predictions for unobserved routes, a first step towards developing structural mod-els of the Internet that enable real applications.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
 
4
O. Bonaventure and B. Quoitin, "Common utilizations of the BGP community attribute, "2003, Internet Draft
5
6
7
8
 
9
Z. M. Mao, D. Johnson, J. Rexford, J. Wang, and R. Katz, "Scalable and accurate identification of AS-level forwarding paths, "in Proc. IEEE INFOCOM, 2004.
10
 
11
R. Teixeira, N. Duffield, J. Rexford, and M. Roughan, "Traffic matrix reloaded: impact of routing changes, "in Proc. ACM PAM, 2005.
12
 
13
"University of Oregon RouteViews project, "http://www.routeviews.org/.
 
14
 
15
L. Subramanian, S. Agarwal, J. Rexford, and R. Katz, "Characterizing the Internet hierarchy from multiple vantage points, "in Proc. IEEE INFOCOM, 2002.
 
16
L. Gao, "On Inferring Autonomous System Relationships in the Internet, "Proc. IEEE Global Internet, 2000.
17
 
18
G. Battista, M. Patrignani, and M. Pizzonia, "Computing the types of the relationships between autonomous systems, "in Proc. IEEE INFOCOM, 2003.
19
20
 
21
B. Quoitin and S. Uhlig, "Modeling the routing of an Autonomous System with C-BGP, "IEEE Network Magazine, 2005.
 
22
"RIPE's routing information service, "http://data.ris.ripe.net/.
23
24
 
25
C. Labovitz, R. Malan, and F. Jahanian, "Origins of Internet routing instability, "in Proc. IEEE INFOCOM, 1999.
 
26
H. Tangmunarunkit, R. Govindan, S. Shenker, and D. Estrin, "The impact of Internet policy on Internet paths, "in Proc. IEEE INFOCOM, 2001.
27
28
29
 
30
B. Quoitin, "C-BGP, an efficient BGP simulator, "http://cbgp.info.ucl.ac.be/, 2003.
 
31
 
32
Intel-DANTE, "Intel-DANTE monitoring project, "http://www.cambridge.intel-research.net/monitoring/dante/.
 
33
Abilene, "The Abilene Observatory: Abilene routing data, "http://abilene.internet2.edu/observatory/.
34
 
35
W. B. Norton, "The art of peering: the peering playbook, "2002.
 
36
G. Siganos and M. Faloutsos, "Analyzing BGP Policies: Methodology and Tool, "in Proc. IEEE INFOCOM, 2004.
 
37
38
39
40
 
41
G. Siganos and M. Faloutsos, "BGP Routing: A Study at Large Time Scale, "in Proc. IEEE Global Internet, 2002.
 
42
43
 
44
R. Musunuri and J. A. Cobb, "An Overview of Solutions to Avoid Persistent BGP Divergence, "IEEE Network Magazine, 2005.
45
 
46
M. Caesar and J. Rexford, "BGP Routing Policies in ISP Networks, "IEEE Network Magazine, 2005.
 
47
48

CITED BY  22

Collaborative Colleagues:
Wolfgang Mühlbauer: colleagues
Anja Feldmann: colleagues
Olaf Maennel: colleagues
Matthew Roughan: colleagues
Steve Uhlig: colleagues