
浏览全部资源
扫码关注微信
西安电子科技大学综合业务网国家重点实验室
纸质出版:2006
移动端阅览
顾华玺, 刘增基, 邱智亮, 等. 太比特路由器内部交换网络的服务质量寻径算法[J]. 中北大学学报(自然科学版), 2006,(3):215-219.
顾华玺, 刘增基, 邱智亮, et al. Routing Algorithms for the Service Quality of the Switching Fabrics in Terabit Routers[J]. 2006, (3): 215-219.
引入了一种针对不同业务需求的服务质量寻径方案
并应用该方案设计了分布式服务质量寻径算法.新算法是基于本地信息
并且通过证明是无死锁无活锁的.算法还采用了不同的阻塞处理策略来降低呼损率.在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).
L N iM,P M cK in ley,K.A survey of w orm ho le rou ting techn iques in d irected netw orks[J].Com pu ter,1993,26:62-76.
顾华玺,刘增基,邱智亮.太比特路由器交换网络中路由算法的研究[J].电信科学,2004,20(3):18-21.G u Huax i,L iu Zeng ji,Q iu Zh iliang.R esearch on the rou ting a lgorithm s of fabrics in terab it rou ter[J].T e lecomm un ication Sc ience,2004,20(3):18-21.(in Ch inese)
Duato J,Y a lam anch ili S,N i L.In terconnection N etw orks[M].A n Eng ineering A pproach,M organ-K au fm annP ress,2003.(in Ch inese)
崔勇.互联网络服务质量路由算法研究综述[J].软件学报,2002(11):2065-2075.Cu i Y ong.R esearch on in ternetw ork Q oS rou ting a lgorithm s:a Survey[J].Journa l of Softw are,2002(11):2065-2075.(in Ch inese)
赵海雁,陈立潮.多约束条件下最短路径Q oS路由算法[J].华北工学院学报,2004,25(1):49-51.Zhao H a iyan,Chen L ichao.A lgorithm for the shortest rou te on m u lti-constra ined Q oS rou ting[J].Journa l of N orthCh ina Institu te of T echno logy,2004,25(1):49-51.(in Ch inese)
朱慧玲.Q oS路由选择:问题与解决方法综述[J].电子学报,2003,31(1):1-8.Zhu Hu iling.Q ua lity of serv ice rou ting:prob lem s and so lu tions[J].A cta E lectron ica S in ica,2003,31(1):1-8.(inCh inese)
W ang Z,C row croft J.Q ua lity-of-serv ice rou ting for supporting m u ltim ed ia app lications[J].IEEE J.on Se lectedA reas in Comm un ications,1996,14,7:1228-1234.
M a Q,S teenk iste P.Q ua lity-of-Serv ice R ou ting for T raffic w ith Perform ance G uaran tees.P roc[M].IF IP F ifthIn ternationa lW orkshop on Q ua lity of Serv ice,1997.115-126.
0
浏览量
60
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621