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

A topology‐based scaling mechanism for Apache Storm

Author

Listed:
  • Ce‐Kuen Shieh
  • Sheng‐Wei Huang
  • Li‐Da Sun
  • Ming‐Fong Tsai
  • Naveen Chilamkurti

Abstract

As more and more well‐known companies, such as Twitter, Yahoo, and Alibaba, start to focus on real‐time big data applications, how to build a platform for processing real‐time data becomes an important issue. Among all the real‐time processing systems, Apache Storm is the most well‐known and representative open‐source, distributed, real‐time computation system. In Storm, the computation is implemented by a topology such as a graph where nodes are operators and edges represent the data flows between operators. In big data processing and analysis systems, scalability is an important issue. Storm provides rebalance mechanism for its scalability property, which can adjust the parallelism of a running topology. However, there are some drawbacks in rebalance command, such as resource usage restriction and topology execution suspension. In this paper, we propose a topology‐based scaling mechanism for Apache Storm. When a topology is overloaded, it scales by adjusting the number of the cloned topologies or replaced by another new topology with more tasks. When scaling by topology‐based mechanism, it eliminates resource usage restriction and execution suspension in the topology, and the procedure is automatically launched. The experimental results show that our topology‐based scaling mechanism can improve the scaling performance of Storm. Copyright © 2016 John Wiley & Sons, Ltd.

Suggested Citation

  • Ce‐Kuen Shieh & Sheng‐Wei Huang & Li‐Da Sun & Ming‐Fong Tsai & Naveen Chilamkurti, 2017. "A topology‐based scaling mechanism for Apache Storm," International Journal of Network Management, John Wiley & Sons, vol. 27(3), May.
  • Handle: RePEc:wly:intnem:v:27:y:2017:i:3:n:e1933
    DOI: 10.1002/nem.1933
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1002/nem.1933?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:3:n:e1933. 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.