改进的SpaceWire路由算法

	改进的SpaceWire路由算法
	侯剑儒; 陈晓敏
刊名	华南理工大学学报. 自然科学版
	2013
卷号	41 期号:9 页码:95
关键词	路由算法空间总线路由选择 Opnet建模
ISSN号	1000-565X
其他题名	Improved Space Wire Routing Algorithm
通讯作者	houjianru@vip.sina.com
中文摘要	目前,SpaceWire标准还只是一个初步的标准,其路由部分缺乏对一些复杂情况的动态应对.针对SpaceWire中使用静态路由表时可能发生的即插即用、大量突发数据等情况,文中提出了一种改进的SpaceWire路由算法.该算法通过发送询问包、查询次选路由发送队列长度来判断是否使用次选路由,并通过合理利用其他闲置路由来提高链路的利用率.文中使用Opnet编写仿真模型进行实验,结果表明,设置次选路由可以提高链路的利用率,降低平均端到端时延,而包通信机制则可以削弱坏情况对算法的影响,说明所提出的路由算法是有效的.
英文摘要	As the existing SpaceWire standard is preliminary due to its lack in dynamic responses to some complex situations in its route section, an improved routing algorithm is proposed to deal with such situations as plug-and-play and a lot of unexpected data that may occur when the static routing table is adopted in SpaceWire. This algorithm judges whether to adopt the second-choice route by sending inquiry packets and by learning the sending queue length of the second-choice route, and rationally utilizes other idle routings to improve the link utilization. Moreover, Opnet is used to make the simulation model for experiments. The results indicate that the second-choice route can not only improve the utilization of the link but also shorten the average end-to-end delay,and that the package communication system can weaken the effect of bad situations on the improved routing algorithm. The effectiveness of the improved routing algorithm is thus verified.
收录类别	EI ; CSCD
语种	中文
CSCD记录号	CSCD:4980397
内容类型	期刊论文
源URL	[http://ir.nssc.ac.cn/handle/122/4960]
专题	国家空间科学中心_空间技术部
推荐引用方式 GB/T 7714	侯剑儒,陈晓敏. 改进的SpaceWire路由算法[J]. 华南理工大学学报. 自然科学版,2013,41(9):95.
APA	侯剑儒,&陈晓敏.(2013).改进的SpaceWire路由算法.华南理工大学学报. 自然科学版,41(9),95.
MLA	侯剑儒,et al."改进的SpaceWire路由算法".华南理工大学学报. 自然科学版 41.9(2013):95.