Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
IEICE Technical Committee Submission System
Conference Paper's Information		 Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2026-06-11 10:20
Mathematical Analysis of PBFT Consensus Latency and the "Fast-Drop" Mechanism in Different Network Topologies
Xinming XU, Noriaki Kamiyama (Ritsumeikan Univ) NLP2026-3 CCS2026-3
Abstract (in Japanese) (See Japanese page) 
(in English) The Practical Byzantine Fault Tolerance (PBFT) consensus algorithm is a core technology in distributed systems, but evaluating its latency in Wide Area Network (WAN) environments is extremely difficult. While many conventional evaluation models assume a fully connected network between nodes, message forwarding on restricted topologies using the Gossip protocol is common in actual WAN environments. Under such conditions, bursty traffic caused by message flooding leads to severe queuing delays, resulting in non-linear congestion that cannot be captured by conventional queuing theory. In this paper, we propose a novel PBFT latency calculation model that integrates topological heterogeneity and congestion dynamics. This model calculates the baseline of static propagation and transmission delays using the expected value formula for the average number of hops based on graph theory. Furthermore, by applying polynomial regression analysis to empirical data obtained from large-scale event-driven simulations, we derived a dynamic congestion penalty coefficient ($alpha$) that depends on the average network degree $k$ and the number of Byzantine nodes $B$. The proposed latency calculation formula was extensively verified across three representative complex network topologies: Erdős-Rényi (ER), Barabási-Albert (BA), and Watts-Strogatz (WS). Experimental results demonstrate that under a network scale setting of $N=120$, the Mean Absolute Percentage Error (MAPE) between theoretical predictions and actual physical simulation measurements was successfully bounded to approximately 10%. The findings of this study prove that the PBFT consensus latency in complex network environments can be predicted with high precision as a function of physical topology attributes and adversarial conditions, providing a new theoretical guideline for the performance design of distributed systems.
Keyword (in Japanese) (See Japanese page) 
(in English) PBFT / Latency Modeling / Polynomial Regression / / / / /  
Reference Info. IEICE Tech. Rep., vol. 126, no. 69, CCS2026-3, pp. 11-16, June 2026.
Paper # CCS2026-3 
Date of Issue 2026-06-04 (NLP, CCS) 
ISSN Online edition: ISSN 2432-6380
Copyright
and
reproduction		 All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF NLP2026-3 CCS2026-3

Conference Information
Committee CCS NLP  
Conference Date 2026-06-11 - 2026-06-12 
Place (in Japanese) (See Japanese page) 
Place (in English) I-site Namba 
Topics (in Japanese) (See Japanese page) 
Topics (in English) Nonlinear Problems, Complex Communication Sciences, etc. 
Paper Information
Registration To CCS 
Conference Code 2026-06-CCS-NLP 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Mathematical Analysis of PBFT Consensus Latency and the "Fast-Drop" Mechanism in Different Network Topologies 
Sub Title (in English)  
Keyword(1) PBFT  
Keyword(2) Latency Modeling  
Keyword(3) Polynomial Regression  
Keyword(4)  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Xinming XU  
1st Author's Affiliation Ritsumeikan University (Ritsumeikan Univ)
2nd Author's Name Noriaki Kamiyama  
2nd Author's Affiliation Ritsumeikan University (Ritsumeikan Univ)
3rd Author's Name  
3rd Author's Affiliation ()
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2026-06-11 10:20:00 
Presentation Time 25 minutes 
Registration for CCS 
Paper # NLP2026-3, CCS2026-3 
Volume (vol) vol.126 
Number (no) no.68(NLP), no.69(CCS) 
Page pp.11-16 
#Pages 6 
Date of Issue 2026-06-04 (NLP, CCS) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan