• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.1491-1494
• /
• 2005

이동 컴퓨팅 시스템에 결함 내성 기능을 제공하기 위한 많은 방법들이 제안되어졌다. 그 중 하나가 이동 에이전트를 이용하여 이동 호스트의 검사점과 메시지 로그를 분산 관리하는 방법이다. 이동 에이전트 기반의 결함 내성 서비스는 기존 기지국 기반의 서비스에 비해, 비동기적인 복구 정보의 이동 및 복구 정보의 유연한 분산 관리 등의 장점이 있으나, 이동 에이전트 자체의 이동 비용 등이 문제가 될 수 있다. 따라서 본 논문에서는 기존의 기지국 기반 복구 정보 관리 기법과 이동 에이전트 기반 복구 정보 관리 기법의 성능을 비교 평가한다. 특히, 다양한 시스템 환경에서 이동 에이전트 자체 비용이 결함 내성 서비스의 성능에 미치는 영향을 분석한다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.6
• /
• pp.145-154
• /
• 2018

A loosely coupled message broker system is a popular method for integrating distributed software components. Especially, a distributed broker structure with multiple brokers with active-standby or active-active message replicas are used to enhance availability as well as message processing performance. However, there are problems in both active-standby and active-active replica structure. The active-standby has relatively low processing performance and The active-active structure requires a high synchronization overhead. In this paper, we propose an active-active structure of replicas to increase the availability of the brokers without compromising its high fault-tolerancy. In the proposed structure, standby replicas process the requests of the active replicas so that load balancing is achieved without additional brokers, while the distributed coordinators are used for the synchronization process to decrease the overhead. We formulated the overhead incurred when synchronizing messages among replicas, and the formulation was used to support the experiment results. From the experiment, we observed that replicas of the active-active structure show better performance than the active stand-by structure with increasing number of users.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10b
• /
• pp.295-297
• /
• 1999

인터넷에 대한 사용자의 관심이 증가하면서 WWW에 관련된 기술이 급격히 증가하고 있다. 이러한 웹을 기반으로 하는 작업은 분산되어 있는 작업그룹의 여러 사용자들이 공동의 프로젝트에 관하여 효율적으로 공동작업을 하기에 충분한 기반환경을 제공할 수 있다. CoDocs 시스템은 웹에서 공동작업을 하는 작업그룹의 사용자들이 서로의 정보를 공유하고 교환함으로써 효율적으로 공동작업을 할 수 있는 기반 환경을 제공한다. 그러나, 이러한 CoDocs 시스템에서는 각 작업그룹 사용자들이 서로간의 의사전달을 위해 다지 비동기적인 통신 방법을 제공하고 있을 뿐 실시간적인 통신 방법을 갖추고 있지 않다. 하지만 보다 효과적인 공동작업을 위해서는 각 작업그룹의 사용자들간에 실시간으로 의사전달을 하고 서로의 정보를 교환하여 공유할 수 있는 통신 수단을 필요로 한다. 본 논문에서는 CoDocs 시스템에서 각 작업그룹 사용자들간에 이루어질 수 있는 실시간 의사전달 및 정보 교환을 가능하게 함으로써 공동작업을 효율적으로 지원할 수 있는 메신저 시스템을 설계하고 구현하였다.

• The KIPS Transactions:PartA
• /
• v.13A no.6 s.103
• /
• pp.525-532
• /
• 2006

Compared with the previous recovery algorithms for causal message logging, Elnozahy's recovery algerian considerably reduces the number of stable storage accesses and enables live processes to execute their computations continuously while performing its recovery procedure. However, if causal message logging is used with asynchronous checkpointing, the state of the system may be inconsistent after having executed this algorithm in case of concurrent failures. In this paper, we show these inconsistent cases and propose a low-cost recovery algorithm for causal message logging to solve the problem. To ensure the system consistency, this algorithm allows the recovery leader to obtain recovery information from not only the live processes, but also the other recovering processes. Also, the proposed algorithm requires no extra message compared with Elnozahy's one and its additional overhead incurred by message piggybacking is significantly low. To demonstrate this, simulation results show that the first only increases about 1.0%$\sim$2.1% of the recovery information collection time compared with the latter.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11A
• /
• pp.1081-1091
• /
• 2005

Unlike conventional DVB-T transmission with the streaming method, DVB-H system based on the IPDC(IP Data Casting) method uses Time-slicing scheme to achieve the maximization of portability by reducing the power consumption of a receiver. To enhance the power efficiency of the receiver, Time-slicing scheme controls the receiver operation to perform only for corresponding burst in specific time slot. The additional power saving can also be achieved by reducing the required time for synchronization. In this paper, we propose a fast scattered pilot synchronization algorithm, which detects the pilot pattern of currently received OFDM symbol. The proposed scheme is based on the correlation between the adjacent subcarriers of potential scattered pilot position in two consecutively received OFDM symbols. Therefore, it can reduce the time for the scattered pilot synchronization within two symbols as com-pared with the conventional method used for DVB-T. And the proposed algorithm has better performance than the two schemes proposed by Nokia for DVB-H and the method using correlation with reference signal. Extensive com-puter simulation is performed based on ETSI EN300 744 ETSI and performance results show that the proposed algorithm has more efficient and stable operation than the conventional schemes.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06d
• /
• pp.384-388
• /
• 2007

