• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10d
• /
• pp.261-266
• /
• 2007

UMTS release 5 에서 소개된 HSDPA 를 위해 도입된 새로운 기술 Adaptive Modulation and Coding, Hybrid Automatic Repeal reQuest, Fast Packet Scheduling 에 대해 알아보고 여기서 key role 이 되는 Fast Packet Scheduling 알고리즘 가운데 대표적인 세 가지 Round Robin(RR), Promotional Fairness(PF), Maximum Channel Quality Index(Max CQI) 알고리즘의 성능을 시스템 수율과 공평성의 관점에서 분석해보았다. 시스템 수율에서는 Max CQI, PF. RR 알고리즘 순이었으며 공평성 측면에서는 RR, PF Max CQI 알고리즘 순으로 나타났다. 같은 시스템, 같은 망 구조 내에서라면 알고리즘을 최적화하여 QoS와 성능을 극대화할 수 있도록 지속적인 연구가 필요하다.

• Proceedings of the KSME Conference
• /
• 2001.11a
• /
• pp.246-251
• /
• 2001

The performance demonstration round robin test was conducted to quantify the capability of ultrasonic inspection for in-service and to address some aspects of reliability for nondestructive evaluation. The fifteen inspection teams who employed procedures that met or exceeded ASME Sec. XI code requirements detected the pinping of nuclear power plant with various cracks to evaluate the capability of detection. With data from PD-RR test, the performance of ultrasonic nondestructive inspection could be assessed using probability of detection and length and depth sizing of cracks.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11a
• /
• pp.151-154
• /
• 2002

갈수록 증가하는 인터넷 사용자의 서비스 요구량에 대처하기 위해, 부하 분산 기능을 갖는 클러스터 시스템의 이용이 늘어가고 있다. 본 연구에서는 클라이언트에게 보다 향상된 응답 성능을 제공하기 위해 사용되는 RR(Round Robin), WRR(Weighted Round Robin), LC(Least Connection), WLC(Weighted Least Connection) 부하 분산 알고리즘에 대해서, 클라이언트로부터 인입되는 7 가지 요구 수신 패턴에 따른 부하 분산 응답 특성을 분석하고 그 결과를 논한다. 이를 위해, 실제 시스템의 측정 결과를 토대로 단위 시간 당 인입되는 클라이언트의 요구량 변화를 7 가지 패턴으로 분류하였고, 리눅스 가상 서버(LVS: Linux Virtual Server) 클러스터 시스템을 대상으로 7 가지 요구 패턴에 대한 부하 분산 응답 특성을 얻었다. 본 연구를 통해서 클라이언트 요구랑 변화 패턴에 따른 최적의 부하 분산 알고리즘을 제시할 수 있었다. 본 연구 결과는 향후 효율적인 동적 부하 분산 연구에 좋은 참고가 될 것이다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.7A
• /
• pp.611-619
• /
• 2005

The present paper proposes two different packet scheduling algorithms in the IEEE 802.16e type TDD-OFDMA downlink, which are the weighted fair scheduling(WFS) and the throughput guarantee scheduling(TGS). The performance of proposed scheduling algorithms are compared to some of conventional schedulers such as round robin(RR), proportional fair(PF), fast fair throughput(FFTH), and fair throughput(FH) in terms of service coverage, effective throughput and fairness at 64 kbps and 128 kbps minimum user throughput requirements. For a relatively smaller throughput(64 kbps) requirement, the proposed algorithms provide higher improvement in the number of users per sector within 95$\%$ service coverage while satisfying the lxEV-DV fairness criterion. For a relatively larger throughput(128 kbps) requirement, the proposed algorithms provide higher coverage enhancement while maintaining the same effective aggregate throughput over PF scheduler.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.6 s.336
• /
• pp.41-52
• /
• 2005

In wireless networks there are various errors, caused by multi-path fading and interference between devices which lower the network Performance. Especially, performance of IEEE 802.IS.3 High-Rate WPAN (Wireless Personal Area Network) which is operated in ISM unlicensed frequency band is easily affected by channel errors. In this paper, we propose a scheduling algorithm which takes channel errors into consideration in scheduling asynchronous data traffic. The proposed scheduling algorithm can allocate CTA(Channel Time Allocation) proportionally in accordance with the requested channel time of each device. It also prevents waste of channel time by allocating CTA of the channel-error devices to other channel-error free devices. After recovering from the channel error, the devices are compensated as much as they conceded during channel error status. Simulation results show that the proposed scheduling algorithm is superior to the existing SRPT(Shortest Remain Processing Time) and RR(Round Robin) in throughput and fairness aspects.

