已为您找到该学者12条结果 成果回收站
-
49浏览
-
0点赞
-
0收藏
-
0分享
-
53下载
-
0
-
引用
【期刊论文】Comments on "A New Family of Cayley Graph Interconnection Networks of Constant Degree Four"
陈贵海, Guihai Chen, and Francis C.M. Lau, Member, IEEE
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 8, NO.12, DECEMBER 1997,-0001,():
-1年11月30日
Vadapalli and Srimani[2] have proposed a new family of Cayley graph interconnection networks of constant degree four. Our comments show that their proposed graph is not new but is the same as the wrap-around butterfly graph. The structural kinship of the proposed graph with the de Bruijn graph is also discussed.
Interconnection network,, Cayley graph,, generator,, de Bruijn graph,, butterfly graph,, isomorphism.,
-
35浏览
-
0点赞
-
0收藏
-
0分享
-
110下载
-
0
-
引用
【期刊论文】Layout of the Cube-connected Cycles without Long Wires
陈贵海, GUIHAI CHEN, AND FRANCIS C. M. LAU
THE COMPUTER JOURNAL, Vol. 44, No.5, 2001,-0001,():
-1年11月30日
Preparata and Vuillemin proposed the cube-connected cycles (CCC) in 1981, and in the same paper gave an asymptotically-optimal layout scheme for the CCC. While all the known optimal layouts of the CCC, including the Preparata–Vuillemin layout, have long wires, we give a new layout scheme which has no long wires while keeping the asymptotically-optimal area. Hence, we can conclude that the CCC can be laid out optimally (within a constant factor) both in area and in wire length. We also show how large a constant-factor blow-up in area is needed in order not to produce any long wire in the layout.
-
50浏览
-
0点赞
-
0收藏
-
0分享
-
54下载
-
0
-
引用
【期刊论文】Fault Resilience of Structured P2P Systems
陈贵海, Zhiyu Liu, Guihai Chen, Chunfeng Yuan, Sanglu Lu, and Chengzhong Xu
WISE 2004, LNCS 3306, pp. 736-741, 2004.,-0001,():
-1年11月30日
A fundamental problem that confronts structured peer-topeer system that use DHT technologies to map data onto nodes is the performance of the network under the circumstance that a large percentage of nodes join and fail frequently and simultaneously. A careful examination of some typical peer-to-peer networks will contribute a lot to choosing and using certain kind of topology in special applications. This paper analyzes the performance of Chord[7] and Koorde[2], and find out the crash point of each network through the simulation experiment.
-
37浏览
-
0点赞
-
0收藏
-
0分享
-
72下载
-
0
-
引用
【期刊论文】A distance-vector routing protocol for networks with unidirectional links
陈贵海, F.C.M. Laua, *, Guihai Chena, b, Hao Huangb, Li Xieb
Computer Communications 23(2000)418-424,-0001,():
-1年11月30日
We propose a simple distance-vector protocol for routing in networks having unidirectional links. The protocol can be seen as an adaptation for these networks of the strategy as used in the popular RIP protocol. The protocol comprises two main algorithms, one for collecting "from" information, and the other one for generating and propagating "to" information. Like the RIP protocol, this one can handle dynamic changes and tolerate node and link failures in the network.
Routing algorithm, Distance vector, Directed graph, Undirectional link, Routing information protocol
-
46浏览
-
0点赞
-
0收藏
-
0分享
-
106下载
-
0
-
引用