• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.49 no.1
• /
• pp.15-24
• /
• 2012

In this paper, we suggest the dynamic-response-free SMPS using a new high-resolution DPWM generator based on switched-capacitor delay technique. In the proposed system, duty ratio of DPWM is controlled by voltage slope of an internal capacitor using switched-capacitor delay technique. In the proposed circuit, it is possible to track output voltage by controlling current of the internal capacitor of the DPWM generator through comparison between the feedback voltage and the reference voltage. Therefore the proposed circuit is not restricted by the dynamic-response characteristic which is a problem in the existing SMPS using the closed-loop control method. In addition, it has great advantage that ringing phenomenon due to overshoot/undershoot does not appear on output voltage. The proposed circuit can operate at switching frequencies of 1MHz~10MHz using internal operating frequency of 100 MHz. The maximum current of the core circuit is 2.7 mA and the total current of the entire circuit including output buffer is 15 mA at the switching frequency of 10 MHz. The proposed circuit has DPWM duty ratio resolution of 0.125 %. It can accommodate load current up to 1 A. The maximum ripple of output voltage is 8 mV. To verify operation of the proposed circuit, we carried out simulation with Dongbu Hitek BCD $0.35{\mu}m$ technology parameter.

• Journal of KIISE:Databases
• /
• v.31 no.5
• /
• pp.457-467
• /
• 2004

The efficiency of algorithms managing data caches has a major impact on the performance of systems that utilize client-side data caching. In these systems, two versions of data can be maintained without an additional space overhead of the server by exploiting the replication of data in the server's buffer and clients' caches. In this paper, we present a new cache consistency algorithm employing versions: Two Versions-Callback Locking (2V-CBL). Our experimental results indicate that 2V-CBL provides good performance, particularly outperforms a leading cache consistency algorithm, Asynchronous Avoidance-based Gache Consistency, when some clients run only read-only transactions.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11
• /
• pp.3097-3107
• /
• 1999

Recently many studies have been done on the Random Early Detection(RED) algorithm as an active queue management and congestion avoidance scheme in the Internet. In this paper we first overview the characteristics of RED and the modified RED algorithms in order to understand the current status of these studies. Then we analyze the RED dynamics by investigating how RED parameters affect router queue behavior. We show the cases when RED fails since it cannot react to queue state changes aggressively due to the deterministic use of its parameters. Based on the RED parameter analysis, we propose a self-adaptive algorithm to cope with this RED weakness. In this algorithm we make two parameters be adjusted themselves depending on the queue states. One parameter is the maximum probability to drop or mark the packet at the congestion state. This parameter can be adjusted to react the long burst of traffic, consequently reducing the congestion disaster. The other parameter is the queue weight which is also adjusted aggressively in order for the average queue size to catch up with the current queue size when the queue moves from the congestion state to the stable state.

• The Journal of the Korea Contents Association
• /
• v.12 no.8
• /
• pp.69-76
• /
• 2012

This paper proposes an efficient power consumption scheme using sleep mode in home gateway. The scheme by this paper classifies incoming real time packet and non-real time packet in home gateway and delay non-real time packet. Therefore, the home gateway can have longer sleep time because non-real time packet can get additional delay time by proposing mechanism using timer. We use non-preemptive two priority queueing model for performance analysis. As a results, we verify that power consumption of proposed scheme is reduced more than existing scheme by delay of non-real time traffic.

• Journal of Korea Multimedia Society
• /
• v.9 no.7
• /
• pp.835-843
• /
• 2006

Multicast can send one copy of each packet to each member of the multicast group. Network resource is utilized effectively, consequently, it is suitable for one-to-many environments. reliability and flow control, however, are not supported basically, it is not suitable or transmission of multimedia data which have a time restriction. In this paper, we present a network model and a multicast retransmission scheme The proposed scheme remove ack-explosion from sender through local recovery and performs local retransmission when time restriction is satisfied on receiver by considering the state of receiver's buffer. Mathematical analysis and simulation are conducted to prove performance of the proposed scheme. The results are shown that the proposed scheme consumes a lower network bandwidth than the existing network model and guarantees QoS of receivers.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.6B
• /
• pp.1059-1067
• /
• 1999

