On inferring autonomous system relationships in the internet
IEEE/ACM Transactions on Networking (TON)
Understanding BGP misconfiguration
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Quantifying path exploration in the internet
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Lord of the links: a framework for discovering missing links in the internet topology
IEEE/ACM Transactions on Networking (TON)
The impact of IXPs on the AS-level topology structure of the Internet
Computer Communications
Acyclic type-of-relationship problems on the internet
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Inferring AS relationships: dead end or lively beginning?
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Obscure giants: detecting the provider-free ASes
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part II
On the incompleteness of the AS-level graph: a novel methodology for BGP route collector placement
Proceedings of the 2012 ACM conference on Internet measurement conference
AS relationships, customer cones, and validation
Proceedings of the 2013 conference on Internet measurement conference
Improving the reliability of inter-AS economic inferences through a hygiene phase on BGP data
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
The structure of the Internet is still unknown even though it provides services for most of the world. Its current configuration is the result of complex economic interactions developed in the last 20 years among important carriers and ISPs. Although with only some success, in the last few years some research has tried to shed light on the economic relationships established among ASes. The typical approaches have two phases: in the first, data from BGP monitors is gathered to infer the Internet AS-level topology graph, while in the second phase, algorithms are instantiated on this graph to derive economic tags for all edges between nodes (i.e. ASes). This paper provides significant findings for both steps. Specifically, regarding the second step, a small set of transit-free ASes and the lifespan of any AS paths are the input to an algorithm that we have devised which assigns an economic tag to each AS connection. The quality of inferred tags is expressed by a weight which takes into consideration the lifespan of the connection it refers to, as well as the outcome of the so called two-way validation approach. Regarding the first step the paper reports another valuable contribution targeted at identifying and cleaning the presence of fake connections induced by typos.