Inferring AS relationships: Dead end or lively beginning?

Lecture Notes in Computer Science

Volumn 3503, Issue , 2005, Pages 113-125

  Dimitropoulos, Xenofontas ^a,b   Krioukov, Dmitri ^b   Huffaker, Bradley ^b   Claffy, Kc ^b   Riley, George ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b Cooperative Association for Internet Data Analysis ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; RELAXATION PROCESSES;

BUSINESS RELATIONSHIPS; MULTIOBJECTIVE OPTIMIZATION; OBJECTIVE FUNCTIONS; SEMIDEFINITE PROGRAMMING;

ALGORITHMS;

EID: 24944532051     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11427186_12     Document Type: Conference Paper

References (19)

1. Battista, G.D., Patrignani, M., Pizzonia, M.: Computing the types of the relationships between Autonomous Systems. In: IEEE INFOCOM. (2003)
2. Erlebach, T., Hall, A., Schank, T.: Classifying customer-provider relationships in the Internet. In: Proceedings of the IASTED International Conference on Communications and Computer Networks (CCN). (2002)
3. Gao, L.: On inferring Autonomous System relationships in the Internet. In: IEEE/ACM Transactions on Networking. (2001)
4. Subramanian, L., Agarwal, S., Rexford, J., Katz, R.H.: Characterizing the Internet hierarchy from multiple vantage points. In: IEEE INFOCOM. (2002)
5. Xia, J., Gao, L.: On the evaluation of AS relationship inferences. In: IEEE GLOBECOM. (2004)
6. Rimondini, M.: 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.
7. Siganos, G., Faloutsos, M.: Analyzing BGP policies: Methodology and tool. In: IEEE INFOCOM. (2004)
8. Huber, B., Leinen, S., O'Dell, R., Wattenhofer, R.: Inferring AS relationships beyond counting edges. Technical Report TR 446, ETH Zürich (2004)
9. Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear time algorithm for testing the truth of certain quantified boolean formulae. Information Processing Letters 8 (1979) 121-123
10. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer Verlag, Berlin (1999)
11. Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM 42 (1995) 1115-1145
12. th International IPCO Conference on Integer Programming and Combinatorial Optimization. (2002)
13. th Annual ACM Symposium on Theory of Computing. (1997)
14. Chang, H., Govindan, R., Jamin, S., Shenker, S.J., Willinger, W.: Towards capturing representative AS-level Internet topologies. Computer Networks Journal 44 (2004) 737-755
15. Meyer, D.: University of Oregon Route Views Project (2004)
16. : A traceroute server list, http://www.traceroute.org (2004)
17. Benson, S., Ye, Y., Zhang, X.: A dual-scaling algorithm for semidefinite programming (2004) http://www-unix.mcs.anl.gov/~benson/dsdp/.
18. GmbH, A.S.S.: L E D A library (2004) http://www.algorithmic-solutions. com/enleda.htm.
19. Collette, Y., Siarry, P.: Multiobjective Optimization: Principles and Case Studies. Springer-Verlag, Berlin (2003)