查詢結果分析
來源資料
相關文獻
- Distributed Broadcasting Algorithms in Rotator Graphs
- On Finding Node-Disjoint Parallel Paths in Rotator Graphs
- Neural Network Error Accommodation with Fuzzy Logic Elements in Robot Time Optimal Path Tracking
- 多埠微波網路之S矩陣量測技術
- 3埠/4埠--網路分析儀S參數校正與量測
- 三埠/四埠--網路分析儀S參數校正與量測
- 區域網路連結與交換技術
- 以基因演算法則求解時間最佳化控制問題
- A Nonlinear Programming Method for Time-optimal Control of an Omni-directional Mobile Robot
- 多埠向量網路分析儀及其於高頻半導體元件參數萃取之應用
頁籤選單縮合
題 名 | Distributed Broadcasting Algorithms in Rotator Graphs=旋轉圖的分散式廣播演算法 |
---|---|
作 者 | 林宏仁; | 書刊名 | 國立臺北商專學報 |
卷 期 | 51 1998.12[民87.12] |
頁 次 | 頁109-136 |
分類號 | 890 |
關鍵詞 | 廣播演算法; 旋轉圖; 單埠; 多埠; 廣度優先衍生樹; 分散式廣播; 時間最佳化; Broadcasting algorithm; Rotator graphs; One-port and all-port transmission models; The breadth first spanning tree; Distributed broadcasting; Time optimal; |
語 文 | 英文(English) |
英文摘要 | The thesis presents broadcasting algorithms in rotator graphs. Broadcasting is the process that one node sends messages to all other nodes. In the thesis, we provide two algorithms to solve the broadcasting process problems under both one-port and all-port transmission models. One benefit of our algorithms is that no global information is needed in the broadcasting, where the global information indicates the breadth first spanning. Since we do not have to build the breadth first spanning tree before broadcasting, the algorithms are flexible for different scales of rotator graphs. That is, once the scale of the rotator graph is changed, our broadcasting algorithms still work well without any modification. Nodes in our broadcasting algorithms can decide where to send the messages by themselves without the global information. We call this kind of broadcasting "distributed broadcasting". We guarantee that no node will receive the same messages redundantly in our broadcasting process. Our all-port broadcasting algorithm is time optimal. Our one-port model broadcasting is not time optimal, but the number of transmission steps can be bounded. |
本系統中英文摘要資訊取自各篇刊載內容。