Computing the types of the relationships between autonomous systems

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 2003, Pages 156-165

  Di Battista, Giuseppe ^a   Patrignani, Maurizio ^a   Pizzonia, Maurizio ^a  

^a ROMA TRE UNIVERSITY   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; INTERNET; ROUTERS;

DATA SETS;

AUTONOMOUS AGENTS; ALGORITHMS;

AS PATHS; AUTONOMOUS SYSTEMS; DATA SETS; EFFICIENT ALGORITHM; NP-COMPLETENESS; ROUTING TABLE; STATE OF THE ART; TIME COMPLEXITY;

EID: 0042934007     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. L. Gao, "On inferring autonomous system relationships in the internet," IEEE/ACM Transactions on Networking, vol. 9, no. 6, pp. 733-745, Dec 2001.
2. L. Subramanian, S. Agarwal, J. Rexford, and R. Katz, "Characterizing the internet hierarchy from multiple vantage points," in Proc. IEEE INFOCOM 2002, 2002.
3. J. W. Stewart, BGP4: Inter-Domain Routing in the Internet. Reading, MA: Addison-Wesley, 1999.
4. C. Alaettinoglu, "Scalable router configuration for the internet," in Proc. IEEE IC3N, October 1996.
5. G. Huston, "Interconnection, peering, and settlements," in Proc. INET, June 1999.
6. R. Govindan and A. Reddy, "An analysis of internet inter-domain topology and route stability," in Proc. IEEE INFOCOM 1997, April 1997.
7. R. Govindan and H. Tangmunarunkit, "Heuristics for internet map discovery," in Proc. IEEE INFOCOM 2000, March 2000.
8. W. Theilmann and K. Rothermel, "Dynamic distance maps of the internet," in IEEE INFOCOM 2000. Tel-Aviv, Israel: IEEE, March 2000. [Online]. Available: citeseer.nj.nec.com/theilmann00dynamic.html
9. Z. Ge, D. R. Figueiredo, S. Jaiswal, and L. Gao, "On the hierarchical structure of the logical internet graph," in Proc. SPIE ITCom 2001, 2001.
10. L. Gao, T. G. Griffin, and J. Rexford, "Inherently safe backup routing with BGP," in IEEE INFOCOM 2001, Apr 2001, pp. 547-556.
11. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York, NY: W. H. Freeman, 1979.
12. B. Aspvall, M. F. Plass, and R. E. Tarjan, "A linear-time algorithm for testing the truth of certain quantified boolean formulas," Information Processing Letters, vol. 8, no. 3, pp. 121-123, 1979.
13. K. Mehlhorn, Data Structures and Algorithms. Springer Publishing Company, 1984, vol. 1-3.
14. K. Mehlhorn and S. Näher, LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999.
15. "Characterizing the internet hierarchy from multiple vantage points," http://www.cs.berkeley.edu/̃sagarwal/research/BGP-hierarchy/.
16. "University of Oregon Route Views project," http://www.routeviews.org.
17. U. Feige and M. Goemans, "Approximating the value of two prover proof systems, with applications to max 2sat and max dicut," in Proc. of 3rd Israel Symposium on the Theory of Computing and Systems, 1995, pp. 182-189.
18. V. Kann. "On the approximability of NP-complete optimization problems," Ph.D. dissertation, Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm, 1992.
19. L. Subramanian, personal communication.
20. G. Di Battista, M. Patrignani, and M. Pizzonia, "Computing the types of the relationships between autonomous systems," Dipartimento di Informatica e Automazione, Università di Roma Tre, Technical Report RT-DIA-73-2002, July 2002.
21. T. Erlebach, A. Hall, and T. Schank, "Classifying customer-provider relationships in the internet," ETH Zurich, Technical Report TIK-145, July 2002.
22. A. Carmignani, G. Di Battista, W. Didimo, F. Matera, and M. Pizzonia, "Visualization of the high level structure of the internet with hermes," J. of Graph Algorithms and Applications, vol. 6, no. 3, pp. 281-311, 2002.