本文選題：SpaceWire + 路由選擇算法�。� 參考：《首都師范大學(xué)》2012年碩士論文

【摘要】：空間任務(wù)的復(fù)雜度日益增加，形式越來(lái)越多樣化。同時(shí)，衛(wèi)星系統(tǒng)的各類(lèi)型通信任務(wù)在不斷地復(fù)雜化，，對(duì)通信速率和數(shù)據(jù)量的需求也在不斷地提高。SpaceWire總線(xiàn)通信標(biāo)準(zhǔn)是ESA專(zhuān)為航天任務(wù)設(shè)計(jì)的一種高傳輸速率、低功耗、可升級(jí)、低成本的串行通信協(xié)議標(biāo)準(zhǔn)，對(duì)解決目前星上數(shù)據(jù)處理系統(tǒng)的總線(xiàn)帶寬不足有重要作用。SpaceWire總線(xiàn)的通信速率可達(dá)400Mbps，并支持高級(jí)協(xié)議，拓?fù)浣Y(jié)構(gòu)靈活，具有很好的數(shù)據(jù)傳輸性能與可靠性。因此，SpaceWire總線(xiàn)通信標(biāo)準(zhǔn)的研究具有很大的研究意義和發(fā)展空間。 另一方面，由于衛(wèi)星在太空的工作環(huán)境極為復(fù)雜，對(duì)通信網(wǎng)絡(luò)的可靠性要求很高，而當(dāng)前SpaceWire總線(xiàn)通信技術(shù)的應(yīng)用中還存在著對(duì)鏈路故障的容錯(cuò)能力不足的問(wèn)題。在原有的SpaceWire通信網(wǎng)絡(luò)的星型拓?fù)浣Y(jié)構(gòu)中，如果某條鏈路出現(xiàn)無(wú)法重新建立連接的故障，網(wǎng)絡(luò)通信將出現(xiàn)部分死區(qū)，造成不可預(yù)料的損失。本文在對(duì)SpaceWire通信協(xié)議的研究分析的基礎(chǔ)上，研究一種SpaceWire通信網(wǎng)絡(luò)的路由演化算法和相關(guān)故障恢復(fù)策略。 SpaceWire路由演化算法的研究在理論上主要是基于路由選擇算法和人工智能算法開(kāi)展的。路由選擇算法主要目的是當(dāng)通信網(wǎng)絡(luò)出現(xiàn)鏈路故障時(shí)，對(duì)整個(gè)SpaceWire通信網(wǎng)絡(luò)進(jìn)行路由重構(gòu)及優(yōu)化；而考慮到實(shí)際應(yīng)用中可能存在大規(guī)模路由網(wǎng)絡(luò)的演化需求，引入人工智能算法進(jìn)行算法優(yōu)化，以提高效率。 本文首先從理論上進(jìn)行了算法的討論和分析，進(jìn)一步進(jìn)行了算法的詳細(xì)設(shè)計(jì)和收斂性驗(yàn)證，最后通過(guò)實(shí)際項(xiàng)目的系統(tǒng)實(shí)現(xiàn)，在仿真平臺(tái)上進(jìn)行了故障恢復(fù)和路由重構(gòu)優(yōu)化的測(cè)試。測(cè)試結(jié)果表明，在SpaceWire通信網(wǎng)絡(luò)發(fā)生若干次鏈路故障過(guò)程中，監(jiān)控演化系統(tǒng)均能及時(shí)檢測(cè)到具體故障位置，進(jìn)一步完成了演化重構(gòu)的任務(wù)，達(dá)到了路由演化算法的設(shè)計(jì)目標(biāo)。
[Abstract]:The complexity of space missions is increasing and the forms are becoming more and more diverse. At the same time, the communication tasks of various types of satellite systems are becoming more and more complicated, and the requirements of communication rate and data volume are also constantly improving. SpaceWire bus communication standard is a kind of high transmission rate, low power consumption and scalable design designed by ESA for space missions. The low cost serial communication protocol standard plays an important role in solving the shortage of bus bandwidth of on-board data processing system. The communication rate of SpaceWire bus can reach 400 Mbps. it also supports advanced protocol and has flexible topology. It has good data transmission performance and reliability. Therefore, the research of SpaceWire bus communication standard has great significance and development space. On the other hand, because the working environment of satellite in space is very complex, the reliability of communication network is very high. However, in the current application of SpaceWire bus communication technology, the fault tolerance of link is insufficient. In the star topology of the original SpaceWire communication network, if a link fails to re-establish the connection, there will be some dead zones in the network communication, resulting in unexpected losses. Based on the research and analysis of SpaceWire communication protocol, a routing evolutionary algorithm and related fault recovery strategy for SpaceWire communication network are studied in this paper. The research of SpaceWire routing evolutionary algorithm is mainly based on routing algorithm and artificial intelligence algorithm. The main purpose of routing algorithm is to reconfigure and optimize the whole SpaceWire communication network when the communication network has a link failure, and considering the evolution needs of large-scale routing network may exist in practical applications. The artificial intelligence algorithm is introduced to optimize the algorithm to improve the efficiency. In this paper, the algorithm is discussed and analyzed theoretically, and the detailed design and convergence verification of the algorithm are carried out. Finally, the system implementation of the actual project is carried out. Fault recovery and route reconfiguration optimization are tested on the simulation platform. The test results show that in the course of several link failures in the SpaceWire communication network, the monitoring and evolution system can detect the specific fault location in time, and further accomplish the task of evolutionary reconfiguration, and achieve the design goal of the routing evolution algorithm.
【學(xué)位授予單位】：首都師范大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2012
【分類(lèi)號(hào)】：TP336

