Skip to Main content Skip to Navigation
Conference papers

Network Verification via Routing Table Queries

Abstract : We address the problem of verifying the accuracy of a map of a network by making as few measurements as possible on its nodes. This task can be formalized as an optimization problem that, given a graph G = (V,E), and a query model specifying the information returned by a query at a node, asks for finding a minimum-size subset of nodes of G to be queried so as to univocally identify G. This problem has been faced w.r.t. a couple of query models assuming that a node had some global knowledge about the network. Here, we propose a new query model based on the local knowledge a node instead usually has. Quite naturally, we assume that a query at a given node returns the associated routing table, i.e., a set of entries which provides, for each destination node, a corresponding (set of) first-hop node(s) along an underlying shortest path. First, we show that any network of n nodes needs Ω(loglogn) queries to be verified. Then, we prove that there is no o(logn)-approximation algorithm for the problem, unless \sf P=\sf NP , even for networks of diameter 2. On the positive side, we provide an O(logn)-approximation algorithm to verify a network of diameter 2, and we give exact polynomial-time algorithms for paths, trees, and cycles of even length.
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-00647362
Contributor : Ralf Klasing Connect in order to contact the contributor
Submitted on : Thursday, December 1, 2011 - 8:29:49 PM
Last modification on : Friday, December 3, 2021 - 3:38:07 PM

Links full text

Identifiers

Collections

Citation

Evangelos Bampas, Davide Bilò, Guido Drovandi, Luciano Gualà, Ralf Klasing, et al.. Network Verification via Routing Table Queries. SIROCCO 2011, Jun 2011, Gdańsk, Poland. pp.270--281, ⟨10.1007/978-3-642-22212-2_24⟩. ⟨hal-00647362⟩

Share

Metrics

Record views

289