• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06d
• /
• pp.227-229
• /
• 2011

애드혹 네트워크(Ad-hoc network)는 노드의 이동성으로 인해 토폴로지가 동적으로 변화하여 경로 에러가 빈번하게 발생한다. 그러므로 빠르고 효과적으로 경로를 재설정 하는 것이 중요하다. 본 논문에서는 애드 혹 라우팅 플로토콜 중의 하나인 AODV(Ad-hoc On-Demand Distance Vector) 라우팅 프로토콜에서의 노드 경로 설정 과정을 개선하는데 있어서, 코어(CORE) 노드를 중심으로 다중경로를 설정하여 경로 오류 발생시, 경로 재설정 과정의 시간을 단축시키고 제어 트래픽의 오버헤드를 낮추어 보다 빠르고 효율적인 경로 복구 기법을 제시한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.953-956
• /
• 2000

최근들어 정보가전. 휴대 통신 기기. 셋탑박스 등의 Embedded 시스템이 개발됨에 따라 이를 운영할 실시간 운영체제의 필요성이 절실히 요구되고 있으며, 여기에 사용될 파일 시스템이 필요하게 되었다. 그러나, 이런 Embedded 시스템의 특성상 전원이 꺼진 상태에서도 데이터를 보관하기 위하여 플래시 메모리를 이용한 파일 시스템이 필요하며, 본 논문에서는 이런 실시간 운영체제를 위한 플래시 파일시스템을 설계하고 구현한다. 또한 효율적인 플래시 메모리 접근을 위해 플래시 메모리 관리자를 구현하고, 오류 복구를 위한 효율적인 복구 알고리즘을 제안한다. 마지막으로 순차적 파일 쓰기와 무작위 파일 쓰기 실험을 통해 본 논문의 플래시 파일 시스템의 성능을 평가한다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.6
• /
• pp.248-262
• /
• 2008

As the number of large size multimedia files increases and the importance of individual's digital data grows, storage devices have been advanced to store more data into smaller spaces. In such circumstances, a physical damage in a storage device can destroy large amount of important data. Therefore, it is needed to verify the robustness of various physical faults in storage device before certain systems are used. We developed SOAR(Storage Reliability Analyzer), Storage Reliability Analyzer, to detect physical faults in diverse kinds of HDD hardware components and to recover the systems from those faults. This is a useful tool to verify robustness and reliability of a disk. SOAR uses three unique methods of creating physical damages on a disk and two unique techniques to apply the same feature on file systems. In this paper, we have performed comprehensive tests to verify the robustness and reliability of storage device with SOAR, and from the verification result we could confirm SOAR is a very efficient tool.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.6
• /
• pp.33-39
• /
• 2020

Developers spend considerable time manually repairing code that was not built during project construction. If the build fails, it is necessary to understand the failed execution, identify the cause of the failure, and then implement the solution. Build tools such as Gradle have been developed to reduce this effort and automate project construction. However, build tools still do not solve many errors, requiring developers to try to solve build errors. In this study, we propose a solution recommendation method to increase the success rate of Gradle build and reduce the effort required to resolve errors. We provide a way to collect build errors and a way to transition from build error messages to successful builds. In particular, 296 build error messages collected from Github's Java project are classified as solutions, and 89% show that the solution can be applied.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.563-572
• /
• 2002

Wireless mobile networks tend to drop a large portion of packets due to propagation errors rather than congestion. To Improve reliability over noisy wireless channels, wireless networks can employ forward error correction (FEC) techniques. Static FEC algorithms, however, can degrade the performance by poorly matching their overhead to the degree of the underlying channel error, especially when the channel path loss rate fluctuates widely. This paper investigates the benefits of an adaptable FEC mechanism for wireless networks with severe packet loss by analytical analysis or measurements over a real wireless network called sensor network. We show that our adaptive FEC named FECA (FEC-level Adaptation) technique improves the performance by dynamically tuning FEC strength to the current amount of wireless channel loss. We quantify these benefits through a hybrid simulation integrating packet-level simulation with bit-level details and validate that FECA keeps selecting the appropriate FEC-level for a constantly changing wireless channel.

