%0 Conference Proceedings
%T BGP and Inter-AS Economic Relationships
%+ National Research Council [Italy] (CNR)
%+ University of Pisa - Università di Pisa
%+ IMT Institute for Advanced Studies [Lucca]
%A Gregori, Enrico
%A Improta, Alessandro
%A Lenzini, Luciano
%A Rossi, Lorenzo
%A Sani, Luca
%Z Part 2: Pricing
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 10th IFIP Networking Conference (NETWORKING)
%C Valencia, Spain
%Y Jordi Domingo-Pascual
%Y Pietro Manzoni
%Y Sergio Palazzo
%Y Ana Pont
%Y Caterina Scoglio
%I Springer
%3 NETWORKING 2011
%V LNCS-6641
%N Part II
%P 54-67
%8 2011-05-09
%D 2011
%R 10.1007/978-3-642-20798-3_5
%K BGP
%K Internet
%K Autonomous System
%K Tagging algorithm
%K Inter-AS Economics
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%2 https://inria.hal.science/hal-01597984/document
%2 https://inria.hal.science/hal-01597984/file/978-3-642-20798-3_5_Chapter.pdf
%L hal-01597984
%U https://inria.hal.science/hal-01597984
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC6
%~ IFIP-NETWORKING
%~ IFIP-LNCS-6641