This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
March 1987 (vol. 13 no. 3)
pp. 398-405
Y.K. Dalal, Metaphor Computer Systems
Most algorithms for constructing minimal spanning trees are sequential in operation. Distributed algorithms for constructing these trees operate both concurrently and asynchronously, and are useful in store-and-forward packet-switching computer-communication networks where there is typically no single source of control. The difficulties in designing such algorithms arise from communication and synchronization problems. This paper discusses these problems and describes the first distributed algorithm for constructing minimal spanning trees. This algorithm and the principles and techniques underlying its design will find application in large communication networks and large multiprocessor computer systems.
Index Terms:
synchronization, Broadcast routing, computer-communication networks, distributed algorithms, minimal spanning tree, protocols, store-and-forward packet-switching
Citation:
Y.K. Dalal, "A Distributed Algorithm for Constructing Minimal Spanning Trees," IEEE Transactions on Software Engineering, vol. 13, no. 3, pp. 398-405, March 1987, doi:10.1109/TSE.1987.233171
Usage of this product signifies your acceptance of the Terms of Use.