Abstract
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.
This paper was partly supported by the MOTIA European Project (JLS/2009/CIPS/AG/C1-016). This publication reflects the views only of the authors, and the Commission cannot be held responsible for any use which may be made of the information contained therein.
Chapter PDF
Similar content being viewed by others
References
Battista, G.D., Patrignani, M., Pizzonia, M.: Computing the types of the relationships between autonomous systems. In: IEEE INFOCOM (2003)
Dimitropoulos, X., Krioukov, D., Huffaker, B., Claffy, K.C., Riley, G.: Inferring AS relationships: Dead end or lively beginning? In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 113–125. Springer, Heidelberg (2005)
Erlebach, T., Hall, A., Schank, T.: Classifying customer-provider relationships in the Internet. TIK-Report (145) (July 2002)
Gao, L.: On inferring autonomous system relationships in the Internet. IEEE/ACM Transactions on Networking 9(6), 733–745 (2001)
Gao, L., Wang, F.: The extent of AS path inflation by routing policies. In: Globecom 2002, Conference Records, vol. 1-3, pp. 2180–2184 (2002)
Gregori, E., Improta, A., Lenzini, L., Orsini, C.: The impact of IXPs on the AS-level topology structure of the internet. Computer Communications 34(1), 68–82 (2011)
He, Y., Siganos, G., Faloutsos, M., Krishnamurthy, S.: Lord of the links: A framework for discovering missing links in the internet topology. IEEE/ACM Transactions on Networking 17(2), 391–404 (2009)
Huston, G.: Interconnection, peering, and settlements. In: INET 1999 Abstracts Book (1999)
Kosub, S., Maaß, M.G., Täubig, H.: Acyclic type-of-relationship problems on the Internet. In: Erlebach, T. (ed.) CAAN 2006. LNCS, vol. 4235, pp. 98–111. Springer, Heidelberg (2006)
Mahajan, R., Wetherall, D., Anderson, T.: Understanding BGP misconfiguration. In: Proc. ACM SIGCOMM, vol. 32(4), pp. 3–16 (2002)
Oliveira, R., Pei, D., Willinger, W., Zhang, B., Zhang, L.: Quantifying the completeness of the observed internet AS-level structure. UCLA Technical Report, TR 080026 (September 2008)
Oliveira, R., Zhang, B., Izhak-Ratzin, R.: Quantifying path exploration in the internet. In: ACM Internet Measurement Conference, IMC (October 2006)
Subramanian, L., Agarwal, S., Rexford, J., Katz, R.H.: Characterizing the internet hierarchy from multiple vantage points. In: Proc. IEEE INFOCOM, pp. 618–627 (June 2002)
Xia, J., Gao, L.: On the evaluation of as relationship inferences. In: Proc. of IEEE GLOBECOM, vol. 3, pp. 1373–1377 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 IFIP International Federation for Information Processing
About this paper
Cite this paper
Gregori, E., Improta, A., Lenzini, L., Rossi, L., Sani, L. (2011). BGP and Inter-AS Economic Relationships. In: Domingo-Pascual, J., Manzoni, P., Palazzo, S., Pont, A., Scoglio, C. (eds) NETWORKING 2011. NETWORKING 2011. Lecture Notes in Computer Science, vol 6641. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20798-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-20798-3_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20797-6
Online ISBN: 978-3-642-20798-3
eBook Packages: Computer ScienceComputer Science (R0)