Determination of the Topology of a Directed Network

Authors:
Darin Goldstein
Affiliations:
-
Venue:
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Year:
2002

Citing 7
Cited 0

Self-stabilizing symmetry breaking in constant-space (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Faster computation on directed networks of automata

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Computing with snakes in directed networks of automata

Journal of Algorithms
System area network mapping

Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Mapping the Internet

Computer
Computation: finite and infinite machines

Computation: finite and infinite machines
Sequential Machines: Selected Papers

Sequential Machines: Selected Papers

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider strongly-connected, directed networks of identical synchronous, finite-state processors with in-and out-degree uniformly bounded by a network constant. Via a straightforward extension of Ostrovsky and Wilkerson's Backwards Communication Algorithm[9], 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 succes to show that the Global Topology Determination Problem has time-complexity驴(N, logN) which makes the protocol presented asymptotically time-optimal for many large networks.