In this paper characteristics of ATM-PON is described and a TC layer controller for ATM-PON OLT is designed. This paper proposes an algorithm of economically controlling the grant information written by CPU to dynamically allocate the upstream bandwidth on the PON among the ONUs in a fair way and of encrypting the downstream data using a lower standard of encryption, termed data churning, which is used to distinguish it from existing transmission system scramblers and higher layer encryption methods. This paper also proposes a method of allocating churning-related message into the PLOAM cell in order to synchronously change the churning key between the OLT and the ONU.

• Journal of Korea Multimedia Society
• /
• v.7 no.10
• /
• pp.1443-1451
• /
• 2004

In this paper we propose a new packet scheduling mechanism to improve TCP throughput and fairness with estimated link state information in wireless networks, in which mobile hosts are receivers. Since a priori estimated link state information is used in this proposed mechanism, the entire packet transmission time can be reduced. In other words, packets scheduling procedure is performed before packets are transmitted using estimated link state. The proposed mechanism also has an temporary FIFO queue to store packets which are on the head of queue and can not be transmitted due to bad link state. Using this temporary FIFO queue, HOL(Head of Line) problem of FIFO queue can be resolved.

• The KIPS Transactions:PartA
• /
• v.12A no.3 s.93
• /
• pp.197-204
• /
• 2005

In this paper, we consider the transmission or variable bit rate (VBR) stored video for the distributed video streaming service over Internet. In streaming service, users often suffer from the discontinuity in playback due to the decrease in bandwidth during transmission according to bandwidth renegotiation protocol. We propose a novel transmission technique to overcome this problem for stored variable bit rate video. This scheme uses a priori information of stored VBR video to continue streaming without playback discontinuity. In addition, an approximation scheme for the buffer-bandwidth relation is proposed in order to facilitate the admission control under the proposed scheme.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.250-252
• /
• 2003

휴대폰, PDA 등의 대중화에 따라 원격에서 영상을 통해 대상의 상태를 확인하고자 하는 욕구가 증가하였고, 웹 카메라의 보급에 의한 영상 멀티미디어 기술의 대중화는 소프트웨어적인 영상 처리가 가능한 홈 원격화상 감시 솔루션의 개발을 가능하게 하였다. 기존의 화상 전송 시스템은 설치되어 있는 모든 카메라의 동화상을 처리하여 전송함으로써 시스템의 자원을 소모하였고, 모바일 기기에서의 화상 재생에 대한 고려가 되어있지 않았으며, 카메라 수의 확장이 어려웠다. 본 논문에서는 이에 따른 해결 방안으로 클라이언트에서의 동화상 재생에 필요한 웹 카메라를 선택하여 동화상의 처리 및 전송을 함으로써 시스템의 자원 소모를 줄일 수 있고, 모바일 기기에서의 동화상 재생에 최적화된 화질의 화상을 전송할 수 있으며, 버퍼 사용의 최소화로 실시간 전송 및 재생이 가능한 실시간 화상 전송 서버를 설계 및 구현하였다. 구현된 시스템은 가정. 학교와 같은 특정 장소의 영상 감시와 산업용 기기인 통합 전력 감시 시스템. 분산 제어 시스템 등에 적용할 수 있다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.3
• /
• pp.311-321
• /
• 2003

A current firewall or IDS (intrusion detection system) of the network level suffers from many vulnerabilities in internal computing servers. For a secure Linux implementation using system call hooking, this paper defines two requirements such as the multi-level security function of TCSEC B1 and a prevention of hacking attacks. This paper evaluates the secure Linux implemented in terms of the mandatory access control, anti-hacking and performance overhead, and thus shows the security, stability and availability of the multi-level secure Linux. At the kernel level this system protects various hacking attacks such as using Setuid programs, inserting back-door and via-attacks. The performance degradation is an average 1.18% less than other secure OS product.