已为您找到该学者12条结果 成果回收站
陈贵海, 杜鹏, 王大进, , 谢立
电子学报,2004,32(2),-0001,():
-1年11月30日
矩形无效块模型可以用来解决网格下的容错路由问题,最小连接块(MCC)模型是它的一个改良模型。本文在MCC基础上,建立MCC 重叠图,当发现不存在曼哈顿路径的时候,给出一套算法,来计算出一条避免无效块的尽可能短的路径。模拟试验表明,通过这种算法找到的路径,与最短路径相差很小。相比起花费更多的时间去找寻最短路径,这种启发式容错算法无疑是更好的选择。
自适应路由, 矩形无效块模型, 容错性, 网格
-
69浏览
-
0点赞
-
0收藏
-
0分享
-
252下载
-
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
-
引用
【期刊论文】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
-
引用