基本信息来源于合作网站,原文需代理用户跳转至来源网站获取       
摘要:
The Tori-connected mESH (TESH) Network is a k-ary n-cube networks of multiple basic modules, in which the basic modules are 2D-mesh networks that are hierarchically interconnected for higher level k-ary n-cube networks. Many adaptive routing algorithms for k-ary n-cube networks have already been proposed. Thus, those algorithms can also be applied to TESH network. We have proposed three adaptive routing algorithms—channel-selection, link-selection, and dynamic dimension reversal—for the efficient use of network resources of a TESH network to improve dynamic communication performance. In this paper, we implement these routers using VHDL and evaluate the hardware cost and delay for the proposed routing algorithms and compare it with the dimension order routing. The delay and hardware cost of the proposed adaptive routing algorithms are almost equal to that and slightly higher than that of dimension order routing, respectively. Also we evaluate the communication performance with hardware implementation. It is found that the communication performance of a TESH network using these adaptive algorithms is better than when the dimension-order routing algorithm is used.
推荐文章
一种基于Wormhole Routing的寻径技术
蛀孔寻径技术
先锋寻径技术
微片
基于Adaptive Lasso的股票指数跟踪问题研究
Adaptive Lasso
指数跟踪
沪深 300 指数
用于网格计算的Overlay Network 设计算法的研究
网格架构
Overlay Network
拓扑结构
拉格朗日松驰
内容分析
关键词云
关键词热度
相关文献总数  
(/次)
(/年)
文献信息
篇名 Adaptive Routing Algorithms and Implementation for TESH Network
来源期刊 通讯与网络(英文) 学科 工学
关键词 TESH NETWORK Adaptive ROUTING Algorithm HARDWARE COST ROUTER DELAY Communication Performance
年,卷(期) 2013,(1) 所属期刊栏目
研究方向 页码范围 34-49
页数 16页 分类号 TP39
字数 语种
DOI
五维指标
传播情况
(/次)
(/年)
引文网络
引文网络
二级参考文献  (0)
共引文献  (0)
参考文献  (0)
节点文献
引证文献  (0)
同被引文献  (0)
二级引证文献  (0)
2013(0)
  • 参考文献(0)
  • 二级参考文献(0)
  • 引证文献(0)
  • 二级引证文献(0)
研究主题发展历程
节点文献
TESH
NETWORK
Adaptive
ROUTING
Algorithm
HARDWARE
COST
ROUTER
DELAY
Communication
Performance
研究起点
研究来源
研究分支
研究去脉
引文网络交叉学科
相关学者/机构
期刊影响力
通讯与网络(英文)
季刊
1949-2421
武汉市江夏区汤逊湖北路38号光谷总部空间
出版文献量(篇)
427
总下载数(次)
0
总被引数(次)
0
论文1v1指导