%0 Journal Article
%T Routing algorithm on honeycomb networks<br>蜂窝网络上的路由算法
%A YIN Yu-ling
%A YANG Xiao-fan
%A <br>殷玉玲
%A 杨小帆
%J 计算机应用研究
%D 2009
%I 
%X 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.
%K honeycomb meshes
%K routing algorithm
%K virtual networks
%K deadlock-free property
%K unicast route
%K linear array
%K one-to-all broadcast<br>蜂窝网络
%K 路由算法
%K 虚拟网络
%K 无死锁
%K 单播
%K 线列
%K 一对全广播
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=357266D959467DFBF3A879C4979DA31B&yid=DE12191FBD62783C&vid=96C778EE049EE47D&iid=B31275AF3241DB2D&sid=52F72B689869171D&eid=64DAD8A84EEAD3CB&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=1&reference_num=7