本文選題：網(wǎng)絡拓撲結構 + 局部紐立方體　； 參考：《大連理工大學》2015年碩士論文

【摘要】：眾所周知,使用圖論來構建網(wǎng)絡拓撲結構是建模常見的形式,而且已經(jīng)被越來越多的學者應用到研究之中。泛圈性和路徑嵌入作為衡量網(wǎng)絡拓撲結構容錯性的一項重要指標,變得越來越受學者的關注。研究容錯性不僅具有很強的學術價值而且還有很大的實際意義,它可以有效地改善和優(yōu)化一個大型網(wǎng)絡出現(xiàn)不可預見的故障時的情況,通過合理的規(guī)劃使其能夠在多線路和元件同時發(fā)生故障時,仍然可以保證網(wǎng)絡的正常使用。當網(wǎng)絡中出現(xiàn)錯誤時,用F表示網(wǎng)絡結構圖中錯誤的集合。局部紐立方體LTQn和交叉立方體CQn都是超立方體Qn的變形網(wǎng)絡結構,它們具備Qn現(xiàn)有的優(yōu)點,同時改進了Qn的缺點,如泛圈性等。在點數(shù)一樣時,它們的直徑長度是Qn的一半。容錯性在衡量一個拓撲結構的標準中占有很重要的比重,也引起了科學工作者對容錯性研究的興趣和重視。本文通過在n比較小的情況下進行計算機程序搜索和在n較大的情況下進行數(shù)學歸納法的方法,研究局部紐立方體網(wǎng)絡和交叉立方體網(wǎng)絡的容錯性質(zhì),得出了下面的結論：(1)給出弱點對的概念,并得出結論：對于任意當|F|≤n-2時,對于LTQn-f中的任意兩點(弱點對中的兩點除外)在LTQn-f中存在一條長為1的路徑連接這兩點。(2)對于任意是中的任意一個正確點,在LTQn-F中存在包含點v且長為l的正確圈,其中(3)對于任意中的任意一個正確點,在中存在包含點v且長為6的正確圈。
[Abstract]:It is well known that the use of graph theory to construct network topology is a common form of modeling and has been applied to research by more and more scholars. As an important index to measure the fault tolerance of network topology, pan cycle and path embedding have been paid more and more attention by scholars. The study of fault tolerance is not only of great academic value but also of great practical significance. It can effectively improve and optimize the situation of a large network in the event of unforeseen failures. Through reasonable planning, it can ensure the normal use of the network when the multiple lines and components fail at the same time. When errors occur in the network, F is used to represent the set of errors in the network structure diagram. Both local new cube LTQn and cross cube CQn are the deformed network structure of hypercube Qn. They have the advantages of QN and improve the shortcomings of QN, such as pancyclicity, etc. When the number of points is the same, their diameter is half the length of Q _ n. Fault-tolerance plays an important role in the criterion of a topology, and it also attracts the interest and attention of scientists in the research of fault-tolerance. In this paper, the fault-tolerant properties of local and crossed cube networks are studied by means of computer program search in the case of small n and mathematical induction in the case of larger n. The following conclusion is drawn: 1) the concept of weakness pair is given, and it is concluded that for any F 鈮，

本文編號：1937526