IDEAS home Printed from https://ideas.repec.org/a/ids/ijnvor/v24y2021i2p144-160.html
   My bibliography  Save this article

Reduce memory consumption for internet traffic classification

Author

Listed:
  • Alhamza Munther
  • Ali Abdulrazzaq
  • Mosleh M. Abualhaj
  • Ghada Almukhaini

Abstract

Application level traffic classification is an essential requirement for stable network operation and resource management. However, the classification's processing tends to face low resources when high volumes of traffic are being classified in high-speed networks in real time. Memory consumption considered to be a serious issue during classification processing time. In this paper, a data reduction method is proposed to decrease redundant data entry during the preprocessing phase with regard to accuracy classification. The proposed active build-model random forest (ABRF) eliminates redundant data-entry by utilising feature selection algorithm during the preprocessing phase. The proposed system successfully reduces the memory space of the entire classification process. The system is evaluated by comparing the proposed system against four classifiers (RF, NB, SVM and C5.0) and four features selection techniques (FCBF, SFE, Chi2 and GR). DR reported excellent results amongst the NB, C5.0 and RF. The results were optimised due to the data excluding 314,216 out of 774,013. Moreover, C5.0 consumed less memory space due to the decreased depth of C5.0 tree model. In conclusion, the DR was most effective on the RF model due to the nature of the ensemble classifier.

Suggested Citation

  • Alhamza Munther & Ali Abdulrazzaq & Mosleh M. Abualhaj & Ghada Almukhaini, 2021. "Reduce memory consumption for internet traffic classification," International Journal of Networking and Virtual Organisations, Inderscience Enterprises Ltd, vol. 24(2), pages 144-160.
  • Handle: RePEc:ids:ijnvor:v:24:y:2021:i:2:p:144-160
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=114730
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijnvor:v:24:y:2021:i:2:p:144-160. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=22 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.