• Proceedings of the Korea Information Processing Society Conference
• /
• 2021.11a
• /
• pp.334-336
• /
• 2021

허가형 블록체인 기반 데이터 공유 시스템은 분산 환경에서 신뢰 수준을 구축하고 일관된 메시지를 기록 및 공유함으로써 서비스의 상호 운용성을 가능하게 한다. 그러나 허가형 블록체인은 종종 탈중앙화, 보안 및 상호 운용성과 충돌한다. 이는 중앙 집중식 시스템으로 돌아가거나 데이터의 독점 및 남용 및 오용으로 이어질 수 있다. 따라서 CAP (Consistency, Availability, Partition tolerance)에 이론 검증에 따라 메시지 공유, 비잔틴 내결함성 및 메시지 일관성을 고려하고 적용해야 한다. 기존의 PBFT(Practical Byzantine Fault Tolerance) 합의 알고리즘는 노드의 증가시, 장애내성을 갖기위해 계산되어야 할 합의 처리시간이 증가하며, DPOS(Delegated Proof of Stake) 알고리즘은 보상, 리더 선출의 공정성 문제 등에 따라 허가형 블록체인에서의 적합한 방식이 연구되고 있다. 본 논문에서는 서비스의 상호 운용성과 과제에 대해 논의하고 허가된 블록체인의 합의 개선을 통한 데이터 공유 시스템을 제안한다.

• Journal of KIISE:Software and Applications
• /
• v.31 no.7
• /
• pp.869-882
• /
• 2004

This paper proposes an effective method to create logically consistent and structured requirement model by applying consistency control approach of the formal method to the use-case modeling. This method integrates the multi-perspective scattered requirement segments that may overlap and conflict each other into a structured requirement model. The model structure can be analyzed based on context goal and concerned area overlap analysis. The model consistency can be achieved by using specification overlap-based consistency checking method as an integration vehicle. An experimental application to case study shows that the Proposed method can successfully identify requirement overlaps and inconsistency. It can also transfer multi-viewpoint requirement segments into a consistently integrated use-case model to clarify software behaviors and functionality This method helps users to enhance capability to identify specification inconsistency in the use-case modeling at the early stage of software engineering development. The proposed approach can also facilitate communication between users and developers to ensure customer satisfaction.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.126-134
• /
• 2000

Version control is an application to maintain consistency between different instances of the same document allowing operations such as navigation, differencing, and merging. Most version control systems, however, lack the support of functionality for cooperative writing environment, such as to represent and store the history of the actions of different individuals, to effectively differentiate and merge the individual actions including the text object, and to manage different access privileges for different granularity and individuals. With the help of Activity IDentification (AID) tag and its unique addressing scheme proposed in this paper, differencing and merging become simple and effective. Access and role control is improved by associating the access right table and role assignment in AID scheme also eliminates the requirements for large storage capacity for version information maintenance.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.4
• /
• pp.91-99
• /
• 2014

The main game architectures for multiplayer online games are the traditional client-server architectures, multi-server architectures and P2P(peer-to-peer) architectures. P2P architectures, due to their distributed and collaborative nature, have low infrastructure costs and can achieve high scalability as well as fast response time by creating direct connections between players. However, P2P architectures face many challenges. Distributing a game among peers makes maintaining control over the game more complex. These architectures also tend to be vulnerable to churn and cheating. Providing consistency control in P2P systems is also more difficult since conflicting updates might be executed at different sites resulting in inconsistency. In order to avoid or correct inconsistencies, most multiplayer games use a primary-copy replication approach where any update to the object has to be first performed on the primary copy. This paper presents the primary-copy model with the update dissemination mechanism that provides consistency control over an object in P2P architectures for multiplayer online games. The performance for this model is evaluated through simulation experiments and analysis.

• Journal of KIISE:Databases
• /
• v.30 no.2
• /
• pp.184-196
• /
• 2003

Mobile transactions updating spatial objects are long transactions that can update independently local objects of mobile clients during disconnection. Validation based protocols that are well known to be appropriate for mobile transactions are required to abort a conflicted transaction in order to keep data consistent. Since abortion leads to cancel of all of tile updates, it is not desirable to use the abortion for resolving conflicts of mobile transactions. In this paper, we propose a reprocessing transaction model to resolve the update conflicts between mobile transactions without aborting them. We also design a mobile transaction server to support the reprocessing transaction and build a prototype of a mobile field system. The reprocessing transaction is a subtransaction of a newly committed mobile transaction and re-executes only conflicted objects with foreign conflicted objects. We also introduce a progressive reprocessing scheme to expose non-conflicted objects of the mobile transaction to other transactions in order to reduce starvation of reprocessing transactions.

• Journal of KIISE:Databases
• /
• v.31 no.4
• /
• pp.422-431
• /
• 2004

In recent years, different models in data delivery have been explored in mobile computing systems. Particularly, there were a lot of research efforts in the periodic push model where the server repetitively disseminates information without explicit request. However, average waiting time per data operation highly depends on the length of a broadcast cycle and different access pattern among clients may deteriorate the response time considerably. In this case, clients are preferably willing to send a data request to the server explicitly through backchannel in order to obtain optimal response time. We call the broadcast model supporting backchannel as hybrid broadcast. In this paper, we devise a new transaction processing algorithm(O-PreH) in hybrid broadcast environments. The data objects which the server maintains are divided into Push_Data for periodic broadcasting and Pull_Data for on-demand processing. Clients tune in broadcast channel or demand the data of interests according to the data type. Periodic invalidation reports from the server support maintaining transactional consistency. If one or more conflicts are found, conflict orders are determined not to violate the consistency(pre-reordering) and then the remaining operations have to be executed pessimistically. Through extensive simulations, we demonstrate the improved throughput of the proposed algorithm.

