Network Discovery and Verification

Due to its fast, dynamic, and distributed growth process, it is hard to obtain an accurate map of the Internet. In many cases, such a map-representing the structure of the Internet as a graph with nodes and links-is a prerequisite when investigating properties of the Internet. A common way to obtain such maps is to make certain local measurements at a small subset of the nodes, and then to combine these in order to "discover" (an approximation of) the actual graph. Each of these measurements is potentially quite costly. It is thus a natural objective to minimize the number of measurements which still discover the whole graph. We formalize this problem as a combinatorial optimization problem and consider it for two different models characterized by different types of measurements. We give several upper and lower bounds on the competitive ratio (for the online network discovery problem) and the approximation ratio (for the offline network verification problem) in both models. Furthermore, for one of the two models, we compare four simple greedy strategies in an experimental analysis

[1]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[2]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[3]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[4]  G. Di Battista,et al.  Computing the types of the relationships between autonomous systems , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[5]  J. Frankel,et al.  The gnutella protocol specification v0.4 document revision 1.2 , 2000 .

[6]  A. R. Curtis,et al.  Standard Mathematical Tables , 1971, The Mathematical Gazette.

[7]  Azer Bestavros,et al.  On the Marginal Utility of Deploying Measurement Infrastructure , 2000 .

[8]  H. S. Shapiro,et al.  A Combinatory Detection Problem , 1963 .

[9]  Cristopher Moore,et al.  On the bias of traceroute sampling: Or, power-law degree distributions in regular graphs , 2005, JACM.

[10]  Ramesh Govindan,et al.  An analysis of Internet inter-domain topology and route stability , 1997, Proceedings of INFOCOM '97.

[11]  B. Cheswick,et al.  The Internet mapping project , 1998 .

[12]  Alessandro Vespignani,et al.  Statistical theory of Internet exploration. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Rajeev Rastogi,et al.  Robust Monitoring of Link Delays and Faults in IP Networks , 2003, IEEE/ACM Transactions on Networking.

[14]  R. Ravi,et al.  On the Approximability of the Minimum Test Collection Problem , 2001, ESA.

[15]  Alessandro Vespignani,et al.  Exploring networks with traceroute-like probes: theory and simulations , 2004, Theor. Comput. Sci..

[16]  Azer Bestavros,et al.  On the marginal utility of network topology measurements , 2001, IMW '01.

[17]  András Sebö,et al.  On Metric Generators of Graphs , 2004, Math. Oper. Res..

[18]  Ramesh Govindan,et al.  Heuristics for Internet map discovery , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[19]  David R. Wood,et al.  On the Metric Dimension of Cartesian Products of Graphs , 2005, SIAM J. Discret. Math..

[20]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[21]  S. N. Dorogovtsev,et al.  Size-dependent degree distribution of a scale-free growing network. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  Lixin Gao,et al.  On inferring autonomous system relationships in the Internet , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[23]  Azriel Rosenfeld,et al.  Landmarks in Graphs , 1996, Discret. Appl. Math..

[24]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[25]  Anja Feldmann,et al.  Methodology for Estimating Network Distances of Gnutella Neighbors , 2004, GI Jahrestagung.

[26]  Madhu Sudan,et al.  Improved Low-Degree Testing and its Applications , 1997, STOC '97.

[27]  Randy H. Katz,et al.  Characterizing the Internet hierarchy from multiple vantage points , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[28]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[29]  Michael A. Bender,et al.  The power of team exploration: two robots can learn unlabeled directed graphs , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[30]  Ping Zhang,et al.  Conditional resolvability in graphs: a survey , 2004, Int. J. Math. Math. Sci..

[31]  G. Chartrand,et al.  The theory and applications of resolvability in graphs: A survey , 2003 .