%0 Journal Article
%T A New Family of Interconnection Networks of Fixed Degree Three
%A Shu-Ming Zhou
%A Wen-Jun Xiao
%A <br>Shu-MingZhou
%A Wen-JunXiao
%J 计算机科学技术学报
%D 2004
%I 
%X A new family of interconnection networks WGn is proposed, that is constant degree 3 Cayley graph, and is isomorphic to a Cayley graph of the wreath product Z2 Sn when the generator set is chosen properly. Its different algebraic properties is investigated and a routing algorithm is given with the diameter upper bounded by 3n2 - 6n 4. The embedding properties and the fault tolerance are devired. In conclusion, we present a comparison of some familiar networks with constant degree 3.
%K interconnection network
%K Cayley graph
%K routing
%K diameter
%K embedding<br>互连网络
%K 凯莱图表
%K 路由
%K 等级固定
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=7EAE6C578174534C86C33A07146128D7&yid=D0E58B75BFD8E51C&vid=2A8D03AD8076A2E3&iid=0B39A22176CE99FB&sid=2B25C5E62F83A049&eid=2B25C5E62F83A049&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=12