IDEAS home Printed from https://ideas.repec.org/a/spr/infosf/v16y2014i1d10.1007_s10796-013-9460-7.html
   My bibliography  Save this article

Scalable and leaderless Byzantine consensus in cloud computing environments

Author

Listed:
  • JongBeom Lim

    (Korea University)

  • Taeweon Suh

    (Korea University)

  • JoonMin Gil

    (Catholic University of Daegu)

  • Heonchang Yu

    (Korea University)

Abstract

Traditional Byzantine consensus in distributed systems requires n ≥ 3f + 1, where n is the number of nodes. In this paper, we present a scalable and leaderless Byzantine consensus implementation based on gossip, requiring only n ≥ 2f + 1 nodes. Unlike conventional distributed systems, the network topology of cloud computing systems is often not fully connected, but loosely coupled and layered. Hence, we revisit the Byzantine consensus problem in cloud computing environments, in which each node maintains some number of neighbors, called local view. The message complexity of our Byzantine consensus scheme is O(n), instead of O(n 2). Experimental results and correctness proof show that our Byzantine consensus scheme can solve the Byzantine consensus problem safely in a scalable way without a bottleneck and a leader in cloud computing environments.

Suggested Citation

  • JongBeom Lim & Taeweon Suh & JoonMin Gil & Heonchang Yu, 2014. "Scalable and leaderless Byzantine consensus in cloud computing environments," Information Systems Frontiers, Springer, vol. 16(1), pages 19-34, March.
    • Handle: RePEc:spr:infosf:v:16:y:2014:i:1:d:10.1007_s10796-013-9460-7
    DOI: 10.1007/s10796-013-9460-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10796-013-9460-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10796-013-9460-7?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
    ---><---

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sanjaya K. Panda & Indrajeet Gupta & Prasanta K. Jana, 0. "Task scheduling algorithms for multi-cloud systems: allocation-aware approach," Information Systems Frontiers, Springer, vol. 0, pages 1-19.
    2. Ching-Hsien Hsu & Jianhua Ma & Mohammad S. Obaidat, 2014. "Dynamic intelligence towards merging cloud and communication services," Information Systems Frontiers, Springer, vol. 16(1), pages 1-5, March.
    3. Sanjaya K. Panda & Indrajeet Gupta & Prasanta K. Jana, 2019. "Task scheduling algorithms for multi-cloud systems: allocation-aware approach," Information Systems Frontiers, Springer, vol. 21(2), pages 241-259, April.

    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:spr:infosf:v:16:y:2014:i:1:d:10.1007_s10796-013-9460-7. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.