为了构建适合大规模网络结构的模型,文中提出了一种新型Cayley图互联网络模型WG2nm,当n≥3时,其节点度为m+3,当n=2时,其节点度为m+2.文中还给出了该网络模型的路由算法,得到了其直径上界为﹂5n/2」,并对该网络模型的嵌入性进行了分析.将WG2nm与其它网络模型进行分析比较,发现WG2nm模型能够以更小的代价构造大规模网络结构.
Proposed in this paper is a new type of Cayley graph model for building large-scale interconnection networks,namely WG2mn,whose node degree is m+3 when n≥3 and is m+2 when n=2.A routing algorithm for the proposed model is also presented,and the upper bound of the algorithm diameter is deduced as 5n/2」.Moreover,the embedding properties of the model are analyzed.It is found that WG2mn is superior to other network models because it helps to construct large-scale interconnection networks with lower cost.