AS relationships: Inference and validation

Computer Communication Review

Volumn 37, Issue 1, 2007, Pages 29-40

  Dimitropoulos, Xenofontas ^a,b   Krioukov, Dmitri ^b   Fomenkov, Marina ^b   Huffaker, Bradley ^b   Hyun, Young ^b   Claffy, K C ^b   Riley, George ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b CAIDA ^*  (United States)

Author keywords

As relationships; Inference; Routing policies

Indexed keywords

AS RELATIONSHIPS; AUTONOMOUS SYSTEM (ASS); CONTRACTUAL RELATIONSHIPS; INFERENCE; INFERENCE TECHNIQUES; MEASURING TECHNIQUE; NETWORK ADMINISTRATOR; ROUTING POLICIES;

COMMUNICATION;

SURVEYS;

EID: 84876393159     PISSN: 01464833     EISSN: 19435819     Source Type: Conference Proceeding    
DOI: 10.1145/1198255.1198259     Document Type: Review

References (30)

1. Algorithmic Solutions Software GmbH. L E D A library, 2004. http://www.algorithmic-solutions.com/enleda.htm.
2. I. Alvarez-Hamelin, L. Dall'Asta, A. Barrat, and A. Vespignani. k-core decomposition: A tool for the analysis of large scale Internet graphs. arXiv:cs.NI/0511007.
3. I. Alvarez-Hamelin, L. Dall'Asta, A. Barrat, and A. Vespignani. k-core decomposition: A tool for the visualization of large scale networks. arXiv:cs.NI/0504107.
4. G. D. Battista, M. Patrignani, and M. Pizzonia. Computing the types of the relationships between Autonomous Systems. In IEEE INFOCOM, 2003.
5. S. Benson, Y. Ye, and X. Zhang. A dual-scaling algorithm for semidefinite programming, 2004. http://www-unix.mcs.anl.gov/~benson/dsdp/.
6. S. Busygin. QUick ALmost EXact maximum weight clique/independent set solver. http://www.busygin.dp.ua/npc.html.
7. CAIDA. AS Relationships Data. Research Project. http://www.caida.org/ data/active/as-relationships/.
8. CAIDA. Automated Autonomous System (AS) ranking. Research Project. http://as-rank.caida.org.
9. H. Chang, R. Govindan, S. Jamin, S. J. Shenker, and W. Willinger. Towards capturing representative AS-level Internet topologies. Computer Networks Journal, 44:737-755, April 2004.
10. R. Cohen, M. Gonen, and A. Wool. Bounding the bias of tree-like sampling in IP topologies. arXiv:cs.NI/0611157.
11. Y. Collette and P. Siarry. Multiobjective Optimization: Principles and Case Studies. Springer-Verlag, Berlin, 2003.
12. L. Dall'Asta, I. Alvarez-Hamelin, A. Barrat, A. Vázquez, and A. Vespignani. Exploring networks with traceroute-like probes: Theory and simulations. Theoretical Computer Science, Special Issue on Complex Networks, 2005.
13. X. Dimitropoulos, D. Krioukov, B. Huffaker, kc claffy, and G. Riley. Inferring AS relationships: Dead end or lively beginning? In Proceedings of 4th Workshop on Efficient and Experimental Algorithms (WEA' 05), May 2005.
14. T. Erlebach, A. Hall, and T. Schank. Classifying customer-provider relationships in the Internet. In Proceedings of the IASTED International Conference on Communications and Computer Networks (CCN), 2002.
15. L. Gao. On inferring Autonomous System relationships in the Internet. In IEEE/ACM Transactions on Networking, December 2001.
16. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco, 1979.
17. M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42(6):1115-1145, 1995.
18. P. Mahadevan, D. Krioukov, M. Fomenkov, B. Huffaker, X. Dimitropoulos, k. claffy, and A. Vahdat. The Internet AS-level topology: Three data sources and one definitive metric. ACM Computer Communications Review, 36(1):17-26, 2006.
19. R. Mahajan, D. Wetherall, and T. Anderson. Understanding BGP misconfiguration. In ACM SIGCOMM, August 2002.
20. Z. M. Mao, L. Qiu, J. Wang, and Y. Zhang. On AS-level path inference. In SIGMETRICS, 2005.
21. D. Meyer. University of Oregon Route Views Project, 2004.
22. W. Muhlbauer, A. Feldmann, O. Maennel, M. Roughan, and S. Uhlig. Building an AS-topology model. In ACM SIGCOMM, 2006.
23. D. Raz and R. Cohen. The Internet dark matter: on the missing links in the AS connectivity map. In INFOCOM, 2006.
24. M. Rimondini. Statistics and comparisons about two solutions for computing the types of relationships between Autonomous Systems, 2002. http://www.dia.uniroma3.it/~compunet/files/ToR-solutions-comparison.pdf.
25. Y. Shavitt and E. Shir. DIMES: Let the Internet measure itself. Computer Communication Review, 35(5), 2005.
26. L. Subramanian, S. Agarwal, J. Rexford, and R. H. Katz. Characterizing the Internet hierarchy from multiple vantage points. In IEEE INFOCOM, 2002.
27. L. Subramanian, M. Caesar, C. T. Ee, M. Handley, M. Mao, S. Shenker, and I. Stoica. HLP: A next generation inter-domain routing protocol. In ACM SIGCOMM, 2005.
28. H. Tangmunarunkit, J. Doyle, R. Govindan, S. Jamin, W. Willinger, and S. Shenker. Does AS size determine AS degree? ACM Computer Communication Review, October 2001.
29. S. Uhlig, O. Maennel, and W. Muelbauer. Modeling as a necessary step for understanding Internet-wide route propagation. In WIRED: Workshop on Internet Routing Evolution and Design, 2006.
30. J. Xia and L. Gao. On the evaluation of AS relationship inferences. In IEEE GLOBECOM, 2004.