• Aerospace Engineering and Technology
• /
• v.4 no.2
• /
• pp.171-191
• /
• 2005

This Technical Memo(TM) was written for the purpose of determining the type of UHF-band power divider which is applicable to KSLV-1. For this, some different kinds of power divider are compared with there types and characteristics. And then, we select three types of power divider(which is Wilkinson power divider, Quadrature hybrid divider and Ring hybrid divider) and perform Schematic and Momentum simulation for finding the optimized characteristics. With this results, in order to demonstrate the selected power divider, we manufactured UHF-band power dividers using FR-4 epoxy plate. By the measured results, we obtain the similar results compare with simulation and fabrication. And Quadrature hybrid power divider is suitable to application to KSLV-1.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.25-27
• /
• 2003

본 논문은 10GbE로의 망 전개에 따라 구현될 l0Gb 스위치에 필요한 계층2 부가서비스들 중에서 여러개의 물리적인 링크를 하나의 논리적인 링크로 집합하여 대역폭의 증가를 가져오는 링크 집합(Link Aggregation) 기술에 필요한 프레임 분배방식에 대한 것이다. 링크 집합 기술은 분배 알고리즘의 설계에 따라 스위치에서 성능의 차이를 가져오므로 링크 집합의 장정을 살리려면 종은 성능을 가지는 분배 알고리즘이 필요하다. 우선 링크 집합의 간단한 구현 방법을 살펴보고 기존에 제시된 스위치와 스위치 사이에서의 프레임 분배방식인 정적/동적 프레임 분배 방식과 우리가 새로이 제안한 패딩을 이용한 분배방식을 비교한 후, 정적/동적 프레임 분배 방식과 패딩을 이용한 분배방식을 컴퓨터 시뮬레이션을 통해 성능을 비교하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12A
• /
• pp.945-950
• /
• 2003

The link aggregation between 10GbE switches requires an advanced frame distribution method to be properly and efficiently applied. The fixed or dynamic frame distribution methods, formerly proposed, cannot fully utilize the aggregated links, where the receiving terminal only attaches to a pre-specified link among multiple physical links. A frame distribution method using tagging is proposed for the link aggregation between 10GbE switches to solve this problem. We compared the performance of the proposed method with those of the fixed and dynamic frame distribution methods. As a result, the proposed method shows a better performance when the applied load is below 0.7 and the average length of the frames is longer than 954 bytes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7A
• /
• pp.955-963
• /
• 1999

In this paper, in other to analyze the performance of efficient key distribution protocol, we evaluate the key distribution processing method of push model like the Kerberos and pull model such as X.9.17 used in wired network. Also, we evaluate the procedure of key distribution protocol in satellite network. Besides, we analyze the performance of key distribution protocol procedure in view of delay and throughput in the case that key distribution protocol is processed based on Inband/Outband channel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.7B
• /
• pp.1236-1243
• /
• 2000

본 논문은 LAN의 대역폭을 증가 시키기 위하여, 여러 개의 링크를 논리적인 하나의 링크처럼 동작하도록 하는 다중링크통함(link aggregation)기술에 대한 것이다. 우리는 망 구성에 따라 이 기술의 동작방식이 상이함에 착안하여, 두 가지의 새로운 프레임 분배방식을 제안하고 SIMULA를 이용한 모의실험으로 성능을 분석하였다. 먼저, LAN스위치와 스위치간에 적용 가능한 동적 프로엠 분배방식을 제안하였다. 이 방식은 특정 포트로 집중되는 프레임들을 분산시키기 위하여 가장 이용율이 낮은 링크를 동적으로 추가하는 것으로서, 링크 추가시 프레임들의 전달순서를 지킬 수 있도록 특별한 플러쉬 버퍼를 사용하였다. 모의실험 결과, 프러임간의 순서가 유지되면서도 스위치의 내부 버퍼에서의 프레임 폐기율이 기존 방식에 비해 감소됨을 확인하였다. 그리고, 단말과 단말간에 다중링크가 사용된 경우, 수신된 프레임들 간의 순서 뒤바뀜 문제에 대한 해결책으로 패딩 방법과, 태깅 방법, 프레임 분할 방식 등의 세가지으 프레임 분배방식을 제안하고 성능을 분석하였다. 이러한 세가지 방법 중에서 프레임 분할방식이 가장 성능면에서 우수함이 모의실험결과\ulcorner서 알 수 있지만, 패딘 방식도 구현관점에서 장점이 있다.

