poster

Free access

Network-Assisted Raft Consensus Algorithm

Authors:

Yang Zhang,

Bo Han,

Zhi-Li Zhang,

Vijay GopalakrishnanAuthors Info & Claims

SIGCOMM Posters and Demos '17: Proceedings of the SIGCOMM Posters and Demos

Pages 94 - 96

https://doi.org/10.1145/3123878.3131998

Published: 22 August 2017 Publication History

PDF eReader

Abstract

Consensus is a fundamental problem in distributed computing. In this poster, we ask the following question: can we partially offload the execution of a consensus algorithm to the network to improve its performance? We argue for an affirmative answer by proposing a network-assisted implementation of the Raft consensus algorithm. Our approach reduces consensus latency, is failure-aware, and does not sacrifice correctness or scalability. In order to enable Raft-aware forwarding and quick response, we use P4-based programmable switches and offload partial Raft functionality to the switch. We demonstrate the efficacy of our approach and performance improvements it offers via a prototype implementation.

References

[1]

OpenDaylight Controller:MD-SAL. https://wiki.opendaylight.org/view/OpenDaylight_Controller:MD-SAL:Architecture:Clustering:2-Node.

Google Scholar

[2]

Logcabin: A distributed storage using raft. https://github.com/logcabin, 2016.

Google Scholar

[3]

P4 behavioral simulator. https://github.com/p4lang/p4factory, 2017.

Google Scholar

[4]

P. Bosshart et al. P4: Programming Protocol-Independent Packet Processors. In CCR, 2014.

Digital Library

Google Scholar

[5]

H. T. Dang, M. Canini, F. Pedone, and R. Soulé. Paxos made switch-y. SIGCOMM CCR, 2016.

Digital Library

Google Scholar

[6]

H. T. Dang et al. Netpaxos: Consensus at network speed. In Proc. SOSR, 2015.

Digital Library

Google Scholar

[7]

P. Hunt et al. Zookeeper: Wait-free coordination for internet-scale systems. In Proc. ATC, 2010.

Digital Library

Google Scholar

[8]

Z. István et al. Consensus in a box: Inexpensive coordination in hardware. In Proc. NSDI, 2016.

Digital Library

Google Scholar

[9]

L. Lamport. The Part-time Parliament. ACM Transactions on Computer Systems, 1998.

Digital Library

Google Scholar

[10]

D. Ongaro et al. In Search of an Understandable Consensus Algorithm. In Proc. ATC, 2014.

Digital Library

Google Scholar

Cited By

View all

Yu XLiu RNkenyereye LWang ZRen Y(2024)ACRS-Raft: A Raft Consensus Protocol for Adaptive Data Maintenance in the Metaverse Based on Cauchy Reed–Solomon CodesIEEE Transactions on Consumer Electronics10.1109/TCE.2024.337343570:1(3792-3801)Online publication date: Feb-2024
https://doi.org/10.1109/TCE.2024.3373435
Luo HYang XYu HSun GLei BGuizani M(2024)Performance Analysis and Comparison of Nonideal Wireless PBFT and RAFT Consensus Networks in 6G CommunicationsIEEE Internet of Things Journal10.1109/JIOT.2023.332349211:6(9752-9765)Online publication date: 15-Mar-2024
https://doi.org/10.1109/JIOT.2023.3323492
Jiang JHuang ZXiang QTang LShu JSchulzrinne HKohler EMaltz DMisra V(2023)Poster: P4-DPLL: Accelerating SAT Solving Using Switching ASICsProceedings of the ACM SIGCOMM 2023 Conference10.1145/3603269.3610863(1123-1125)Online publication date: 10-Sep-2023
https://dl.acm.org/doi/10.1145/3603269.3610863
Show More Cited By

Index Terms

Network-Assisted Raft Consensus Algorithm
1. Networks
  1. Network algorithms
    1. Control path algorithms
      1. Network control algorithms
  2. Network protocols
    1. Network protocol design

Recommendations

When Raft Meets SDN: How to Elect a Leader and Reach Consensus in an Unruly Network
APNet '17: Proceedings of the First Asia-Pacific Workshop on Networking

In SDN, the logically centralized control plane ("network OS") is often realized via multiple SDN controllers for scalability and reliability. ONOS is such an example, where it employs Raft -- a new consensus protocol developed recently -- for state ...
Uniform consensus is harder than consensus

We compare the consensus and uniform consensus problems in synchronous systems. In contrast to consensus, uniform consensus is not solvable with byzantine failures. This still holds for the omission failure model if a majority of processes may be ...
The k-simultaneous consensus problem

