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

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.299-306
• /
• 1999

Considers the problem to update the spanning tree and strongly-connected components in response to topology change of the network. This paper proposes a distributed algorithm that solves such a problem after several processors and links are added and deleted. Its message complexity and its ideal-time complexity are O(n'log n'+ (n'+s+t)) and O(n'logn') respectively where n'is the number of processors in the network after the topology change, s is the number of added links, and t is the total number of links in the strongly connected component (of the network before the topology change) including the deleted links.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2021.01a
• /
• pp.189-192
• /
• 2021

이 시스템은 블록체인의 분산 처리 방식을 활용하여 중앙 집중식 데이터베이스에서 사용자가 관리자의 보안 인프라에 의존할 수밖에 없는 점을 보완하고, 네트워크 독립성과 데이터의 불변성, 투명성을 보장한다. 본 논문에서는 기존의 중앙 집중식 데이터베이스의 단점을 보완하는 블록체인의 분산 데이터 저장 방식을 활용하여 블록체인의 해시 기법과 작업 증명, 탈중앙화, 합의 알고리즘을 구현한 암호화 시스템을 제안한다.

• The Journal of Bigdata
• /
• v.7 no.1
• /
• pp.1-14
• /
• 2022

The proof-of-work consensus algorithm used by most blockchains is causing a massive waste of computing resources in the form of mining. A useful proof-of-work consensus algorithm has been studied to reduce the waste of computing resources in proof-of-work, but there are still resource waste and mining centralization problems when creating blocks. In this paper, the problem of resource waste in block generation was solved by replacing the relatively inefficient computation process for block generation with distributed artificial intelligence model learning. In addition, by providing fair rewards to nodes participating in the learning process, nodes with weak computing power were motivated to participate, and performance similar to the existing centralized AI learning method was maintained. To show the validity of the proposed methodology, we implemented a blockchain network capable of distributed AI learning and experimented with reward distribution through resource verification, and compared the results of the existing centralized learning method and the blockchain distributed AI learning method. In addition, as a future study, the thesis was concluded by suggesting problems and development directions that may occur when expanding the blockchain main network and artificial intelligence model.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2018.01a
• /
• pp.17-18
• /
• 2018

현재 우리나라를 비롯해 전 세계적으로 핀테크, 빅데이터, 사물 인터넷, 인공 지능, 공유 경제 등 향후 다가올 미래 세상에서의 주요 기술에 대해 전략적으로 개발 및 산업화를 추진하고 있으며 이러한 흐름을 4차 산업혁명으로 명명하고 있다. 4차 산업혁명의 근간 중에서 분산 데이터베이스의 한 형태로 지속적으로 성장하는 데이터 기록 리스트로써 분산노드의 운영자에 의한 임의 조작이 불가능하도록 고안된 블록체인의 정의와 블록체인에서 사용되는 합의 알고리즘에 대해 설명하였다.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.12
• /
• pp.99-104
• /
• 2021

Blockchain technology is a distributed ledger technology that shares the ledger between multiple nodes connected to a distributed network. The data managed through the existing central server is managed through the blockchain, and the transparency, accuracy, and integrity of the transaction data is increased, and the need for data management through the blockchain is increasing. In this paper, recognizing the need for trust-based data sharing between trust-based institutions in the financial industry, this paper describes the process of selecting leader nodes in Raft, a private blockchain consensus algorithm, as a way to increase data management efficiency through blockchain. A modified consensus algorithm is presented. The performance of the modified consensus algorithm and the general Raft consensus algorithm presented in this paper was compared and analyzed based on the transaction processing time, and it was confirmed that the efficiency of the consensus process was increased by applying the proposed consensus algorithm.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.164-167
• /
• 2012

합의는 분산 시스템 환경에서 해결해야 할 근본적인 문제 중 하나이다. 특히 노드 또는 프로세스의 임의적인 실패 즉, 비잔틴 실패가 발생하였을 때 합의 문제는 더 복잡해진다. 본 연구에서는 동적인 노드의 가입과 탈퇴가 자유로운 클라우드 환경에서 비잔틴 합의 문제를 해결하기 위한 가쉽 알고리즘을 제안한다. 제안하는 알고리즘에서 확장성과 결함 포용의 특성을 내재한 가쉽 알고리즘을 적용함으로써 클라우드 환경에서의 비잔틴 합의 문제를 확장적이고 결함 포용적으로 해결할 수 있다. 알고리즘의 성능을 분석하기 위해 성능 평가를 수행하였다.

• Smart Media Journal
• /
• v.10 no.4
• /
• pp.15-20
• /
• 2021

The distributed trigger counting problem is to notify the user when the total number of triggers received from a distributed system consisting of n nodes reaches a predefined value w. The distributed trigger counting problem is used for monitoring and global snapshots in various distributed systems. In this paper, we propose a simple and efficient algorithm for the distributed trigger counting problem. The proposed algorithm operates based on a tree structure of degree $\sqrt{n}$ and height 2. The proposed algorithm operates in three different phases based on the remaining number of triggers. Experimental results show that the proposed algorithm has a smaller message complexity than CoinRand, and MaxRcv also performed better when the number of nodes is not large.

• Electronics and Telecommunications Trends
• /
• v.37 no.1
• /
• pp.63-72
• /
• 2022

Recently, blockchain has been attracting attention as a high-reliability technology in various fields. However, the Proof-of-Work-based distributed consensus algorithm applied to representative blockchains, such as Bitcoin and Ethereum, has limitations in applications to various industries owing to its excessive resource consumption and performance limitations. To overcome these limitations, various distributed consensus algorithms have appeared, and recently, hybrid distributed consensus algorithms that use two or more consensus algorithms to achieve decentralization and scalability have emerged. This paper introduces the technological trends of the latest high-performance distributed consensus algorithms by analyzing representative hybrid distributed consensus algorithms.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2018.01a
• /
• pp.9-10
• /
• 2018

SDN 환경에서 여러 컨트롤러의 동기화는 중요한 문제로 대두되었다. 모든 컨트롤러의 네트워크 상태가 동일한지 여부를 확인하려면 컨트롤러를 효율적으로 동기화하기 위한 합의과정이 필요하다. 하지만 합의 과정에서 일어나는 지도자 선출과정이 임의적이기 때문에 시스템 상에서 시간지연이 일어날 수 있다. 본 논문에서 제안하는 우선순위 기반 Raft 알고리즘은 동기화 프로세스를 제어하는 강력한 지도자를 선택하여 동기화로드에서 시간을 절약할 수 있다.