頁籤選單縮合
題 名 | An Experience of SNMP-MIB Implementation=一個SNMP-MIB的實作經驗談 |
---|---|
作 者 | 曾振輝; 嚴劍琴; 陳向明; 呂宗憲; | 書刊名 | 電信研究 |
卷 期 | 30:4 2000.08[民89.08] |
頁 次 | 頁489-499 |
分類號 | 448.6 |
關鍵詞 | SNMP; PNNI; OID-Trie; MIB; RSVP; MPLS; MPOA; QoS; PHB; |
語 文 | 英文(English) |
中文摘要 | 第二版及第三版的SNMP只解決了部份網路擴充太快的問題,另外一個會影響 SNMP功能的問題就是網路資源的競爭力。由於在最近與QoS相關的網路新技術中,常常把 SNMP的優先權排在最後,造成網路元件的管理更為不易。本文將提出一個有效率的資料結 構(OIDTrie),使得實作在納路元件上的SNMP,在被查調時,及應時間更快。進一步解決SNMP 在網路資源競爭的劣勢。 |
英文摘要 | SNMPv2 or SNMPv3 only solve the network size fast growing problem. Another issue that might choke the SNMP is the bandwidth competition. Improve the efficiency of SNMP response time becomes more important when the newer network QoS related technologies have been developing. Unlike the traditional IP network in which all kinds of flows share the bandwidth fairly, the SNMP data flow will be assigned to be the lowest priority to avoid intruding the network normal data traffic. Unfortunately, such assignment will result in higher data loss rate of SNMP/UDP/IP management traffic than before if the SNMP agent does not response the requests fast enough, and finally some network elements will be out of control. Consequent retransmissions will be made by network manager repeatedly to try to steal network bandwidth from those called critical data traffic. Eventually, SNMP will lose its original shape, a light-weight protocol. To alleviate this problem caused by lookup delay, a fast searching mechanism, named OID-Trie, used to retrieve the MIB objects of the SNMP agent will be presented in the paper. |
本系統中英文摘要資訊取自各篇刊載內容。