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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Shakkottai, S., Srikant, R.: Economics of network pricing with multiple ISPs. IEEE/ACM Trans. Netw. 14(6), 1233–1245 (2006)
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)
The Internet Engineering Task Force (IETF): Application-layer traffic optimization (alto), http://datatracker.ietf.org/wg/alto/charter/
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)
Gao, L.: On inferring autonomous system relationships in the Internet. IEEE/ACM Transactions on Networking 9(6), 733–745 (2001)
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)
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)
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)
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)
Norton, W.B.: Internet service providers and peering (2000)
Weiss, M.B., Shin, S.J.: Internet interconnection economic model and its analysis: Peering and settlement. Netnomics 6(1), 43–57 (2004)
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)
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)
Cooperative Association for Internet Data Analysis: The CAIDA AS Relationships Dataset (10/08/2009), http://www.caida.org/data/active/as-relationships/
University of Oregon: Route Views Project, http://www.routeviews.org/
Réseaux IP Européens Network Coordination Centre: Routing Information Service (RIS), http://www.ripe.net/projects/ris/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Asai, H., Esaki, H. (2010). Estimating AS Relationships for Application-Layer Traffic Optimization. In: Stiller, B., Hoßfeld, T., Stamoulis, G.D. (eds) Incentives, Overlays, and Economic Traffic Control. ETM 2010. Lecture Notes in Computer Science, vol 6236. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15485-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-15485-0_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15484-3
Online ISBN: 978-3-642-15485-0
eBook Packages: Computer ScienceComputer Science (R0)