Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

International Conference on Research in Networking

NETWORKING 2012: NETWORKING 2012 pp 149–160Cite as

  1. Home
  2. NETWORKING 2012
  3. Conference paper
Obscure Giants: Detecting the Provider-Free ASes

Obscure Giants: Detecting the Provider-Free ASes

  • Syed Hasan20,21 &
  • Sergey Gorinsky20 
  • Conference paper
  • 965 Accesses

  • 5 Citations

Part of the Lecture Notes in Computer Science book series (LNCCN,volume 7290)

Abstract

Internet routing depends on economic relationships between ASes (Autonomous Systems). Despite extensive prior research of these relationships, their characterization remains imprecise. In this paper, we focus on provider-free ASes that reach the entire Internet without paying anyone for the traffic delivery. While the ground truth about PFS (set of the provider-free ASes) lies outside the public domain, we use trustworthy non-verifiable sources as a baseline for result validation. Straightforward extraction of PFS from public datasets of inter-AS economic relationships yields poor results. Then, we develop a more sophisticated Temporal Cone (TC) algorithm that relies on topological statistics (customer cones of ASes) and exploits the temporal diversity of the datasets. Our evaluation shows that the TC algorithm infers PFS from the same public datasets with a significantly higher accuracy. We also assess the sensitivity of the TC algorithm to its parameters.

Keywords

  • Internet economics
  • transit
  • provider-free ASes

Download conference paper PDF

