查詢結果分析
來源資料
頁籤選單縮合
題名 | Contention Resolution for Nonblocking ATM Switches=在非同步傳送模式無阻礙交換器之競爭解決方法 |
---|---|
作者 | 林修平; 歐陽彥杰; | 書刊名 | 興大工程學報 |
卷期 | 8:1 1997.01[民86.01] |
頁次 | 頁19-28 |
分類號 | 312.2 |
關鍵詞 | 非同步傳送模式交換組; 類神經元; 交換排程; ATM switch; Neuron; Switching scheduling; |
語文 | 英文(English) |
中文摘要 | A parallel switching scheduling algorithm for an NN nonblocking ATM sw itch is proposed. The algorithm makes use of binary state neuron representation and the equivalence classes to solve the cell contention problem. Differ from the Hopfield type neural scheduling algorithm, the neuron state of the proposed algorithm is calculated by the inhibitory condition and the excitatory condition which are determined by the set of selected cells. The uniformly distributed and hot-spot input traffic are used to generated test patterns to test the performance of the parallel algorithm. The algorithm is parallel computed and it can choose a maximal set of conflict-free cells for transmission. From the simulation results, the parallel algorithm can achieve high throughput and the order of converage speed is less than O(N) which is better than the Hopfield neural algorithm. |
英文摘要 | 本文提出一個平行的非同步傳送模式交換排程方式,本演算法利用雙態之類神經 元素示法及相等區分法去解決傳送資料元之間的競爭問題。不同於 HOPFIELD 的類神經排程 法,本法利用類神經元所決定之抑制條件及激發條件去作為狀態值的計算,同時本法亦經過 平均態分佈及熱門分佈的交通流量去產生測試值作為本演算法的輸入值。本法經平行計算後 可得到一組最佳無衝突的傳送。從模擬結果來看,本平行演算法可達成增加交通流量及快速 完成所有的計算。 |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。