• Journal of the Korea Society of Computer and Information
• /
• v.7 no.4
• /
• pp.188-198
• /
• 2002

In this paper, we propose an active network to support reliable data transmission in the mobile ad-hoc network. The active network uses DSR(Dynamic Source Routing) protocol as its basic routing protocol, and uses source and destination nodes as key active nodes. For reliable improvement the source node is changed to source active node to add function that its buffer to store the last data with the flow control for data transmission per destination node. The destination node is changed to destination active node to add function that it requests the re-transmission for data that was not previously received by the destination active node with the flow control for data reception per source active node As the result of evaluation. we found the proposed active network guaranteed reliable data transmission with almost 100% data reception rate for slowly moving mobile ad-hoc network and with more 95% data reception rate, which is improvement of 3.5737% reception rate compared with none active network, for continuously fast moving mobile ad-hoc network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4A
• /
• pp.377-386
• /
• 2008

In this paper, a new handover management scheme has been proposed to reduce handover latency and to support fast handover without packet losses, so that it may be applicable to the wireless mobile Internet system such as IPv6-based WiBro system. To minimize the handover latency in processing of movement detection, we propose the handover management scheme which simplifies the handover message exchanging procedure between mobile subscriber station (MSS) and network by integrating layer 2 and layer 3 handovers efficiently based on the layer2 information. To reduce the processing delay from new care-of-address (NCoA) configuration during handover, we propose that NCoA is created, distributed and managed by new access control router (NACR). In addition, in order to minimize the packet transmission delay and eliminate the packet losses, the proposed scheme employs a crossover router (CR) which is upper network located over PACR and NACR and employs the packet buffering for MSS. The simulation study shows that the proposed scheme achieves loss-free packet delivery and low latency in the environment of narrow overlapped cell area or high velocity of the MSS, comparing the performance with the conventional schemes.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.6
• /
• pp.59-70
• /
• 2004

SMT(Simultaneous Multi Threading) architecture uses TLP(Thread Level Parallelism) and increases processor throughput, such that issue slots can be filled with instructions from multiple independent threads. Having multiple ready threads reduces the probability that a functional unit is left idle, which increases processor efficiency. To utilize those advantages for the SMT processors, the issue unit must control the flow of instructions from different threads and not create conflicts among those instructions, which make the SMT issue logic extremely complex. Therefore, our SMT architecture, which is modeled in this paper, uses an in-order-issue and completion scheme, and therefore, can use a simple issue mechanism with a scoreboard already instead of using register renaming or a reorder buffer. However, an SMT scoreboarding mechanism is still more complex and costlier than that of a single threaded conventional processor. This paper proposes an optimal implementation of a scoreboarding mechanism for an ARM-based SMT architecture.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.12
• /
• pp.359-368
• /
• 2014

Process synchronization is one of the most difficult subject for students learning the Operating System courses. It is due to the fact that concurrent process environment, where many events occur at the same time, is difficult to understand for ordinary human who thinks only one thing at a time. Classical synchronization examples like the Bounded buffer problem or the Dining philosopher problem fail to hook attention and interest from lower grade students who just begin to study the Operating System courses in college because these examples are either too technical or too unrealistic. In this paper we propose another synchronization example named the Bank account problem as an alternative to the classical ones. Bank account problem is proved to succeed getting high interest and understanding from the student as it is easy and realistic, and almost every student has the experience using bank account in real life. Various synchronization subjects including controlling the execution sequence of each process, incorrect result due to the race conditions, use of semaphores, deadlock, and monitor are considered to apply them to the Bank account problem.

• Journal of KIISE:Software and Applications
• /
• v.35 no.7
• /
• pp.452-461
• /
• 2008

Binary diffing is a method to find differences in similar binary executables such as two different versions of security patches. Previous diffing methods using flow information can detect control flow changes, but they cannot track constant value changes. Biffing methods using assembly instructions can detect constant value changes, but they give false positives which are due to compiling methods such as instruction reordering. We present a binary diffing method and its implementation named SCV which utilizes both structure and value information. SCV summarizes structure and constant value information from disassembled code, and matches the summaries to find differences. By analyzing a Microsoft Windows security patches, we showed that SCV found necessary differences caused by constant value changes which the state-of-the-art binary diffing tool BinDiff failed to find.

• Proceedings of the KAIS Fall Conference
• /
• 2006.05a
• /
• pp.517-521
• /
• 2006