• The KIPS Transactions:PartA
• /
• v.10A no.4
• /
• pp.285-294
• /
• 2003

The request scheduling algorithms being used for the cluster web servers are mostly in two categories : load-balancing and contents-based cache affinity The goal of the load-balancing algorithms is to balance the loads between real servers. On the other hand, contents-based scheduling algorithm exploits the cache affinity in a way that the same type of requests are to be directed to a dedicated real server allowing load imbalance. So the performance comparison of the two algorithms is necessary, nevertheless the related experiment results are not much suggested. In this paper, performance evaluations have been done to compare the performance of the two scheduling algorithms. To accomplish this, we first implement a linux cluster web server, and then present the performance measurement results. The main contribution of this paper is to help the cluster web server administrators to select an algorithm fitting in with their circumstances from the two algorithms.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.3
• /
• pp.97-103
• /
• 2020

Linux Cgroups takes a fundamental role for sharing system resources among multiple containers on container-based cloud computing environment. Especially for I/O resource, Linux Cgroups supports a mechanism for sharing I/O bandwidth in proportion to I/O weight. However, the current mechanism of Linux Cgroups using BFQ I/O scheduler seriously degrades the I/O performance with high bandwidth storage device such as NVMe SSDs. In this paper, we proposed a new feedback based I/O bandwidth sharing scheme for Linux Cgroups which allocates I/O credits to containers according to I/O weights and adjusts the amount of credits to performance fluctuation of NVMe SSDs. The proposed scheme is implemented on Linux kernel 5.3 and evaluated. The evaluation results show that it can share the I/O bandwidth among multiple containers proportionally to I/O weights while improving I/O performance more than twice as high as the existing scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6A
• /
• pp.635-642
• /
• 2008

We propose the Optimum Power Allocation (OPA) scheme for Distributed Antenna Systems(DAS) in the time-varying Rayleigh fading channel. Recently, the OPA schemes which uses the Channel State Information (CSI) including a small scale (fast) fading have been proposed. However, the channel is changing vary fast over time due to small scale fading, therefore Bit Error Rate (BER) increases. Because of this reason, we derive the OPA for minimizing BER in DAS, which only uses a large scale fading to CSI and excepts a small scale fading. The simulation results show that the proposed OPA achieves better BER performance than conventional OPA considering a small scale fading in time-varying Rayleigh fading channel, and also has similar performance in Rayleigh flat-fading environment. The BER performance of proposed OPA which derived in Rayleigh fading channel is similar to minimum BER of Ricean fading channel which has small Line-of-Sight (LOS).

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.4
• /
• pp.1523-1531
• /
• 2011

Multi-axle driving vehicle are favored for military use in off road operations because of their high mobility on extreme terrains and obstacles. Especially, Military Vehicle needs an ability to driving on hills of 60% angle slope. This paper presents the improvement of the ability of hill climbing for 6WD/6WS vehicle through the optimal tire force distribution method. From the driver's commands, the desired longitudinal force, the desired lateral force, and the desired yaw moment were obtained for the hill climbing of vehicle using optimal tire force distribution method. These three values were distributed to each wheel as the torque based on optimal tire force distribution method using friction circle and cost function. To verify the performance of the proposed algorithm, the simulation is executed using TruckSim software. Two vehicles, the one the proposed algorithm is implemented and the another the tire's forces are equivalently distributed, are compared. At the hill slop, the ability to driving on hills is improved by using the optimum tire force distribution method.

• Journal of Korea Multimedia Society
• /
• v.7 no.8
• /
• pp.1097-1106
• /
• 2004

The typical web cluster architecture consists of replicated real servers and a virtual server that routes client requests among the real servers. In this paper, we proposed an efficient dynamic load distribution method with load prediction for the web cluster systems. The virtual server transmit status request message to real servers in other to get load states. However the load states dose not accurate during load distribution, thus the virtual server predict the load status of real servers and assign a request of the client to the minimum loaded real server. The proposed distribution methods works not related to partial breakdown of real servers, thus the system works with high availability. We also show that the proposed distribution method preserve scalable property and improve the throughput through a set of simulations.