507161 A7 B7 PA890314.TWP-3/9 五、發明説明（ 【技術領域】 本發明係關於一種新的Mffi搜尋系統，特別是指一種 藉由資料結構Oid-Trie及其搜尋演算法，使得以崁入 (Embedded)在網路元件上的簡易網路管理協定媒介(SNMP agent)，讓網路元件在被查詢時，能提昇其反應時間更快 的MIB搜尋系統。 【先前技術】 10 15 (請先閲讀背面之注意事項再填寫本頁) 經濟部智慧財產局員工消費合作社印製 在管理資訊基部(MIB)搜尋系統中之簡易網路管理協 定（Simple Network Management Protocol)，由於受到最近與 Q〇S 相關的網路新技術，常常把處理此簡易網路管理協定 (SNMP)的優先權排在最後，再加上其下層用戶資料訊息協 定(User Datagram Protocol)的不保證資料不流失的不確定因 素’造成網路元件的管理更為不易，使得簡易網路管理協 定(SNMP)在網路資源中處於競爭劣勢。因此，在不影響資 料層（DataPlan)傳輸順序為最優先的基本原則下，發展出此 種有效率的資料結構Oid-Trie及其搜尋演算法，使得以崁 入(Embedded)在網路元件上的簡易網路管理協定媒介(sNMp agent)中，以改善簡易網路管理協定(SNMp)在網路資源競 2〇 爭劣勢中所衍生的問題。 由此可見，亦唯有加速網路被管元件的反應速度，才 有可能解決上述問題，本案發明人有鑑於此，針對=衍生 的缺點，乃亟思加以改良創新，並經多年苦心孤讀潛=研 究後，終於成功研發完成本件一種新的MIB搜尋***曰。 本紙張尺度適用中國國家標準（CNS ) A4g^7210x297公釐 507161 PA890314.TWP - 4/8 A7 B7 五、發明說明ο) 【發明目的】 本發明之目的即在於發明有效率的資料結構〇id-Trie及 其搜尋演算法，使得以炭入(Embedded)在網路元件上的簡 易網路管理協定媒介(SNMP agent)中。 5【技術内容】 可達成上述發明目的之一種新的MIB搜尋系統，需包 括有Oid，Trie資料結構及搜尋演算法，用以崁入在網路元 件上的簡易網路管理協定媒介(SNMP agent)中，使得該新 的MIB搜尋系統可以利用Trie結構直接對應到Mffi-Tree的物 10 件辨識碼(ObjectID)排列組合，充份利用Trie的特性，大量 提升搜尋速度logN，並且在每一個Trie的節點上，配合雜 湊法則，彈性增加分枝的數量。 又因為每一個簡易網路管理協定媒介（SNMp agent)的 模組都會提供MIB編譯器（MIB Compikr)，因此關於在每一 15 個Trie節點上的分枝量，正可依此編譯器事先算出，以便 正確的掌握資料結構中，雜湊滿位(Bucket)的記憶體空間 大小。經由下列所述幾個步驟，即可建立一個完整的〇id-Trie · 步驟一、在建立代理模組前，先使用MIB編譯器掃描MIB-II 2〇 以及由使用者所定義的私人MIB，以計算每個Trie階層中某些節 點的旁支節點數目（sibling number){n},。同時建立一個用以儲 存{η}數目集合的標頭檔丨。mib編輯器是一個SNMP訊息分析器 的前置處理器。 步驟二、壓縮所有丨η}為1的旁支節點以減少路徑高度，並 -4- 本紙張尺度適用中國國豕標準（CNS)A4規格（210 X 297公爱） — III — — — — — — · I I I I I I - — — — — — III — (請先閱讀背面之注意事項再填寫本頁) 經濟部智慧財產局員工消費合作社印製 507161 A7 PA890314.TWP - 5/8 經濟部智慧財產局員工消費合作社印製 五、發明說明（l ) 且節省OIDrie所需的空間。更新壓縮後的丨N丨内容。同時需要避 免在GetNext操作產生額外的線性搜尋。 步驟三、根據標頭檔内的{N}以精確配置出各種大小變動的 陣列，作為各個旁支階層的雜湊空間，因此可避免雜湊空間中每 5 一個項目（Entry)可能發生溢位的情況，同時也可以節省陣列所 需要的空間。平均的串列長度稍大於丨。雜湊表上的每一個項目 (Entry)同時對應到一個〇id數字。 步驟四、針對所有無法預期而耗盡以乜的以访议七指令，建 立所有線性索引的MIB索引Trie (MIB Index Trie)。 步驟五、同時，建立一個瀏覽MIB表格的雜湊表屬性集合。 循序儲存於oid陣列内的屬性指標將指向各自的雜湊表上。所需 要的時間複雜度為〇(L+l)。檢索某個MIB表格中的物件幾乎不需 額外的時間。 【圖式簡單說明】 明參閱以下有關本發明一較佳實施例之詳細說明及其 附圖’將可進一步瞭解本發明之技術内容及其目的功效； 有關該實施例之附圖為： 圖一為本發明一種新的MIB搜尋系統之實施例。 【較佳實施例】 20 請參閱圖一所示，為說明本發明所提供之一種新的 MIB搜尋系統，需包括有〇id-Trie資料結構及搜尋演算法， 其中OID-Trie資料結構可以C語言表現如下： typedef struct _OidTrie OidTrie; typedef struct _HashTable HashTable; 10 15 本紙張尺度適用中國國家標準（CNS)A4規格（210 x 297公釐） (請先閱讀背面之注意事項再填寫本頁) Γ-裝 訂： 經濟部智慧財產局員工消費合作社印製 507161 五、發明說明（C(/〇 struct 一 OidTrie{ struct 一HashTable{ U32 oid; U32 ^thread; 5 OidTrie *sibling;507161 A7 B7 PA890314.TWP-3 / 9 V. Description of the invention ([Technical Field] The present invention relates to a new Mffi search system, in particular to a data structure Oid-Trie and its search algorithm, which makes The simple network management protocol medium (SNMP agent) embedded in the network element allows the network element to improve its MIB search system with faster response time when inquired. [Previous Technology] 10 15 (Please (Please read the notes on the back before filling this page.) The Simple Network Management Protocol printed in the Management Information Base (MIB) search system by the Consumer Cooperatives of the Intellectual Property Bureau of the Ministry of Economy. New S-related network technologies often place the priority of dealing with this Simple Network Management Protocol (SNMP) last, coupled with the uncertainty of the underlying User Datagram Protocol that does not guarantee that data will not be lost Factors make the management of network components more difficult, making the Simple Network Management Protocol (SNMP) a competitive disadvantage in network resources. Therefore, it does not affect data Under the basic principle of (DataPlan) transmission order being the highest priority, this efficient data structure Oid-Trie and its search algorithm have been developed, making it a simple network management protocol medium embedded in network components (sNMp agent), in order to improve the problems derived from the Simple Network Management Protocol (SNMp) in the competition for network resources. In this way, it can be seen that only by accelerating the response speed of network managed components can there be In view of this, the inventor of this case has considered this. In view of the shortcomings of =, he is eager to improve and innovate. After years of hard work, he has successfully developed a new MIB search system. Paper size applies Chinese National Standard (CNS) A4g ^ 7210x297 mm 507161 PA890314.TWP-4/8 A7 B7 V. Description of the invention ο [Objective of the invention] The purpose of the present invention is to invent efficient data structures. And its search algorithm makes it possible to embed (SNMP) in a simple network management protocol medium (SNMP agent) on a network element. 5 [Technical content] A new MIB search system that can achieve the above-mentioned object of the invention needs to include Oid, Trie data structure and search algorithm, which is used to insert a simple network management protocol medium (SNMP agent) on the network element ), So that the new MIB search system can use the Trie structure to directly correspond to the Mffi-Tree's 10-piece object ID (ObjectID) arrangement and combination, make full use of the characteristics of the Trie, greatly improve the search speed logN, and in each Trie With the hash rule, the number of branches can be increased flexibly. And because each module of the Simple Network Management Protocol (SNMp agent) will provide a MIB compiler (MIB Compikr), so the branch amount on each 15 Trie nodes can be calculated in advance according to this compiler In order to correctly grasp the memory space size of the hash in the data structure. Through the following steps, you can create a complete Oid-Trie. Step 1. Before setting up the proxy module, use the MIB compiler to scan MIB-II 2〇 and the private MIB defined by the user. To calculate the sibling number {n}, of some nodes in each Trie hierarchy. At the same time, a header file is created to store the number of sets of {η}. mib editor is a pre-processor for SNMP message analyzer. Step 2: Compress all collateral nodes whose η is 1 to reduce the path height, and this paper size applies the China National Standard (CNS) A4 specification (210 X 297 public love) — III — — — — — — · IIIIII-— — — — — III — (Please read the notes on the back before filling out this page) Printed by the Employees ’Cooperatives of the Intellectual Property Bureau of the Ministry of Economic Affairs 507161 A7 PA890314.TWP-5/8 Employees’ Cooperatives of the Intellectual Property Bureau of the Ministry of Economic Affairs Print 5. Invention Description (l) and save the space required by OIDrie. Update compressed 丨 N 丨 content. At the same time, it is necessary to avoid additional linear search during GetNext operation. Step 3: According to the {N} in the header file, an array of various size changes is accurately configured as the hash space of each side branch hierarchy, so that every 5 entries in the hash space (Entry) may be overflowed. It can also save the space required by the array. The average string length is slightly larger than 丨. Each entry on the hash table corresponds to a 0id number at the same time. Step 4: For all unpredictable and depleted visits to the Seven Commands, establish MIB Index Trie (MIB Index Trie) for all linear indexes. Step 5. At the same time, a hash table attribute set for browsing the MIB table is established. The attribute indicators that are sequentially stored in the oid array will point to their respective hash tables. The required time complexity is 0 (L + 1). Retrieving objects in a MIB table takes almost no additional time. [Brief description of the drawings] By referring to the following detailed description of a preferred embodiment of the present invention and the accompanying drawings', the technical content of the present invention and its purpose and effect can be further understood; the drawings related to this embodiment are: Figure 1 This is an embodiment of a new MIB search system of the present invention. [Preferred Embodiment] 20 Please refer to FIG. 1. In order to illustrate a new MIB search system provided by the present invention, it needs to include the Oid-Trie data structure and search algorithm. The OID-Trie data structure can be C The language performance is as follows: typedef struct _OidTrie OidTrie; typedef struct _HashTable HashTable; 10 15 This paper size applies to China National Standard (CNS) A4 (210 x 297 mm) (Please read the precautions on the back before filling this page) Γ- Binding: Printed by the Consumer Cooperative of the Intellectual Property Bureau of the Ministry of Economic Affairs 507161 V. Description of the invention (C (/ 〇struct-OidTrie {struct-HashTable {U32 oid; U32 ^ thread; 5 OidTrie * sibling;
HashTable *next; //for overflow of hashing } bucket[n]; // where n is one element of {N} set }； 再依據上述之OID-Trie資料結構，並配合OID-Trie搜尋 10 演算法，以下列所述幾個步驟，即可建立一個完整的Oid-Trie · 步驟一、在建立代理模組前，先使用MIB編譯器掃揭MIB-II 以及由使用者所定義的私人MIB，以計算每個Trie階層中某些節 點的旁支節點數目（sibling number){n}。同時建立一個用以儲 15存丨n丨數目集合的標頭槽{N}。MIB編輯器是一個SNMP訊息分析器 的前置處理器。 步驟二、壓縮所有（η}為1的旁支節點以減少路徑高度，並 且節省OIDrie所需的空間。更新壓縮後的丨Ν丨内容。同時需要避 免在GetNext操作產生額外的線性搜尋。 20 步驟三、根據標頭檔内的{N}以精確配置出各種大小變動的 陣列，作為各個旁支階層的雜溱空間，因此可避免雜凑空間中每 一個項.目（Entry)可能發生溢位的情況，同時也可以節省陣列所 需要的空間。平均的串列長度稍大於i。雜湊表上的每一個項目 (Entry)同時對應到一個oid數字。 -6 _ 本紙張尺度適用中國國家標準（CNS)A4規格（210 X 297公爱) 1 ---- ”---------I 1 MW— --- (請先閱讀背面之注意事項再填寫本頁) tSJ· 507161 A7 經濟部智慧財產局員工消費合作社印製 五、發明說明（f) 步驟四、針對所有無法預期而耗盡oids的GetNext指令，建 立所有線性索引的MIB索引Trie (MIB Index Trie)。 步驟五、同時，建立一個瀏覽MIB表格的雜凑表屬性集合。 循序儲存於〇id陣列内的屬性指標將指向各自的雜凑表上。所需 要的時間複雜度為〇(L+l)。檢索某個MIB表格中的物件幾乎不需 額外的時間。 【特點及功效] 本發明所提供之一種新的^!^搜尋系統，與前述習用 技術相互比較時，更具有下列之優點： 1·當被管理的MIB物件非常多時，建立像這樣的一個 Oid-Trie時，可能會費時良久，但是因為本發明是在8_ Agent開始接受詢問之前，便已經建立完成，所以並不會 影響資料層的傳輸速度。 2.SNMP GetNext的操作，將很容易在此資料結構中實 行，因為經由Oid-Trie指標所指向的Mffi物件是順序排列的 陣列。 上列詳細說明係針對本發明之一可行實施例之具體說 明，惟該實施例並非用以限制本發明之專利範圍，凡未脫 離本發明技藝精神所為之等效實施或變更，均應包含於本 20 案之專利範圍中。 綜上所述，本案不但在技術思想上確屬創新，並能較 習用物品增進上述多項功效，應已充分符合新穎性及進步 性之法定發明專利要件，爰依法提出申請，懇請責局核 准本件發明專利申請案，以勵發明，至感德便。 10 15 本紙張尺度適用中國國家標準（CMS)A4規格（210 X 297公爱） (請先閱讀背面之注意事項再填寫本頁) ，裝 I---訂--------- fHashTable * next; // for overflow of hashing} bucket [n]; // where n is one element of {N} set}; and according to the above OID-Trie data structure, and cooperate with the OID-Trie search 10 algorithm, Follow the steps below to create a complete Oid-Trie. Step 1. Before creating the proxy module, use the MIB compiler to scan MIB-II and the private MIB defined by the user to calculate The sibling number {n} of some nodes in each Trie hierarchy. At the same time, a header slot {N} is set up to store 15 sets of numbers. The MIB editor is a pre-processor for the SNMP message analyzer. Step 2: Compress all the branch nodes with (η) 1 to reduce the path height and save the space required by OIDrie. Update the compressed content 丨 N 丨. At the same time, you need to avoid additional linear search in the GetNext operation. 20 Step 3 5. According to the {N} in the header file, an array with various size changes can be accurately configured as the miscellaneous space of various side branches, so each item in the hash space can be avoided. At the same time, it can also save the space required by the array. The average string length is slightly larger than i. Each entry on the hash table corresponds to an oid number at the same time. -6 _ This paper size applies the Chinese National Standard (CNS) A4 specifications (210 X 297 public love) 1 ---- ”--------- I 1 MW— --- (Please read the notes on the back before filling this page) tSJ · 507161 A7 Ministry of Economy Printed by the Intellectual Property Bureau's Consumer Cooperatives. 5. Description of the invention (f) Step 4. For all GetNext instructions that run out of oids unexpectedly, set up MIB Index Tries (MIB Index Trie) for all linear indexes. Step 5. Simultaneously, establish One Browse the hash table attribute set of the MIB table. The attribute indicators that are sequentially stored in the 0id array will point to their respective hash tables. The time complexity required is 0 (L + 1). Retrieve the MIB table Objects require almost no additional time. [Features and Effects] A new ^! ^ Search system provided by the present invention has the following advantages when compared with the aforementioned conventional technologies: 1. When the managed MIB object is very For a long time, it may take a long time to establish an Oid-Trie like this, but because the invention is completed before the 8_ Agent starts to accept the query, it will not affect the data layer transmission speed. 2.SNMP The operation of GetNext will be easy to implement in this data structure, because the Mffi objects pointed by the Oid-Trie indicator are a sequential array. The detailed description above is a specific description of a feasible embodiment of the present invention. The embodiments are not intended to limit the patent scope of the present invention, and any equivalent implementation or change that does not depart from the technical spirit of the present invention should be included in the patent scope of this 20 case To sum up, this case is not only technically innovative, but also enhances the above-mentioned multiple effects over conventional items. It should have fully met the requirements for statutory invention patents that are novel and progressive. Apply for it in accordance with the law. The invention patent application is to encourage invention, to the best of your ability. 10 15 This paper size applies the Chinese National Standard (CMS) A4 specification (210 X 297 public love) (Please read the precautions on the back before filling this page). I --- Order --------- f