Skip to main content
SpringerLink
Log in

Consensus Algorithm

  • Chapter
  • First Online:
Decentralised Internet of Things

Part of the book series: Studies in Big Data ((SBD,volume 71))

Abstract

Consensus algorithm in general is framed as a decision-making process where a group of people express their individual opinions to construct the decision which provides a best estimate of a process or system. Each member of the group expresses their opinion to support the decisions taken for a course of action. In simple terms, it is just a method to decide any event to occur within a group. Every one present in the group can suggest an idea, but the majority will be in favor of the one that helps them the most. Others have to deal with this decision whether they liked it or not. Byzantine Fault Tolerance (BFT), a problem of Byzantine General, is a system with a particular event of failure. One can experience best the aforementioned situation (BFT) with a distributed computer system. Many times, there can be malfunctioning consensus systems. These components are responsible for the further conflicting information. Consensus systems can only work successfully if all the elements work in harmony. However, if even one of the components in this system malfunctions the whole system could break down. These Blockchain consensus models are just the way to reach an agreement. However, there can’t be any decentralized system without common consensus algorithms. It won’t even matter whether the nodes trust each other or not. They will have to go by certain principles and reach a collective agreement. In order to do that, it is required to check out all the Consensus algorithms. It can be stated that versatility of blockchain networks is due to consensus algorithms. However, blockchain consensus algorithm may have pros and cons which can always alter the perfection of the algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 199.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. J. Assoc. Comput. Mach. 27(2) (1980)

    Google Scholar 

  2. Lamport, L.: The implementation of reliable distributed multiprocess systems. Comput. Netw. 2, 95–114 (1978)

    MathSciNet  Google Scholar 

  3. Nguyen, G.T., Kim, K.: A Survey about consensus algorithms used in blockchain. J. Inf. Process. Syst. 14(3), 101–128 (2018). https://doi.org/10.3745/JIPS.01.0024

    Article  Google Scholar 

  4. Google Press Center: Fun Facts. Archived from the original on 2001-07-15

    Google Scholar 

  5. Lamport, L.: The part-time parliament. ACM Trans. Comput. Syst. 16(2), 133–169 (1998)

    Article  Google Scholar 

  6. Schneider, F.: Implementing fault-tolerant services using the state machine approach: a tutorial (PDF). ACM Comput. Surv. 22(4). 299-319 (1990). CiteSeerX 10.1.1.69.1536. https://doi.org/10.1145/98163.98167 Leslie

  7. Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558–565 (1978)

    Article  Google Scholar 

  8. Lamport, L.: Paxos made simple. ACM SIGACT News (Distributed computing Column) 32(4), 51–58, 121

    Google Scholar 

  9. Morris, D.Z.: Leaderless, blockchain-based venture capital fund raises \(100\) million and counting. Fortune (2016). Archived from the original on 21 May 2016. Retrieved 23 May 2016

    Google Scholar 

  10. Tromp, J.: Cuckoo cycle: a memory-hard proof of work system (2015). https://eprint.iarc.org/2014/059.pdf

  11. Schwarz, K.: Cuckoo hashing. http://web.stanford.edu/class/cs166/lectures/13/small13.pdf

  12. Bitcoinwiki: Irreversible transactions. https://en.bitcoin.it/wiki/IrreversibleTransactions

  13. Lamport, L.; Massa, M.: Cheap Paxos. In: Proceedings of the International Conference on Dependable Systems and Networks (DSN 2004) (2004)

    Google Scholar 

  14. Liskov, B., Cowling, J.: Viewstamped replication revisited. Technical Report: MIT-CSAIL-TR-2012-021, MIT (2012)

    Google Scholar 

  15. OKI, B.M., Liskov, B.H.: Viewstamped replication: A new primary copy method to support highly-available distributed systems. In: Proceedings of ACM Symposium on Principles of Distributed Computing, PODC’88, pp. 8–17. ACM (1988)

    Google Scholar 

  16. Ghemawat, S., Gobioff, H., Leung, S.T.: The google file system. In: Proceedings of ACM Symposium on Operating Systems Principles, SOSP’03, pp. 29–43. ACM (2003)

    Google Scholar 

  17. Shvachko, K., Kuang, H., Radia, S., Chansler, R.: The hadoop distributed file system. In: Proceedings of Symposium on Mass Storage Systems and Technologies, MSST’10, pp. 1–10. IEEE Computer Society (2010)

    Google Scholar 

  18. Ousterhout, J., Agrawal, P., Erickson, D., Kozyrakis, C., Leverich, J., Mazieres, D., Mitra, S., Narayanan, A., Ongaro, D., Parulkar, G., Rosenblum, M., Rumble, S.M., Stratmann, E., Stutsman, R.: The case for RAM Cloud. Commun. ACM 54, 121–130 (2011)

    Article  Google Scholar 

  19. Dempster, A.P.: Upper and lower probabilities induced by a multiple valued mapping. Ann. Math. Stat. 38, 325–339 (1967)

    Article  Google Scholar 

  20. Saltelli, A., Andres, T.H., Homma, T.: Sensitivity analysis of model output: an investigation of new techniques. Int. J. Comput. Stat. Data Anal. 15, 211–238 (1993)

    Article  Google Scholar 

  21. Helton, J.C.: Uncertainty and sensitivity analysis techniques for use in performance assessment for radioactive waste disposal. Int. J. Reliab. En. Syst. Safety. 42, 327–367 (1993)

    Google Scholar 

  22. Saltelli, A., Chan, K., Scott, E.M.: Sensitivity analysis. In: Wiley Series in Probability and Statistics. Wiley (2000)

    Google Scholar 

  23. Datta, D.: Statistics of Monte Carlo methods used in radiation transport calculation, applications of Monte Carlo methods. In: Kushwaha, H.S. (ed.) Nuclear Science and Engineering. Bhabha Atomic Research Centre, Trombay, Mumbai (2009). ISBN 978-81-8372-047-2

    Google Scholar 

  24. Datta, D., Kushwaha, H.S.: In: Kushwaha, H.S. (ed.) Fundamental Statistics for Uncertainty Analysis, Uncertainty Modeling and Analysis, pp. 1–48. Bhabha Atomic Research Centre (2009). ISBN 978-81-907216-0-8

    Google Scholar 

  25. Shafer, G.: A Mathematical Theory of Evidence. University Press, Princeton (1976)

    MATH  Google Scholar 

  26. Dubois, D., Nguyen H.T., Prade, H.: Possibility Theory, Probability and Fuzzy Sets: Misunderstandings, Bridges and Gaps, Fundamentals of Fuzzy Sets, pp. 343–438. Kluwer Academic Publishers, Boston (2000)

    Google Scholar 

  27. Klir, G.J., Wierman, M.J.: Uncertainty-Based Information. Springer (1998)

    Google Scholar 

  28. Yager, R.R.: Entropy and specificity in a mathematical theory of evidence. Int. J. Gen. Syst. 9, 249–260 (1983)

    Article  MathSciNet  Google Scholar 

  29. International Atomic Energy Agency: Hydrological Dispersion of Radionuclide Material in Relation to Nuclear Power Plant Siting, Safety Series No. 50-SG-S6, IAEA, Vienna (1985)

    Google Scholar 

