查詢結果分析
來源資料
頁籤選單縮合
題名 | Constructing Large Networks: Some Techniques from Graph Theory=由圖形理論建構大型網路方法之研究 |
---|---|
作 者 | 趙福源; 徐濟世; | 書刊名 | 國立雲林技術學院學報 |
卷期 | 4 1995.06[民84.06] |
頁次 | 頁81-96 |
分類號 | 448.6 |
關鍵詞 | 網路架構; 圖形理論; DeBruijn圖; Cayley星圖; Hypercube圖; Network topology; Graph theory; DeBruijn graphs; Cayley graphs; Star graphs; Hypercubes; |
語文 | 英文(English) |
中文摘要 | 建構一大型網路需要考慮以最小的自由度及直徑來連結最多的節點,這個問題也 就是圖形理論裡所謂的 (d,k) 問題。 在經過多年的研究,已有不少解決此問題的方法被提 出, 然而大多數的方法並不能達到 Moore Bound 的值,所以為了更清楚瞭解這些方法以提 供改進之道,實有必要針對各個方法加以研究。 本文把這些方法分成三大類:Bruce-Force 方法、 Cayley Graph 方法和 Tree-Structured 方法,並介紹各類中的幾種重要方法, 同 時提出在不同自由度及直徑下,其所能連結的最大節點表,相關的方法將比較其相對的自由 度及直徑。這些研究結果可做為設計大型網路時一個重要的依據,並且一些分散式相關的重 要研究主題,如分散式路徑、容錯能力、績效評估等,也可依此而進行。 |
英文摘要 | Building a large network has to consider the maximum number of nodes that can be placed with a small value of of degree and diameter. This problem corresponds to the well-known theoretic graph problem, called the (d,k) problem, which has been studied by many researchers. Some good techniques have been proposed for solving this problem. However most of the techniques cannot achieve the value of the Moore bounds. There is a need to look into these techniques for the purpose of better understanding of how they work and what can be done to improve them. In this paper, a considerable work has been taken to investigate these techniques. Techniques are divided into three categories and are examined. For each technique, when it is possible, a dense table is produced. Related techniques are compared in term of the values of degree and diameter. The results of this reseach can be served as the guideline for designing a large network. Also some further research can be undertaken from here. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。