Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Ioannis Kaklamanis

dblp:332/2974 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%
Network and information security
1 paper
Blockchain and cryptocurrency security · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed systems › fault tolerance
byzantine fault tolerance
0.612022
Poster: Coded Broadcast for Scalable Leader-Based BFT Consensus · CCS 2022
Blockchain and cryptocurrency security › blockchain scalability
scalable consensus
0.212022
Poster: Coded Broadcast for Scalable Leader-Based BFT Consensus · CCS 2022

Methods — techniques the papers use, named apart from their topics

network coding · 1.1benchmarking · 1.1
YearPublicationVenuePosition
2022 Poster: Coded Broadcast for Scalable Leader-Based BFT Consensus
abstract
With the success of blockchains and cryptocurrencies, Byzantine Fault Tolerant state machine replication protocols have attracted considerable interest. A class of such protocols that is particularly popular are leader-based protocols, where one server (the leader) is tasked with proposing and broadcasting blocks of new data to be applied to the state machine. Simple implementation of the broadcast requires the leader to send entire blocks to all other servers, creating a network bottleneck at the leader and reducing the system throughput as the number of servers scales. We demonstrate this effect by benchmarking HotStuff, a popular leader-based protocol, and then propose a mitigation based on coding. The key idea is to let the leader encode the block into small chunks, and task each server with broadcasting a chunk, thus utilizing the bandwidth of all servers during the process. We apply this idea on HotStuff, and demonstrate a 64% improvement in throughput in a deployment across 9 servers.
Ioannis Kaklamanis, Lei Yang 0031, Mohammad Alizadeh
CCS1