Determination of the Topology of a Directed Network

Details Determination of the Topology of a Directed Network Determination of the Topology of a Directed Network

2003-10-05

arxiv.org/abs/cs/0310004v1

Computer Science

Distributed, Parallel, and Cluster Computing

9 pages, no figures, accepted to appear in IPDPS 2002 (unable to attend), (journal version to appear in Information Processing

Scientific paper

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 in [OW], we exhibit a protocol which solves the Global Topology Determination Problem, the problem of having the 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 Omega(N logN) which makes the protocol presented asymptotically time-optimal for many large networks.

Affiliated with

Also associated with

No associations

Rating

Determination of the Topology of a Directed Network does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Determination of the Topology of a Directed Network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Determination of the Topology of a Directed Network will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-652150