• Journal of Broadcast Engineering
• /
• v.9 no.4 s.25
• /
• pp.446-454
• /
• 2004

With the growth of multimedia systems, compressing image data has become more important in the area of multimedia services. Since a compressed image bitstream can often be seriously distorted by various types of channel noise, an error concealment algorithm becomes a very important issue. In order to solve this problem, Hsia proposed the error concealment algorithm where he recovered lost block data using 1D boundary matching vectors. His algorithm, however, requires high computational complexity since each matching vector needs MAD (Mean Absolute Difference) values of all pixels, which is either a boundary line top or a boundary line bottom of a damaged block. We propose a hierarchical search-based fast error concealment scheme as well as its approximated version to reduce computational time. In the proposed scheme, a hierarchical search is applied to reduce the number of checking points for searching a vector. The error concealment schemes proposed in this paper can be about 3 times faster than Hsia's with keeping visual quality and PSNR.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.202-206
• /
• 2012

In this paper, we proposed on the direction of self-repairing mimicking the cell on the digital system design. Three-dimensional array of cells rather than using the original structure of FPGA, an array of blocks for efficient error detection methods were investigated. With a certain regularity, so the design method in detail by dividing the full array. The digital circuits can be detected fault location easily and quickly.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.12
• /
• pp.21-27
• /
• 1998

This paper recommends the database construction for STL data and the new method of Delaunay's triangulation method in order to decrease volume errors by verifying STL file errors and modifying hole errors. Each vertex for the boundary coordinates of the verified hole errors was analyzed according to the following cases: planes or slow curves, edges, apexes, and rapid curves. In each case, a different modification process was adopted. With this method, most errors resulting from the conversion into the STL data as well as lots of volume errors arising from error modification were decreased.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.05d
• /
• pp.752-757
• /
• 2002

IP 멀티캐스트는 다자간 통신을 위한 효과적인 방법이지만 신뢰성 보장과 FTP나 Telnet등 TCP제공하는 다양한 전송프로토콜을 지원하지 않는다. 본 논문에서는 멀티캐스트의 UDP와 TCP계층의 전송 프로토콜을 동시에 사용할 수 있는 신뢰성 있는 멀티캐스트 서버라우터를 제안한다. 신뢰성 있는 멀티캐스트가 반드시 고려해야 할 확장성과 오류회복, 흐름제어를 위해, 그룹의 확장성과 오류회복에 적합한 기존의 SRM방식을 이용하였다. SRM방식은 신뢰성 있는 다-대-다 멀티캐스트 패킷을 전달한다. 각 참여자는 동시에 수신자와 송신자 역할을 할 수 있다. 모든 그룹 멤버는 낮은 주파수의 세션 메시지를 교환하고 그룹내의 주변 가입자에 대한 정보를 얻게 되며 패킷 손실 판단에 필요한 지연시간을 측정하고 복구하는 방식이다. UDP의 트래픽 기반은 멀티캐스트에 적합한 CBR과 SRM을 사용하였다. 본 연구에서는 멀티캐스트의 UDP 패킷과 TCP 패킷을 동시에 보낸 수신율과 멀티캐스트의 UDP만 보낸 수신율을 지연이 가장 큰 멀티캐스트 수신자측에서 패킷 번호와 수신율을 측정하고, 시뮬레이션을 통해서 검증을 통하여 기존의 멀티캐스트 전송방법과 비교하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.4
• /
• pp.509-518
• /
• 1993

Protocol conversion is to resolve the imcompatibility between networks so that users on different protocols can communicate with each other. This paper designs a formal model, EPN , to increase its modeling power and analyze conversion protocol and proposes a conversion algorithm using it. The conversion algorithm has two capabilities : synchronization and automatic error recovery function. Therefore burden of protocol converter design will be reduced, automatic protocol converter design can be possible and implementation for half-gateway will be easy.