Routing algorithm on honeycomb networks
蜂窝网络上的路由算法

This paper addressed the routing algorithm on its brick drawing.First,based on its topology and the routing algorithm on square mesh,proposed a minimum-path unicast routing algorithm by two virtual networks.And proved to be deadlock-free.Second,based on the one-to-all broadcast algorithm on linear array,presented a one-to-all broadcast strategy by emp-loying the unicast routing algorithm given at the very start.And proved to be much lower than the prior ones by simple analyse.