Matrix analysis
On inferring autonomous system relationships in the internet
IEEE/ACM Transactions on Networking (TON)
Internet Routing Architectures, Second Edition
Internet Routing Architectures, Second Edition
BGP routing stability of popular destinations
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Power laws and the AS-level internet topology
IEEE/ACM Transactions on Networking (TON)
Flow classification by histograms: or how to go on safari in the internet
Proceedings of the joint international conference on Measurement and modeling of computer systems
AS relationships: inference and validation
ACM SIGCOMM Computer Communication Review
Inferring AS relationships: dead end or lively beginning?
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
| Hi-index | 0.00 |
Exploring topological structure at Autonomous System (AS) level is indispensable for understanding most issues in Internet services. Previous models of AS graph involve address or connectivity information separately, and neither of these information can serve as a comprehensive metric for evaluating an AS's contribution to the global routing. In this paper, we propose a new model for AS ranking named IDAV (Inter-Domain Access Volume). IDAV introduces the quantity of routed addresses into AS graph, and enriches the methodology of Internet marco structure inference. In IDAV, the magnitude of AS is measured with the primary eigenvector of the access volume matrix (Carriage Matrix) for AS graph. We construct the AS graph by parsing the forwarding information bases in border gateways. The computation, compared with previous approaches, demonstrate that IDAV model results in more accurate AS rankings. We believe the IDAV model is promisingly useful for studying inter-domain routing and Internet service behavior.