• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.2
• /
• pp.271-277
• /
• 2022

PBFT (Practical Byzantine Fault Tolerant) is a consensus algorithm that can achieve consensus by resolving unintentional and intentional faults in a distributed network environment and can guarantee high performance and absolute finality. However, as the size of the network increases, the network load also increases due to message broadcasting that repeatedly occurs during the consensus process. Due to the characteristics of the PBFT algorithm, it is suitable for small/private blockchain, but there is a limit to its application to large/public blockchain. Because PBFT affects the performance of blockchain networks, the industry should test whether PBFT is suitable for products and services, and academia needs a unified evaluation metric and technology for PBFT performance improvement research. In this paper, quantitative evaluation metrics and evaluation frameworks that can evaluate PBFT family consensus algorithms are studied. In addition, the throughput, latency, and fault tolerance of PBFT are evaluated using the proposed PBFT evaluation framework.

• Journal of the Korean Society for Precision Engineering
• /
• v.11 no.4
• /
• pp.126-137
• /
• 1994

Performance management of computer networks is intended to improve a given network performance in order for more efficient information exchange between subsystems of an integrated large-scale system. Importance of perfomance management is growing as many functions of the large- scale system depend on the quality of communication services provided by the network. The role of performance management is to manipulate the adjustable protocol parameters on line so that the network can adapt itself to a dynamic environment. This can be divided into two subtasks : performance evaluation to find how changes in protocol parameters affect the network performance and decision making to determine the magnitude and direction of parameter adjustment. This paper is the first part of the two papers focusing on conceptual design, development, and evaluation of performance management for token bus networks. This paper specifically deals with the task of performance evaluation which utilizes the principle of perturbation analysis of discrete event dynamic systems. The developed algorithm can estimate the network performance under a perturbed protocol parameter setting from observations of the network operations under a nominal parameter setting.

• Journal of the Korean Society for Precision Engineering
• /
• v.13 no.9
• /
• pp.114-129
• /
• 1996

This paper describes the whole development phase for the underwater vehicle actuating system with high hydroload torque disturbance. This includes requirement analysis, system modeling, control algorithm design, real time implementation, test and performance evaluations. As for driving control algorithms, fuzzy logic, variable structure and PD(Proportional-Differential) algorithm were designed and implemented on board controller using a single chip microprocessor. Intel 8797. And test and performance evaluation is carried out both single test and wystem integration test. We could confirm the basic performance of actuating system through the single test and gereral developing work of any actuating systems was finished with a single performance test of actuating system without system integration test. But, we suggested that system integration test be needed. System integration test is carried out using G/C HILS(Guidance and Control Hardware-In-the -Loop Simulation) which is constituted flight motion simulator, load simulator, real time host computer and the related subsystems such as inertial navigation system, power supply system and Guidance and Control Computer etc.. The most important practical contribution of this paper is that full system characteristics such as minimal control effort, enhancement of guidance and autopilot performance by the actuating system using G/C HILS technique are investigated. Through full running G/C HILS, in spite of the passing to single tests, some control algorithm resulted in failure as to stability of full system and system time frame.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2554-2580
• /
• 2018

Lenstra-Lenstra-$Lov{\acute{a}}sz$ (LLL) is an effective receiving algorithm for Multiple-Input-Multiple-Output (MIMO) systems, which is believed can achieve full diversity in MIMO detection of fading channels. However, the LLL algorithm features polynomial complexity and shows poor performance in terms of convergence. The reduction of algorithmic complexity and the acceleration of convergence are key problems in optimizing the LLL algorithm. In this paper, a variant of the LLL algorithm, the Hybrid-Fix-and-Round LLL algorithm, which combines both fix and round measurements in the size reduction procedure, is proposed. By utilizing fix operation, the algorithmic procedure is altered and the size reduction procedure is skipped by the hybrid algorithm with significantly higher probability. As a consequence, the simulation results reveal that the Hybrid-Fix-and-Round-LLL algorithm carries a faster rate of convergence compared to the original LLL algorithm, and its algorithmic complexity is at most one order lower than original LLL algorithm in real field. Comparing to other families of LLL algorithm, Hybrid-Fix-and-Round-LLL algorithm can make a better compromise in performance and algorithmic complexity.

• Journal of the Korean Society of Industry Convergence
• /
• v.3 no.2
• /
• pp.167-178
• /
• 2000

