• DocumentCode
    1971923
  • Title

    An Efficient Algorithm about Extracting Large MIB Table

  • Author

    Lv, Liping ; Ming, Tingtang

  • Author_Institution
    Dept.of Comput. & Inf. Technol., Zhengzhou Univ., Zhengzhou, China
  • fYear
    2010
  • fDate
    22-23 June 2010
  • Firstpage
    255
  • Lastpage
    258
  • Abstract
    The composition of the network becomes more complex and the number of nodes that compose a network has increased greatly. Therefore, efficient network management is becoming vital. SNMP (Simple Network Management Protocol) with its advantages of high efficiency has been widely used in the management of a variety of network communication equipments, but how effectively transmit large bulk data between NMS (Network Management Station) and SNMP Agent remains a prominent issue. GetBulk made a great contribution to SNMPv2 in transferring bulk data, but there is a problem in extracting bulk data from mib tables using GetBulk is that the management system typically does not know the number of rows in the table, so easily leads to excessive or insufficient retrieval. To resolve these problems, this article proposes an M-GetBulk algorithm by adding GetBulk Request PDU field and modifying data storage structure. Our simulation results also show that M-GetBulk algorithm greatly reduces network bandwidth consumption and data query time.
  • Keywords
    computer network management; protocols; GetBulk; GetBulkRequest PDU field; M-GetBulk algorithm; SNMPv2; data query time; large MIB table extraction; network bandwidth consumption; network communication equipments; network management station; simple network management protocol; Algorithm design and analysis; Bandwidth; Computers; Data mining; Indexes; Memory; Protocols; GetBulk; NMS; SNMP; SNMPv2; mib;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent Computing and Cognitive Informatics (ICICCI), 2010 International Conference on
  • Conference_Location
    Kuala Lumpur
  • Print_ISBN
    978-1-4244-6640-5
  • Electronic_ISBN
    978-1-4244-6641-2
  • Type

    conf

  • DOI
    10.1109/ICICCI.2010.31
  • Filename
    5565987