【參考文獻(xiàn)】

相關(guān)期刊論文 前10條

1 鳳雷;魯文帥;付平;;SpaceWire網(wǎng)絡(luò)層協(xié)議分析與應(yīng)用研究[J];測(cè)試技術(shù)學(xué)報(bào);2010年06期

2 程輝,李永閣,郭志,王興偉,黃敏;一種有效的QoS組播路由算法[J];大連理工大學(xué)學(xué)報(bào);2003年S1期

3 傅茂忠;高茂庭;;Internet中常用路由選擇算法分析[J];電腦知識(shí)與技術(shù);2009年16期

4 石堅(jiān),鄒玲,董天臨,趙爾墩;遺傳算法在組播路由選擇中的應(yīng)用[J];電子學(xué)報(bào);2000年05期

5 葉大振，吳新余;計(jì)算機(jī)通信網(wǎng)中路由選擇和容量分配問(wèn)題的遺傳算法求解[J];電子學(xué)報(bào);1996年12期

6 李海民,吳成柯;自適應(yīng)變異遺傳算法及其性能分析[J];電子學(xué)報(bào);1999年05期

7 毛春靜;關(guān)永;David Jungwirth;;星載SpaceWire路由器的研究與設(shè)計(jì)[J];電子與信息學(xué)報(bào);2010年08期

8 李臣波;劉潤(rùn)濤;;一種基于Dijkstra的最短路徑算法[J];哈爾濱理工大學(xué)學(xué)報(bào);2008年03期

9 侯越先,何丕廉,孫學(xué)軍;自適應(yīng)隨機(jī)化鏈路狀態(tài)路由算法[J];計(jì)算機(jī)研究與發(fā)展;2002年11期

10 吳少巖,許卓群;遺傳算法中遺傳算子的啟發(fā)式構(gòu)造策略[J];計(jì)算機(jī)學(xué)報(bào);1998年11期

相關(guān)碩士學(xué)位論文 前1條

1 李志文;分布式系統(tǒng)中冗余網(wǎng)絡(luò)容錯(cuò)及負(fù)載均衡技術(shù)研究[D];山東大學(xué);2008年

本文編號(hào)：1933465