Evaluating the Quality of a Network Topology through Random Walks

  • Anne-Marie Kermarrec
  • Erwan Le Merrer
  • Bruno Sericola
  • Gilles Trédan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5218)

Abstract

In this brief announcement we propose a distributed algorithm to assess the connectivity quality of a network, be it physical or logical. In large complex networks, some nodes may play a vital role due to their position (e.g. for routing or network reliability). Assessing global properties of a graph, as importance of nodes, usually involves lots of communications; doing so while keeping the overhead low is an open challenge. To that end, centrality notions have been introduced by researchers (see e.g. [Fre77]) to rank the nodes as a function of their importance in the topology. Some of these techniques are based on computing the ratio of shortest-paths that pass through any graph node. This approach has a limitation as nodes “close” from the shortest-paths do not get a better score than any other arbitrary ones. To avoid this drawback, physician Newman proposed a centralized measure of betweenness centrality [New03] based on random walks: counting for each node the number of visits of a random walk travelling from a node i to a target node j, and then averaging this value by all graph source/target pairs. Yet this approach relies on the full knowledge of the graph for each system node, as the random walk target node should be known by advance; this is not an option in large-scale networks. We propose a distributed solution that relies on a single random walk travelling in the graph; each node only needs to be aware of its topological neighbors to forward the walk.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Fei95]
    Feige. A tight upper bound on the cover time for random walks on graphs. RSA 6 (1995)Google Scholar
  2. [Fre77]
    Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40(1), 35–41 (1977)CrossRefGoogle Scholar
  3. [KMST08]
    Kermarrec, A.-M., Le Merrer, E., Sericola, B., Trédan, G.: Rr-6534 inria - evaluating topology quality through random walks (2008)Google Scholar
  4. [New03]
    Newman, M.E.J.: A measure of betweenness centrality based on random walks (September 2003)Google Scholar
  5. [SRD+06]
    Stutzbach, D., Rejaie, R., Duffield, N., Sen, S., Willinger, W.: On unbiased sampling for unstructured peer-to-peer networks. In: IMC 2006, pp. 27–40. ACM, New York (2006)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Anne-Marie Kermarrec
    • 1
  • Erwan Le Merrer
    • 1
  • Bruno Sericola
    • 1
  • Gilles Trédan
    • 1
  1. 1.IRISA/INRIARennesFrance

Personalised recommendations