Skip to main content

A Cycle-Time-Analysis Model for Byzantine Fault Tolerance

  • Conference paper
  • First Online:
Algorithms and Architectures for Parallel Processing (ICA3PP 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9532))

  • 1718 Accesses

Abstract

Mission-critical services must be replicated in order to be available even if Byzantine faults happen. Castro and Liskov proposed a successful Byzantine fault tolerant protocol named CLBFT (Castro Liskov Byzantine Fault Tolerance), which overcame performance drawbacks of previous protocols. Other proposals extended CLBFT with further optimizations, but these protocols did not support asynchronous invocations from replicated calling services, thereby making these protocols unsuitable for nested computation model such as SOA (Service-Oriented Architecture). In this paper, we extend CLBFT to support asynchronous invocations, and we propose a window mechanism to support batch request and confirmation. A cycle-time-analysis model is proposed to analyze every stage of the protocol to measure performance improvements by window mechanism. Experimental results show effectiveness of proposed protocol.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

References

  1. Castro, M., Liskov, B.: Practical Byzantine fault tolerance. In: 3rd Symposium on Operating Systems Design and Implementation, New Orleans, pp. 173–186 (1999)

    Google Scholar 

  2. Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Trans. Prog. Lang. Syst. 4, 382–401 (1982)

    Article  MATH  Google Scholar 

  3. Bilorusets, R.: Web services reliable messaging specification (2005). http://www.ibm.com/developerworks/library/specification/ws-rm

  4. Kotla, R.: Zyzzyva: speculative Byzantine fault tolerance. In: 21st ACM SIGOPS Symposium on Operating Systems Principles, pp. 45–58(2007)

    Google Scholar 

  5. Wenbing Zhao, C.: BFT-WS: a Byzantine fault tolerance framework for web services. In: 11th International IEEE EDOC Conference Workshop, pp. 89–96 (2007)

    Google Scholar 

  6. Abd-El-Malek, M., et al.: Fault-scalable Byzantine fault tolerant Services. SIGOPS Oper. Syst. Rev. 39, 59–74 (2005)

    Article  Google Scholar 

  7. Merideth, M., Iyengar, A., Mikalsen, T., et al.: Thema: Byzantine-fault-tolerant middleware for web services applications. In: Proceedings of the IEEE Symposium on Reliable Distributed Systems, pp. 131–142 (2005)

    Google Scholar 

  8. Erradi, A., Maheshwari, P.: A broker-based approach for improving web services reliability. In: Proceedings of the IEEE International Conference on Web Services, Orlando, pp. 41–53 (2005)

    Google Scholar 

  9. Castro, M., Liskov, B.: Proactive recovery in a Byzantine fault-tolerant system. In: Symposium on Operating Systems Design and Implementation, pp. 287–301 (2000)

    Google Scholar 

  10. Wenbing, Z.: Byzantine fault tolerance for nondeterministic applications. In: Proceedings of the Third IEEE International Symposium on Dependable, Autonomic and Secure Computing, pp. 108–115. Loyola College Graduate Center, Columbia (2007)

    Google Scholar 

  11. Daniel, F. et al.: Benchmarking Of Web Services Platforms. In: International Conference on Web Information Systems and Technologies (WEBIST 2006), pp. 11–13, Setubal (April 2006)

    Google Scholar 

  12. TPC, 2008. TPC Benchmark App (Application Server) specification, version 1.3. Transaction Processing Performance Council. http://www.tpc.org/tpc_app/

  13. Rodrigues, R., Castro, M., Liskov, B.: BASE: using abstraction to improve fault tolerance. In: Symposium on Operating Systems Principles, pp. 45–60 (2001)

    Google Scholar 

  14. Tadashi Araragi, C.: Byzantine fault tolerance for agent systems. In: Proceedings of the International Conference on Dependability of Computer Systems (2006)

    Google Scholar 

  15. Martin, J.P., Alvisi, L., Dahlin, M.: Minimal Byzantine Storage. Distributed Computing, pp. 311–325. Springer, Berlin (2002)

    Chapter  Google Scholar 

  16. Paxson, V.: Bro: a system for detecting network intruders in real-time. Comput. Netw. 31, 2435–2463 (1999)

    Article  Google Scholar 

  17. de Sá, A.S., de Araújo Macêdo, R.J.: QoS self-configuring failure detectors for distributed systems. In: Eliassen, F., Kapitza, R. (eds.) DAIS 2010. LNCS, vol. 6115, pp. 126–140. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

Download references

Acknowledgments

This research is supported in part by Research Project for Science and Technology of Hubei Provincial Department of Education, China under award B2015322, and by Youth Foundation of Wuhan Institute of Technology, China under award Q201407.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wei Zhou .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Chen, L., Zhou, W. (2015). A Cycle-Time-Analysis Model for Byzantine Fault Tolerance. In: Wang, G., Zomaya, A., Martinez, G., Li, K. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2015. Lecture Notes in Computer Science(), vol 9532. Springer, Cham. https://doi.org/10.1007/978-3-319-27161-3_60

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-27161-3_60

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-27160-6

  • Online ISBN: 978-3-319-27161-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics