research-article

A novel methodology to address the internet AS-level data incompleteness

Editor: R. Srikant Authors:

Enrico Gregori,

Alessandro Improta,

Luciano Lenzini,

Luca SaniAuthors Info & Claims

IEEE/ACM Transactions on Networking (TON), Volume 23, Issue 4

Pages 1314 - 1327

https://doi.org/10.1109/TNET.2014.2323128

Published: 01 August 2015 Publication History

Abstract

In the last decade, many studies have used the Internet autonomous system (AS)-level topology to perform several analyses, from discovering its graph properties to assessing its impact on the effectiveness of worm-containment strategies. Yet, the Border Gateway Protocol (BGP) data used to reveal the topologies are far from complete. Our contribution is threefold. First, we analyze BGP data currently gathered by the most famous route collector projects, highlighting and explaining the causes of their incompleteness. We found that large areas of the Internet are not properly captured due to the geographical location of route collector feeders and due to BGP filters, such as export policies and decision processes. Second, we propose a methodology based on a new metric, named p2c-distance, which is able to: 1) identify the minimum number of ASs required to obtain an Internet AS-level topology that is closer to reality; and 2) identify a ranking list of these ASs to show that it is possible to obtain nonnegligible coverage improvements with a limited number of appropriately chosen feeding ASs. Third, we characterize the ASs that were found to be part of the solution of the above covering problems. We found that the route collectors are rarely connected to these ASs, thus highlighting that much effort is needed to devise a route collector infrastructure that ideally would be able to capture a complete view of the Internet.

References

[1]

E. Gregori, A. Improta, L. Lenzini, L. Rossi, and L. Sani, "On the incompleteness of the AS-level graph: a Novel methodology for BGP route collector placement," in Proc. ACM SIGCOMM IMC, 2012, pp. 253--264.

[2]

Y. Rekhter, T. Li, and S. Hares, "RFC 4271---A border gateway protocol 4 (BGP-4)," 2006.

[3]

K. Keys, "Internet-scale IP alias resolution techniques," Comput. Commun. Rev., vol. 40, no. 1, pp. 50--55, 2010.

[4]

D. Achlioptas, A. Clauset, D. Kempe, and C. Moore, "On the bias of traceroute sampling: or, power-law degree distributions in regular graphs," in Proc. ACM STOC, 2005, pp. 694--703.

[5]

B. Huffaker, A. Dhamdhere, M. Fomenkov, and K. C. Claffy, "Toward topology dualism: Improving the accuracy of AS annotations for routers," in Proc. PAM, 2010, pp. 101--110.

[6]

Y. Zhang, R. Oliveira, H. Zhang, and L. Zhang, "Quantifying the pitfalls of traceroute in AS connectivity inference," in Proc. PAM, 2010, pp. 91--100.

[7]

R. Oliveira, D. Pei, W. Willinger, B. Zhang, and L. Zhang, "The (In)Completeness of the observed Internet AS-level structure," IEEE/ACM Trans. Netw., vol. 18, no. 1, pp. 109--122, Feb. 2010.

[8]

X. Dimitropoulos et al., "AS relationships: Inference and validation," Comput. Commun. Rev., vol. 37, no. 1, pp. 29--40, 2007.

[9]

B. Ager et al., "Anatomy of a large European IXP," in Proc. ACM SIGCOMM, 2012, pp. 163--174.

[10]

Y. He, G. Siganos, M. Faloutsos, and S. V. Krishnamurthy, "Lord of the links: A framework for discovering missing links in the Internet topology," IEEE/ACM Trans. Netw., vol. 17, no. 2, pp. 391--404, Apr. 2009.

[11]

R. Cohen and D. Raz, "The Internet dark matter---On the missing links in the AS connectivity map," in Proc. IEEE INFOCOM, 2006, pp. 1--12.

[12]

M. R. Garey and D. S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness. New York, NY, USA: Freeman, 1990.

[13]

E. J. McCluskey, "Minimization of Boolean functions," Bell Syst. Tech. J., vol. 35, no. 6, pp. 1417--1444, 1956.

[14]

W. V. Quine, "A way to simplify truth functions," Amer. Math. Monthly, vol. 62, no. 9, pp. 627--631, 1955.

[15]

W. V. Quine, "On cores and prime implicants of truth functions," Amer. Math. Monthly, vol. 66, no. 9, pp. 755--760, 1959.

[16]

T. H. Cormen, C. Stein, R. L. Rivest, and C. E. Leiserson, Introduction to Algorithms, 2nd ed. New York, NY, USA: McGraw-Hill, 2001.

[17]

R. Govindan and A. Reddy, "An analysis of Internet inter-domain topology and route stability," in Proc. IEEE INFOCOM, 1997, pp. 850--857.

[18]

H. Chang, R. Govindan, S. Jamin, S. Shenker, and W. Willinger, "Towards capturing representative AS-level Internet topologies," Comput. Netw., vol. 44, no. 6, pp. 737--755, 2004.

[19]

