本文選題：雙環(huán)網(wǎng)絡(luò) + 最優(yōu)路由��； 參考：《安徽工業(yè)大學》2014年碩士論文

【摘要】：雙環(huán)網(wǎng)絡(luò)包括有向雙環(huán)網(wǎng)絡(luò)和無向雙環(huán)網(wǎng)絡(luò)，是計算機網(wǎng)絡(luò)的一類重要拓撲結(jié)構(gòu)，具有良好的對稱性、易于擴展、具有一定的容錯能力等特點。它是云計算和物聯(lián)網(wǎng)等網(wǎng)絡(luò)潛在的組網(wǎng)形式，或可作為局部網(wǎng)絡(luò)嵌入其中。 傳統(tǒng)方法側(cè)重利用組合網(wǎng)絡(luò)理論來研究雙環(huán)網(wǎng)絡(luò)，晦澀難懂。本文在圖論的基礎(chǔ)上，借助計算機仿真，充分利用計算機高效算法的設(shè)計和實現(xiàn)來系統(tǒng)研究雙環(huán)網(wǎng)絡(luò)的兩類路由策略。 在網(wǎng)絡(luò)中各節(jié)點無故障的情況下，為了提高網(wǎng)絡(luò)節(jié)點的訪問速度，設(shè)計具有高速傳輸效率的雙環(huán)網(wǎng)絡(luò)，我們對其最優(yōu)路由策略進行了研究，并且分別針對有向雙環(huán)網(wǎng)絡(luò)和無向雙環(huán)網(wǎng)絡(luò)展開了分析；在網(wǎng)絡(luò)中某些節(jié)點發(fā)生故障，無法進行正常通信的情況下，為了確保網(wǎng)絡(luò)節(jié)點之間的路由，，設(shè)計具有高安全容錯性能的雙環(huán)網(wǎng)絡(luò)，我們研究了其容錯路由策略，主要針對無向雙環(huán)網(wǎng)絡(luò)進行了分析。論文的主要工作包括： 1.無故障節(jié)點情況下，對有向雙環(huán)網(wǎng)絡(luò)最優(yōu)路由策略的研究。基于有向雙環(huán)網(wǎng)絡(luò)的L形拓撲結(jié)構(gòu)來研究其最優(yōu)路由，可在不構(gòu)造出L形構(gòu)圖的情況下，直接借助L形瓦的參數(shù)設(shè)計單位步長和非單位步長有向雙環(huán)網(wǎng)絡(luò)的最優(yōu)路由算法，并仿真出有向雙環(huán)網(wǎng)絡(luò)的最優(yōu)路由。 2.無故障節(jié)點情況下，對無向雙環(huán)網(wǎng)絡(luò)最優(yōu)路由策略的研究。按照最短路徑訪問方式將無向雙環(huán)網(wǎng)絡(luò)拓撲結(jié)構(gòu)映射到平面直角坐標系，形成最優(yōu)路由構(gòu)圖CG (N;±r,±s)，使節(jié)點可見可控。根據(jù)雙環(huán)網(wǎng)絡(luò)的對稱性，基于此構(gòu)圖以及節(jié)點坐標進行節(jié)點的最優(yōu)路由思想即可編程仿真出無向雙環(huán)網(wǎng)絡(luò)的最優(yōu)路由。 3.有故障節(jié)點情況下，對無向雙環(huán)網(wǎng)絡(luò)G (N;±r,±s)容錯路由策略的研究。針對源節(jié)點和目的節(jié)點周圍的故障節(jié)點所形成的區(qū)域進行了研究，當出現(xiàn)故障節(jié)點逃逸區(qū)時，源節(jié)點和目的節(jié)點之間仍可以建立最優(yōu)路由；當出現(xiàn)故障節(jié)點封閉區(qū)時，僅僅借助最優(yōu)路由構(gòu)圖CG (N;±r,±s)無法進行最優(yōu)路由，因此提出了目的節(jié)點的等價節(jié)點的想法，通過增加一層節(jié)點對CG (N;±r,±s)進行擴充構(gòu)圖，形成擴展路由構(gòu)圖ECG (N;±r,±s)，在此擴展路由構(gòu)圖的基礎(chǔ)上給出容錯路由算法，并仿真實現(xiàn)了路由算法。
[Abstract]:Dual loop network, which includes directed double loop network and non directional double ring network, is an important topological structure of computer network. It has good symmetry, easy to expand, and has certain fault-tolerant ability. It is a potential network form of cloud computing and the Internet of things, or can be embedded as a local network. The traditional method focuses on using combinatorial network theory to study double loop network, which is obscure and difficult to understand. On the basis of graph theory and with the aid of computer simulation, this paper makes full use of the design and implementation of computer efficient algorithms to systematically study two kinds of routing strategies for double-ring networks. In order to improve the access speed of network nodes and design a double-loop network with high transmission efficiency, the optimal routing strategy is studied. In order to ensure the routing between the nodes in the network when some nodes in the network fail and can not communicate normally in order to ensure the routing between the nodes in the network the analysis is carried out respectively for the directional double-ring network and the non-directional double-ring network. A double-ring network with high security and fault-tolerant performance is designed. The fault-tolerant routing strategy is studied, and the non-directional double-ring network is analyzed. The main work of the thesis includes: 1. In the case of fault-free nodes, the optimal routing strategy for dual-loop directed networks is studied. Based on the L-shape topology of the directed double-loop network, the optimal routing algorithm can be designed directly with the help of the parameters of the L-shaped tile and the non-unit step size double-loop network without constructing the L-shape composition. The optimal routing of directional double loop network is simulated. 2. In the case of fault-free nodes, the optimal routing strategy for non-directional dual-loop networks is studied. According to the shortest path access mode, the topology structure of the non-directional double-ring network is mapped to the plane right-angle coordinate system to form the optimal routing composition CG N; 鹵r, 鹵sn, which makes the nodes visible and controllable. According to the symmetry of double-loop network, the optimal routing of nodes can be programmed to simulate the optimal routing of non-directional double-ring networks based on the idea of optimal routing of nodes based on the composition and the coordinates of nodes. 3. In the case of fault node, the fault-tolerant routing strategy of non-directional double-loop network G n; 鹵r, 鹵s is studied. The region formed by the fault node around the source node and the destination node is studied. When the escape zone of the fault node occurs, the optimal route can still be established between the source node and the destination node, and when the closed zone of the fault node occurs, the optimal route can be established between the source node and the destination node. The optimal routing can not be carried out only with the help of the optimal route composition CG n; 鹵r, 鹵s), so the idea of equivalent nodes of the destination node is put forward, which is extended by adding a layer of nodes to CG n; 鹵r, 鹵s. The extended routing composition ECG is formed. Based on the extended routing composition, a fault-tolerant routing algorithm is proposed, and the routing algorithm is simulated and implemented.
【學位授予單位】：安徽工業(yè)大學
【學位級別】：碩士
【學位授予年份】：2014
【分類號】：TP393.02