References

  1. Akella, A., Maggs, B., Seshan, S., Shaikh, A., Sitaraman, R.: A Measurement-based Analysis of Multihoming. In: Proceedings of ACM SIGCOMM (2003)

    Google Scholar 

  2. Augustin, B., Krishnamurthy, B., Willinger, W.: IXPs: Mapped? In: Proceedings of ACM SIGCOMM (2009)

    Google Scholar 

  3. Chen, K., Choffnes, D.R., Potharaju, R., Chen, Y., Bustamante, F.E., Pei, D., Zhao, Y.: Where the Sidewalk Ends: Extending the Internet AS Graph using Traceroutes from P2P users. In: Proceedings of ACM CoNEXT (2009)

    Google Scholar 

  4. Cooperative Association for Internet Data Analysis: AS Relationships, http://www.caida.org/data/active/as-relationships

  5. Dhamdhere, A., Dovrolis, C.: Ten Years in the Evolution of the Internet Ecosystem. In: Proceedings of ACM IMC (2008)

    Google Scholar 

  6. Dhamdhere, A., Dovrolis, C.: The Internet is Flat: Modeling the Transition from a Transit Hierarchy to a Peering Mesh. In: Proceedings of ACM CoNEXT (2010)

    Google Scholar 

  7. Dimitropoulos, X., Krioukov, D., Fomenkov, M., Huffaker, B., Hyun, Y., Claffy, K., Riley, G.: AS Relationships: Inference and Validation. In: ACM SIGCOMM CCR (2007)

    Google Scholar 

  8. Gao, L.: On Inferring Autonomous System Relationships in the Internet. IEEE/ACM Trans. Netw. (2001)

    Google Scholar 

  9. Ge, Z., Figueiredo, D., Jaiswal, S., Gao, L.: Hierarchical Structure of the Logical Internet Graph. In: Proceedings of SPIE ITCOM (2001)

    Google Scholar 

  10. Georgia Institute of Technology, AS Topology Data, http://www.cc.gatech.edu/~amogh/topology.html

  11. Gregori, E., Improta, A., Lenzini, L., Rossi, L., Sani, L.: BGP and Inter-AS Economic Relationships. In: Domingo-Pascual, J., Manzoni, P., Palazzo, S., Pont, A., Scoglio, C. (eds.) NETWORKING 2011, Part II. LNCS, vol. 6641, pp. 54–67. Springer, Heidelberg (2011)

    CrossRef  Google Scholar 

  12. Hasan, S., Gorinsky, S.: Obscure Giants: Detecting the Provider-free ASes. Technical report, TR-IMDEA Networks-2011-3 (December 2011), http://www.networks.imdea.org/portals/8/Downloads/Publications/Technical-Reports/TR-IMDEA-Networks-2011-3.pdf

  13. Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations. In: Proceedings of ACM SIGKDD (2005)

    Google Scholar 

  14. Ma, R.T.B., Chiu, D.M., Lui, J.C.S., Misra, V., Rubenstein, D.: On Cooperative Settlement Between Content, Transit and Eyeball Internet Service Providers. In: Proceedings of ACM CoNEXT (2008)

    Google Scholar 

  15. Mahajan, R., Zhang, M., Poole, L., Pai, V.: Uncovering Performance Differences among Backbone ISPs with Netdiff. In: Proceedings of NSDI (2008)

    Google Scholar 

  16. Oliveira, R., Pei, D., Willinger, W., Zhang, B., Zhang, L.: The (in)Completeness of the Observed Internet AS-level Structure. IEEE/ACM Trans. Netw. (2010)

    Google Scholar 

  17. Subramanian, L., Agarwal, S., Rexford, J., Katz, R.: Characterizing the Internet Hierarchy from Multiple Vantage Points. In: Proceedings of IEEE INFOCOM (2002)

    Google Scholar 

  18. University of California Los Angeles: Internet Topology Collection, http://irl.cs.ucla.edu/topology

  19. Wikipedia: Tier 1 Network, http://en.wikipedia.org/wiki/Tier_1_network

  20. Wikipedia: Tier 1 Network: 25/3/2009 revision, http://en.wikipedia.org/w/index.php?&oldid=279646779

  21. Wikipedia: Tier 1 Network: 5/6/2009 revision, http://en.wikipedia.org/w/index.php?&oldid=294566542

  22. Wikipedia: Tier 1 Network, 10/2/2011 revision, http://en.wikipedia.org/w/index.php?&oldid=413097463

  23. Wu, J., Zhang, Y., Mao, Z.M., Shin, K.G.: Internet Routing Resilience to Failures: Analysis and Implications. In: Proceedings of ACM CoNEXT (2007)

    Google Scholar 

  24. Xia, J., Gao, L.: On the Evaluation of AS Relationship Inferences. In: Proceedings of IEEE GLOBECOM (2004)

    Google Scholar 

  25. Zhang, B., Liu, R., Massey, D., Zhang, L.: Collecting the Internet AS-level Topology. In: ACM SIGCOMM CCR (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute IMDEA Networks, Spain

    Syed Hasan & Sergey Gorinsky

  2. Carlos III University of Madrid, Spain

    Syed Hasan

Authors
  1. Syed Hasan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sergey Gorinsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Telecommunications Engineering, Czech Technical University in Prague, Technicka 2, 166 27, Prague 6, Czech Republic

    Robert Bestak & Lukas Kencl & 

  2. Bell Labs, Alcatel-Lucent, 600 Mountain Avenue, 07974-0636, Murray Hill, NJ, USA

    Li Erran Li

  3. Instituto IMDEA Networks, Avenida del Mar Mediterraneo 22, 28918, Leganes (Madrid), Spain

    Joerg Widmer

  4. Tsinghua-ChinaCache Joint Laboratory, Tsinghua University, FIT 3-429, Haidian District, 100016, Beijing, China

    Hao Yin

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 IFIP International Federation for Information Processing

About this paper

Cite this paper

Hasan, S., Gorinsky, S. (2012). Obscure Giants: Detecting the Provider-Free ASes. In: Bestak, R., Kencl, L., Li, L.E., Widmer, J., Yin, H. (eds) NETWORKING 2012. NETWORKING 2012. Lecture Notes in Computer Science, vol 7290. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30054-7_12

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-30054-7_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30053-0

  • Online ISBN: 978-3-642-30054-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature