專利授權區國立清華大學國際產學營運總中心 Operations Center for Industry Collaboration

搜尋專利授權區

關鍵字

» 新增關鍵字

選單

專利授權區

專利授權區
專利名稱(英)	SOFTWARE-DEFINED NETWORK CONTROLLER AND MULTIPATH ROUTING METHOD
專利家族	中華民國：I607641 美國：10,103,974
專利權人	國立清華大學 100%
發明人	劉力瑋,許健平
技術領域	資訊工程

專利摘要(英)
A software-defined network (SDN) controller and a multipath routing method thereof are provided. In the method, a maximum bottleneck bandwidth (MBB) and a minimum hop count (MHC) of each of the nodes in the SDN are initiated. Next, a source node is visited, and neighboring nodes thereof are discovered to relax paths between the source node and each neighboring node. Then, a forwarding node having a maximum MBB among other nodes is visited, and its neighboring nodes which are connected therewith and unvisited are discovered to relax the paths between the forwarding node and each neighboring node. Afterwards, the rest of the nodes are consecutively visited until all nodes are visited. Finally, a disjoint path lookup table is established according to relation between the paths recorded for each node, and accordingly k disjoint paths having the maximum bottleneck bandwidth are found for transmitting k sub-flows divided from a data flow.

專利摘要(英)

A software-defined network (SDN) controller and a multipath routing method thereof are provided. In the method, a maximum bottleneck bandwidth (MBB) and a minimum hop count (MHC) of each of the nodes in the SDN are initiated. Next, a source node is visited, and neighboring nodes thereof are discovered to relax paths between the source node and each neighboring node. Then, a forwarding node having a maximum MBB among other nodes is visited, and its neighboring nodes which are connected therewith and unvisited are discovered to relax the paths between the forwarding node and each neighboring node. Afterwards, the rest of the nodes are consecutively visited until all nodes are visited. Finally, a disjoint path lookup table is established according to relation between the paths recorded for each node, and accordingly k disjoint paths having the maximum bottleneck bandwidth are found for transmitting k sub-flows divided from a data flow.

聯絡資訊
承辦人姓名	李曉琪
承辦人電話	03-5715131 #31061
承辦人Email	hsiaochi@mx.nthu.edu.tw