• Journal of KIISE:Databases
• /
• v.30 no.2
• /
• pp.197-208
• /
• 2003

Abstract Workflow is not appropriately applied to coordinated execution of applications(steps) that comprise business process such as a collaborative series of tasks because of the lacks of network infra, standard of information exchange and data consistency management with conflict mode of shared data. Particularly we have not mentioned the problem which can be occurred by shared data with conflict mode. In this paper, to handle data consistency in the process of rollback for failure handling or recovery policy, we have classified rollback dependency into three types such as implicit rollback dependency in a transactional workflow, implicit rollback dependency in collaborative transactional workflows and explicit rollback dependency in collaborative transactional workflows. Also, we have proposed the rollback dependency compiler that determines above three types of rollback dependency. A workflow designer specifies the workflow schema and the resources accessed by the steps from a global database of resources. The rollback dependency compiler generates the enhanced workflow schema with the rollback dependency specification. The run-time system interprets this specification and executes the rollback policy with data consistency if failure of steps is occurred. After all, this paper can offer better correctness and performance than state-of-the-art WFMSs.

• Journal of KIISE:Information Networking
• /
• v.28 no.2
• /
• pp.217-228
• /
• 2001

무선 통신 기술 및 이동 컴퓨터의 성능의 발전함에 따라 이동 컴퓨팅 환경을 단순한 단말기로 사용하기 보다는 독립된 수행 단위로 이용하려는 연구가 활발히 진행되고 있다. 즉 모든 작업을 서버에게 보내어 결과를 기다리는 대신 이동 컴퓨터에서 직접수행할 수 있는 알고리즘이 개발되고 있다. 본 논문에서는 이동 컴퓨터에서의 트랜잭션 수행 알고리즘을 제안한다. 우리는 낙관적인 기법을 채택하였는데 이기법은 (a) 동기화에 필요한 메시지를 적게 필요로 하며 (b) 브로드캐스트 기법의 장점을 얻을수 있다. 브로드캐스트 기법은 최근 많은 수의 클라이언트에게 정보를 전송할 수 있는 수단으로써 많이 연구되고 있다. 그러나 접근하는 데이터간에 충돌이 빈번하게 발생한다면 낙관적 기법은 결국 높은 철회율을 보이게 되며 이는 다시 이동 컴퓨터 자원으로 효율적으로 사용하려는 목적과 반대 결과가 된다. 본 논문에서는 이러한 높은 철회율을 감소시키기 위해 재순서화 개념을 도입하였다. 즉 충돌이 발견될 경우 데이터의 일관성을 침해하지 않는 범위내에서 충돌 순서를 결정하도록 하는 것이다. 특히 읽기-쓰기 트랜잭션에 대해서는 후위-재순서화 개념을 읽기-전용 트랜잭션에 대해서는 전위-재순화 개념(O-Pre)을 제안하였으며 실험에 의하여 성능 향상을 보였다.

• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.473-482
• /
• 2001

Integrated heterogeneous database systems provide the unified interface for users and applications today in order to access the underlying diverse data sources located in different sites. The multiple heterogeneous data sources have the different and specialized data structures and transaction processing capabilities. Because of local autonomy, the local system does not have the capability of cooperation to control the global transaction. Hence designing the global transaction manager with supporting the global serializability is difficult task. To resolve the well-known indirect conflict, we define the global transaction model by using the characteristics of global integrity constraints. And then we propose the site-locking operation and its protocol to manage the global transaction. The correctness and analysis of our site-locking protocol is proved and performance gain over the related other methods is also estimated in this paper.

• Journal of KIISE:Databases
• /
• v.27 no.4
• /
• pp.596-603
• /
• 2000

낙관적 기법은 실시간 데이터베이스 시스템을 위한 동시성 제어로서 적합하다. 특히, 종료시 한을 초과한 트랜잭션이 시스템으로부터 제거되는 펌 실시간 데이터베이스 시스템에서 낙관 적 기법은 잠금 기법보다 우수한 성능을 보인다. 그러나 낙관적 기법은 낭비적 수행과 과도 한 재시작의 문제를 안고 있다. 종료에 가까운 트랜잭션의 재시작은 시스템 자원의 낭비는 물론 종료시한 초과 가능성을 높인다. 발생되는 재시작의 수를 줄이기 위해서 충돌하는 트 랜잭션들간의 직렬화 순서를 동적으로 저장하는 방법이 이용되었다. 그러나 직렬화 순서의 동적 조정 기법을 이용함에도 불구하고 불필요한 재시작이 발생된다. 본 논문에서는 기존의 타임스탬프 기반 동시성 제어에서 이용되던 Thomas 기록 규칙을 이용하여 이러한 불필요 한 재시작을 제거한 개선된 실시간 낙관적 동시성 제어 기법을 제한한다. 제안된 방법은 요 구되는 데이터베이스 일관성을 보장하면서도 발생되는 재시작 수를 줄임으로써 성능을 향상 시킨다.