• Title/Summary/Keyword: Consensus of Information

Search Result 543, Processing Time 0.025 seconds

Raft-D: A Consensus Algorithm for Dynamic Configuration of Participant Peers (Raft-D: 참여 노드의 동적 구성을 허용하는 컨센서스 알고리즘)

  • Ha, Yeoun-Ui;Jin, Jae-Hwan;Lee, Myung-Joon
    • Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
    • /
    • v.7 no.2
    • /
    • pp.267-277
    • /
    • 2017
  • One of fundamental problems in developing robust distributed services is how to achieve distributed consensus agreeing some data values that should be shared among participants in a distributed service. As one of algorithms for distributed consensus, Raft is known as a simple and understandable algorithm by decomposing the distributed consensus problem into three subproblems(leader election, log replication and safety). But, the algorithm dose not mention any types of dynamic configuration of participant peers such as adding new peers to a consensus group or deleting peers from the group. In this paper, we present a new consensus algorithm named Raft-D, which supports the dynamic configuration of participant peers by extending the Raft algorithm. For this, Raft-D manages the additional information maintained by participant nodes, and provides a technique to check the connection status of the nodes belonging to the consensus group. Based on the technique, Raft-D defines conditions and states to deal with adding new peers to the consensus group or deleting peers from the group. Based on those conditions and states, Raft-D performs the dynamic configuration process for a consensus group through the log update mechanism of the Raft algorithm.

Study on the Influence of Online WOM Information Characteristics on the Intention of Information Acceptance and also Re-WOM: Focused on the Receiver's Expertis (온라인 구전정보특성이 정보수용의도와 재구전 의도에 미치는 영향에 관한 연구: 수신자의 전문성을 중심으로)

  • Kim, Ji-Sook;Kwon, Hyeok-Gi
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.21 no.6
    • /
    • pp.81-93
    • /
    • 2016
  • An actual analysis was made regarding how different the effect of the online WOM information characteristics on the expansion of the WOM information characteristics was depending on the level of the receiver's expertise in consideration of the sender's expertise, the vividness and Consensus of WOM information which can affect the acceptance of WOM information in this study. To begin with, the analysis results showed that the online WOM information characteristics had the positive effect on the information acceptance intention in proportion to the sender's expertise and the vividness and Consensus of WOM information. Secondly, the information acceptance intention was found to have a positive effect on the re-WOM intention. Finally, the level of receiver's expertise was found to control the effect of the online WOM information characteristics on the information acceptance intention.

A COMPARATIVE STUDY ON BLOCKCHAIN DATA MANAGEMENT SYSTEMS: BIGCHAINDB VS FALCONDB

  • Abrar Alotaibi;Sarah Alissa;Salahadin Mohammed
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.5
    • /
    • pp.128-134
    • /
    • 2023
  • The widespread usage of blockchain technology in cryptocurrencies has led to the adoption of the blockchain concept in data storage management systems for secure and effective data storage and management. Several innovative studies have proposed solutions that integrate blockchain with distributed databases. In this article, we review current blockchain databases, then focus on two well-known blockchain databases-BigchainDB and FalconDB-to illustrate their architecture and design aspects in more detail. BigchainDB is a distributed database that integrates blockchain properties to enhance immutability and decentralization as well as a high transaction rate, low latency, and accurate queries. Its architecture consists of three layers: the transaction layer, consensus layer, and data model layer. FalconDB, on the other hand, is a shared database that allows multiple clients to collaborate on the database securely and efficiently, even if they have limited resources. It has two layers: the authentication layer and the consensus layer, which are used with client requests and results. Finally, a comparison is made between the two blockchain databases, revealing that they share some characteristics such as immutability, low latency, permission, horizontal scalability, decentralization, and the same consensus protocol. However, they vary in terms of database type, concurrency mechanism, replication model, cost, and the usage of smart contracts.

A Study on the PSP-Platform for the Atomicity of Distributed Ledger

  • Lee, Eun-Hee;Yoon, Yong-Ik
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.5
    • /
    • pp.73-80
    • /
    • 2019
  • In Korea, a budget of tens of trillion won is put into the national R & D project every year. Thanks to these efforts, Korea's ICT industry is gaining global attention. However, there are still a lot of problems that are lacking in terms of the cycle of managing national ICT R&D projects. In particular, the issue of sharing is very insufficient throughout the cycle of the national ICT R&D. In this paper, In this paper, We propose a platfom that can be shared throughout the cycle of managing blockchain-based national ICT R&D projects. This platform we call the Perfect Sharing Project Platform (PSPP). We describe that PSPP can achieve excellent research results through information sharing of project process[1-2]. To support the perfect sharing, this platform uses a new notion of consensus algorithm, called POA (Proof of Atomicity). This platform is suitable for sharing information.

Parallel Algorithms for Finding Consensus of Circular Strings (환형문자열에 대한 대표문자열을 찾는 병렬 알고리즘)

  • Kim, Dong Hee;Sim, Jeong Seop
    • Journal of KIISE
    • /
    • v.42 no.3
    • /
    • pp.289-294
    • /
    • 2015
  • The consensus problem is finding a representative string, called a consensus, of a given set S of k strings. Circular strings are different from linear strings in that the last symbol precedes the first symbol. Given a set S of circular strings of length n over an alphabet ${\Sigma}$, we first present an $O({\mid}{\Sigma}{\mid}nlogn)$ time parallel algorithm for finding a consensus of S minimizing both radius and distance sum when k=3 using O(n) threads. Then we present an $O({\mid}{\Sigma}{\mid}n^2logn)$ time parallel algorithm for finding a consensus of S minimizing distance sum when k=4 using O(n) threads. Finally, we compare execution times of our algorithms implemented using CUDA with corresponding sequential algorithms.

