Discovery of Network Properties with All-Shortest-Paths Queries

  • Davide Bilò
  • Thomas Erlebach
  • Matúš Mihalák
  • Peter Widmayer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5058)


We consider the problem of discovering properties (such as the diameter) of an unknown network G(V,E) with a minimum number of queries. Initially, only the vertex set V of the network is known. Information about the edges and non-edges of the network can be obtained by querying nodes of the network. A query at a node q ∈ V returns the union of all shortest paths from q to all other nodes in V. We study the problem as an online problem – an algorithm does not initially know the edge set of the network, and has to decide where to make the next query based on the information that was gathered by previous queries. We study how many queries are needed to discover the diameter, a minimal dominating set, a maximal independent set, the minimum degree, and the maximum degree of the network. We also study the problem of deciding with a minimum number of queries whether the network is 2-edge or 2-vertex connected. We use the usual competitive analysis to evaluate the quality of online algorithms, i.e., we compare online algorithms with optimum offline algorithms. For all properties except maximal independent set and 2-vertex connectivity we present and analyze online algorithms. Furthermore we show, for all the aforementioned properties, that “many” queries are needed in the worst case. As our query model delivers more information about the network than the measurement heuristics that are currently used in practise, these negative results suggest that a similar behavior can be expected in realistic settings, or in more realistic models derived from the all-shortest-paths query model.




Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Cheswick, B.: Internet mapping project,
  2. 2.
    Govindan, R., Tangmunarunkit, H.: Heuristics for Internet map discovery. In: Proceedings of the 19th Conference on Computer Communications (IEEE INFOCOM), Tel Aviv, Israel, March 2000, pp. 1371–1380 (2000)Google Scholar
  3. 3.
    DIMES: Mapping the internet,
  4. 4.
    Route Views Project: University of Oregon,
  5. 5.
    Beerliová, Z., Eberhard, F., Erlebach, T., Hall, A., Hoffmann, M., Mihalák, M.: Network discovery and verification. IEEE Journal on Selected Areas in Communications (JSAC) 24(12), 2168–2181 (2006)CrossRefGoogle Scholar
  6. 6.
    Diestel, R.: Graph Theory, 3rd edn. Graduate Texts in Mathematics, vol. 173. Springer, Heidelberg (2005)MATHGoogle Scholar
  7. 7.
    Rivest, R.L., Vuillemin, J.: On recognizing graph properties from adjacency metrices. Theoretical Computer Science 3, 371–384 (1976)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Ron, D.: Property testing. In: Handbook of Randomized Computing, vol. II, pp. 597–649. Kluwer Academic Publishers, Dordrecht (2001)Google Scholar
  9. 9.
    Chartrand, G., Zhang, P.: The theory and applications of resolvability in graphs: A survey. Congressus Numerantium 160, 47–68 (2003)MathSciNetMATHGoogle Scholar
  10. 10.
    Barrat, A., Erlebach, T., Mihalák, M., Vespignani, A.: A (short) survey on network discovery. Technical report, DELIS – Dynamically Evolving, Large-Scale Information Systems (2008)Google Scholar
  11. 11.
    Ram, L.S.: Tree-based graph reconstruction. Research Report of the European Graduate Program Combinatorics-Computation-Geometry (CGC) (March 2003)Google Scholar
  12. 12.
    Bilò, D., Erlebach, T., Mihalák, M., Widmayer, P.: Discovery of network properties with all-shortest-paths queries. Technical Report 591, Department of Computer Science, ETH Zurich (April 2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Davide Bilò
    • 1
  • Thomas Erlebach
    • 2
  • Matúš Mihalák
    • 1
  • Peter Widmayer
    • 1
  1. 1.Institute of Theoretical Computer ScienceETH ZurichSwitzerland
  2. 2.Department of Computer ScienceUniversity of LeicesterUnited Kingdom

Personalised recommendations