Estimating AS relationships for application-layer traffic optimization

Authors:
Hirochika Asai;Hiroshi Esaki
Affiliations:
The University of Tokyo, Japan;The University of Tokyo, Japan
Venue:
ETM'10 Proceedings of the Third international conference on Incentives, overlays, and economic traffic control
Year:
2010

Citing 10
Cited 0

On inferring autonomous system relationships in the internet

IEEE/ACM Transactions on Networking (TON)
Internet Interconnection Economic Model and its Analysis: Peering and Settlement

Netnomics
Does AS size determine degree in as topology?

ACM SIGCOMM Computer Communication Review - Special issue on wireless extensions to the internet
AS relationships: inference and validation

ACM SIGCOMM Computer Communication Review
Economics of network pricing with multiple ISPs

IEEE/ACM Transactions on Networking (TON)
Computing the types of the relationships between autonomous systems

IEEE/ACM Transactions on Networking (TON)
Can internet video-on-demand be profitable?

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
P4p: provider portal for applications

Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Cuts and disjoint paths in the valley-free path model of internet BGP routing

CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
Inferring AS relationships: dead end or lively beginning?

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms

Quantified Score

Hi-index	0.00

Visualization

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.