Fan-Qi Ma
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Fan-Qi Ma has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Quan-Lin Li
School of Economics and Management, Beijing University of Technology, Beijing, China
2 shared publications - Rui-Na Fan
School of Management, Fudan University, Shanghai, China
2 shared publications Rui-Na Fan
School of Management, Fudan University, Shanghai, China
1 shared publication- Yan-Xia Chang
School of Economics and Management, Beijing University of Technology, Beijing, China
1 shared publication - Yi-Han Liu
School of Management, Huazhong University of Science and Technology, Wuhan, China
1 shared publication
Latest Publications
- 16 September 2022
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 15 (6) , 2516-2528
Stochastic performance modeling for practical byzantine fault tolerance consensus in the blockchain
- 16 September 2022
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 15 (6) , 2516-2528
Stochastic performance modeling for practical byzantine fault tolerance consensus in the blockchain
- Open Access
- 7 January 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (2) , 182
Queuing Theory of Improved Practical Byzantine Fault Tolerant Consensus
In recent years, the use of consensus mechanism to maintain the security of blockchain system has become a considerable concern of the community. Delegated proof of stake (DPoS) and practical Byzantine fault tolerant (PBFT) consensus mechanisms are key technologies in maintaining the security of blockchain system. First, this study proposes a consensus mechanism combining DPoS and PBFT, which can rapidly deal with malicious witness nodes and shorten the time of block verification. Second, the M/PH/1 queuing model is used to analyze the performance of the proposed consensus mechanism, and the performance of the improved practical Byzantine fault tolerant consensus mechanism is evaluated from steady-state conditions and key performance measure of the system. Third, the current study uses the theoretical method of open (Jackson) queuing network, combined with the blockchain consensus process, and provides theoretical analysis with special cases. Lastly, this research utilizes numerical examples to verify the computability of the theoretical results. The analytic method is expected to open a series of potentially promising research in queueing theory of blockchain systems.
- 7 January 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (2) , 182
Open AccessQueuing Theory of Improved Practical Byzantine Fault Tolerant Consensus
In recent years, the use of consensus mechanism to maintain the security of blockchain system has become a considerable concern of the community. Delegated proof of stake (DPoS) and practical Byzantine fault tolerant (PBFT) consensus mechanisms are key technologies in maintaining the security of blockchain system. First, this study proposes a consensus mechanism combining DPoS and PBFT, which can rapidly deal with malicious witness nodes and shorten the time of block verification. Second, the M/PH/1 queuing model is used to analyze the performance of the proposed consensus mechanism, and the performance of the improved practical Byzantine fault tolerant consensus mechanism is evaluated from steady-state conditions and key performance measure of the system. Third, the current study uses the theoretical method of open (Jackson) queuing network, combined with the blockchain consensus process, and provides theoretical analysis with special cases. Lastly, this research utilizes numerical examples to verify the computability of the theoretical results. The analytic method is expected to open a series of potentially promising research in queueing theory of blockchain systems.
- Open Access
- 1 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 42216-42225
Markov Processes in Data Center Networks
A data center network is an important infrastructure in various applications of modern information technologies. Data centers store files with useful information, but the lifetime of these data centers is limited. Once a data center suffers from natural disasters and man-made damages, all the information stored in the files will be lost. Therefore, replicating important files in other data centers is necessary to increase the lifetime of these files in a data center network. In this study, we develop a more general framework for Markov processes in data center networks, that can provide an analysis of file replication processes. A file replication strategy duplicates each important file in at most d - 1 other data centers such that these files can remain in a data center network under a given data security level in the long term. In this regard, we achieve a sufficient stable condition of data center networks by using a matrix-geometric solution. Then, we provide an expression for the stationary average number of normally operating data center networks. We also develop a computational technique for file lifetime via phase type distribution and the RG-factorizations. Lastly, we hope that the methodology and results presented in this study are applicable to research on file lifetime and data security for more general data center networks with a replication mechanism.
- 1 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 42216-42225
Open AccessMarkov Processes in Data Center Networks
A data center network is an important infrastructure in various applications of modern information technologies. Data centers store files with useful information, but the lifetime of these data centers is limited. Once a data center suffers from natural disasters and man-made damages, all the information stored in the files will be lost. Therefore, replicating important files in other data centers is necessary to increase the lifetime of these files in a data center network. In this study, we develop a more general framework for Markov processes in data center networks, that can provide an analysis of file replication processes. A file replication strategy duplicates each important file in at most d - 1 other data centers such that these files can remain in a data center network under a given data security level in the long term. In this regard, we achieve a sufficient stable condition of data center networks by using a matrix-geometric solution. Then, we provide an expression for the stationary average number of normally operating data center networks. We also develop a computational technique for file lifetime via phase type distribution and the RG-factorizations. Lastly, we hope that the methodology and results presented in this study are applicable to research on file lifetime and data security for more general data center networks with a replication mechanism.
- Open Access
Optimization Strategies for Dockless Bike Sharing Systems via two Algorithms of Closed Queuing Networks
The dockless bike sharing system (DBSS) has been globally adopted as a sustainable transportation system. Due to the robustness and tractability of the closed queuing network (CQN), it is a well-behaved method to model DBSSs. In this paper, we view DBSSs as CQNs and use the mean value analysis (MVA) algorithm to calculate a small size DBSS and the flow equivalent server (FES) algorithm to calculate the larger size DBSS. This is the first time that the FES algorithm is used to study the DBSS, by which the CQN can be divided into different subnetworks. A parking region and its downlink roads are viewed as a subnetwork, so the computation of CQN is reduced greatly. Based on the computation results of the two algorithms, we propose two optimization functions for determining the optimal fleet size and repositioning flow, respectively. At last, we provide numerical experiments to verify the two algorithms and illustrate the optimal fleet size and repositioning flow. This computation framework can also be used to analyze other on-demand transportation networks.
Open AccessOptimization Strategies for Dockless Bike Sharing Systems via two Algorithms of Closed Queuing Networks
The dockless bike sharing system (DBSS) has been globally adopted as a sustainable transportation system. Due to the robustness and tractability of the closed queuing network (CQN), it is a well-behaved method to model DBSSs. In this paper, we view DBSSs as CQNs and use the mean value analysis (MVA) algorithm to calculate a small size DBSS and the flow equivalent server (FES) algorithm to calculate the larger size DBSS. This is the first time that the FES algorithm is used to study the DBSS, by which the CQN can be divided into different subnetworks. A parking region and its downlink roads are viewed as a subnetwork, so the computation of CQN is reduced greatly. Based on the computation results of the two algorithms, we propose two optimization functions for determining the optimal fleet size and repositioning flow, respectively. At last, we provide numerical experiments to verify the two algorithms and illustrate the optimal fleet size and repositioning flow. This computation framework can also be used to analyze other on-demand transportation networks.