Deterministic resource discovery in distributed networks

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2001, Pages 77-83

  Kutten, S ^a   Peleg, D ^a   Vishkin, U ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; INTERNET;

DISTRIBUTED NETWORKS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0034827205     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/378580.378592     Document Type: Conference Paper

References (8)

1. New connectivity and MSF algorithms for ultracomputer and PRAM
2. New models and algorithms for future networks
3. Distributed control for fast networks
4. A distributed algorithm for minimum-weight spanning trees
5. Resource discovery in distributed networks
6. An O(log n) randomized resource discovery algorithm
7. The new routing algorithm for the arpanet
8. An O(log n) parallel connectivity algorithm