• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.1
• /
• pp.34-43
• /
• 2000

Replicated data that is used for fault tolerant distributed system requires replica control protocol to maintain data consistency. The one of replica control protocols is quorum consensus method which accesses replicated data by getting majority approval. If site failure or communication link failure occurs and any one can't get quorum consensus, it degrades the availability of data managed by quorum consensus protocol. So it needs for ghost to replace the failed site. Because ghost is not full replica but process which has state information using meta data, it is important to simplify meta data. In order to maintain availability and simplify meta data, we propose a method to use cohort set as ghost's meta data. The proposed method makes it possible to organize meta data in 2N+logN bits and to have higher availability than quorum consensus only with cohort set and dynamic linear voting protocol. Using Markov model we calculate proposed method's availability to analyze availability and compare it with existing protocols.

• Korean journal of communication and information
• /
• v.41
• /
• pp.41-74
• /
• 2008

Based on the theory of news media's agenda-setting function, this study analyzed Korean public's most important problems (MIP) and the degree of public consensus on the importance of those MIP's. The analysis was done in terms of both time and social strata. According to the findings, economy, social welfare, and political issues were in the for tier of the MIP list. The analysis of issue diversity (H-statistic) also demonstrated a relatively high degree of agenda consensus among Korean public despite some fluctuation in the consensus level, which appears to be higher than that among the American public. A decrease in the degree of agenda consensus with the passage of time appealed to be a general phenomenon across diverse social strata. However, the degrees of consensus-building were different in light of education, socioeconomic status, and the size of residential area. Those who are more educated, have more economic power, and live in a larger city had more chances to experience agenda consensus. These results seem to be basically attributable to the presumed positive relationship between these demographic variables and media exposure. The different degrees of public consensus according to the different levels of those demographic variables suggest that a closer investigation into the various influences on the importance of public issues among the respondents should be done in future studies.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.14 no.5
• /
• pp.941-947
• /
• 2011

This paper deals with the consensus problem for multi-agent linear dynamic systems with directed communication topology. All the agents are identical high-order linear systems and their state information is exchanged through a communication network with directed graph. It is shown that a consensus is achieved if there exists a feasible solution to a set of linear matrix inequalities obtained for a simultaneous stabilization problem for multiple systems. Examples are presented to show the effectiveness of the proposed method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.249-251
• /
• 2021

PBFT (Practical Byzantine Fault Tolerant) is a consensus algorithm that guarantees higher processing speed compared to PoW (Proof of Work) and absolute finality that records are not overturned due to the superiority of computing power. However, due to the complexity of the message, there is a limit that the network load increases exponentially as the number of participating nodes increases. PBFT is an important factor in determining the performance of a blockchain network, but studies on evaluation metrics and evaluation technologies are lacking. In this paper, we propose a PBFT evaluation framework that is convenient to change the consensus algorithm to easily evaluate quantitative indicators and improved methods for evaluating PBFT.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.4
• /
• pp.35-40
• /
• 2003

In this paper, I raise an issue regarding the relationships between the Election problem and the Consensus problem in asynchronous systems with unreliable failure detectors. First, I describe our system model, and then define Leader Election. After then, I show that the Election problem is harder to resolve than the Consensus problem. Each correct process eventually gets into the state in which it considers only one process to be a leader. Therefore a Perfect Failure Detector is the weakest failure detector which is sufficient to solve the Election. In order to show that the Election problem is harder to resolve than the Consensus problem, I utilize the Reduction protocol in this paper.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.12
• /
• pp.3815-3820
• /
• 2000

This paper is about the minimum requirements to solve the Election problem in asynchronous distributed systems. The focus of the paper is to find out what failure detector is the weakest one to solve the Election problem. We first discuss the relationship between the Election problem and the Consensus problem in asynchronous distributed systems with unreliable failure detectors and show that the Election problem is harder than the Consensus problem. More precisely, the weakest failure detector that is needed to solve this problem is a Perfect Failure Detector. which is strictly stronger than the weakest failure detector that is needed to solve Consensus.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2021.07a
• /
• pp.111-112
• /
• 2021

비대면 사회 확산에 따라 디지털 콘텐츠 등 온라인상으로 거래가 관리되는 디지털 자산의 거래가 증가하고 있다. 영상 및 이미지 등 디지털 자산의 경우 창작자가 자산에 대한 충분한 대가를 받지 못하고 불법 거래 내역에 대한 파악이 어렵다. 본 논문에서는 NFT적용을 통한 효율적 디지털 자산 관리를 위하여 신뢰성과 보안을 강화한 블록체인 합의알고리즘을 연구하고 성능평가를 통하여 기존 합의알고리즘 대비 우수성을 증명하였다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.3
• /
• pp.135-139
• /
• 2009

The problems to compute the distances or similarities of multiple strings have been vigorously studied in such diverse fields as pattern matching, web searching, bioinformatics, computer security, etc. One well-known method to compare multiple strings in the given set is finding a consensus string which is a representative of the given set. There are two objective functions that are frequently used to find a consensus string, one is the radius and the other is the consensus error. The radius of a string x with respect to a set S of strings is the smallest number r such that the distance between the string x and each string in S is at most r. A consensus string based on radius is a string that minimizes the radius with respect to a given set. The consensus error of a string with respect to a given set S is the sum of the distances between x and all the strings in S. A consensus string of S based on consensus error is a string that minimizes the consensus error with respect to S. In this paper, we show that the problem of finding a consensus string based on radius is NP-complete when the distance function is a metric.

• Journal of Internet Computing and Services
• /
• v.23 no.4
• /
• pp.73-85
• /
• 2022

In the era of the 4th industrial revolution, where automation and connectivity are maximized with artificial intelligence, the importance of data collection and utilization for model update is increasing. In order to create a model using artificial intelligence technology, it is usually necessary to gather data in one place so that it can be updated, but this can infringe users' privacy. In this paper, we introduce federated learning, a distributed machine learning method that can update models in cooperation without directly sharing distributed stored data, and introduce a study to optimize distributed consensus among participants without an existing server. In addition, we propose a pattern and group-based distributed consensus optimization algorithm that uses an algorithm for generating patterns and groups based on the Kirkman Triple System, and performs parallel updates and communication. This algorithm guarantees more privacy than the existing distributed consensus optimization algorithm and reduces the communication time until the model converges.

• 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.