Wide diameters and Rabin numbers of generalized folded hypercube networks

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：12

、訪客IP：3.128.78.41

姓名

藍珮珊(Pei-Shan Lan) 查詢紙本館藏

畢業系所

數學系

論文名稱

(Wide diameters and Rabin numbers of generalized folded hypercube networks)

相關論文

★ Signed Domination in Block Graphs	★ Distance-two domination of graphs
★ Strong Rabin Numbers on Cartesian Products of Graphs	★ Global defensive alliances in double-loop networks
★ 雙環網路距離二以內的控制問題	★ 廣義彼得森圖形的控制數

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

本電子論文使用權限為同意立即開放。
已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。
請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。

摘要(中)

在互連網路的結構設計上，可靠性、效率、安全性，與是否具有廣播性都是一些很重要的準則。近年來，由「寬直徑」---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.

關鍵字(中)

關鍵字(英)

★ Wide diameters
★ Rabin numbers

論文目次

1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
2 Diameter of Generalized Folded Hypercube networks . . . . . . . . . 5
3 dk(G) and Dk(G) of Generalized Folded Hypercube networks . . . . . . 9
3.1 An upper bound of dk(G) . . . . . . . . . . . . . . . . . . . . . .9
3.2 An lower bound of Dk(G) . . . . . . . . . . . . . . . . . . . . . .16
4 rk(G) and r k(G) of Generalized Folded Hypercube networks . . . . . .18
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21

參考文獻

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.

指導教授

廖勝強(Sheng-Chyang Liaw)

審核日期

2005-7-20

推文