检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:顾华玺[1] 刘增基[1] 邱智亮[1] 康国昌[1]
机构地区:[1]西安电子科技大学综合业务网国家重点实验室,陕西西安710071
出 处:《中北大学学报(自然科学版)》2006年第3期215-219,共5页Journal of North University of China(Natural Science Edition)
基 金:国家863高技术研究发展计划资助项目(2002AA103062);(2003AA103520)
摘 要:引入了一种针对不同业务需求的服务质量寻径方案,并应用该方案设计了分布式服务质量寻径算法.新算法是基于本地信息,并且通过证明是无死锁无活锁的.算法还采用了不同的阻塞处理策略来降低呼损率.在3D torus网络拓扑中针对呼损率进行丁仿真.仿真对所提算法与应用于实际系统中的维序算法和Duato算法进行丁对比,结果表明,所提算法将网络吞吐提高了30%~40%(相比维序算法)和20%~30%(相比Duato算法).Direct interconnection network has been used in the switching fabric of the Terabit routers, and how to guarantee the service quality of the network has drawn much attention. A service-quality routing scheme, as well as a corresponding service-quality routing algorithm based on local information, has been presented in this paper in accordance with various service requirements on the switching fabrics of the Terabit routers. The algorithm has been proved dead-lock free and live-lock free; various blocking-handling strategies have been taken in this algorithm to lower call-failure rate, which has been simulated on 3D torus topology. The results show that the proposed algorithm increases the network throughput by 30%-40% (compared with the dimension order algorithm) and by 20%-30% (compared with Duato's algorithm).
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.44