네트워크 가상현실 시스템은 먼 거리에 떨어진 사용자들 사이에 일관성 있는 가상 세계를 제공하며, 군사, 오락, 건축 등 여러 부분에 응용되고 있다. 본 논문에서는 그 동안 고성능 그래픽 워크스테이션 환경에서 중심적으로 연구되어 왔던 네트워크 가상현실 시스템을 가장 보편적인 플랫폼인 네트워크 환경에서 구현할 때 생기는 3차원 그래픽 처리 성능의 문제 등과 같은 이에 대한 해결책들을 제시하고 미로 환경과 지형 환경에 근거한 가상 세계를 응용 실험 대상으로 삼아 성능을 분석하였다. 실시간으로 상호 작용하는 어플리케이션은 성능을 유지하면서 모든 참가자들에게 동일한 뷰를 보여주는 것이 중요하다. 동일한 뷰를 제공하기 위해 참가자들이 전송하는 이벤트마다 재생 지연 시간을 설정하고, 수신한 이벤트에 대해서는 예정 재생 시각까지 버퍼에 저장하여 모든 참가자들이 동시에 이벤트를 실행하도록 하는 기법이 제안되어 왔다. 그러나 네트워크 트래픽이 동적으로 변하므로 네트워크 상에서 발생하는 전송 지연 시간도 동적으로 변화한다. 그러므로 고정된 재생 지연 시간을 사용할 경우, 네트워크 트래픽 감소에 따라 상호 작용 성능을 향상시킬 수 있는 기회를 상실하게 되고, 네트워크 트래픽 증가에 따라 이벤트 손실률이 크게 증가하게 되어 참가자들 간에 일치하지 않는 뷰를 초래하게 된다. 네트워크 트래픽이 적어서 전송 지연 시간이 짧을 경우 짧은 재생 지연 시간을 적용하여 상호작용 성능을 높여주고, 트래픽이 많은 경우에는 재생 지연 시간을 늘림으로써 상호 작용 성능을 해치지 않는 범위에서 이벤트 손실률을 줄인다. 실험을 통하여 제안하는 기법의 성능을 평가하였으며 그 결과 본 동기화 기법이 고부하(heavily loaded) 네트워크 상태가 지속되는 동안 기존 기법에 비해 참가자들에게 일치된 뷰를 제공할 수 있고, 저부하(lightly loaded) 네트워크 상태에서는 상호 작용 성능을 향상시킬 수 있다는 것을 확인하였다.

• Journal of KIISE
• /
• v.43 no.8
• /
• pp.919-926
• /
• 2016

In a wireless network, TCP causes the performance degradation because of mistaking packet loss, which is caused by characteristics of wireless link and throughput oscillation due to change of devices connected on a limited bandwidth. Delay based TCP is not affected by packet loss because it controls window size by using the RTT. Therefore, it can solve the problem of unnecessary degradation of the rate caused by misunderstanding reason of packet loss. In this paper, we propose an algorithm for improving the remaining problems by using delay based TCP. The proposed scheme can change throughput adaptively by adding the RTT, which rapidly reflects the network conditions to BaseRTT. It changes the weight of RTT and the increases and decreases window size based on the remaining amount of the buffer. The simulation indicated that proposed scheme can alleviate the throughput oscillation problem, as compared to the legacy TCP Vegas.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8B
• /
• pp.514-524
• /
• 2005

In optical burst switching(OBS) networks, the ingress edge router assembles packets in the same class queue into the appropriate size of burst. A burst control packet(BCP) is generated for channel reservation of corresponding data burst and sent earlier than the corresponding data burst with an offset time. Offset time is determined considering the number of hops from source to destination and the required quality of service(QoS). After offset time, the burst data is passed through tile pre-configured optical switches without any O/E/O conversion. But a failure in OBS networks may lead to the loss of bursts until the ingress nodes receive the failure indication signal. This results in a significant degradation in QoS. Therefore, in this paper, we propose a fault-tolerant node architecture based on sub-carrier multiplexing to reduce the effects of failure in OBS networks. The Performance of the proposed fault-tolerant node architecture exhibits considerable improvement as compared with the previous ones.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4C
• /
• pp.295-307
• /
• 2002

The IEEE 1394 protocol is a de facto standard in multimedia digital home network. It supports several advanced features such as hot plugging, dynamic network reconfiguration, isochronous transmission and so on. Since the IEEE 1394 was adapted in the field of multimedia service with QoS guarantee, back bone network protocol with reel-time digital instrumentation and control sub networks, and physical layer protocol for real-time middleware such as real-time CORBA, the additional real-time features has been required in device driver implementation because of the necessity of the predictability enhancement. To guarantee the real-time features, the device driver of the IEEE 1394 should support the priority based packet processing and also need a isochronous buffer management mechanism to deal with the periodic isochronous communication. In this paper, we proposed a new software architecture of the IEEE 1394 device driver for supporting the real-time characteristics such as priority based packet processing, priority based scheduling and so on.

• Journal of rehabilitation welfare engineering & assistive technology
• /
• v.11 no.4
• /
• pp.363-370
• /
• 2017

In this paper, we proposed a low-complexity speech enhancement algorithm based on a improved minima controlled recursive averaging (IMCRA) and log minimum mean square error (logMMSE). The IMCRA algorithm track the minima value of input power within buffers in local window and identify the speech presence using ratio between input power and its minima value. In this process, many number of operations are required. To reduce the number of operations of IMCRA algorithm, minima value is tracked using time-varying frequency-dependent smoothing based on speech presence probability. The proposed algorithm enhanced speech quality by 2.778%, 3.481%, 2.980% and 2.162% in 0, 5, 10 and 15dB SNR respectively and reduced computational complexity by average 9.570%.