Building an AS-topology model that captures route diversity

被引:61
作者
Muehlbauer, Wolfgang [1 ]
Feldmann, Anja
Maennel, Olaf
Roughan, Matthew
Uhlig, Steve
机构
[1] Tech Univ Munich, D-8000 Munich, Germany
[2] Univ Adelaide, Adelaide, SA 5005, Australia
[3] Catholic Univ Louvain, B-1348 Louvain, Belgium
关键词
algorithms; experimentation; measurement; bGP; inter-domain routing; route diversity; routing policies;
D O I
10.1145/1151659.1159937
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 [计算机科学与技术];
摘要
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 models of the Internet that enable real applications.
引用
收藏
页码:195 / 206
页数:12
相关论文
共 45 条
[1]
*ABL, AB OBS AB ROUT DAT
[2]
ANDERSEN DG, 2002, P ACM IMW
[3]
[Anonymous], P IEEE INFOCOM
[4]
[Anonymous], P ACM SIGMETRICS
[5]
BASU A, 2002, P ACM SIGCOMM
[6]
BATTISTA G, 2003, P IEEE INFOCOM
[7]
BONAVENTURE O, 2003, COMMON UTILIZATIONS
[8]
CAESAR M, 2005, IEEE NETWORK MAGAZIN
[9]
CHANG DF, 2003, P ICNP
[10]
CHANG H, 2004, COMPUTER NETWORKS J