Solving Bandwidth and Priority Domination Problems of DQDB Metropolitan Area Networks

淡江大學機構典藏 > 工學院 > 電機工程學系暨研究所 > 會議論文 > Item 987654321/70560

請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/70560

題名:	Solving Bandwidth and Priority Domination Problems of DQDB Metropolitan Area Networks
作者:	Huang, Nen-fu;Sheu, Shiann-tsong
貢獻者:	淡江大學電機工程學系
日期:	1991-05
上傳時間:	2011-10-23 21:26:35 (UTC+8)
出版者:	中壢市 : 中央大學
摘要:	The bandwidth domination problem (BDP) in the distributed queue dual bus (DQDB) medium access control (MAC) protocol could occur if the network bandwidth is dominated by a single node when it is active early and other nodes having heavy traffic demands are active later. The priority domination problem (PDP) is the problem that the network bandwidth may be dominated by an upstream node with lower priority when it is active early and other nodes with higher priorities are active later. To solve the BDP a mechanism is provided such that the bandwidth can be shared among all active nodes. To solve the PDP a mechanism is provided such that nodes with higher priority can capture all the bandwidth. The authors propose two adaptive algorithms to solve the BDP and a priority mechanism to solve the PDP. The adaptive algorithms and priority mechanism were evaluated by simulation. It is also shown that if the adaptive algorithms and priority mechanism are combined together, then the nodes with highest priority can use all the bandwidth and the bandwidth can be balanced among these nodes rapidly.
關聯:	中華民國八十年全國計算機會議論文集(一),
顯示於類別:	[電機工程學系暨研究所] 會議論文

文件中的檔案:

沒有與此文件相關的檔案.

在機構典藏中所有的資料項目都受到原著作權保護.

TAIR相關文章