已为您找到该学者20条结果 成果回收站
【期刊论文】Hexagonal and Pruned Torus Networks as Cayley Graphs
肖文俊, Wenjun Xiao, Behrooz Parhami
,-0001,():
-1年11月30日
Hexagonal mesh and torus, as well as honeycomb and certain other pruned torus networks, are known to belong to the class of Cayley groups which are node-symmetric and possess other interesting mathematical properties. In this paper, we use Cayley-graph formulations for the aforementioned networks, along with some of our previous results on subgraphs and coset graphs, to draw conclusions relating to internode distance and network diameter. We also use our results to refine, clarify, and unify a number of previously published properties for these networks and other networks derived from them.
Cayley digraph,, Coset graph,, Diameter,, Distributed System,, Hex mesh,, Homomorphism,, Honeycomb mesh or torus,, Internode distance.,
-
57浏览
-
0点赞
-
0收藏
-
0分享
-
47下载
-
0
-
引用
【期刊论文】Cayley graphs as models of deterministic small-world networks
肖文俊, Wenjun Xiao a, Behrooz Parhami b, *
Information Processing Letters 97 (2006) 115-117,-0001,():
-1年11月30日
Many real networks, including those in social, technological, and biological realms, are small-world networks. The two distin-guishing characteristics of small-world networks has been based on probabilistic methods, with a rather small number of researchers advocating deterministic models. In this paper, we further the study of deferministic small-world networks and show that Cayley graphs may be good models for such networks. Small-world networks based on Cayley graphs possess simple structures and signif-icant adaptability. The Cayley-graph model has pedagogical value and can also be used for desiging and analyzing communication and the other real networks.
Average internode distance, Cayley graph, Clustering cofficient, Interconnection network, Low-diameter network
-
16浏览
-
0点赞
-
0收藏
-
0分享
-
47下载
-
0
-
引用
【期刊论文】Biswapped Networks and Their Topological Properties
肖文俊, Wenjun Xiao, Weidong Chen, , Mingxin He, Wenhong Wei, Behrooz Parhami
,-0001,():
-1年11月30日
In this paper, we propose a new class of interconnection networks, called "biswapped networks" (BSNs). Each BSN is built of 2n copies of some n-node basis network using a simple rule for connectivity that ensures its regularity, modularity, fault tolerance, and algorithmic efficiency. In particular, if the basis network is a Cayley digraph then so is the resulting BSN. Our proposed networks provide a systematic construction strategy for large, scalable, modular, and robust parallel architectures, while maintaining many desirable attributes of the underlying basis network that comprises its clusters. We show how key parameters of a BSN are related to the corresponding parameters of its basis network and obtain a number of results on internode distances, Hamiltonian cycles, and node-disjoint paths. We also discuss the relationship between BSNs and swapped or OTIS networks.
-
47浏览
-
0点赞
-
0收藏
-
0分享
-
75下载
-
0
-
引用
【期刊论文】A Unified Formulation of Kautz Network and Generalized Hypercube
肖文俊, S. ZHOU and H. XU, W. XIAO
Computers and Mathematics with Applications 49 (2005) 1403-1411,-0001,():
-1年11月30日
Hypercube and Kautz network each possess certain desirable properties. However, some of the attractive features of one network are not found in the other. A novel class of network topologies proposed in this paper has the generalized hypercube and the Kautz network as its two extremes. The propsed network inberits the topological properties of both the Kautz network and extremes. The Propsed network inherits the topological properties of both the Kautz network and the generalized hypercube to a varying degree. This allows us to trade-off cost and performance effectively and construct networks which are most suitable for a particular purpose. In the present paper, we investigate the connectivity, wide-diameter, fault-tolerance, Hamiltonicity.
Kautz graph,, Generalized hypercube,, Diameter,, Hamiltonictity.,
-
37浏览
-
0点赞
-
0收藏
-
0分享
-
58下载
-
0
-
引用
肖文俊, Wenjun Xiao , and Behrooz Parhami
,-0001,():
-1年11月30日
Despite numerous interconnection schemes proposed for distributed multicomputing, systematic studies of classes of interprocessor networks, that offer speed-cost tradeoffs over a wide range, have been few and far in between. A notable exception is the study of Cayley graphs that model a wide array of symmetric networks of theoretical and practical interest. Properties established for all, or for certain subclasses of, Cayley graphs are extremely useful in view of their wide applicability. In this paper, we obtain a number of new relationships between Cayley (di) graphs and their subgraphs and coset graphs with respect to subgroups, focusing in particular on homomorphism between them and on relating their internode distances and diameters. We discuss applications of these results to well-known and useful interconnection networks such as hexagonal and honeycomb meshes as well as certain classes of pruned tori.
Cayley digraph, Cellular network, Coset graph, Distributed system, Homomorphism, Interconnection network, Internode distance, Diameter, Parallel processing
-
29浏览
-
0点赞
-
0收藏
-
0分享
-
28下载
-
0
-
引用