• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.339-350
• /
• 2004

A broadcast method in mobile computing environments which have very large client populations solves the problem of low bandwidth. But most of previous proposed concurrency control protocols are restricted to read-only transactions from mobile client. In this paper, we propose the UTSM-ARM method which uses caching and broadcast method, and allows update transactions in mobile client. The UTSM-ARM decides the validation of cache data consistency with the dynamic update pattern ratio of accessed cached data. Also, the timestamps of accessed cached data and transaction in mobile client guarantee the serializable execution of mobile transactions. As a result, UTSM-ARM makes efficiently use of the asymmetric bandwidth of broadcast environment and can Increase the transaction throughput.

• Proceedings of the KAIS Fall Conference
• /
• 2002.11a
• /
• pp.220-224
• /
• 2002

본 논문에서는 웹 서버의 부하가 급증하면서 대두된 네트워크 과부하를 해결하기 위한 방법으로 서버분산처리 방식과 RTO(retransmission time out : 재전송타임아웃)간을 조정하는 기법을 이용하였다. 부하 분산을 위한 방법으로는 기존의 NAT 기반의 가상서버 방식과 비슷하나, 기존의 가상서버에서 서버들을 선택하는 스케줄링 방법을 이용하지 않고 네트워크 주소(IP)룰 통한 서버 분산방법을 선택하였다. 이를 위해 Linux 기반의 PC에 라우터론 구축하였고 여기에 실제 IP를 할당하였으며, 라우터를 경유하여 연결된 두개의 서버에는 가상 IP를 할당 내부접속용과 외부접속용으로 나누어 서버 분산이 이루어지게끔 하였다. 이러한 서버 분산은 학교라는 즉. 웹서버의 접속이 내부접속 비율과 외부접속 비율 어느 한쪽으로도 크게 기울지 않는 네트워크 환경을 고려한 것이다. 네트워크의 성능 평가에 있어 가장 기본이 될 수 있는 응답시간은 전송거리와 트래픽량에 비례한다. 이에 외부접속용 서버와 내부접속용 서버 각각에 RTO 값을 다르게 적용시킴으로써 전체적인 Delay의 변화를 확인해 볼 수 있다. 이는 전송거리가 길 경우 생길 수 있는 패킷 손실을 고려한 것으로 패킷 손실로 인하여 재전송이 이루어질 경우 재전송 time이 RTO를 통하여 이루어지며 이러한 RTO의 적절한 값은 전체적인 응답시간에 영향을 미칠 수 있다는 것에 기인한 것으로 RTO값을 전송거리가 긴 외부접속용 서버에는 전송거리가 짧은 내부접속용 서버에 비해 길게 적응시킴으로써 전체적인 응답시간의 개선을 유도하였다

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.7
• /
• pp.18-25
• /
• 2014

To increase wireless capacity, the concurrent use of multiple wireless interfaces on different frequency bands, called aggregation, can be considered. In this paper, we focus on aggregation of multiple Wi-Fi interfaces with packet-level traffic spreading between the interfaces. Two aggregation schemes, link bonding and multipath TCP (MPTCP), are tested and compared in a dualband Wi-Fi radio system with their Linux implementation. Various test conditions such as traffic types, network delay, locations, interface failures and configuration parameters are considered. Experimental results show that aggregation increases throughput performance significantly over the use of a single interface. Link bonding achieves lower throughput than MPTCP due to duplicate TCP acknowledgements (ACKs) resulting from packet reordering and filtering such duplicate ACKs out is considered as a possible solution. However, link bonding is fast responsive to links' status changes such as a link failure. It is shown that different combinations of interface weights for packet spread in link bonding result in different throughput performance, envisioning a spatio-temporal adaptation of the weights. We also develop a mathematical model of power consumption and compare the power efficiency of the schemes applying different power consumption profiles.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.6
• /
• pp.85-94
• /
• 2015