• Proceedings of the Korean Reliability Society Conference
• /
• 2001.06a
• /
• pp.245-255
• /
• 2001

원전 가동전/가동중검사 결과의 신뢰도(reliability)는 원전 배관기기의 건전성에 직결되는 것으로써 결함 발견 시 적용되는 파괴역학해석(FMA)은 비파괴검사 결과에 대한 100%의 신뢰를 전제하고 있다. 그러나 비파괴검사가 어느 정도 신뢰성을 가지고 있는지에 대한 평가가 국내에서는 거의 수행된 바가 없었다. 따라서, 본 연구에서는 원전의 비파괴검사 규제 요건의 기술적 근거를 확보하고, 원전 기기 건전성 평가 및 안전성 향상을 위한 합리적 규제지침을 수립하기 위하여 국내 원전 가동중검사(ISI)에 적용되거나 일반 산업계에 적용되고 있는 초음파탐상검사에 대하여 기량검증 Round Robin Test에 의한 통계적 신뢰도를 평가하고자 한다. 이를 위해 초음파검사 PD-RRT 결과의 통계적 신뢰도 평가 모델을 고찰하고, 결함검출성능 평가, 결함크기 측정 평가, 팀 오차 분석 등 초음파검사 PD-RRT 결과의 통계적 신뢰도를 평가하였다.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.414-417
• /
• 2003

In this paper, a performance of Bluetooth piconet is analyzed. Average cycle time, average waiting time, average transfer delay and average queue length are used for measure of performance (MOP). Simple round robin (RR) scheduling policy with exhaustive service is used for the analysis. Packet loss is considered because of noise environments of wireless communication. Numerical results have been presented. Simulation is performed to validate the correctness of analysis.y and its maximum operating frequency is 800MHz.

• Proceedings of the Korean Reliability Society Conference
• /
• 2002.06a
• /
• pp.217-224
• /
• 2002

The performance demonstration round robin test was conducted to quantify the capability of ultrasonic inspection for in-service and to address some aspects of reliability for nondestructive evaluation. The fifteen inspection teams who employed procedures that met or exceeded ASME Sec. XI code requirements detected the piping of nuclear power plant with various cracks to evaluate the capability of detection. With data from PD-RR test, the performance of ultrasonic nondestructive inspection could be assessed using probability of length and depth sizing of cracks.

• International Journal of Contents
• /
• v.6 no.3
• /
• pp.19-24
• /
• 2010

Task scheduling is an integrated component of computing with the emergence of grid computing. In this paper, we address two different task scheduling models, which are static Round-Robin (RR) and dynamic Fastest Site First (FSF) task scheduling method, using extended timed marked graphs, which is a special case of Stochastic Petri Nets (SPN). Stochastic reward nets (SRN) is an extension of SPN and provides compact modeling facilities for system analysis. We build hierarchical SRN models to compare two task scheduling methods. The upper level model simulates task scheduling and the lower level model implements task serving process for different sites with multiple servers. We compare these two models and analyze their performances by giving reward measures in SRN.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.7_8
• /
• pp.352-358
• /
• 2003

A cluster of servers is the most promising solution to provide highly scalable and highly available network services with low implementation cost. One of popular solutions is using dispatcher as a request distributor. However this solution has the problem that is can be the bottleneck or single-point of failure point of itself. ONE-IP, the previous work, solves this serious problem by using broadcast message for distributing the request packet in LAN. Using simple scheduling technique, in addition, the overhead due to dispatching the request becomes minimal. However, as ONE-IP using very simple static scheduling algorithm, it would spread the request among servers unevenly and downgrades the cluster performance consequently. In this paper, we propose an improved TCP connection scheduling technique solving this unbalanced distributing problem. Using Round-Robin(RR) scheduling instead of hashing clients IP address, proposed technique can more evenly distribute incoming service requests among the servers. Experiments show average 3.8% improved performance in throughput compared to original ONE-IP technique.