Download references

Acknowledgements

Authors are thankful to Guru Gobind Singh Indraprastha University and Bhabha Atomic Research Centre for research facility.

Author information

Authors and Affiliations

  1. Nonlinear Dynamics Research Lab, University School of Basic & Applied Sciences, Guru Gobind Singh Indraprastha University, Delhi, India

    Rashmi Bhardwaj

  2. Radiological Physics & Advisory Division, Bhabha Atomic Research Centre, CT & CRS Building, Anushakti Nagar, Mumbai, India

    Debabrata Datta

Authors
  1. Rashmi Bhardwaj
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Debabrata Datta
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rashmi Bhardwaj .

Editor information

Editors and Affiliations

  1. College of Computing and Information Technology, University of Bisha, Bisha, Saudi Arabia

    Mohammad Ayoub Khan

  2. College of Computing and Information Technology, University of Bisha, Bisha, Saudi Arabia

    Mohammad Tabrez Quasim

  3. College of Computing and Information Technology, University of Bisha, Bisha, Saudi Arabia

    Fahad Algarni

  4. College of Computing and Information Technology, University of Bisha, Bisha, Saudi Arabia

    Abdullah Alharthi

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Bhardwaj, R., Datta, D. (2020). Consensus Algorithm. In: Khan, M., Quasim, M., Algarni, F., Alharthi, A. (eds) Decentralised Internet of Things. Studies in Big Data, vol 71. Springer, Cham. https://doi.org/10.1007/978-3-030-38677-1_5

Download citation

Publish with us

Policies and ethics

Search

Navigation