In this paper, an enhanced QoS multicast routing scheduling scheme is proposed to adapt to a dynamic mobile traffic condition for wireless mesh networks (WMNs). It handles the network QoS by controlling the delay constraints for multimedia applications. The group size will be controlled according to both the current network state and QoS requirements. The dynamic reconstruction of QoS multicast tree can be obtained from preprocessing with both the partial multicast routing scheme and the traffic estimation. Performance evaluation of the proposed scheme is carried out on randomly generated graph derived from the wireless mesh network, by choosing the optimal value related to the appropriate delay bounds. Simulation results show that the proposed scheme can improve the performance of QoS multicast routing for WMNs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8A
• /
• pp.798-803
• /
• 2006

An opportunistic scheduling is adopted to improve the capacity of the system by exploiting the multiuser diversity of multiuser MIMO(MU-MIMO) systems. However it requires the large amount of feedback carrying the channel quality information(CQI) of each user to the transmitter, The considered per user unitary and rate control(PU2RC) needs to feedback the preferred preceding index and its CQIs, and it has a defect in scheduling the streams for the grouped user. In order to overcome these drawbacks, a novel feedback reduction scheme is proposed in this paper. It employs transmitter controlled preceding and opportunistic feedback(TCP-OFB). The simulation results demonstrate that TCP-OFB shows comparable performance to PU2RC while it only requires far reduced feedback load.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.662-665
• /
• 2013

ITS(Intelligent Tutoring System) is a system that provides active and flexible tutoring conditions to learners, having adopted artificial intelligence to overcome the limitations of CAI(Computer Assisted Instruction). However, the existing ITS has a few problems; the system provides the same contents to every learner, not considering main variants of their learning and achievement, characters and levels, and therefore, it does not generate satisfactory results; the system does not offer a properly designed course schedule. Therefore, this thesis proposes ARS(Adaptive Recommendation System), founded on ITS, that provides contents designed based on the characters and levels of learners. To catch the characters of learners, the important variant for successful learning, ARS applies and embodies a module of self-assessment test. Also, it puts weighs according to the areas of learning which is different from the simplified assessment that asks for short and mechanical answers for the purpose of knowing the levels of the learners.

• KIPS Transactions on Software and Data Engineering
• /
• v.1 no.3
• /
• pp.137-148
• /
• 2012

Cloud service users request dedicated virtual computing resource from the cloud service provider to process jobs in independent environment from other users. To optimize this process with automated method, in this paper we proposed a framework for workflow scheduling in the cloud environment, in which the core component is the middleware called broker mediating the interaction between users and cloud service providers. To process jobs in on-demand and virtualized resources from cloud service providers, many papers propose scheduling algorithms that allocate jobs to virtual machines which are dedicated to one machine one job. With this method, the isolation of being processed jobs is guaranteed, but we can't use each resource to its fullest computing capacity with high efficiency in resource utilization. This paper therefore proposed a cost-efficient job scheduling algorithm which maximizes the utilization of managed resources with increasing the degree of multiprogramming to reduce the number of needed virtual machines; consequently we can save the cost for processing requests. We also consider the performance degradation in proposed scheme with thrashing and context switching. By evaluating the experimental results, we have shown that the proposed scheme has better cost-performance feature compared to an existing scheme.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.1
• /
• pp.9-26
• /
• 2005

In the pursuit of ever higher levels of performance, recent computer systems have made use of deep pipeline, dynamic scheduling and multi-issue superscalar processor technologies. In this situations, branch prediction schemes are an essential part of modem microarchitectures because the penalty for a branch misprediction increases as pipelines deepen and the number of instructions issued per cycle increases. In this paper, we propose a novel branch prediction scheme, direction-gshare(d-gshare), to improve the prediction accuracy. At first, we model a neural network with the components that possibly affect the branch prediction accuracy, and analyze the variation of their weights based on the neural network information. Then, we newly add the component that has a high weight value to an original gshare scheme. We simulate our branch prediction scheme using Simple Scalar, a powerful event-driven simulator, and analyze the simulation results. Our results show that, compared to bimodal, two-level adaptive and gshare predictor, direction-gshare predictor(d-gshare. 3) outperforms, without additional hardware costs, by up to 4.1% and 1.5% in average for the default mont of embedded direction, and 11.8% in maximum and 3.7% in average for the optimal one.