K. Chen, C. Hu, W. Zhang, Y. Chen, and B. Liu, "On the eyeshots of BGP vantage points," in Proc. IEEE GLOBECOM, 2009, pp. 3558--3563.

[20]

L. Gao, "On inferring autonomous system relationships in the Internet," IEEE/ACM Trans. Netw., vol. 9, no. 6, pp. 733--738, Dec. 2001.

[21]

M. Roughan, S. J. Tuke, and O. Maennel, "Bigfoot, sasquatch, the yeti and other missing links: What we don't know about the AS graph," in Proc. ACM SIGCOMM IMC, 2008, pp. 325--330.

[22]

M. Roughan, W. Willinger, O. Maennel, D. Perouli, and R. Bush, "10 lessons from 10 years of measuring and modeling the Internet's autonomous systems," IEEE J. Sel. Areas Commun., vol. 29, no. 9, pp. 1810--1821, Oct. 2011.

[23]

University of Colorado, Ft. Collins, CO, USA, "BGPmon," {Online}. Available: http://bgpmon.netsec.colostate.edu

[24]

Packet Clearing House, San Francisco, CA, USA, "Packet Clearing House," {Online}. Available: http://www.pch.net

[25]

RIPE NCC, Amsterdam, The Netherlands, "RIPE NCC routing information service," {Online}. Available: http://www.ripe.net/data-tools/stats/ris/routing-information-service

[26]

University of Oregon, Eugene, OR, USA, "University of Oregon Route Views project," {Online}. Available: http://www.routeviews.org

[27]

L. Blunk, M. Karir, and C. Labovitz, "RFC 6396---Multi-threaded routing toolkit (MRT) routing information export format," 2011.

[28]

"Tier 1 network," 2014 {Online}. Available: http://en.wikipedia.org/wiki/Tier_1_network

[29]

B. Augustin, B. Krishnamurthy, and W. Willinger, "IXPs: mapped?," in Proc. ACM SIGCOMM IMC, 2009, pp. 336--349.

[30]

A. Dhamdhere, H. Cherukuru, C. Dovrolis, and K. Claffy, "Measuring the evolution of Internet peering agreements," in Proc. IFIP-TC6 NETWORKING, 2012, vol. 2, pp. 136--148.

[31]

"Maxmind GeoLite database," {Online}. Available: http://dev.maxmind.com/geoip/geolite

[32]

M. Luckie, B. Huffaker, A. Dhamdhere, V. Giotsas, and K. Claffy, "AS relationships, customer cones, and validation," in Proc. ACM SIGCOMM IMC, 2013, pp. 243--256.

[33]

E. Gregori, A. Improta, L. Lenzini, L. Rossi, and L. Sani, "BGP and inter-AS economic relationships," in Proc. IFIP-TC6 NETWORKING, 2011, vol. 2, pp. 54--67.

[34]

IIT-CNR, Pisa, Italy, "IIT-CNR isolario project," {Online}. Available: http://www.isolario.it

[35]

E. Gregori, A. Improta, L. Lenzini, and C. Orsini, "The impact of IXPs on the AS-level topology structure of the Internet," Comput. Commun., vol. 34, no. 1, pp. 68--82, 2010.

[36]

J. C. Cardona Restrepo and R. Stanojevic, "A history of an Internet exchange point," Comput. Commun. Rev., vol. 42, no. 2, pp. 58--64, 2012.

[37]

D. S. Hochbaum, Approximation Algorithms for NP-Hard Problems. Boston, MA, USA: PWS, 1997.

[38]

G. J. Woeginger, "Exact algorithms for NP-hard problems: A survey," Combinat. Optim., Eureka, You Shrink!, LNCS, vol. 2570, pp. 185--207, 2003.

[39]

O. Coudert, "Two-level logic minimization: an overview," Integration VLSI J., vol. 17, no. 2, pp. 97--140, 1994.

[40]

E. Gregori, A. Improta, L. Lenzini, L. Rossi, and L. Sani, "Inferring geography from BGP raw data," in Proc. IEEE NETSCICOM, 2012, pp. 208--213.

[41]

W. B. Norton, The Internet Peering Playbook: Connecting to the Care of the Internet. Palo Alto, CA, USA: DrPeering Press, 2011.

[42]

T. S. O. Coudert, Two-Level Logic Minimization, Logic Synthesis and Verification. Norwell, MA, USA: Kluwer, 2001.

[43]

J. F. Gimpel, "A reduction technique for prime implicant tables," IEEE Trans. Electron. Comput., vol. EC-14, no. 4, pp. 535--541, Aug. 1965.

[44]

E. Gregori, A. Improta, L. Lenzini, L. Rossi, and L. Sani, "An enhancement for Networking '11 Tagging Algorithm," Internal Rep., 2012 {Online}. Available: http://www.isolario.it/index.php?page=publications

[45]

K. Chen et al., "Where the sidewalk ends: Extending the Internet AS graph using traceroutes from P2P users," in Proc. ACM SIGCOMM CoNEXT, 2009, pp. 217--228.

[46]

