首页> 美国政府科技报告 >A Distributed Algorithm for Constructing Minimal Spanning Trees in Computer-Communication Networks.

【24h】

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

机译：计算机通信网络中构建最小生成树的分布式算法。

获取原文

页面导航

摘要
著录项
相似文献
相关主题

摘要

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. (Author)

著录项

作者
dalal, yogen k.;
展开▼
作者单位

展开▼
年度 1976
页码 1-43
总页数 43
原文格式 PDF
正文语种 eng
中图分类工业技术;
关键词
Communications networks; Computer communications; Routing; Algorithms; Distribution; Multiprocessors; Trees(Mathematics);

机译：通信网络;计算机通信;路由;算法;分配;多处理器;树（数学）;

相似文献

外文文献
中文文献
专利

1. Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks [J] . Khan Maleq, Pandurangan Gopal, Anil Kumar V.S. IEEE Transactions on Parallel and Distributed Systems . 2009,第1期

机译：在无线传感器网络中构造近似最小生成树的分布式算法
2. An Efficient Distributed Algorithm for Constructing Spanning Trees in Wireless Sensor Networks [J] . Edgard Jamhour, Manoel C. Penna, Marcelo E. Pellenz, Sensors . 2015,第1期

机译：无线传感器网络中生成树的高效分布式算法
3. A Distributed Algorithm for Constructing Minimum Delay Spanning Trees under Bandwidth Constraints on Overlay Networks [J] . Thilmee M. Baduge, Akihito Hiromori, Hirozumi Yamaguchi, Systems and Computers in Japan . 2006,第14期

机译：覆盖网络上带宽约束下最小延迟生成树的分布式算法
4. Self-Stabilizing Algorithms of Constructing Spanning Tree and Weakly Connected Minimal Dominating Set [C] . Srimani, Pradip K, Xu, . 2007

机译：生成树和弱连接最小控制集的自稳定算法
5. Distributed approximation algorithms for minimum spanning trees and other related problems with applications to wireless ad hoc networks [D] . Khan, Md Abdul Maleq 2007

机译：分布式近似算法，用于最小生成树和其他相关问题，应用于无线自组织网络
6. An Efficient Distributed Algorithm for Constructing Spanning Trees in Wireless Sensor Networks [O] . Rosana Lachowski, Marcelo E. Pellenz, Manoel C. Penna, 2015

机译：无线传感器网络中生成树的高效分布式算法
7. Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks [O] . Maleq Khan, Gopal P, V. S. Anil Kumar 2008

机译：无线传感器网络中构造近似最小生成树的分布式算法

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

摘要

著录项

相似文献

相关主题

期刊订阅