A slide reinforcement learning for the consensus of a multi-agents system (다중 에이전트 시스템의 컨센서스를 위한 슬라이딩 기법 강화학습)

  • Yang, Janghoon
    • Journal of Advanced Navigation Technology
    • /
    • v.26 no.4
    • /
    • pp.226-234
    • /
    • 2022
  • With advances in autonomous vehicles and networked control, there is a growing interest in the consensus control of a multi-agents system to control multi-agents with distributed control beyond the control of a single agent. Since consensus control is a distributed control, it is bound to have delay in a practical system. In addition, it is often difficult to have a very accurate mathematical model for a system. Even though a reinforcement learning (RL) method was developed to deal with these issues, it often experiences slow convergence in the presence of large uncertainties. Thus, we propose a slide RL which combines the sliding mode control with RL to be robust to the uncertainties. The structure of a sliding mode control is introduced to the action in RL while an auxiliary sliding variable is included in the state information. Numerical simulation results show that the slide RL provides comparable performance to the model-based consensus control in the presence of unknown time-varying delay and disturbance while outperforming existing state-of-the-art RL-based consensus algorithms.

Librarian Consensus on the Need for Customerized Research Information Services in Academic Libraries: A Delphi Method Study (대학도서관 고객화 연구정보서비스 필요성에 대한 사서의 공감대 연구: 델파이 조사를 중심으로)

  • Hyun Soo, Chae;Jung Hyun, Chun;Jee Yeon, Lee
    • Journal of the Korean Society for information Management
    • /
    • v.39 no.4
    • /
    • pp.127-157
    • /
    • 2022
  • The study aims to establish the concept of customerized research information services in academic libraries and to build librarians' consensus on the need for customerized research information services. The literature review enabled summarizations of the definition of research information service, customerization, and research trends. A categorization process resulted in a list of research information services of academic libraries. The Delphi method survey revealed the necessity of providing research information services and applying customerization to research information services based on the opinions of librarians. The librarians agreed on eight research information services using customerization services. This study has significance because it proposed new attempts to improve and develop research information services and explored ways to enhance the expertise and value of academic libraries by forming a consensus among librarians.

(Pattern Search for Transcription Factor Binding Sites in a Promoter Region using Genetic Algorithm) (유전자 알고리즘을 이용한 프로모터 영역의 전사인자 결합부위 패턴 탐색)

  • 김기봉;공은배
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.5_6
    • /
    • pp.487-496
    • /
    • 2003
  • The promoter that plays a very important role in gene expression as a signal part has various binding sites for transcription factors. These binding sites are located on various parts in promoter region and have highly conserved consensus sequence patterns. This paper presents a new method for the consensus pattern search in promoter regions using genetic algorithm, which adopts the assumption of N-occurrence-per-dataset model of MEME algorithm and employs the advantage of Wataru method in determining the pattern length. Our method will be employed by genome researchers who try to predict the promoter region on anonymous DNA sequence and to find out the binding site for a specific transcription factor.

Applied Practice on Fresh Food Cold Chain System with Blockchain Solution

  • Jang, Eun Choul;Kim, Janghwan;Kim, R. Young Chul
    • International journal of advanced smart convergence
    • /
    • v.10 no.3
    • /
    • pp.207-213
    • /
    • 2021
  • Informatization and digital transformation across industries are big trends in the world. However, although a few food groups are investing in informatization on a pilot basis, informatization is still delayed in related industries, such as distribution, logistics, etc. Therefore, consumers often are not able to have easy access to detailed information about products. In this paper, to improve these problems, we propose a fresh food logistics solution that adopts Proof of Nonce (PoN) consensus algorithm with Internet of Thing (IoT) technology. The recently developed PoN algorithm dramatically reduces a time for generating a block and is suitable for a platform that collects and services real-time information. We expect to improve their trust in the platform by preventing forgery/falsification of information recorded in real time through this paper.

An Influence of Appropriation on Intrinsic and Extrinsic Motivation with Ease of Use in Using Information Technology : Focus on Blog Users (정보기술 사용에서의 전유가 내재적/외재적 동기 및 사용용이성에 미치는 영향 : 블로그 사용자들을 중심으로)

  • Lee, Woong-Kyu
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.33 no.1
    • /
    • pp.131-148
    • /
    • 2008
  • Today, it is not difficult to use information technology (IT), especially, Internet based ones. Many people can not only access IT without learning how to use it but also find and develop new techniques and usages which couldn't be expected by system engineers or designers. This is owing to social interactions among users as well as advancement of IT. Theoretically, such social interactions in using IT can be well explained by adaptive structuration theory (AST) which has been considered as one of trying to capture the change of using IT due to social interactions between users and system. This study is to analyze the relationship between social interactions and motivation in using IT which can determine attitude and intention of using IT. For this purpose we provide a research model, in which two AST related variables, faithfulness of appropriation and consensus on appropriation, are independent variables and three beliefs for using IT, usefulness, ease of use and playfulness, are dependent ones. Additionally, for reflection of changing uses, usefulness is formed as second order factor by two first order factors-usefulness of self-expression and communication. An empirical test of our model for blog users which is analyzed by Partial Least Square method shows supporting most of hypotheses except one, consensus-ease of use.