科研之友
微信
新浪微博
Facebook
分享链接
摘要
Proposed in this paper is a new type of Cayley graph model for building large-scale interconnection networks, namely WGn2m, 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 WGn2m is superior to other network models because it helps to construct large-scale interconnection networks with lower cost.
