• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.29 no.11
• /
• pp.592-604
• /
• 2017

A chiller, having a thermal storage system, can contribute to load-leveling and can reduce the cost of electricity by using electricity at night. In this study, the control experiments and simulations are conducted using both conventional and advanced methods for the building cooling system. Advanced approaches, such as the "region control method", divide the control region into five zones according to the size of the building load, and determines the cooling capacities of the chiller and thermal storage. On the other hand, the "dynamic programming method" obtains the optimal cooling capacities of the chiller and thermal storage by selecting the minimum-cost path by carrying out repetitive calculations. The "thermal storage priority method" shows an inferior chiller performance owing to the low-part load operation, whereas the chiller priority method leads to a high electric cost owing to the low utilization of thermal storage and electricity at night. It has been proven that the advanced control methods have advantages over the conventional methods in terms of electricity consumption, as well as cost-effectiveness. According to the simulation results during the winter season, the electric cost when using the dynamic programming method was 6.5% and 8.9% lower than that of the chiller priority and the thermal storage priority methods, respectively. It is therefore concluded that the cost of electricity utilizing the region control method is comparable to that of the dynamic programming method.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11S
• /
• pp.3251-3259
• /
• 1999

In this paper, we present a new mechanism applying more strict priority than RIO mechanism proposed as a drop precedence policy of AF classes in differentiated services. In this mechanism, applying strict priority to drop precedence policy, we get better performance on priority level. Simulation results indicate that the proposed mechanism may provide more efficient and more strict priority transmissions as compared to RIO regardless of traffic load.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1113-1116
• /
• 2002

For contents delivery systems, the service is considered in which the utility depends on each priority class. This paper deals with the multiple priority class of the contents delivery system from the viewpoint of the utility. The willingness to pay (WTP) is introduced as a measure of utility, and the optimum condition is analyzed to maximize the total user's utility. For the system with multiple priority classes, the optimum condition is given in terms of the traffic load, wating time for service for each priority class. Systems with the priority classes, 1, 2 and 3 are analyzed, and the effect of the number of priority classes is examined.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.11
• /
• pp.1-13
• /
• 1992

In this DQDB networks, erasure nodes may be allocated on the bus and release slots which already had been read by destination nodes. An important function of the erasure node must be to eliminate as many requests as erased slots used by downstream nodes. In the networks with priorities, following two additional issues must be solved : (1) accurately to guess for which priority the erased slots is to be used, and (2) to find in a short period a request of that priority to cancel. In this paper, we propose two erasure node algorithms based on elimination of the requests. In these algorithms, the requests are eliminated excessively at low load but optimum elimination can be achieved at full load. Simulation results show that these two algorithms have similar access delay to that of existing algorithms at low load and better performance at high load.

• Proceedings of the KIEE Conference
• /
• 1992.07a
• /
• pp.161-164
• /
• 1992

In operation of power systems, operators must solve overloads in abnormal conditions instantaneously for restoring the power system to normal state. Earlier works proposed the power flow distribution and the load shedding decision, developed by the expert system, for settling overloads. This paper presents a method for solving special conditions in the earlier works which requires less amount of loads than that of the load shedding, in particular, of the load shedding considering the priority. This paper uses the effort system to improve the ability of a beginner as well as of trained operators for operating the power system during emergency operation. To prove efficiency of the proposed method, this paper has adopted the model system with 13 bus for obtaining simulation results and used the prolog language to implement the system.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.136-144
• /
• 2003

In this paper, we propose a scheme that can control the loss probability of low priority class bursts by dynamically adjusting the assembly threshold of low priority class. The key ideas is that the loss Probability of the longer burst increases as the load increases, thus reduced low priority class burst length decreases the loss priority at high traffic load. To achieve this aim, we first derive the relation among the loss probability, the assembly threshold, and the traffic load. In this paper we derive the relation by curve fitting on the simulation results. The ingress edge routers periodically or by event-driven receives the proper corresponding assembly threshold information from the core routers. This assembly threshold is calculated from the derived relation so that the required loss probability of the low priority class bursts in the network is satisfied. The simulation results show that the proposed scheme performs well to meet the loss probability target as expected.

• Journal of Korea Multimedia Society
• /
• v.23 no.2
• /
• pp.247-254
• /
• 2020

The recent Internet environment is characterized by the explosion of certain types of data, as the data that people want is affected by certain issues. In this paper, we propose a load balancing technique that considers the data generation forms. The concept of this technique is to prioritize some type of data when it suddenly explodes. This is a technique to build an add-on middle box on a switch to monitor packets and give priority to a queue for load balancing. This technique worked when certain types of data exploded. SDN(Software Defined Networking) has the advantage of efficiently managing a number of network equipment. However, load balancing in the SDN environment has not been studied much. Applying the proposed load balancing technique in the SDN environment can save time and budget and easily implement our policies. When the proposed load balancing technique is applied to the SDN environment, it has been found that the techniques we want can be easily applied to the network systems, and that efficient data processing is possible when certain types of data explosion.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.237-252
• /
• 2017

In recent years, data centers have become the core infrastructure to deal with big data processing. For these big data applications, network transmission has become one of the most important factors affecting the performance. In order to improve network utilization and reduce job completion time, in this paper, by real-time monitoring from the application layer, we propose job-aware priority scheduling. Our approach takes the correlations of flows in the same job into account, and flows in the same job are assigned the same priority. Therefore, we expect that flows in the same job finish their transmissions at about the same time, avoiding lagging flows. To achieve load balancing, two approaches (Flow-based and Spray) using ECMP (Equal-Cost multi-path routing) are presented. We implemented our scheme using NS-2 simulator. In our evaluations, we emulate real network environment by setting background traffic, scheduling delay and link failures. The experimental results show that our approach can enhance the Hadoop job execution efficiency of the shuffle stage, significantly reduce the network transmission time of the highest priority job.

• Proceedings of the KIEE Conference
• /
• 1993.07a
• /
• pp.70-72
• /
• 1993

This paper presents an expert system that sheds loads considering priority in the localized SCADA power systems during an emergency states. The proposed algorithm uses neural networks to detect local load shedding location and heuristic rules to determine load shedding amounts. The proposed expert system is demonatrated at one of the model system which incorporates two localized SCADA power system. It is operated under workstation.

• ETRI Journal
• /
• v.39 no.4
• /
• pp.558-569
• /
• 2017

In this study, a non-preemptive M/G/1 queueing model of a spectrum handoff scheme for cognitive wireless networks is proposed. Because spectrum handoff gives secondary users an opportunity to carry on their transmissions, it is crucially important to determine the actions of primary users. In our queueing model, prioritized data traffic is utilized to meet the requirements of the secondary users. These users' packets are categorized into three different priority classes: urgent, real-time, and non-real time. Urgent data packets have the highest priority, while non-real time data packets have the lowest priority. Riverbed (OPNET) Modeler simulation software was used to simulate both reactive and proactive decision spectrum handoff schemes. The simulation results were consistent with the analytical results obtained under different load and traffic conditions. This study also revealed that the cumulative number of handoffs can be drastically decreased by exploiting priority classes and utilizing a decent spectrum handoff strategy, such as a reactive or proactive decision-based strategy.