收稿日期: 2013-04-01
修回日期: 2013-05-17
网络出版日期: 2013-08-01
基金资助
中国科学院战略性先导科技专项(XDA04060300)
Improved SpaceWire Routing Algorithm
Received date: 2013-04-01
Revised date: 2013-05-17
Online published: 2013-08-01
Supported by
中国科学院战略性先导科技专项(XDA04060300)
侯剑儒 陈晓敏 . 改进的 SpaceWire 路由算法[J]. 华南理工大学学报(自然科学版), 2013 , 41(9) : 95 -99,106 . DOI: 10.3969/j.issn.1000-565X.2013.09.016
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 algo-rithm 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.Moreo-ver,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.
Key words: routing algorithms; SpaceWire; routing choice; Opnet modeling
/
| 〈 |
|
〉 |