This paper introduces and investigates the k-simultaneous consensus task: each process participates at the same time in k independent consensus instances until it decides in any one of them. It is shown that the k-simultaneous consensus task is ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SIGCOMM Posters and Demos '17: Proceedings of the SIGCOMM Posters and Demos

August 2017

158 pages

ISBN:9781450350570

DOI:10.1145/3123878

Co-chairs:
Jeff Burke
UCLA
,
Matthias Wählisch
Freie Universität Berlin
,
Nicholas Zhang
Huawei Technologies, China
,
David Meyer
University of Oregon/Brocade
,
Puneet Sharma
Hewlett Packard Labs

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 August 2017

Check for updates

Author Tags

Qualifiers

Poster
Research
Refereed limited

Conference

SIGCOMM '17

Sponsor:

SIGCOMM

SIGCOMM '17: ACM SIGCOMM 2017 Conference

August 22 - 24, 2017

CA, Los Angeles, USA

Acceptance Rates

Overall Acceptance Rate 92 of 158 submissions, 58%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

18
Total Citations
View Citations
1,686
Total Downloads

Downloads (Last 12 months)527
Downloads (Last 6 weeks)128

Reflects downloads up to 14 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Yu XLiu RNkenyereye LWang ZRen Y(2024)ACRS-Raft: A Raft Consensus Protocol for Adaptive Data Maintenance in the Metaverse Based on Cauchy Reed–Solomon CodesIEEE Transactions on Consumer Electronics10.1109/TCE.2024.337343570:1(3792-3801)Online publication date: Feb-2024
https://doi.org/10.1109/TCE.2024.3373435
Luo HYang XYu HSun GLei BGuizani M(2024)Performance Analysis and Comparison of Nonideal Wireless PBFT and RAFT Consensus Networks in 6G CommunicationsIEEE Internet of Things Journal10.1109/JIOT.2023.332349211:6(9752-9765)Online publication date: 15-Mar-2024
https://doi.org/10.1109/JIOT.2023.3323492
Jiang JHuang ZXiang QTang LShu JSchulzrinne HKohler EMaltz DMisra V(2023)Poster: P4-DPLL: Accelerating SAT Solving Using Switching ASICsProceedings of the ACM SIGCOMM 2023 Conference10.1145/3603269.3610863(1123-1125)Online publication date: 10-Sep-2023
https://dl.acm.org/doi/10.1145/3603269.3610863
Huang ZFan XJiang JSong MTang LXiang QShu J(2023)Accelerating SAT Solving Using Switching ASICs2023 IEEE 29th International Conference on Parallel and Distributed Systems (ICPADS)10.1109/ICPADS60453.2023.00271(1983-1990)Online publication date: 17-Dec-2023
https://doi.org/10.1109/ICPADS60453.2023.00271
Choumas KKorakis T(2023)When Machine Learning Meets Raft: How to Elect a Leader over a NetworkGLOBECOM 2023 - 2023 IEEE Global Communications Conference10.1109/GLOBECOM54140.2023.10437805(3705-3710)Online publication date: 4-Dec-2023
https://doi.org/10.1109/GLOBECOM54140.2023.10437805
Kianpisheh STaleb T(2023)A Survey on In-Network Computing: Programmable Data Plane and Technology Specific ApplicationsIEEE Communications Surveys & Tutorials10.1109/COMST.2022.321323725:1(701-761)Online publication date: Sep-2024
https://doi.org/10.1109/COMST.2022.3213237
Tong SZhou XFu WZhang YWu XChen M(2023)ImprovedRaft Algorithm Based on Communication Bottleneck and Log Inconsistency2023 China Automation Congress (CAC)10.1109/CAC59555.2023.10451363(4833-4838)Online publication date: 17-Nov-2023
https://doi.org/10.1109/CAC59555.2023.10451363
Hauser FHäberle MMerling DLindner SGurevich VZeiger FFrank RMenth M(2023)A survey on data plane programming with P4: Fundamentals, advances, and applied researchJournal of Network and Computer Applications10.1016/j.jnca.2022.103561212(103561)Online publication date: Mar-2023
https://doi.org/10.1016/j.jnca.2022.103561
Akarte HYadav D(2023)Packet processing and data plane program verification: A survey with tools, techniques, and challengesInternational Journal of Communication Systems10.1002/dac.555436:14Online publication date: 14-Jun-2023
https://doi.org/10.1002/dac.5554
Chen XXu SMa KChen P(2022)Cross-Domain Identity Authentication Protocol of Consortium Blockchain Based on Face RecognitionInformation10.3390/info1311053513:11(535)Online publication date: 10-Nov-2022
https://doi.org/10.3390/info13110535
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

When Raft Meets SDN: How to Elect a Leader and Reach Consensus in an Unruly Network

Uniform consensus is harder than consensus

The k-simultaneous consensus problem