University of Pisa, Pisa, Italy, "University of Pisa Portolan project," {Online}. Available: http://portolan.iet.unipi.it

[47]

"DIMES project," 2009 {Online}. Available: http://www.netdimes.org

[48]

P. Marchetta, P. Mérindol, B. Donnet, A. Pescapé, and J.-J. Pansiot, "Topology discovery at the router level: a New hybrid tool targeting ISP networks," IEEE J. Sel. Areas Commun., vol. 29, no. 6, pp. 1776--1787, Oct. 2011.

[49]

A. Faggiani, E. Gregori, A. Improta, L. Lenzini, V. Luconi, and L. Sani, "A study on traceroute potentiality in revealing the Internet AS-level topology," in Proc. IFIP-TC6 NETWORKING, 2014, to be published.

Cited By

Kirci ETorsiello VVanbever L(2024)What is the next hop to more granular routing models?Proceedings of the 23rd ACM Workshop on Hot Topics in Networks10.1145/3696348.3696859(343-351)Online publication date: 18-Nov-2024
https://dl.acm.org/doi/10.1145/3696348.3696859
Prehn LFeldmann ALevin DMislove AAmann JLuckie M(2021)How biased is our validation (data) for AS relationships?Proceedings of the 21st ACM Internet Measurement Conference10.1145/3487552.3487825(612-620)Online publication date: 2-Nov-2021
https://dl.acm.org/doi/10.1145/3487552.3487825
Zhuang SWang JWang JPan ZWu TLi FZhang ZCarle GOtt J(2021)Discovering obscure looking glass sites on the web to facilitate internet measurement researchProceedings of the 17th International Conference on emerging Networking EXperiments and Technologies10.1145/3485983.3494857(426-439)Online publication date: 2-Dec-2021
https://dl.acm.org/doi/10.1145/3485983.3494857
Show More Cited By

Index Terms

A novel methodology to address the internet AS-level data incompleteness

Recommendations

On the incompleteness of the AS-level graph: a novel methodology for BGP route collector placement
IMC '12: Proceedings of the 2012 Internet Measurement Conference

In the last decade many studies have used the Internet AS-level topology to perform several analyses, from discovering its graph properties to assessing its impact on the effectiveness of worm-containment strategies. Yet, the BGP data typically used to ...
On inferring autonomous system relationships in the internet

The Internet consists of rapidly increasing number of hosts interconnected by constantly evolving networks of links and routers. Interdomain routing in the Internet is coordinated by the Border Gateway Protocol (BGP). BGP allows each autonomous system (...
Inter-domain collaborative routing (IDCR): Server selection for optimal client performance

Communication between institutions, or domains, residing in the Internet requires a route to be created between the routing domains. Each of these domains is controlled by a single administrative authority, and is referred to as an autonomous system (AS)...

Comments

Information & Contributors

Information

Published In

cover image IEEE/ACM Transactions on Networking

IEEE/ACM Transactions on Networking Volume 23, Issue 4

August 2015

341 pages

ISSN:1063-6692

Editor:
R. Srikant
Univ. Illinois at Urbana-Champaign, Urbana, IL

Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 August 2015

Published in TON Volume 23, Issue 4

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
120
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 17 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Kirci ETorsiello VVanbever L(2024)What is the next hop to more granular routing models?Proceedings of the 23rd ACM Workshop on Hot Topics in Networks10.1145/3696348.3696859(343-351)Online publication date: 18-Nov-2024
https://dl.acm.org/doi/10.1145/3696348.3696859
Prehn LFeldmann ALevin DMislove AAmann JLuckie M(2021)How biased is our validation (data) for AS relationships?Proceedings of the 21st ACM Internet Measurement Conference10.1145/3487552.3487825(612-620)Online publication date: 2-Nov-2021
https://dl.acm.org/doi/10.1145/3487552.3487825
Zhuang SWang JWang JPan ZWu TLi FZhang ZCarle GOtt J(2021)Discovering obscure looking glass sites on the web to facilitate internet measurement researchProceedings of the 17th International Conference on emerging Networking EXperiments and Technologies10.1145/3485983.3494857(426-439)Online publication date: 2-Dec-2021
https://dl.acm.org/doi/10.1145/3485983.3494857
Jin ZShi XYang YYin XWang ZWu J(2020)TopoScopeProceedings of the ACM Internet Measurement Conference10.1145/3419394.3423627(266-280)Online publication date: 27-Oct-2020
https://dl.acm.org/doi/10.1145/3419394.3423627
Gosain DAgarwal AChakravarty SAcharya H(2017)The Devil's in The DetailsProceedings of the 33rd Annual Computer Security Applications Conference10.1145/3134600.3134608(577-589)Online publication date: 4-Dec-2017
https://dl.acm.org/doi/10.1145/3134600.3134608
Gregori EGuidi BImprota ASani L(2017)ICEComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2017.07.009126:C(162-173)Online publication date: 24-Oct-2017
https://dl.acm.org/doi/10.1016/j.comnet.2017.07.009

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents