| 研究生: |
藍珮珊 Pei-Shan Lan |
|---|---|
| 論文名稱: | Wide diameters and Rabin numbers of generalized folded hypercube networks |
| 指導教授: |
廖勝強
Sheng-Chyang Liaw |
| 口試委員: | |
| 學位類別: |
碩士 Master |
| 系所名稱: |
理學院 - 數學系 Department of Mathematics |
| 畢業學年度: | 93 |
| 語文別: | 英文 |
| 論文頁數: | 21 |
| 外文關鍵詞: | Wide diameters, Rabin numbers |
| 相關次數: | 點閱:10 下載:0 |
| 分享至: |
| 查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
在互連網路的結構設計上,可靠性、效率、安全性,與是否具有廣播性都是一些很重要的準則。近年來,由「寬直徑」---dw(G)可決定文件傳輸的效率及可靠性,將文件分部分傳輸後再集合至同一目的地。而「失效直徑」---Dw(G)則可確定資料傳輸的安全性;在傳輸過程中,即使某些點無法使用,資料仍舊可安全送達目地。而「羅賓數」---rw(G)與「強羅賓數」---r*w(G)則與資料的廣播有關,可將訊息經由網路一次送入多個目的地。經由討論這些參數,網路就可以有較好的性質。
在這篇學位論文中,我們將探討在連通性k的一般化折疊多元網路中的d(G)、dk(G)、Dk(G)、rk(G)、r*k(G)。
Reliability, efficiency, security, and broadcasting are important criteria in the design of interconnection networks. Recently, the w-wide diameter dw(G), the (w − 1)-fault diameter Dw(G), and the w-Rabin number rw(G) have been used to determine reliability and efficiency of interconnection networks. In this thesis, we study d(G), dk(G),Dk(G), rk(G), and r k(G) of generalized folded hypercube networks
having connectivity k.
References
[1] D. R. Duh, G. H. Chen and J. F. Fang, Algorithms and properties of a new
two-level network with folded hypercubes as basic modules, IEEE Transactions
on Parallel and Distributed Systems 6 (1995), 714-723.
[2] A. El-Amawy and S. Latifi, Properties and performance of folded hypercubes,
IEEE Transactions on Parallel and Distributed Systems 2 (1991), 31-42.
[3] D. F. Hsu, On container width and length in graphs, groups, and networks, IEICE Transaction on Fundamentals of Electronics, Communications and Computer
Science E77-A (1994), 668-680.
[4] T. Kojima, On Rabin numbers of graphs and digraphs, preprint.
[5] M. S. Krishnamoorthy and B. Krishnamurthy, Fault diameter of interconnection networks, Computers and Mathematics with Applications 13 (1987), 577-582.
[6] S. Lakshmivarahan, J. S. Jwo, and S. K. Dhall, Symmetry in interconnection
networks based on Caley graphs of permutation groups, Parallel Compution 19
(1993), 361-407.
[7] S. C. Liaw and G. J. Chang, Generalized diameters and Rabin numbers of
networks, Journal of Combinatorial Optimization 4 (1999), 371-384.
[8] S. C. Liaw, G. J. Chang, F. Cao, and D. F. Hsu, Fault-tolerant routing in circulant networks and cycle prefix networks, Annals of Combimatorics 2 (1998),
165-172.
[9] M. O. Rabin, Efficient dispersal of information for security, load balancing, and fault tolerance, J. Association for Computing Machinery 36 (1989), 335-348.