IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v11y2019i22p6306-d285427.html
   My bibliography  Save this article

Priolog: Mining Important Logs via Temporal Analysis and Prioritization

Author

Listed:
  • Byungchul Tak

    (Department of Computer Science and Engineering, Kyungpook National University, 80 Daehakro, Bukgu, Daegu 41566, Korea)

  • Seorin Park

    (Department of Computer Science and Engineering, Kyungpook National University, 80 Daehakro, Bukgu, Daegu 41566, Korea)

  • Prabhakar Kudva

    (IBM TJ Watson Research Center, 1101 Kitchawan Rd, Yorktown Heights, NY 10598, USA)

Abstract

Log analytics are a critical part of the operational management in today’s IT services. However, the growing software complexity and volume of logs make it increasingly challenging to mine useful insights from logs for problem diagnosis. In this paper, we propose a novel technique, Priolog, that can narrow down the volume of logs into a small set of important and most relevant logs. Priolog uses a combination of log template temporal analysis, log template frequency analysis, and word frequency analysis, which complement each other to generate an accurately ranked list of important logs. We have implemented this technique and applied to the problem diagnosis task of the popular OpenStack platform. Our evaluation indicates that Priolog can effectively find the important logs that hold direct hints to the failure cause in several scenarios. We demonstrate the concepts, design, and evaluation results using actual logs.

Suggested Citation

  • Byungchul Tak & Seorin Park & Prabhakar Kudva, 2019. "Priolog: Mining Important Logs via Temporal Analysis and Prioritization," Sustainability, MDPI, vol. 11(22), pages 1-17, November.
  • Handle: RePEc:gam:jsusta:v:11:y:2019:i:22:p:6306-:d:285427
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/11/22/6306/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2071-1050/11/22/6306/
    Download Restriction: no
    ---><---

    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:gam:jsusta:v:11:y:2019:i:22:p:6306-:d:285427. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.