• Journal of Communications and Networks
• /
• v.13 no.4
• /
• pp.393-399
• /
• 2011

We evaluate the link-level performance of cooperative multi-hop relaying networks with an maximum distance separable (MDS) code. The effect of the code on the link-level performance at the destination is investigated in terms of the outage probability and the spectral efficiency. Assuming a simple topology, we construct an absorbing Markov chain. Numerical results indicate that significant improvement can be achieved by incorporating an MDS code. MDS codes successfully facilitate recovery of the message block at a relaying node due to powerful error-correcting capability, so that it can reduce the outage probability. Furthermore, we evaluate the average number of hops where the message block can be delivered.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.570-572
• /
• 2000

멀티캐스팅 프로토콜에서 중요하게 요구되는 사항은 신뢰성과 확장성이다. 그 중 확장성을 향상시키기 위해서 여러 지역적 오류 복구 기법이 사용되고 있다. 본 논문에서는 기존의 지역적 오류 복구 기법에서 발생하는 제한점을 설명하고, 이 문제를 해결하기 위해서 지역대표에 의한 NAK 메시지의 기능분리 방법을 제안하고 구현하였다. 그리고, 제안된 방법에 대해서 시뮬레이션을 통해 확장성에 대한 성능평가를 하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.27-30
• /
• 2004

모바일 컴퓨팅 환경은 네트워크가 손상되기 쉬우며, MH(Mobile Host)를 지원하는 MSS(Mobile Support Station)가 안정적이지 못하기 때문에, 이런 상황을 고려하여 시스템 환경을 모델링 한다. 메시지 전송 시 에러가 발생했을 경우 복구 기법으로 체크포인팅 기법과 메시지 로깅 기법을 추가적으로 사용하게 된다. 본 논문에서는 움직임을 기반으로 한 모바일 시스템 환경에서 체크포인트와 함께 메시지 로그를 사용하는 기법의 성능을 비교하고자 한다.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.2 s.34
• /
• pp.39-47
• /
• 2005

This paper proposes and analyzes the MAC(Message Authentication Code) algorithm that is used for the transition integrity and the entity authentication of message. The MAC algorithm uses the DES algorithm which has 64-bit block and 56-bit key and we compare the security according to 64-bit and 32-bit length of MAC value. Moreover, we use the SEED algorithm which has 128-bit block and 128-bit key and compare the security according to 128-bit and 64-bit length of MAC value. We analyze the security the forgery attack according to length of message and length of MAC value. this paper, a coarse-to-fine optical flow detection method is proposed. Provided that optical flow gives reliable approximation to two-dimensional image motion, it can be used to recover the three-dimensional motion. but usually to get the reliable optical flows are difficult. The proposed algorithm uses Horn's algorithm (or detecting initial optical flow, then Thin Plate Spline is introduced to warp a image frame of the initial optical flow to the next image frame. The optical flow for the warped image frame is again used iteratively until the mean square error between two image sequence frames is lowered. The proposed method is experimented for the real moving Picture image sequence. The proposed algorithm gives dense optical flow vectors.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.2
• /
• pp.327-338
• /
• 1996

In this paper, we present a new checkpointing algorithm to preserve the consistency of resources in distributed transaction processing systems, and the error recovery algorithms to recover form the failure. In comparison with the existed algorithms, the checkpointing algorithm proposed in this paper can minimize the interference of the distributed transaction and the stroage cost during checkpointing, and does not need the extra message to make th checkpoint. Also we show that the error recovery algorithms prevent the distributed transaction with a partial fault from spreading the fault, which calls domnio-effect and prevent them from restarting cyclically. And we describe the correctness and the performane of the proposed algorithms.

• Journal of KIISE
• /
• v.43 no.12
• /
• pp.1420-1427
• /
• 2016

This paper proposes a method taking advantage of Fog computing and SDN in the connected vehicle environment which is having an unstable communication channel and a dynamic topology. For this purpose, the controller should understand the current state of the overall network by maintaining recent network topology, especially, the mobility information of mobile nodes. These are managed by the controller, and are important in unstable conditions in the mobile environment. The mobility levels are divided into 3 categories. We can efficiently exploit that information. By utilizing network state information, we suggest two outcomes. First, we reduce the control message overhead by adjusting the period of beacon messages. Second, we propose a recovery process to prepare the communication failure. We can efficiently recover connection failure through mobility information. Furthermore, we suggest a path recovery by decoupling the cloud level and the fog level in accordance with application data types. The simulation results show that the control message overhead and the connection failure time are decreased by approximately 55% and 5%, respectively in comparison to the existing method.

