Acyclic Type-of-Relationship Problems on the Internet
We contribute to the study of inferring commercial relationships between autonomous systems (AS relationships) from observable BGP routes. We deduce several forbidden patterns of AS relationships that impose a certain type of acyclicity on the AS graph. We investigate algorithms for solving the acyclic all-paths type-of-relationship problem, i.e., given a set of AS paths, find an orientation of the edges according to some types of AS relationships such that the oriented AS graph is acyclic (with respect to the forbidden patterns) and all AS paths are valley-free. As possible AS relationships we include customer-to-provider, peer-to-peer, and sibling-to-sibling. Moreover, we examine a number of problem versions parameterized by sets K and U where K is the set of edge types available for describing explicit pre-knowledge and U is the set of edge types available for completion of partial orientations. A complete complexity classification of all 56 cases (8 type sets for pre-knowledge and 7 type sets for completion) is given. The most relevant practical result is a linear-time algorithm for finding an acyclic and valley-free completion using customer-to-provider relations given any kind of pre-knowledge. Interestingly, if we allow sibling-to-sibling relations for completions then most of the non-trivial inference problems become NP-hard.
KeywordsAutonomous System Edge Type Partial Orientation Oriented Cycle Acyclic Orientation
Unable to display preview. Download preview PDF.
- 2.Di Battista, G., Erlebach, T., Hall, A., Patrignani, M., Pizzonia, M., Schank, T.: Computing the types of the relationships between autonomous systems. IEEE/ACM Trans. Networking (to appear)Google Scholar
- 6.Govindan, R., Reddy, A.: An analysis of Internet inter-domain topology and route stability. In: Proc. 16th Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 1997), pp. 850–857. IEEE, Los Alamitos (1997)Google Scholar
- 8.Kosub, S., Maaß, M.G., Täubig, H.: Acyclic type-of-relationship problems on the Internet. Technical Report TUM-I0605, Fakultät für Informatik, Technische Universität München (March 2006)Google Scholar
- 9.Labovitz, C., Ahuja, A., Wattenhofer, R., Venkatachary, S.: The impact of Internet policy and topology on delayed routing convergence. In: Proc. 20th Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2001), pp. 537–546. IEEE, Los Alamitos (2001)Google Scholar
- 10.Norton, W.B.: Internet Service Providers and peering. Equinix White Paper, Equinix, Inc. (2001)Google Scholar
- 11.Siganos, G., Faloutsos, M.: Analyzing BGP policies: Methodology and tool. In: Proc. 23rd Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2004), pp. 1640–1651. IEEE, Los Alamitos (2004)Google Scholar
- 12.Subramanian, L., Agarwal, S., Rexford, J., Katz, R.H.: Characterizing the Internet hierarchy from multiple vantage points. In: Proc. 21st Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2002), pp. 618–627. IEEE, Los Alamitos (2002)Google Scholar
- 14.Tangmunarunkit, H., Govindan, R., Shenker, S., Estrin, D.: The impact of routing policy on Internet paths. In: Proc. 20th Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2001), pp. 736–742. IEEE, Los Alamitos (2001)Google Scholar
- 15.van Beijnum, I.: BGP. O’Reilly & Associates, Sebastopol (2002)Google Scholar
- 16.Xia, J., Gao, L.: On the evaluation of AS relationship inferences. In: Proc. 47th IEEE Global Telecommunications Conference (Globecom 2004), vol. 3, pp. 1373–1377. IEEE, Los Alamitos (2004)Google Scholar