基於二進位樹搜尋法之網路評估方法及其系統

專利類型

發明

專利國別 (專利申請國家)

中華民國

專利申請案號

109139805

專利證號

I 744093

專利獲證名稱

基於二進位樹搜尋法之網路評估方法及其系統

專利所屬機關 (申請機關)

國立清華大學

獲證日期

2021/10/21

技術說明

本發明提供一種基於二進位樹搜尋法之網路評估方法, 其用以評估網路之路徑之狀態, 路徑包含節點及弧。數值設定步驟係將其中一路徑之狀態向量之狀態數值均設為0。 此路徑之狀態向量用二進位數表示, 且此路徑之狀態向量之狀態數值分別對應弧。路徑列舉步驟係透過二進位樹搜尋法將此路徑之狀態向量之狀態數值所對應之二進位數加1, 以列舉出所有路徑之狀態向量之狀態數值。計算評估步驟係根據路徑之狀態向量之狀態數值評估出網路之路徑之狀態。藉此, 透過窮舉法將路徑上所有可能狀態列出, 以簡化程式複雜度、節省空間、增加效率及平行處理。 A binary-addition tree algorithm-based network assessment method is proposed to evaluate a state of a plurality of paths of a network. The paths include a plurality of nodes and a plurality of arcs connected to the nodes. The binary-addition tree algorithm-based network assessment method includes a parameter setting step, a path enumerating step and an evaluating step. The parameter setting step includes setting a plurality of state values of a state vector of one of the paths to 0. The state vector of the one of the paths is represented by a binary value. The state values of the state vector of the one of the paths are corresponding to a plurality of nodes or a plurality of arcs, respectively. The path enumerating step includes adding 1 to the binary value corresponding to the state values of the state vector of the one of the paths according to a binary-addition tree algorithm to enumerate all of the state values of the state vectors of the paths. The evaluating step includes evaluating the state of the paths of the network according to all of the state values of the state vectors of the paths. Therefore, the binary-addition tree algorithm-based network assessment method of the present disclosure can comprehensively enumerate all the possible state vectors of the paths to evaluate the state of the paths of the network, thereby simplifying program complexity, saving memory space and increasing efficiency and parallel processing.

備註

連絡單位 (專責單位/部門名稱)

智財技轉組

連絡電話

03-5715131-62219

網址