Determination of the Topology of a Directed Network
| dc.creator | Goldstein, Darin | |
| dc.date | 2003-10-05 | |
| dc.date.accessioned | 2026-07-07T03:20:23Z | |
| dc.date.available | 2026-07-07T03:20:23Z | |
| dc.description | 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. | |
| dc.description | 9 pages, no figures, accepted to appear in IPDPS 2002 (unable to attend), (journal version to appear in Information Processing Letters) | |
| dc.identifier | https://arxiv.org/abs/cs/0310004 | |
| dc.identifier | http://arxiv.org/abs/cs/0310004 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31811 | |
| dc.subject | Distributed, Parallel, and Cluster Computing | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | C.2.1; C.2.2; E.1 | |
| dc.title | Determination of the Topology of a Directed Network | |
| dc.type | text |