• ETRI Journal
• /
• v.45 no.4
• /
• pp.627-635
• /
• 2023

In vehicular edge computing (VEC) networks, the rapid expansion of intelligent transportation and the corresponding enormous numbers of tasks bring stringent requirements on timely task offloading. However, many tasks typically appear within a short period rather than arriving simultaneously, which makes it difficult to realize effective and efficient resource scheduling. In addition, some key information about tasks could be learned due to the regular data collection and uploading processes of sensors, which may contribute to developing effective offloading strategies. Thus, in this paper, we propose a model that considers the deterministic demand of multiple tasks. It is possible to generate effective resource reservations or early preparation decisions in offloading strategies if some feature information of the deterministic demand can be obtained in advance. We formulate our scenario as a 0-1 programming problem to minimize the average delay of tasks and transform it into a convex form. Finally, we proposed an efficient optimal offloading algorithm that uses the interior point method. Simulation results demonstrate that the proposed algorithm has great advantages in optimizing offloading utility.

• Proceedings of the KIEE Conference
• /
• 2005.07a
• /
• pp.804-806
• /
• 2005

In this paper, a new probabilistic generation modeling method which can address the characteristics of changed electricity industry is proposed. The major contribution of this paper can be captured in the development of a probabilistic generation modeling considering generator maintenance outage and in the classification of market demand into multiple demand clusters for the applications to electricity markets. Conventional forced outage rates of generators are conceptually combined with maintenance outage of generators and, consequently, effective outage rates of generators are new iy defined in order to properly address the probabilistic characteristic of generation in electricity markets. Then, original market demands are classified into several distinct demand clusters, which are defined by the effective outage rates of generators and by the inherent characteristic of the original demand. We have found that generators have different effective outage rates values at each classified demand cluster, depending on the market situation. From this, therefore, it can be seen that electricity markets can also be classified into several groups which show similar patterns and that the fundamental characteristics of power systems can be more efficiently analyzed in electricity markets perspectives, for this classification can be widely applicable to other technical problems in power systems such as generation scheduling, power flow analysis, price forecasts, and so on.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.62 no.1
• /
• pp.21-28
• /
• 2013

The paper proposes an optimal sizing method of a customer's battery energy storage system (BESS) which aims at managing the electricity demand of the customer to minimize electricity cost under the time of use(TOU) pricing. Peak load limit of the customer and charging and discharging schedules of the BESS are optimized on annual basis to minimize annual electricity cost, which consists of peak load related basic cost and actual usage cost. The optimal scheduling is used to assess the maximum cost savings for all sets of candidate capacities of BESS. An optimal size of BESS is determined from the cost saving curves via capacity of BESS. Case study uses real data from an apartment-type factory customer and shows how the proposed method can be employed to optimally design the size of BESS for customer demand management.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2A
• /
• pp.55-62
• /
• 2003

This paper proposes an efficient and differentiated MAC scheduling algorithm for Bluetooth systems. The proposed algorithm guarantees QoS (Quality of Service) requirement of each master-slave pair or application. Conventional MAC scheduling algorithms for Bluetooth take priority of each pair into consideration and demonstrate relatively reasonable performance. However, their performances may depend on traffic characteristic, or they are limited by overheads for signaling. In this paper, we propose a new MAC scheduling algorithm superior to the conventional algorithms from the viewpoints of throughput, delay, and supporting QoS. Our proposed algorithm is evaluated via computer simulations under various environments and compared with the conventional scheduling algorithms. Simulation results indicate that the proposed algorithm shows better performance than the existing algorithms, and can support the QoS demand of each pair.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.6
• /
• pp.1892-1912
• /
• 2022

