A vector graph model for interconnection networks
SHI Hai-Zhong, NIU Pan-Feng, MA Ji-Yong, HOU Fei-Fei
2011, 15(3):
115-123.
Asbtract
(
3235 )
PDF (345KB)
(
1326
)
Related Articles |
Metrics
the n-cube, the ring network, the k-ary-n-cube, the star network, the pancake network, the bubble sort network, the Cayley graph of transposition tree, the De Bruijn network, the Kautz network, the consecutive-d digraph, the ILLIAC network, the circulant digraph, the circulant undirected graph, the ring digraph, etc have been widely used as processor/communication networks. The performance of such networks is often measured through an analysis of their degree, diameter, connectivity, fault tolerance, routing algorithm, etc. In this paper, at first, we proposed the concepts --- vector digraph and vector graph. Second, we developed vector digraph model and vector graph model for interconnection networks for designing, analyzing, and improving above networks. Furthermore, we shew that the networkd mentioned above can be concisely represented in the two models. More importantly, we shew that the two models enabled us to design new networks --- double star network and triangle network based on vector graphs.
