Abstract
Weak leader algorithms can improve the efficiency of reaching consensus by reducing the number of communications for distributed network services. However, they generate a large number of conflicts during operation, which can lead to expensive cross-region communications and make them difficult to adapt to WAN environments. So how to efficiently resolve conflicts becomes a key challenge. In this paper, we propose an approach applied to weak-leader algorithms, which effectively reduces the happens of conflicts and provides low-latency and high-throughput consensus in WAN systems, called the Low-Conflict Consensus method (LCC). Our proposed LCC uses timestamps generated by synchronized clocks to reduce conflicts. We present how LCC determines the delayed time in message processing and adopts some rules to sort the received messages. We validate and evaluate LCC through extensive experiments, which show that LCC can effectively reduce conflicts and the latency to achieve consensus.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Lamport, L.: Paxos made simple. In: ACM SIGACT News (Distributed Computing Column), pp. 18–25 (2001)
Lamport, L.: The part-time parliament. ACM Trans. Comput. Syst., 133–169 (1998)
Moraru, I., Andersen, D.G., Kaminsky, M.: There is more consensus in egalitarian parliaments. In: Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, pp. 358–372 (2013)
Lamport, L.: Fast paxos. In: Distributed Computing, pp. 79–103 (2006)
Du, J., Sciascia, D., Elnikety, S., Zwaenepoel, W., Pedone, F.: Clock-RSM: low-latency inter-datacenter state machine replication using loosely synchronized physical clocks. In: 2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, pp. 343–354 (2014)
Arun, B., Peluso, S., Palmieri, R., Losa, G., Ravindran, B.: Speeding up consensus by chasing fast decisions. In: 2017 47th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), pp. 49–60 (2017)
Howard, H., Malkhi, D., Spiegelman, A.: Flexible Paxos: quorum intersection revisited. In: International Conference on Principles of Distributed Systems, pp. 1–14 (2016)
Ailijiang, A., Charapko, A., Demirbas, M., Kosar, T.: WPaxos: wide area network flexible consensus. IEEE Trans. Parallel Distrib. Syst. 31, 211–223 (2020)
The network time protocol (2014). http://www.ntp.org/
Burrows, M.: The Chubby lock service for loosely-coupled distributed systems. In: Symposium on Operating Systems Design Implementation, pp. 335–350 (2006)
Schneider, F.B.: Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Comput. Surv. 22, 299–319 (1990)
Baker, J., Bond, C., Corbett, JC., et al.: Megastore: providing scalable, highly available storage for interactive services. In: Conference on Innovative Data Systems Research, pp. 223–234 (2011)
Calder, B., Wang, J., Ogus, A., et al.: Windows azure storage: a highly available cloud storage service with strong consistency. In: Symposium on Operating Systems Principles, pp. 143–157 (2011)
Zieliński, P.: Low-latency Atomic Broadcast in the presence of contention. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 505–519. Springer, Heidelberg (2006). https://doi.org/10.1007/11864219_35
Corbett, C., Dean, J., Epstein, M., et al.: Spanner: Google’s globally-distributed database. ACM Trans. Comput. Syst. 31, 1–22 (2013)
Baker, J., Bond, C., Corbett, C., et al.: Megastore: providing scalable, highly available storage for interactive services. In: Conference on Innovative Data Systems Research, pp. 223–234 (2011)
Waldo, J., Wyant, G., Wollrath, A., Kendall, S.: A note on distributed computing. In: Vitek, J., Tschudin, C. (eds.) MOS 1996. LNCS, vol. 1222, pp. 49–64. Springer, Heidelberg (1997). https://doi.org/10.1007/3-540-62852-5_6
Rotem-Gal-Oz, A.: Fallacies of distributed computing explained[EB/OL] (2006). http://www.rgoarchitects.com/Files/fall/
Geng, Y., et al.: Exploiting a natural network effect for scalable, fine-grained clock synchronization. In: Proceedings of the 15th USENIX Conference on Networked Systems Design and Implementation, pp. 81–94 (2018)
Seo, H., Park, J., Bennis, M., Choi, W.: Communication and consensus co-design for distributed, low-latency, and reliable wireless systems. IEEE Internet Things J. 8, 129–143 (2021)
Wang, Y., Hu, H., Qian, W., Zhou, A.: Migratable Paxos. In: Nah, Y., Cui, B., Lee, S.-W., Yu, J.X., Moon, Y.-S., Whang, S.E. (eds.) DASFAA 2020. LNCS, vol. 12112, pp. 296–304. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-59410-7_20
Howard, E., Mortier, R.: Relaxed Paxos: quorum intersection revisited (again). In: Proceedings of the 9th Workshop on Principles and Practice of Consistency for Distributed Data, pp. 16–23 (2022)
Jinkun, G., Sivaraman, A., Prabhakar, B., Rosenblum, M.: NEZHA: deployable and high-performance consensus using synchronized clocks. In: Proceedings of VLDB Endowment, pp. 629–642 (2022)
Tollman, S., Jin Park, S., John, O.: EPaxos revisited. In: Symposium on Networked Systems Design and Implementation, pp. 613–632 (2021)
Ongaro, D., Ousterhout, J.: In search of an understandable consensus algorithm. In: 2014 USENIX Annual Technical Conference (USENIX ATC 2014), pp. 305–319 (2014)
Acknowledgement
This work was supported in part by grants from National Natural Science Foundation of China (Project number: 61971309).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Ni, Y., Xu, G., Tian, Y. (2024). Low-Latency Consensus with Weak-Leader Using Timestamp by Synchronized Clocks. In: Tari, Z., Li, K., Wu, H. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2023. Lecture Notes in Computer Science, vol 14493. Springer, Singapore. https://doi.org/10.1007/978-981-97-0862-8_19
Download citation
DOI: https://doi.org/10.1007/978-981-97-0862-8_19
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-97-0861-1
Online ISBN: 978-981-97-0862-8
eBook Packages: Computer ScienceComputer Science (R0)