WebDAV(Web-based Distributed Authoring and Versioning)는 웹 기반의 분산 저작과 버전관리를 지원하는 표준 명세로서, 인터넷을 통하여 다양한 콘텐츠의 비동기적인 협업을 지원하는 표준 하부구조를 제공한다. 특히 WebDAV의 속성 관리 기능은 자원의 주요 정보를 속성으로 설정하여 관리할 수 있는 기능이다. 이러한 WebDAV의 속성 관리기능을 이용하는 경우 사용자 측에서 자유롭게 속성관리가 가능하여 웹을 기반으로 하는 협업시스템 및 자원공유 시스템을 개발하는데 매우 유용하게 활용될 수 있다. 본 논문에서는 웹을 통한 문서 및 데이터의 관리를 제공하는 응용시스템의 개발을 효율적으로 지원할 수 있도록 한 WebDAV 프로토콜의 확장과 이를 이용하여 기업내에서 생성되는 기술문서 및 도면 문서에 대한 협업을 지원해주는 도면공유시스템을 개발하였다. 확장된 WebDAV의 기능을 이용하는 경우 응용시스템 개발자는 사용자 속성을 정의함으로써 어플리케이션을 간편하게 설계할 수 있게 되며, 기존의 웹 서버에서는 복잡하게 구현해야했던 자원에 대한 잠금관리 및 버전관리 기능도 지원받을 수 있게 된다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.2
• /
• pp.45-50
• /
• 2017

Micro-service Architecture is a service architecture optimized for large-scale distributed systems such as real-time realistic broadcasting systems, so that are fiercely adopted by Global leading service platform vendors such as Netflix and Twitter due to the merit of horizontal performance scalability enabling the scale-out technique. In addition, micro-service architecture makes it possible to execute image processing and real-time data analysis using an asynchronous-based processing that are difficult to handle in Web API such as REST. In this paper, an event stream processing framework applicable to asynchronous based micro services is proposed in the sense that the accountability of event processing order is not guaranteed in the events such as IoT sensor data analysis or cloud-based image editing because these are the situations where the real-time media editing generates multiple event streams and asynchronous processes in the platform.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.2
• /
• pp.46-52
• /
• 2009

In this paper, the timing estimator based on the principle of the best linear unbiased estimator (BLUE) is proposed in OFDMA uplink systems. The proposed timing estimator exploits the phase information of the differential correlation between adjacent subcarriers. The differential correlation can extract the information about timing offset and mitigate the distortion of the signal caused by the frequency selectivity of channel. Compared with conventional methods, the proposed estimator shows more accurate capability in estimation. In addition, the estimator is hardly affected by the distortion caused by the frequency selectivity of channel. Simulation results confirm that the proposed estimator shows a small error mean and a relatively small error variance. In addition, the performance of the estimator is evaluated by means of SNR loss. It is shown by simulations that the SNR loss of the proposed estimator by estimation errors is less than 0.4 dB for the SNR values between 0 and 20 dB. This might indicate that the proposed estimator is suitable for the timing synchronization of multiple users in OFDMA uplink systems.

• The Journal of Engineering Research
• /
• v.6 no.2
• /
• pp.11-22
• /
• 2004

A distributed constraint satisfaction problem (distributed CSP) is a constraint satisfaction problem(CSP) in which variables and constraints are distributed among multiple automated agents. ACSP is a problem to find a consistent assignment of values to variables. Even though the definition of a CSP is very simple, a surprisingly wide variety of AI problems can be formalized as CSPs. Similarly, various application problems in DAI (Distributed AI) that are concerned with finding a consistent combination of agent actions can be formalized as distributed CAPs. In recent years, many new backtracking algorithms for solving distributed CSPs have been proposed. But most of all, they have common drawbacks that the algorithm assumes the priority of agents is static. In this thesis, we establish a basic algorithm for solving distributed CSPs called dynamic priority search algorithm that is more efficient than common backtracking algorithms in which the priority order is static. In this algorithm, agents act asynchronously and concurrently based on their local knowledge without any global control, and have a flexible organization, in which the hierarchical order is changed dynamically, while the completeness of the algorithm is guaranteed. And we showed that the dynamic priority search algorithm can solve various problems, such as the distributed 200-queens problem, the distributed graph-coloring problem that common backtracking algorithm fails to solve within a reasonable amount of time. The experimental results on example problems show that this algorithm is by far more efficient than the backtracking algorithm, in which the priority order is static. The priority order represents a hierarchy of agent authority, i.e., the priority of decision-making. Therefore, these results imply that a flexible agent organization, in which the hierarchical order is changed dynamically, actually performs better than an organization in which the hierarchical order is static and rigid. Furthermore, we describe that the agent can be available to hold multiple variables in the searching scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.2
• /
• pp.386-393
• /
• 2004

In order to maintain load balancing in distributed systems in a decentralized manner, every node should obtain workload information from all the nodes on the network. It requires $Ο({v^2})$ traffic overheads, where v is the number of nodes. This paper presents a new synchronous dynamic distributed load balancing algorithm for a ( v,k+1,1)-configured network topology, which is a kind of 2k regular graph, based on symmetric balanced incomplete block design, where v equals ${k^2}+k+1$. Our algorithm needs only Ο(v√v) message overheads and each node receives workload information from all the nodes without redundancy. And load balancing in this algorithm is maintained so that every link has same amount of traffic by √v for transferring workload information.