頁籤選單縮合
題名 | Two New Parallel Shortest-Path Routing Algorithms for Communication Networks= |
---|---|
作者 | Wu,Wen; KhoshnevisanH.; |
期刊 | 國防管理學院學報 |
出版日期 | 19981100 |
卷期 | 19:2 1998.11[民87.11] |
頁次 | 頁63-77 |
分類號 | 557.16 |
語文 | eng |
關鍵詞 | |
英文摘要 | This paper presents two new parallel routing algorithms which enhance the transmission efficiency of distributed systems in communication networks. The algorithms are derived by revising the Loop-Free Extended Bellman-Ford Algorithms. The main advantages of these algorithms are that they can avoid the 'counting to infinity' and 'routingtable loops' problems, whilst employing parallel processing to achieve greater performance. We describe the prototype implementation of the two algorithms which evaluate shortest paths from source to destination at each node by parallel processing. The paper also describes the results of the implementation of the algorithms on the AP1000 parallel machine at Imperial College. Finally, the performance of these two algorithms on the AP1000 is compared and contrasted. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。