【參考文獻】

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

1 江小平;張先迪;;4度循環(huán)圖的寬直徑[J];電子科技大學學報;2006年04期

2 徐俊明;2緊優(yōu)雙環(huán)網(wǎng)絡(luò)無限族[J];高校應用數(shù)學學報A輯(中文版);2000年02期

3 秦飛;鄭毅;劉明;方木云;;雙環(huán)網(wǎng)絡(luò)G(N;1,s)等價生成樹[J];華中科技大學學報(自然科學版);2008年06期

4 李穎;陳業(yè)斌;;有向雙環(huán)網(wǎng)絡(luò)G(N;r,s)的尋徑策略[J];華中科技大學學報(自然科學版);2009年05期

5 李穎;陳業(yè)斌;;基于樹的無向雙環(huán)網(wǎng)絡(luò)G(N;±r,±s)尋徑策略[J];華中科技大學學報(自然科學版);2009年06期

6 陳業(yè)斌;王建X;李穎;;有向雙環(huán)網(wǎng)絡(luò)的容錯路由及容錯直徑[J];華中科技大學學報(自然科學版);2010年02期

7 劉輝;方木云;杭婷婷;侯海金;;直角坐標系下雙環(huán)網(wǎng)絡(luò)G(N;r,s)容錯路由研究[J];華中科技大學學報(自然科學版);2010年10期

8 劉輝;方木云;杭婷婷;侯海金;;無向雙環(huán)網(wǎng)絡(luò)G(N;±r,±s)直徑的研究[J];華中科技大學學報(自然科學版);2010年12期

9 李喬,徐俊明,張忠良;最優(yōu)雙環(huán)網(wǎng)絡(luò)的無限族[J];中國科學(A輯 數(shù)學 物理學 天文學 技術(shù)科學);1993年09期

10 徐俊明,劉琦;一類4緊優(yōu)雙環(huán)網(wǎng)無限族[J];中國科學(A輯:數(shù)學);2003年01期

本文編號：1972676