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

詳目顯示:::

我願授權國圖
: 
twitterline
研究生:陳俊宏
研究生(外文):Chen, Jun-Hung
論文名稱:非同步傳輸模式網路環境中供多媒體通訊之機率式動態多點播送路由安排方法
論文名稱(外文):Probabilistic Dynamic Multicast Routing for Multimedia Communications in an ATM Network Environment
指導教授:王國禎
指導教授(外文):Kuochen Wang
學位類別:碩士
校院名稱:國立交通大學
系所名稱:資訊科學學系
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:1996
畢業學年度:84
語文別:中文
論文頁數:51
中文關鍵詞:動態多點播送路由安排方法機率最小擴展樹有限延遲時間非同步傳輸模式網路多媒體通訊
外文關鍵詞:dynamic multicast routingprobabilityminimal spanning treebounded delayATM networkmultimedia communication
相關次數:
  • 被引用被引用:0
  • 點閱點閱:61
  • 評分評分:系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
In this thesis, we propose a dynamic multicast routing
algorithm based on {\em probability} formultimedia
communications in an Asynchronous Transfer Mode (ATM)
networkenvironment. In the immediate future, the provision of
multicast in ATM networks will be necessary to achieve
multimediacommunications. Due to the connection-oriented
characteristic of ATM networksand the real-time requirement of
multimedia communications, we must guarantee that a connection
path can not be modified during the transmission period and the
transmission delayshould be within the preset threshold.For
multimedia communications, we not only arrange a transmission
pathwith the minimal cost from a source node to each destination
node,but also consider the dynamic multicast situation with node
joining/leaving.To meet the above requirements, we develop a
newmethod based on the probability of each node being truncated
from the multicast connection tree, such that we could arrange a
better path for a new joining node in a way to reduce the impact
of leaving requests by other nodes in the multicast connection
tree. The main contribution of this thesis is providing a newand
efficient dynamic multicast routing algorithm for multimedia
communications whichkeeps the whole multicast connection tree
near optimal in terms of {\em costinefficiency} and
guaranteesthe transmission delay less than the preset bounded
end-to-end delay. Simulation results show that under various
sizes of network and request, thecost of the multicast
connection tree constructed by our approach is less than that by
the greedy algorithm and the weighted greedy algorithm,
respectively.

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