(100.26.179.251) 您好!臺灣時間:2021/04/14 08:06
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

我願授權國圖
: 
twitterline
研究生:袁建東
研究生(外文):Kin-Tong Yuen
論文名稱:階層式環狀網路之效能分析
論文名稱(外文):Performance Analysis of Hierarchical-Ring Network
指導教授:孔令洋
指導教授(外文):Ling-Yang Kung
學位類別:碩士
校院名稱:國立成功大學
系所名稱:電機工程研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:1996
畢業學年度:84
語文別:中文
論文頁數:80
中文關鍵詞:階層式環狀網路效能分析延遲時間與輸出量特性
外文關鍵詞:Hierarchical-ringPerformance analysisDelay-throughput characteristics
相關次數:
  • 被引用被引用:0
  • 點閱點閱:77
  • 評分評分:系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
在文中,針對高速非同步封包交換通訊系統,我們除提出一嶄新之階層式
環狀網路系統外,並對其拓撲結構與設計考量作逐一探討;另外,我們還
會從平均傳輸延遲與總傳輸量的角度去剖析此網路之效能。基本上,階層
式環狀網路就是數層互相連結之環狀網路,一個較高階的連結數個較低階
的,而每個個別的環狀網路各自遵照目的端封包移去法則與緩衝插入式環
狀網路機制去運作。緩衝插入式環狀網路之優點在於介面簡單且能提供空
間頻寬重覆使用,而階層式之優點在於各節點間存在唯一路徑且各層間能
簡易連接。所以,階層式環狀網路除了容許各節點同時嘗試送出封包外,
還保證各封包是自我安排傳輸路徑的。我們對階層式環狀網路之效能分析
是基於單一性的資料流量、對稱的拓撲結構以及每節點之緩衝器皆為先進
先出等前題下,以非搶先式優先權之 M/G/1系統所推導出來。最後,我們
會將理論分析結果與程式模擬結果作一比較。

A new Hierarchical Ring (H-Ring) architecture for high-speed
asynchronous packet-switched telecommunications networks is
proposed and the design of H-Ring networks is considered. We
investigate the topological properties of the H-Ring, including
the diameter, cost, average distance, etc. Also, an analysis
of the performance, in terms of average message delay and
aggregate throughput, is presented. The basic H-Ring
architecture is an interconnected-ring system with several
levels. A higher level ring connects a number of lower level
rings through bridges while each ring obeys the buffer-
insertion access and flow control mechanism with destination
removal policy. Buffer inserting rings (BIRs) are attractive
because their simple interfaces allow for spatial bandwidth
reuse. Hierarchies are attractive because their diameter grow
only with the logarithm of the number of stations and the
simpling connections. Hence H-Ring provides on one hand a
service in which any node can try to transmit asynchronously as
much as it can, and on the other hand the network access and
flow control ensure self-routing. We model analytically the H-
Ring under assumptions of symmetry architecture and homogeneous
traffic, infinite buffers and a first-in, first-out (FIFO)
queuing discipline at each node (station or bridge). The
performance analysis views the queue at an arbitrary node as a
M/G/1 system with nonpreemptive priority. The results obtained
from the analytical models are compared to those obtained from
simulation. They show a good agreement.

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
系統版面圖檔 系統版面圖檔