Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 82 tok/s
Gemini 2.5 Pro 43 tok/s Pro
GPT-5 Medium 30 tok/s
GPT-5 High 32 tok/s Pro
GPT-4o 95 tok/s
GPT OSS 120B 469 tok/s Pro
Kimi K2 212 tok/s Pro
2000 character limit reached

BCM-Broadcast: A Byzantine-Tolerant Causal Broadcast Algorithm for Distributed Mobile Systems (2401.16956v1)

Published 30 Jan 2024 in cs.DC

Abstract: This paper presents an algorithm, called BCM-Broadcast, for the implementation of causal broadcast in distributed mobile systems in the presence of Byzantine failures. The BCM-Broadcast algorithm simultaneously focuses on three critical challenges in distributed systems: Byzantine failures, Causality, and Mobility. We first present a hierarchical architecture for BCM-Broadcast. Then, we define twelve properties for BCM-Broadcast, including validity, integrity, termination, and causality. We then show that BCM-Broadcast satisfies all these properties. We also prove the safety of BCM-Broadcast; i.e., no healthy process delivers a message from any Byzantine process, assuming that the number of Byzantine processes is less than a third of the total number of mobile nodes. Subsequently, we show that the message complexity of BCM-Broadcast is linear. Finally, using the Poisson process, we analyze the probability of the violation of the safety condition under different mobility scenarios.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (35)
  1. Bmobi_causal: a causal broadcast protocol in mobile dynamic groups. In Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, pages 421–421, 2008.
  2. Causal ordering in deterministic overlay networks. Technical report, Citeseer, 2004.
  3. Breaking the scalability barrier of causal broadcast for large and dynamic systems. In 2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS), pages 51–60. IEEE, 2018.
  4. Causal and δ𝛿\deltaitalic_δ-causal broadcast in opportunistic networks. Future Generation Computer Systems, 118:142–156, 2021.
  5. A causal broadcast protocol for distributed mobile systems. Systems and Computers in Japan, 32(3):65–75, 2001.
  6. Byzantine-tolerant causal broadcast. Theoretical Computer Science, 885:55–68, 2021.
  7. Byzantine fault-tolerant causal ordering. In Proceedings of the 24th International Conference on Distributed Computing and Networking, pages 100–109, 2023.
  8. The causal ordering abstraction and a simple way to implement it. Information processing letters, 39(6):343–350, 1991.
  9. Gabriel Bracha. Asynchronous byzantine agreement protocols. Information and Computation, 75(2):130–143, 1987.
  10. Trading off t-resilience for efficiency in asynchronous byzantine reliable broadcast. Parallel Processing Letters, 26(04):1650017, 2016.
  11. Reliable communication in the presence of failures. ACM Transactions on Computer Systems (TOCS), 5(1):47–76, 1987.
  12. The isis project: Real experience with a fault tolerant programming system. ACM SIGOPS Operating Systems Review, 25(2):103–107, 1991.
  13. Scalability approaches for causal multicast: a survey. Computing, 98:923–947, 2016.
  14. Causal order delivery in a multicast environment: An improved algorithm. Journal of Parallel and Distributed Computing, 62(1):111–131, 2002.
  15. A survey of scalability approaches for reliable causal broadcasts. Technical report, Tech. Rep. ITI-SIDI-2009/010, 2009.
  16. Reducing false causality in causal message ordering. In International Conference on High-Performance Computing, pages 61–72. Springer, 2000.
  17. Introduction to reliable and secure distributed programming. Springer Science & Business Media, 2011.
  18. K Ravindran and S Samdarshi. A flexible causal broadcast communication interface for distributed applications. Journal of Parallel and Distributed Computing, 16(2):134–157, 1992.
  19. An efficient causal group communication protocol for p2p hierarchical overlay networks. Journal of Parallel and Distributed Computing, 102:149–162, 2017.
  20. Necessary and sufficient conditions on information for causal message ordering and their optimal implementation. Distributed Computing, 11:91–111, 1998.
  21. Leslie Lamport. Time, clocks, and the ordering of events in a distributed system. In Concurrency: the Works of Leslie Lamport, pages 179–196. 2019.
  22. Causal consistent databases. Open Journal of Databases (OJDB), 2(1):17–35, 2015.
  23. Causal consistency algorithms for partially replicated and fully replicated systems. Future Generation Computer Systems, 86:1118–1133, 2018.
  24. Optimistic causal consistency for geo-replicated key-value stores. IEEE Transactions on Parallel and Distributed Systems, 32(3):527–542, 2020.
  25. A protocol for causally ordered message delivery in mobile computing systems. Mobile Networks and Applications, 2:365–372, 1997.
  26. A scalable causal broadcast that tolerates dynamics of mobile networks. In Proceedings of the 23rd International Conference on Distributed Computing and Networking, pages 9–18, 2022.
  27. Causal multicast in mobile networks. In The IEEE Computer Society’s 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004.(MASCOTS 2004). Proceedings., pages 213–220. IEEE, 2004.
  28. An optimal causal broadcast protocol in mobile dynamic groups. In 2008 IEEE International Symposium on Parallel and Distributed Processing with Applications, pages 477–484. IEEE, 2008.
  29. An adaptive causal ordering algorithm suited to mobile computing environments. Journal of Parallel and Distributed Computing, 41(2):190–204, 1997.
  30. Solvability of byzantine fault-tolerant causal ordering problems. In International Conference on Networked Systems, pages 87–103. Springer, 2022.
  31. Causal ordering properties of byzantine reliable broadcast primitives. In 2022 IEEE 21st International Symposium on Network Computing and Applications (NCA), volume 21, pages 115–122. IEEE, 2022.
  32. Detecting causality in the presence of byzantine processes: There is no holy grail. In 2022 IEEE 21st International Symposium on Network Computing and Applications (NCA), volume 21, pages 73–80. IEEE, 2022.
  33. Byzantine fault-tolerant causal broadcast on incomplete graphs. In 2022 IEEE 21st International Symposium on Network Computing and Applications (NCA), volume 21, pages 63–71. IEEE, 2022.
  34. Dependency sequences and hierarchical clocks: efficient alternatives to vector clocks for mobile computing systems. Wireless Networks, 3:349–360, 1997.
  35. Mobi_causal: a protocol for causal message ordering in mobile computing systems. ACM SIGMOBILE Mobile Computing and Communications Review, 9(2):19–28, 2005.
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

List Streamline Icon: https://streamlinehq.com Explore 10 Community Prompts
Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets