Acyclic type-of-relationship problems on the internet: An experimental analysis

Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC

Volumn , Issue , 2007, Pages 221-226

  Hummel, Benjamin ^a   Kosub, Sven ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Algorithms; AS relationships; Inter domain routing

Indexed keywords

(1 1 1) ORIENTATION; ACYCLICITY; AUTONOMOUS SYSTEM (AS); BUSINESS RELATIONSHIPS; CARDINALITY; DATA SETS; EXPERIMENTAL ANALYSIS; EXPERIMENTAL STUDIES; HIGH QUALITY (HQ); INAPPROXIMABILITY; INTEGRAL PART; INTERNET MEASUREMENTS; NP HARDNESS; STATE-OF-THE-ART ALGORITHMS;

HEURISTIC METHODS; HEURISTIC PROGRAMMING; INTERNET; NUCLEAR PROPULSION; SEMICONDUCTING INTERMETALLICS;

HEURISTIC ALGORITHMS;

EID: 42149188782     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1298306.1298337     Document Type: Conference Paper

References (23)

1. C. Alaettinoǧlu. Scalable router configuration for the Internet. In ICCCN'96. IEEE, 1996.
2. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi. Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, 1999.
3. T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein. Introduction to Algorithms. 2nd edition. The MIT Press, 2001.
4. G. Di Battista, T. Erlebach, A. Hall, M. Patrignani, M. Pizzonia, T. Schank. Computing the types of the relationships between autonomous systems. IEEE/ACM Transactions on Networking, 15(2):267-280, 2007.
5. G. Di Battista, T. Refice, M. Rimondini. How to extract BGP peering information from the Internet Routing Registry. In MineNet'2006, pp. 317-322. ACM, 2006.
6. X. A. Dimitriopoulos, D. V. Krioukov, M. Fomenkov, B. Huffaker, Y. Hyun, K. C. Claffy, G. F. Riley. AS relationships: Inference and validation. ACM SIGCOMM Computer Communication Review, 37(1):31-40, 2007.
7. X. A. Dimitriopoulos, D. V. Krioukov, B. Huffaker, K. C. Claffy, G. F. Riley. Inferring AS relationships: Dead end or lively beginning? In WEA'OB, LNCS #3503, pp. 113-125. Springer, 2005.
8. L. Gao. On inferring autonomous system relationships in the Internet. IEEE/ACM Transactions on Networking, 9(6):733-745, 2001.
9. T. G. Griffin, G. T. Wilfong. An analysis of BGP convergence properties. ACM SIGCOMM Computer Communication Review, 29(4):277-288, 1999.
10. J. Hawkinson, T. Bates. Guidelines for creation, selection, and registration of an autonomous system (AS). RFC 1930, The Internet Society, 1996.
11. B. Hummel, S. Kosub. Acyclic type-of-relationship problems on the Internet: An experimental analysis. Technical Report TUM-I0709, Fakultät für Informatik, TU München, February 2007.
12. G. Huston. Interconnection, peering and settlements-Part II. The Internet Protocol Journal, 2(2):2-23, 1999.
13. T. Kernen, traceroute.org web site. http://www.traceroute.org.
14. S. Kosub, M. G. Maaß, H. Täubig. Acyclic type-of-relationship problems on the Internet. In CAAN'06, LNCS #4235, pp. 98-111. Springer, 2006.
15. Merit Network Inc. Internet Routing Registry. http://www.irr.net.
16. Y. Rekhter, T. Li. A Border Gateway Protocol 4 (BGP-4). RFC 1771, The Internet Society, 1995.
17. RIPE NCC. Routing Information Service (RIS). http://www.ripe.net/ris/.
18. G. Siganos, M. Faloutsos. Analyzing BGP policies: Methodology and tool. In INFOCOM'04, pp. 1640-1651. IEEE, 2004.
19. L. Subramanian, S. Agarwal, J. Rexford, R. H. Katz. Characterizing the Internet hierarchy from multiple vantage points. In INFOCOM'02, pp. 618-627. IEEE, 2002.
20. P. Traina, R. Chandra, T. Li. BGP community attribute. RFC 1997, The Internet Society, 1996.
21. University of Oregon. Route Views project page. http://www.routeviews. org.
22. I. van Beijnum. BGP. O'Reilly, 2002.
23. J. Xia, L. Gao. On the evaluation of AS relationship inferences. In Globecom'04, vol. 3, pp. 1373-1377. IEEE, 2004.