Costas Busch

Costas Busch


Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2015
Verified
Book Chapter
Closed access
PDF file
GSGokarna Sharma
Gokarna Sharma
CBCostas Busch
Costas Busch
SMSupratik Mukhopadhyay
Supratik Mukhopadhyay

3 April 2014 in Distributed Computing
Verified
Journal Article
Closed access
PDF file
GSGokarna Sharma
Gokarna Sharma
CBCostas Busch
Costas Busch

21 September 2021 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
MJMohammad Mussadiq Jalalzai
Mohammad Mussadiq Jalalzai
CFChen Feng
Chen Feng
CBCostas Busch
Costas Busch
GRGolden G. Richard
Golden G. Richard
JNJianyu Niu
Jianyu Niu
The performance of partially synchronous BFT-based consensus protocols is highly dependent on the primary node. All participant nodes in the network are blocked until they receive a proposal from the primary node to begin the consensus process. Therefore, an honest but slack node (with limited bandwidth) can adversely affect the performance when selected as primary. Hermes decreases protocol dependency on the primary node and minimizes transmission delay induced by the slack primary while keeping low message complexity and latency with high scalability. Hermes achieves these performance improvements by relaxing strong BFT agreement (safety) guarantees only for a specific type of Byzantine faults (also called equivocated faults). Interestingly, we show that in Hermes equivocating by a Byzantine primary is expensive and ineffective. Therefore, the safety of Hermes is comparable to the general BFT consensus. We deployed and tested Hermes on $190$ Amazon $EC2$ instances. In these tests, Hermes's performance was comparable to the state-of-the-art BFT protocol for blockchains (when the network size is large) in the absence of slack nodes. Whereas, in the presence of slack nodes, Hermes outperforms the state-of-the-art BFT protocol significantly in terms of throughput and latency.

20 February 2013 in Algorithmica
Verified
Journal Article
Closed access
PDF file
CBCostas Busch
Costas Busch
RLRyan LaFortune
Ryan LaFortune
STSrikanta Tirthapura
Srikanta Tirthapura

6 November 2007 in Distributed Computing
Verified
Journal Article
Closed access
PDF file
BXBojian Xu
Bojian Xu
STSrikanta Tirthapura
Srikanta Tirthapura
CBCostas Busch
Costas Busch

17 June 2024
Verified
Conference Paper
Open access
RARamesh Adhikari
Ramesh Adhikari
CBCostas Busch
Costas Busch
DKDariusz R. Kowalski
Dariusz R. Kowalski
Sharding is used to improve the scalability and performance of blockchain systems. We investigate the stability of blockchain sharding, where transactions are continuously generated by an adversarial model. The system consists of n processing nodes that are divided into s shards. Following the paradigm of classical adversarial queuing theory, transactions are continuously received at injection rate ρ ≤ 1 and burstiness b > 0. We give an absolute upper bound max{2/k+1, 2⌊√2s⌋} on the maximum injection rate for which any scheduler could guarantee bounded queues and latency of transactions, where k is the number of shards that each transaction accesses. We next give a basic distributed scheduling algorithm for uniform systems where shards are equally close to each other. To guarantee stability, the injection rate is limited to ρ ≤ max{1/18k, 1/ ⌈18√s⌉}. We then provide a fully distributed scheduling algorithm for non-uniform systems where shards are arbitrarily far from each other. By using a hierarchical clustering of the shards, stability is guaranteed with injection rate ρ ≤ 1/(c1d log2 s) ⋅ max{1/k, 1/√s}, where d is the worst distance of any transaction to the shards it will access, and c1 is some positive constant. We also conduct simulations to evaluate the algorithms and measure the average queue sizes and latency throughout the system. To our knowledge, this is the first adversarial stability analysis of sharded blockchain systems.