• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.11
• /
• pp.5269-5286
• /
• 2018

Task scheduling is one of the key issues in improving system performance and optimizing resource management in cloud computing environment. In order to provide appropriate services for heterogeneous users, we propose a novel task scheduling strategy with service differentiation, in which the delay sensitive tasks are assigned to the rapid cloud with high-speed processing, whereas the fault sensitive tasks are assigned to the reliable cloud with service restoration. Considering that a user can receive service from either local SaaS (Software as a Service) servers or public IaaS (Infrastructure as a Service) cloud, we establish a hybrid queueing network based system model. With the assumption of Poisson arriving process, we analyze the system model in steady state. Moreover, we derive the performance measures in terms of average response time of the delay sensitive tasks and utilization of VMs (Virtual Machines) in reliable cloud. We provide experimental results to validate the proposed strategy and the system model. Furthermore, we investigate the Nash equilibrium behavior and the social optimization behavior of the delay sensitive tasks. Finally, we carry out an improved intelligent searching algorithm to obtain the optimal arrival rate of total tasks and present a pricing policy for the delay sensitive tasks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.10
• /
• pp.708-714
• /
• 2014

Wireless sensor networks (WSNs) generally consist of densely deployed sensor nodes that depend on batteries for energy. Having a large number of densely deployed sensor nodes causes energy waste and high redundancy in sensor data transmissions. The problems of power limitation and high redundancy in sensing coverage can be solved by appropriate scheduling of node activity among sensor nodes. In this paper, we propose a cellular automata based node scheduling algorithm for prolonging network lifetime with a balance of energy savings among nodes while achieving high coverage quality. Based on a cellular automata framework, we propose a new mathematical model for the node scheduling algorithm. The proposed algorithm uses local interaction based on environmental state signaling for making scheduling decisions. We analyze the system behavior and derive steady states of the proposed system. Simulation results show that the proposed algorithm outperforms existing protocols by providing energy balance with significant energy savings while maintaining sensing coverage quality.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.40 no.4
• /
• pp.145-156
• /
• 2015

Incorporation of individual learning and forgetting behaviors within worker-task assignment models produces a mixed integer nonlinear program (MINLP) problem, which is difficult to solve as a NP hard due to its nonlinearity in the objective function. Previous studies commonly assume homogeneity among workers in workforce scheduling that takes account of learning and forgetting characteristics. This paper expands previous researches by considering heterogeneous individual learning/forgetting, and investigates the impact of worker heterogeneity in initial expertise, steady-state productivity, learning and forgetting on system performance to assist manager's decision-making in worker-task assignments without tackling complex MINLP models. In order to understand the performance implications of workforce heterogeneity, this paper examines analytically how heterogeneity in each of the four parameters of the exponential learning and forgetting (L/F) model affects system performance in three cases : consecutive assignments with no break, n breaks of s-length each, and total b break-periods occurred over T periods. The study presents the direction of change in worker performance under different assignment schedules as the variance in initial expertise, steady-state productivity, learning or forgetting increases. Thus, it implies whether having more heterogenous workforce in terms of each of four parameters in the L/F model is desired or not in different schedules from the perspective of system productivity measurement.

• The KIPS Transactions:PartA
• /
• v.18A no.4
• /
• pp.123-128
• /
• 2011

As the global grid has grown in size, large-scale distributed data analysis schemes have gained momentum. Over the last few years, a number of methods have been introduced for allocating data intensive tasks across distributed and heterogeneous computing platforms. However, these approaches have a limited potential for scaling up computing nodes so that they can serve more tasks simultaneously. This paper tackles the scalability and communication delay for computing nodes. We propose a distributed data node for storing and allocating the data. This paper also provides data provisioning method based on the steady states for minimizing the communication delay between the data source and the computing nodes. The experimental results show that scalability and communication delay can be achieved in our system.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.44 no.3
• /
• pp.22-32
• /
• 2021

