A Distributed Algorithm for Constructing Minimal Spanning Trees in Computer-Communication Networks

Abstract

This paper presents a distributed algorithm for constructing minimal spanning trees in computer-communication networks. The algorithm can be executed concurrently and asynchronously by the different computers of the network. This algorithm is also suitable for constructing minimal spanning trees using a multiprocessor computer system. There are many reasons for constructing minimal spanning trees in computer-communication networks since minimal spanning tree routing is useful in distributed operating systems for performing broadcase, in adaptive routing algorithms for transmitting delay estimates, and in other networks like the Packet Radio Network.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1976
Accession Number
ADA037222

Entities

People

  • Yogen K. Dalal

Organizations

  • Stanford University

Tags

Communities of Interest

  • Air Platforms
  • C4I
  • Materials and Manufacturing Processes
  • Space

DTIC Thesaurus Topics

  • Algorithms
  • Communication Networks
  • Communication Systems
  • Computer Communications
  • Computer Networks
  • Computer Science
  • Computers
  • Governments
  • Illinois
  • Information Processing
  • Information Science
  • Information Systems
  • Network Science
  • New York
  • Operating Systems
  • Software Development
  • United States

Fields of Study

  • Computer science

Readers

  • Computer Networking