Determination of the topology of a directed network

  • Authors:
  • Darin Goldstein

  • Affiliations:
  • Computer Science Department, California State University, Long Beach, CA

  • Venue:
  • Information Processing Letters
  • Year:
  • 2003

Quantified Score

Hi-index 0.89

Visualization

Abstract

We consider strongly-connected, directed networks of identical synchronous, finite-state processors with in- and outdegree uniformly bounded by a network constant. Via a straightforward extension of Ostrovsky and Wilkerson's Backwards Communication Algorithm [Proc. 14th Annual Symp. on Principles of Distributed Computing, 1995], we exhibit a protocol which solves the Global Topology Determination Problem, the problem of having a root processor map the global topology of a network of unknown size and topology, with running time O(ND) where N represents the number of processors and D represents the diameter of the network. A simple counting argument suffices to show that the Global Topology Determination Problem has time-complexity Ω(N log N) which makes the protocol presented asymptotically time-optimal for many large networks.