Advertisement

Estimating AS Relationships for Application-Layer Traffic Optimization

  • Hirochika Asai
  • Hiroshi Esaki
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6236)

Abstract

The relationships among autonomous systems (ASes) on the Internet are categorized into two major types: transit and peering. We propose a method for quantifying AS’ network size called magnitude by recursively analyzing the AS adjacency matrix converted from a spanning subgraph of the AS-level Internet topology. We estimate the relationships of inter-AS links by comparing differences in magnitude of two neighboring ASes, while showing differences in the magnitude, representing AS relationships appropriately through three evaluations. We also discuss the applicability of this method to AS relationships-aware application-layer traffic optimization.

Keywords

Network Size Span Subgraph Recursive Computation Content Delivery Network Transit Inference 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Shakkottai, S., Srikant, R.: Economics of network pricing with multiple ISPs. IEEE/ACM Trans. Netw. 14(6), 1233–1245 (2006)CrossRefGoogle Scholar
  2. 2.
    Xie, H., Yang, Y.R., Krishnamurthy, A., Liu, Y.G., Silberschatz, A.: P4P: provider portal for applications. In: SIGCOMM 2008: ACM SIGCOMM 2008 Conference on Data Communication, pp. 351–362. ACM, New York (2008)CrossRefGoogle Scholar
  3. 3.
    The Internet Engineering Task Force (IETF): Application-layer traffic optimization (alto), http://datatracker.ietf.org/wg/alto/charter/
  4. 4.
    Asai, H., Esaki, H.: A content delivery path control architecture for the multi-domain P2P CDN system. In: Internet Conference 2008 (October 2008) (in Japanese)Google Scholar
  5. 5.
    Gao, L.: On inferring autonomous system relationships in the Internet. IEEE/ACM Transactions on Networking 9(6), 733–745 (2001)CrossRefGoogle Scholar
  6. 6.
    Battista, G.D., Erlebach, T., Hall, A., Patrignani, M., Pizzonia, M., Schank, T.: Computing the types of the relationships between autonomous systems. IEEE/ACM Trans. Netw. 15(2), 267–280 (2007)CrossRefGoogle Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    Dimitropoulos, X., Krioukov, D., Fomenkov, M., Huffaker, B., Hyun, Y., Claffy, K.C., Riley, G.: As relationships: inference and validation. SIGCOMM Comput. Commun. Rev. 37(1), 29–40 (2007)CrossRefGoogle Scholar
  9. 9.
    Erlebach, T., Hall, A., Panconesi, A., Vukadinovi, D.: Cuts and disjoint paths in the valley-free path model of Internet BGP routing. In: López-Ortiz, A., Hamel, A.M. (eds.) CAAN 2004. LNCS, vol. 3405, pp. 49–62. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  10. 10.
    Norton, W.B.: Internet service providers and peering (2000)Google Scholar
  11. 11.
    Weiss, M.B., Shin, S.J.: Internet interconnection economic model and its analysis: Peering and settlement. Netnomics 6(1), 43–57 (2004)CrossRefGoogle Scholar
  12. 12.
    Huang, C., Li, J., Ross, K.W.: Can internet video-on-demand be profitable? In: SIGCOMM 2007: Proceedings of the 2007 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 133–144. ACM, New York (2007)Google Scholar
  13. 13.
    Tangmunarunkit, H., Doyle, J., Govindan, R., Willinger, W., Jamin, S., Shenker, S.: Does AS size determine degree in AS topology? SIGCOMM Comput. Commun. Rev. 31(5), 7–8 (2001)CrossRefGoogle Scholar
  14. 14.
    Cooperative Association for Internet Data Analysis: The CAIDA AS Relationships Dataset (10/08/2009), http://www.caida.org/data/active/as-relationships/
  15. 15.
    University of Oregon: Route Views Project, http://www.routeviews.org/
  16. 16.
    Réseaux IP Européens Network Coordination Centre: Routing Information Service (RIS), http://www.ripe.net/projects/ris/

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Hirochika Asai
    • 1
  • Hiroshi Esaki
    • 1
  1. 1.The University of TokyoJapan

Personalised recommendations