Robustness of the Internet at the topology and routing level
Erlebach, Thomas × Hall, Alexander Moonen, Linda Panconesi, Alessandro Spieksma, Frits Vukadinovic, Danica #
Lecture Notes in Computer Science vol:4028 pages:260-274
2nd Workshop on Dependable System Software, Computing, Networks location:Lowenberb, GERMANY date:13-14 Oct 2005
Classical measures of network robustness are the number of disjoint paths between two nodes and the size of a smallest cut separating them. In the Internet, the paths that traffic can take are constrained by the routing policies of the individual autonomous systems (ASs). These policies mainly depend on the economic relationships between ASs, e.g., customer-provider or peer-to-peer. Paths that are consistent with these policies can be modeled as valley-free paths. We give an overview of existing approaches to the inference of AS relationships, and we survey recent results concerning the problem of computing a maximum number of disjoint valley-free paths between two given nodes, and the problem of computing a smallest set of nodes whose removal disconnects two given nodes with respect to all valley-free paths. For both problems, we discuss NP-hardness and inapproximability results, approximation algorithms, and exact algorithms based on branch-and-bound techniques. We also summarize experimental findings that have been obtained with these algorithms in a comparison of different graph models of the AS-level Internet with respect to robustness properties.