Software RAID(Redundant Arrays of Inexpensive Disks) is defined as a storage system that provides capabilities of hardware RAID, and guarantees high reliability as well as high performance. In this paper, we propose an enhanced disk scheduling algorithm and a scheme to guarantee reliability of data. We also design and implement software RAID by utilizing these mechanism to develop a storage system for multimedia applications. Because the proposed algorithm improves a defect of traditional GSS algorithm that disk I/O requests arc served in a fixed order, it minimizes buffer consumption and reduces the number of deadline miss through service group exchange. Software RAID also alleviates data copy overhead during disk services by sharing kernel memory. Even though the implemented software RAID uses the parity approach to guarantee reliability of data, it adopts different data allocation scheme. Therefore, we reduce disk accesses in logical XOR operations to compute the new parity data on all write operations. In the performance evaluation experiments, we found that if we apply the proposed schemes to implement the Software RAID, it can be used as a storage system for small-sized video-on-demand servers.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.4
• /
• pp.1342-1359
• /
• 2021

The data deduplication technique identifies the duplicates and minimizes the redundant storage data in the backup server. The chunk level deduplication plays a significant role in detecting the appropriate chunk boundaries, which solves the challenges such as minimum throughput and maximum chunk size variance in the data stream. To provide the solution, we propose a new chunking algorithm called Dynamic Prime Chunking (DPC). The main goal of DPC is to dynamically change the window size within the prime value based on the minimum and maximum chunk size. According to the result, DPC provides high throughput and avoid significant chunk variance in the deduplication system. The implementation and experimental evaluation have been performed on the multimedia and operating system datasets. DPC has been compared with existing algorithms such as Rabin, TTTD, MAXP, and AE. Chunk Count, Chunking time, throughput, processing time, Bytes Saved per Second (BSPS) and Deduplication Elimination Ratio (DER) are the performance metrics analyzed in our work. Based on the analysis of the results, it is found that throughput and BSPS have improved. Firstly, DPC quantitatively improves throughput performance by more than 21% than AE. Secondly, BSPS increases a maximum of 11% than the existing AE algorithm. Due to the above reason, our algorithm minimizes the total processing time and achieves higher deduplication efficiency compared with the existing Content Defined Chunking (CDC) algorithms.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.4
• /
• pp.71-77
• /
• 2020

Through the consensus algorithm, which is the core technology of the blockchain, the same data is accurately shared between connected nodes. The use of an appropriate consensus algorithm that considers the user and the usage environment ensures efficient maintenance of data integrity and accuracy. In this paper, we proposed a performance evaluation method for efficient selection of a consensus algorithm among authorized nodes considering the characteristics of a private blockchain platform, and applied the modified item to the existing published formula considering the number of authoritative connected nodes. Through this process, it was possible to simplify the consensus process considering the stability between nodes. The stability of the consensus process can be improved by selecting an appropriate consensus algorithm based on the proposed research.

• Proceedings of the Safety Management and Science Conference
• /
• 2002.05a
• /
• pp.91-97
• /
• 2002

In this thesis presents line balancing problems of two-sided and mixed model assembly line widely used in practical fields using genetic algorithm for reducing throughput time, cost of tools and fixtures and improving flexibility of assembly lines. Two-sided and mixed model assembly line is a special type of production line where variety of product similar in product characteristics are assembled in both sides. This thesis proposes the genetic algorithm adequate to each step in tow-sided and mixed model assembly line with suitable presentation, individual, evaluation function, selection and genetic parameter. To confirm proposed genetic algorithm, we apply to increase the number of tasks in case study. And for evaluation the performance of proposed genetic algorithm, we compare to existing algorithm of one-sided and mixed model assembly line. The results show that the algorithm is outstanding in the problems with a larger number of stations or larger number of tasks.

• Journal of the Korea Safety Management & Science
• /
• v.4 no.2
• /
• pp.83-101
• /
• 2002

In this thesis presents line balancing problems of two-sided and mixed model assembly line widely used in practical fields using genetic algorithm for reducing throughput time, cost of tools and fixtures and improving flexibility of assembly lines. Two-sided and mixed model assembly line is a special type of production line where variety of product similar in product characteristics are assembled in both sides. This thesis proposes the genetic algorithm adequate to each step in tow-sided and mixed model assembly line with suitable presentation, individual, evaluation function, selection and genetic parameter. To confirm proposed genetic algorithm, we apply to increase the number of tasks in case study. And for evaluation the performance of proposed genetic algorithm, we compare to existing algorithm of one-sided and mixed model assembly line. The results show that the algorithm is outstanding in the problems with a larger number of stations or larger number of tasks.

• Journal of information and communication convergence engineering
• /
• v.8 no.1
• /
• pp.45-50
• /
• 2010

EPCglobal Class-1 Gen-2 standard proposed Q-algorithm to select a frame size for the next query round. Q-algorithm calculates the frame size without estimating the number of tags. Therefore, the Q-algorithm has advantage that the reader's algorithm is simpler than other algorithms. However, it is impossible to allocate the optimized frame size. Also. the conventional Q-algorithm does not define an optimized parameter value C for adjusting the frame size. In this paper, we propose a modified Q-algorithm with the tag number estimation scheme, and evaluate the performance with computer simulations.