已为您找到该学者12条结果 成果回收站
【期刊论文】Tighter Layouts of the Cube-Connected Cycles
陈贵海, Guihai Chen, and Francis C.M. Lau, Member, IEEE
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 11, NO.2, FEBRUARY 2000,-0001,():
-1年11月30日
Preparata and Vuillemin proposed the cube-connected cycles (CCC) and its compact layout in 1981[17]. We give a new layout of the CCC which uses less than half the area of the Preparata-Vuillemin layout. We also give a lower bound on the layout area of the CCC. The area of the new layout deviates from this bound by a small constant factor. If we "unfold" the cycles in the CCC, the resulting structure can be laid out in optimal area.
Interconnection networks,, cube-connected cycles,, VLSI,, embedding,, routing,, layout.,
-
45浏览
-
0点赞
-
0收藏
-
0分享
-
63下载
-
0
-
引用
【期刊论文】Cycloid: a constant-degree and lookup-efficient P2P overlay network
陈贵海, Haiying Shena, Cheng-Zhong Xua, ∗, Guihai Chenb
Performance Evaluation xxx(2005)xxx-xxx,-0001,():
-1年11月30日
There are many structured P2P systems that use DHT technologies to map data items onto the nodes in various ways for scalable routing and location. Most of the systems require O(log n) hops per lookup request with O(log n) neighbors per node, where n is the network size. In this paper, we present a constant-degree P2P architecture, namely Cycloid, which emulates a cube-connected cycles (CCC) graph in the routing of lookup requests. It achieves a time complexity of O(d) per lookup request by using O(1) neighbors per node, where n=d
ycloid, eer-to-peer, iceroy, oorde, Distributed hash table, Constant-degree DHT
-
43浏览
-
0点赞
-
0收藏
-
0分享
-
124下载
-
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.
-
38浏览
-
0点赞
-
0收藏
-
0分享
-
72下载
-
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
-
引用
【期刊论文】P2P Overlay Networks of Constant Degree
陈贵海, Guihai Chen, , Chengzhong Xu, Haiying Shen, and Daoxu Chen
GCC 2003, LNCS 3032, pp. 412-419, 2004.,-0001,():
-1年11月30日
This paper proposes an abstract and generic topological model that captures the essence of P2P architecture. Such model should in return facilitate the exploitation of the new design space for more novel P2P systems. The paper also proposes a variant of the cube-connected cycles as a P2P overlay network that achieves O(log N) path length with O(1) neighbors. The simulation result has shown that our system is no worse than other systems of the same complexity such as Viceroy and Koorde.
-
34浏览
-
0点赞
-
0收藏
-
0分享
-
108下载
-
0
-
引用