To meet rapidly changing market demands, manufacturers strive to increase both of productivity and diversity at the same time. As a part of those effort, they are applying flexible manufacturing systems that produce multiple types and/or options of products at a single production line. This paper studies such flexible manufacturing system with multiple types of products, multiple Bernoulli reliability machines and dedicated buffers between them for each of product types. As one of the prevalent control policies, priority based policy is applied at each machines to select the product to be processed. To analyze such system and its performance measures exactly, Markov chain models are applied. Because it is too complex to define all relative transient and its probabilities for each state, an algorithm to update transient state probability are introduced. Based on the steady state probability, some performance measures such as production rate, WIP-based measures, blocking probability and starvation probability are derived. Some system properties are also addressed. There is a property of non-conservation of flow, which means the product ratio at the input flow is not conserved at the succeeding flows. In addition, it is also found that increased buffer capacity does not guarantee improved production rate in this system.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.38 no.12
• /
• pp.1170-1176
• /
• 2010

This study addresses adaptive control of UAVs(Unmanned Aerial Vehicles) pitch-axis maneuver. The MRAC(Model Referenced Adaptive Control) approach is employed to accommodate uncertainties which are introduced by feedback linearization of pitch attitude control by elevator input. The model uncertainty is handled by adaptation laws which update model parameters while the UAV is under control by the feedback control law. Steady-state pitch attitude achieved by the stabilizing control law is derived to provide insight on the closed-loop behavior of the controlled system. The proposed idea is free of linearization, gain-scheduling procedures, so that one can design high maneuverability of UAVs for pitching motion in the presence of significant model uncertainty.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.06a
• /
• pp.340-342
• /
• 2018

최근 네트워크 기술과 스마트 단말의 보급으로 인해 비디오 스트리밍 서비스에 대한 수요가 증가하게 되었다. 네트워크를 효율적으로 사용하여 비디오 스트리밍 서비스를 제공하기 위해 적응적으로 전송률을 조절하는 HTTP (HyperText Transfer Protocol) 적응적 스트리밍 서비스가 주목 받게 되었다. UHD (Ultra High Definition) 콘텐츠는 HD (High Definition) 콘텐츠에 비해 적어도 4 배 이상의 크기를 갖기 때문에 끊김 없는 UHD 콘텐츠 스트리밍 서비스를 제공하기 위해서는 많은 가용 대역폭이 필요하다. 기존의 HTTP 적응적 스트리밍 방식은 정상 상태 (Steady State)에서 가용 대역폭보다 낮은 품질의 비디오 세그먼트를 일정 시간마다 주기적으로 요청하여 다운로드 받는다. 정상 상태에서는 가용 대역폭과 콘텐츠의 인코딩 율에 차이에 따라 On-Off 구간의 패턴이 반복되어 발생하고, 빈번한 Off 구간에 의해서 대역폭이 낭비되는 문제점이 있다. 따라서 본 논문에서는 HTTP 적응적 스트리밍에서 UHD 콘텐츠의 효율적인 대역폭 활용을 위한 세그먼트 전송 기법을 제안한다. 제안하는 기법은 Off 구간의 빈도수를 줄이기 위한 집단 세그먼트 전송 방식과 대역폭 낭비를 최소화 하기 위한 세그먼트 품질 조절기법으로 구성되어 있다.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.5
• /
• pp.103-111
• /
• 2010

This paper proposes an efficient data transmission strategy using adaptive-tier low transmission power schedule in a TDMA-based ad hoc MAC protocol. Since the network resource of ad hoc networks has the characteristic of reassignment due to the multiple interferences and the contention-based limited wireless channel, the efficient time slot assignment and low power transmission scheme are the main research topics in developing ad hoc algorithms. Based on the proposed scheme of interference avoidance when neighbor clusters transmit packets, this paper can minimize the total energy dissipation and maximize the utilization of time slot in each ad hoc node. Simulation demonstrates that the proposed algorithm yields 15.8 % lower energy dissipation and 4.66% higher time slot utilization compared to the ones of two-tier conventional energy dissipation model.