IDEAS home Printed from https://ideas.repec.org/a/wly/intnem/v27y2017i5ne1981.html
   My bibliography  Save this article

Application traffic classification using payload size sequence signature

Author

Listed:
  • Kyu‐Seok Shim
  • Jae‐Hyun Ham
  • Baraka D. Sija
  • Myung‐Sup Kim

Abstract

Recently, network traffic has become more complex and diverse because of the emergence of new applications and services. Therefore, the importance of application‐level traffic classification is increasing rapidly, and it has become a very popular research area. Although a lot of methods for traffic classification have been introduced in literature, they have some limitations to achieve an acceptable level of performance in real‐time application‐level traffic classification. In this paper, we propose a novel application‐level traffic classification method using payload size sequence signature. The proposed method generates unique payload size sequence signatures for each application using packet order, direction, and payload size of the first N packets in a flow and uses them to identify application traffic. The evaluation shows that this method can classify application traffic easily and quickly with high accuracy and completeness rates, over 99.93% and 93.45%, respectively. Furthermore, the method can classify each application traffic into its respective individual application. The evaluation shows that the method can classify all applications traffic, known and unknown (new) applications into their respective applications, and it can classify applications traffic that use the same application protocol or are encrypted into each other.

Suggested Citation

  • Kyu‐Seok Shim & Jae‐Hyun Ham & Baraka D. Sija & Myung‐Sup Kim, 2017. "Application traffic classification using payload size sequence signature," International Journal of Network Management, John Wiley & Sons, vol. 27(5), September.
  • Handle: RePEc:wly:intnem:v:27:y:2017:i:5:n:e1981
    DOI: 10.1002/nem.1981
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nem.1981
    Download Restriction: no

    File URL: https://libkey.io/10.1002/nem.1981?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:wly:intnem:v:27:y:2017:i:5:n:e1981. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1099-1190 .

    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.