一种与网络中心通信的路由算法

A Routing Algorithm of Communication with a Network Center

考虑一个用无向图G＝（V．E）描述的异步的处理机网络，这里V＝｛0．1…，n｝是处理机集，E是无向边集．每一条边（i，j）表示处理机i与j之间的一条双向通信链路。处理机0表示中心。提出了一种算法，它保证每台处理机保持一个无回路的路径集，该处理机通过这些路径可以与中心通信。该算法可适应拓扑变化且是分布式的。

An asynchronous network of processors described by an undirected graph G= (V,E) is Considered, where V= {0, 1, ….n} is the set of processors, and E is the set of undirected arcs. Each arc (i,j) represents a bidirectional communication link between processors iand j. Processor 0 represents a center. An algorithm is proposed in order to guarantee that each processor maintains a set of loop - free paths through which it can communicate with the center. The algorithm to be able adapt topololgical changes and should be distributed.