With the massive demand and growth of cloud computing, virtualization plays an important role in providing services to end-users efficiently. However, with the increase in services over Cloud Computing, it is becoming more challenging to manage and run multiple Virtual Machines (VMs) in Cloud Computing because of excessive power consumption. It is thus important to overcome these challenges by adopting an efficient technique to manage and monitor the status of VMs in a cloud environment. Reduction of power/energy consumption can be done by managing VMs more effectively in the datacenters of the cloud environment by switching between the active and inactive states of a VM. As a result, energy consumption reduces carbon emissions, leading to green cloud computing. The proposed Efficient Dynamic VM Scheduling approach minimizes Service Level Agreement (SLA) violations and manages VM migration by lowering the energy consumption effectively along with the balanced load. In the proposed work, VM Scheduling for Efficient Dynamically Migrated VM (VMS-EDMVM) approach first detects the over-utilized host using the Modified Weighted Linear Regression (MWLR) algorithm and along with the dynamic utilization model for an underutilized host. Maximum Power Reduction and Reduced Time (MPRRT) approach has been developed for the VM selection followed by a two-phase Best-Fit CPU, BW (BFCB) VM Scheduling mechanism which is simulated in CloudSim based on the adaptive utilization threshold base. The proposed work achieved a Power consumption of 108.45 kWh, and the total SLA violation was 0.1%. The VM migration count was reduced to 2,202 times, revealing better performance as compared to other methods mentioned in this paper.

• The Journal of Korean Association of Computer Education
• /
• v.7 no.1
• /
• pp.97-106
• /
• 2004

Recently, the demand for the customized courseware which is required from the learners is increased. Therefore the needs of the efficient and automated education agents in the web-based instruction are recognized. In this paper we propose a multi-agent system for course scheduling of learner-oriented using weakness analysis algorithm. At first proposed system analyze learner's result of evaluation and calculates learning accomplishment. From this accomplishment the multi-agent schedules the suitable course for the learner. The learner achieves an active and complete learning from the repeated and suitable course.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.5
• /
• pp.967-973
• /
• 2009

Recently, as 3rd-generation mobile communication services using high-speed data rate system are widely employed, the demand for a variety of real-time data services such as VoIP service are also increased. Unlike typical data packets, VoIP packets have delay bound and low loss rate requirement. In this paper we propose a new scheduling algorithm that schedule two deferent kinds of packets efficiently, considering the characteristics of VoIP. Basically this algorithm considers both time delay and channel condition and gives priority depending on the time delay. Simulation results show that the proposed algorithm works more efficiently than conventional algorithms.

• Journal of Korean Institute of Industrial Engineers
• /
• v.41 no.5
• /
• pp.414-424
• /
• 2015

In this research, we consider a smart grid network of electricity with multiple consumers connected to a monopolistic provider. Each consumer can be informed the real time price changes through the smart meter and updates his consumption schedule to minimize the energy consumption expenditures by which the required power demand should be satisfied under the given real time pricing scheme. This real-time decision making problem has been recently studied through game-theoretic approach. The present paper contributes to the existing literature by incorporating storage appliance into the set of available household appliances which has somewhat distinctive functions compared to other types of appliances and would be regarded to play a significant role in energy consumption scheduling for the future smart grid. We propose a game-theoretic algorithm which could draw the optimal energy consumption scheduling for each household appliances including storage. Results on simulation data showed that the storage contributed to increase the efficiency of energy consumption pattern in the viewpoint of not only individual consumer but also whole system.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.2
• /
• pp.305-314
• /
• 2017

Most of the existing researches on systemwide optimization of generator maintenance scheduling do not consider the equivalent operating hours(EOHs) mainly due to the difficulties of calculating the EOHs of the CCGTs in the large scale system. In order to estimate the EOHs not only the operating hours but also the number of start-up/shutdown during the planning period should be estimated, which requires the mathematical model to incorporate the economic dispatch model and unit commitment model. The model is inherently modelled as a large scale mixed-integer nonlinear programming problem and the computation time increases exponentially and intractable as the system size grows. To make the problem tractable, this paper proposes an EOH calculation based on demand grouping by K-means clustering algorithm. Network congestion is also considered in order to improve the accuracy of EOH calculation. This proposed method is applied to the actual Korean electricity market and compared to other existing methods.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.3
• /
• pp.373-380
• /
• 2007

In this paper, we consider a new lot-sizing and scheduling problem (LSSP) that minimizes the sum of production cost, setup cost and inventory cost. Setup carry-over and overlapping as well as demand splitting are considered. Also, maximum number of setups for each time period is not limited. For this LSSP, we have formulated a mixed integer programming (MIP) model, of which the size does not increase even if we divide a time period into a number of micro time periods. Also, we have developed an efficient heuristic algorithm by combining decomposition scheme with local search procedure. Test results show that the developed heuristic algorithm finds good quality (in practice, even better) feasible solutions using far less computation time compared with the CPLEX, a competitive MIP solver.