Acyclic type-of-relationship problems on the internet

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4235 LNCS, Issue , 2006, Pages 98-111

  Kosub, Sven ^a   Maaß, Moritz G ^a   Täubig, Hanjo ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ACYCLICITY; AS GRAPH; AUTONOMOUS SYSTEMS; COMMERCIAL RELATIONSHIP; FORBIDDEN PATTERN; INFERENCE PROBLEM; LINEAR-TIME ALGORITHMS; NON-TRIVIAL; NP-HARD; PARAMETERIZED; PARTIAL ORIENTATION; PEER TO PEER;

CLUSTERING ALGORITHMS; COMPUTATIONAL COMPLEXITY;

LANDFORMS;

EID: 42149086030     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11922377_9     Document Type: Conference Paper

References (16)

1. H. Chang, R. Govindan, S. Jamin, S. J. Shenker, W. Willinger. Towards capturing representative AS-level Internet topologies. Comput. Netw., 44(6):737-755, 2004.
2. G. Di Battista, T. Erlebach, A. Hall, M. Patrignani, M. Pizzonia, T. Schank. Computing the types of the relationships between autonomous systems. IEEE/ACM Trans. Networking. To appear.
3. X. Dimitriopoulos, D. V. Krioukov, B. Huffaker, K. C. Claffy, G. F. Riley. Inferring AS relationships: Dead end or lively beginning? In Proc. 4th International Workshop on Experimental and Efficient Algorithms (WEA'05), LNCS 3503, pp. 113-125. Springer, 2005.
4. L. Gao. On inferring autonomous system relationships in the Internet. IEEE/ACM Trans. Networking, 9(6):733-745, 2001.
5. L. Gao, J. Rexford. Stable Internet routing without global coordination. IEEE/ACM Trans. Networking, 9(6):681-692, 2001.
6. R. Govindan, A. Reddy. An analysis of Internet inter-domain topology and route stability. In Proc. 16th Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'97), pp. 850-857. IEEE, 1997.
7. T. G. Griffin, G. T. Wilfong. An analysis of BGP convergence properties. Comput. Commun. Rev., 29(4):277-288, 1999.
8. S. Kosub, M. G. Maaß, H. Täubig. Acyclic type-of-relationship problems on the Internet. Technical Report TUM-I0605, Fakultät für Informatik, Technische Universität München, March 2006.
9. C. Labovitz, A. Ahuja, R. Wattenhofer, S. Venkatachary. The impact of Internet policy and topology on delayed routing convergence. In Proc. 20th Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'01), pp. 537-546. IEEE, 2001.
10. W. B. Norton. Internet Service Providers and peering. Equinix White Paper, Equinix, Inc., 2001.
11. G. Siganos, M. Faloutsos. Analyzing BGP policies: Methodology and tool. In Proc. 23rd Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'04), pp. 1640-1651. IEEE, 2004.
12. L. Subramanian, S. Agarwal, J. Rexford, R. H. Katz. Characterizing the Internet hierarchy from multiple vantage points. In Proc. 21st Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'02), pp. 618-627. IEEE, 2002.
13. H. Tangmunarunkit, J. Doyle, R. Govindan, S. Jamin, S. J. Shenker, W. Willinger. Does AS size determine degree in AS topology? Comput. Commun. Rev., 31(5):7-10, 2001.
14. H. Tangmunarunkit, R. Govindan, S. Shenker, D. Estrin. The impact of routing policy on Internet paths. In Proc. 20th Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'01), pp. 736-742. IEEE, 2001.
15. I. van Beijnum. BGP. O'Reilly & Associates, 2002.
16. J. Xia, L. Gao. On the evaluation of AS relationship inferences. In Proc. 47th IEEE Global Telecommunications Conference (Globecom'04), vol. 3, pp. 1373-1377. IEEE, 2004.