Rui-Na Fan

Dr. Rui-Na Fan


Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
7 January 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
FMFan-qi Ma
Fan-qi Ma
RFRui-Na Fan
Rui-Na Fan
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.

18 March 2020 in Processes
Verified
Journal Article
Open access
PDF file
RFRui-Na Fan
Rui-Na Fan
FMFan-qi Ma
Fan-qi Ma
QLQuan-Lin Li
Quan-Lin Li
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.


16 October 2019 in Communications in Computer and Information Science
Verified
Book Chapter
Closed access
PDF file
Usman AkbarUsman Akbar
Usman Akbar
RFRui-Na Fan
Rui-Na Fan
QLQuan-Lin Li
Quan-Lin Li

17 June 2021 in Annals of Operations Research
Verified
Journal Article
Closed access
PDF file
QLQuan-Lin Li
Quan-Lin Li
RFRui-Na Fan
Rui-Na Fan

14 March 2021 in IET Intelligent Transport Systems
Verified
Journal Article
Open access
PDF file
RFRui-Na Fan
Rui-Na Fan
FMFan‐Qi Ma
Fan‐Qi Ma
Bike‐sharing systems have gained considerable attention with the tide of sharing economy. This paper proposes a dual selection mechanism and a dynamic double‐threshold repositioning policy to reduce problematic stations. The selection mechanism is a preventive self‐balancing measure, which is carried out before problematic stations appear. To prove the effectiveness of this selection mechanism, a system of differential equations is set up, the steady‐state probabilities of the bike‐sharing system are computed, and numerical experiments to verify the applicability and computability of the computational method are provided. The method providd in this study contributes to improving the efficiency of the bike‐sharing by self‐balancing measure.