2002
DOI: 10.1145/511399.511380
|View full text |Cite
|
Sign up to set email alerts
|

Towards capturing representative AS-level Internet topologies

Abstract: Abstract-Recent studies concerning the Internet connectivity at the AS level have attracted considerable attention. These studies have exclusively relied on the BGP data from Oregon route-views [1] to derive some unexpected and intriguing results. The Oregon route-views data sets reflect AS peering relationships, as reported by BGP, seen from a handful of vantage points in the global Internet. The possibility that these data sets from Oregon route-views may provide only a very sketchy picture of the complete i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
114
0
3

Year Published

2004
2004
2014
2014

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 86 publications
(119 citation statements)
references
References 18 publications
2
114
0
3
Order By: Relevance
“…Moreover, we found out using the algorithm presented in [13] (and similar to the results presented in [13] over older data), that the simpler 0-ToR problem (i.e. regardless the existence of cycles), does not have a valley-free solution as well 8 . Next, we execute the different algorithms over the entire Route-Views database.…”
Section: Experiments and Simulation Resultssupporting
confidence: 76%
See 2 more Smart Citations
“…Moreover, we found out using the algorithm presented in [13] (and similar to the results presented in [13] over older data), that the simpler 0-ToR problem (i.e. regardless the existence of cycles), does not have a valley-free solution as well 8 . Next, we execute the different algorithms over the entire Route-Views database.…”
Section: Experiments and Simulation Resultssupporting
confidence: 76%
“…If the orientation of an edge, assigned by a specific algorithm is different from the actual orientation of the edge, it means that there is a mismatch between the export policy inferred by the algorithm to the actual export policy of one 8 We refer to the 0-ToR problem as the decision version of the ToR problem that determines if there is a solution without any invalid path. Type I Type II provider-customer Type II Type I peer-peer Type I Type I sibling-sibling Type II Type II TABLE I EXPORT POLICY AND TYPE OF RELATIONSHIP or both nodes.…”
Section: Experiments and Simulation Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The collection and gathering of data related to the AS level topology have been the subject of a intense debate in the community [3,11,12,13,14,15]. As a consequence, more complete databases have been constructed.…”
Section: As-level Topology: Metrics Generators Databasesmentioning
confidence: 99%
“…One important issue we have to point out with this suggestion is the possibility of the incompleteness of topologies generated by using these routing tables. Authors in [15] studied the topologies generated using Oregon Route Views BGP data and compared that with topologies they constructed using the data they collected employing several different Looking Glass sites and Internet Routing Registry (IRR). As a result of the study, authors found out that "there are at least about 25%-50% more AS connections in the Internet than commonly-used BGP-derived AS maps reveal".…”
Section: Simulation Environment and Topologiesmentioning
confidence: 99%