- 會議論文
- OpenAccess
以最小瓶頸生成樹為基礎之軟體定義網路路由演算法
Traffic engineering in SDN using minimum bottleneck spanning tree
摘要
軟體定義網路 (Software defined networking, SDN) 將控制層 (control plane) 與資料層 (data plane)分離，網路管理者能藉由控制器，以集中化的方式管理網路上的交換器，並根據網路策略規劃路由路徑。本論文在SDN 架構下，以最小瓶頸生成樹為基礎建立路由演算法，本論文提出的路由演算法在決定路由時，會以best-effort 的方式盡可能地平均使用所有link 做為傳輸路徑。此外，我們亦提出一個低成本的重新路由演算法，當link 頻寬即將溢滿時，僅需更動極少數的交換器便能解決網路壅塞問題。
並列摘要
Software-defined networking (SDN) decouples the control plane and data plane, which allows that network administrators intensively manage network services and determine forwarding paths according to the network policy. In this paper, we propose a best-effort routing algorithm by using minimum bottleneck spanning tree (MBST). The proposed routing algorithm can balance the link usage while the forwarding paths are determined. Furthermore, we also propose a low-cost re-routing algorithm. When the traffic load on a link reaches a set threshold, only a few number of switches is modified for balancing the whole traffic load.