• Journal of Korea Multimedia Society
• /
• v.8 no.7
• /
• pp.953-960
• /
• 2005

The Network can be easily damaged in the mobile computing environment. Mobile Support Station (MSS) which supports the Mobile Host(MH) could also be unstable too. Therefore, when a critical error occurs the repairing cost can be high. For stable repair, the hand-off strategy should be considered to save the continuing message and checkpoint information, and to reduce the cost of network repair. In this paper, we propose the Switching Trickle(ST) strategy which reduces the repairing cost for the MH's mobility. ST strategy changes the way which stores the information in connection with the number of write events(r) that occur from the hands-off strategy. Accumulated cost by increased mobility has been simulated too. From the results of simulation, the proposed strategy has shown more cost effective than the conventional strategy. The proposed strategy also has shown very supportive in saving checkpoint and message log information stably.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1363-1372
• /
• 1999

에이전트 기반 이동 컴퓨팅 환경에서 전자 상거래를 구현하기 위해 가장 필요로 하는 것은 안전한 지불 구조를 제공하는 것이다. 본 연구에서는 불확정 전송 기법 1,2 을 사용한 비대화형 엔티티 인증 기법과 Horster 기법 4,5 을 기반으로 메시지 복원 기능을 제공하는 공정 은닉 서명 기법을 제시한다. 또한 이를 직접 Brands가 제시한 오프-라인 전자 지불 시스템 3,6 에 접목한다. 인증 단계가 비대화형으로 수행되므로 이동 엔티티 인증에 효율적이고, 메시지 복원 기능을 갖고 공개 검증 기능을 제공하는 은닉 서명을 적용하기 때문에 카운터 방식을 사용한 스마트 카드 기반 전자 지불 시스템 6 에 효과적으로 적용할 수 있었다. 전자 화폐에 대해서 신뢰 센터에 의한 공정성 검토 기능을 추가로 제공하므로 전자 지불 시스템의 신뢰성을 향상시킬 수 있다.Abstract The primary requirements for realizing the electronic commerce in agent based mobile computing environments are to implement the compatible secure payment framework. In this paper, we propose both the non-interactive entity authentication scheme that is combined with oblivious transfer protocol 1,2 and the message recovery fair blind signature based on Horster scheme 4,5 . And these techniques are directly applied to the Brand's off-line electronic payment system 3,6 . As the authentication processes are done by non-interactive manner, we can also get efficiency for mobile entity authentication. Additionally, as the used signature scheme provides a message recovery function with publicly verifiable properties, it is efficiently applicable to a counter based off-line electronic payment scheme 6 based on the additional device like smart card. Therefore, we can enhance the reliability of proposed electronic payment system based on the publicly verifiable fairness in its electronic cash by a trusted judge.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1C
• /
• pp.103-111
• /
• 2002

In RNC of IMT-2000, main control processors such as ASP, ACP and OMP are responsible for call control function, and the high reliability and real-time property should be provided for it. So, the study of real-time fault-tolerant for it is needed. In this paper, we proposes an Task based duplication method, in which Tasks in active side operated on message unit and send the updated data to standby side after operation, log in the message to standby side for recovery during take-over. This scheme decreases the dual down and the complexity of synchronization procedure, and performs the synchronization more exactly because Tasks control the synchronization of system. This paper also proposes the fault detection and the fault handing method for effective implementation of Task based duplication. This scheme focus on increasing the fault detection rate and intercepting originally that fault data is send to standby side.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.5_6
• /
• pp.328-334
• /
• 2004

Recently, Software DSMs continue to improve its performance and scalability As Software DSMs become attractive on larger clusters, the focus of attention is likely to move toward improving the reliability of a system. A popular approach to tolerate failures is message logging with checkpointing, and so many log-based rollback recovery schemes have been proposed. In this work, we propose a remote logging scheme which uses the volatile memory of a remote node assigned to each node. As our remote logging does not incur frequent disk accesses during failure-free execution, its logging overhead is not significant especially over high-speed communication network. The remote logging tolerates multiple failures if the backup nodes of failed nodes are alive. It makes the reliability of DSMs grow much higher. We have designed and implemented the FT-KDSM(Fault Tolerant KAIST DSM) with the remote logging and showed the logging overhead and the recovery time.