• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7B
• /
• pp.1001-1008
• /
• 2010

In this paper, we propose the dynamic spectrum allocation (DSA) algorithm using spectrum sharing method considering the long-term priority between NOs and service classes for the maritime communication system environment where a ship locates at either near shore (or land) or off-shore. It was shown that the proposed algorithm using spectrum sharing with priorities could deliver better satisfaction ratio (SR) than the fixed allocation schemes, in the context of provision of required bandwidth (or spectrum) for each users. Therefore, we conclude that the proposed DSA with priorities could apply to the maritime communication environment and exploit the under-used (or unused, idle) spectrum of terrestrial communication networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.641-649
• /
• 2004

We propose a dynamic traffic management model which uses adaptive priority reassignment algorithm to deliver service differentiation in home networks, and implement adaptive priority reassignment algorithm using FPGA. The proposed architecture is designed to handle home network traffic without the need for signaling protocol. We categorize home network traffic into three kinds of traffic class: control data traffic class, the Internet data and non-real-time data traffic class, and multimedia data traffic class (include non-real-time and real-time multimedia data traffic). To support differential service about these kinds of traffic class, we designed and implemented a traffic management framework that dynamically change each traffic class priority depending on bandwidth utilization of each traffic class.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.12 no.11
• /
• pp.982-993
• /
• 2000

This paper describes an optimal control scheduling of an encapsulated ice storage system with a chiller of nominal chiller 34RT(103,200kcal/hr) and an ice storage tank of 170RT-hrs(514,080 kcal). The optimization technique used in the study is dynamic programing. The objective function is summed cost during a day including charge and discharge periods. Control strategies being used commercially are chiller priority and storage priority control. In chiller priority control, the chiller is allowed to run at full capacity during the day, subject to limitations of the building load, and the ice is only melted when and if the load exceeds the chillers full capacity. In contrast to chiller priority control, the aim in storage priority control is to melt as much as ice as possible during the day time period. The system simulation calculates the operation costs for the three control strategies in the condition of the same cooling load and the same ice storage system. The simulation period is a day, assuming that initially the tank is stored fully and the cooling load is perfectly predicted for the scheduling. Also Final state of the tank is to be charged fully.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.611-616
• /
• 2003

Recently, the HFC-CATV network stand in a substructure of superhighway information network. Because of sharing up to 500 of subscribes, the Collision Resolution Algorithm needs in the upstream channel of HFC-CATV network. In order to provide Quality of Service (QoS) to users with real-time data such as voice, video and interactive service, the research of Collision Resolution Algorithm must include an effective priority scheme. In IEEE 802.14, the Collision Resolution Algorithm has high request delay because of static PNA(Priority New Access) slots structure and different priority traffics with the same probability. In order to resolve this problem, this paper proposed dynamic priority collision resolution algorithm with ternary tree algorithm. It has low request delay according to an increase of traffic load because high priority traffic first resolve and new traffic content with different probability. In the result of the simulation, it demonstrated that the proposed algorithm needs lower request delay than that of ternary tree algorithm with static PNA slots structure.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.2
• /
• pp.268-279
• /
• 1997

In this paper, we show the movable boundary (MB) method is the effective bandwidth allocation strategy for the ABR service among existing bandwidth allocation methods. The MB method can gurantee the QOS requirement according to the service priority and improve bandwidth utilization using the characteristics of the ABR service. The threshold values of the MB, which have an important effect upon connection blocking probability(CBP) performance of each service, are obtained by simulation. The MB method with the fixed thresholds, however, may not have good performance to variation of input traffic parameters. We suggest the dynamic MB method which changes the threshold values adaptively according to the required bandwidth of input traffic. We also show that the dynamic MB method can urantee the CBP performance according to the service priority regardless of variation of input traffic parameters.

• Journal of information and communication convergence engineering
• /
• v.5 no.1
• /
• pp.29-34
• /
• 2007

This paper proposes a MAC protocol for real-time VBR (rt-VBR) services in wireless ATM networks. The proposed protocol is characterized by a contention-based mechanism of the reservation request, a contention-free polling scheme for transferring the dynamic parameters, and a priority scheme of the slot allocation. The design objective of the proposed protocol is to guarantee the real-time constraint of rt-VBR traffic. The scheduling algorithm uses a priority scheme based on the maximum cell transfer delay parameter. The wireless terminal establishes an rt-VBR connection to the base station with a contention-based scheme. The base station scheduler allocates a dynamic parameter minislot to the wireless terminal for transferring the residual lifetime and the number of requesting slots as the dynamic parameters. Based on the received dynamic parameters, the scheduler allocates the uplink slots to the wireless terminal with the most stringent delay requirement. The simulation results show that the proposed protocol can guarantee the delay constraint of rt-VBR services along with its cell loss rate significantly reduced.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.30 no.3
• /
• pp.130-142
• /
• 2018

We use heat pumps with thermal storage system to reduce peak usage of electric power during winters and summers. A heat pump stores thermal energy in a thermal storage tank during the night, to meet load requirements during the day. This system stabilizes the supply and demand of electric power; moreover by utilizing the inexpensive midnight electric power, thus making it cost effective. In this study, we propose a system wherein the thermal storage tank and heat pump are modeled using the TRNSYS, whereas the control simulations are performed by (i) conventional control methods (i.e., thermal storage priority method and heat pump priority method); (ii) region control method, which operates at the optimal part load ratio of the heat pump; (iii) load response control method, which minimizes operating cost responding to load; and (iv) dynamic programming method, which runs the system by following the minimum cost path. We observed that the electricity cost using the region control method, load response control approach, and dynamic programing method was lower compared to using conventional control techniques. According to the annual simulation results, the electricity cost utilizing the load response control method is 43% and 4.4% lower than those obtained by the conventional techniques. We can note that the result related to the power cost was similar to that obtained by the dynamic programming method based on the load prediction. We can, therefore, conclude that the load response control method turned out to be more advantageous when compared to the conventional techniques regarding power consumption and electricity costs.

• Proceedings of the IEEK Conference
• /
• 2003.07b
• /
• pp.959-962
• /
• 2003

At the processing capabilities and operating frequency of embedded system are growing, so is the needed data bandwidth to fully utilize the processing capability. The ability to transfer huge amount of data between the embedded core and external devices is required for efficient system operation. In this paper, the data communication architecture for the mixed-clock system is proposed. The dynamic priority adaptation algorithm for bus arbitration is proposed for bandwidth guarantee. The communication architecture that incorporates the proposed arbitration algorithm adapts the priority of communication components dynamically based on the information from FIFO. The experiments show that the measured bandwidth of each component traces the required bandwidth well compared to the other arbitration algorithms

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.855-869
• /
• 1997

In this paper, we proposed two kids of dynamic priority control mechanisms controlling the cell service ratio in order to improve the QOS(Quality of Service). We also analyse theoretically the characteristics of cell loss probability and mean cell delay time by applying the proposed priority control mechanisms to ATM switch with output buffer. The proposed priority control mechanisms have the same principles of storing cells into buffer but the different principles of serving cells from buffer. The one is the control mechanism controlling the cell service ratio according to the relative cell occupancy ratio of buffer, the other is the control mechanism controlling the cell service ratio according to both the relative cell occupancy ratio of buffer and the average arrival rate. The two service classes of our concern are the delay sensitive class and the loss sensitive class. The analytical results show that the proposed control mechanisms are able to improve the QOS, the characteristics of cell loss probability and mean cell delay time, by selecting properly the relative cell occupancy ratio of buffer and the average arrival rate. conventional DLB algorithm does not support synchronous cells, but the proposed algorithm gives higher priority to synchronous cells. To reduce synchronous cell loss rate, the synchronous cell detector is used in the proposed algorithm. Synchronous cell detector detects synchronous cells, and passes them cells to the 2nd Leaky-Bucket. So it is similar to give higher priority to synchronous cells. In this paper, the proposed algorithm used audio/video traffic modeled by On/Off and Two-state MMPP, and simulated by SLAM II package. As simulation results, the proposed algorithm gets lower synchronous cell loss rate than the conventional DLB algorithms. The improved DLB algorithm for multimedia synchronization can be extended to any other cells which require higher priority.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.2 s.46
• /
• pp.111-121
• /
• 2007

In mobile computing environments, data broadcasting is widely used to resolve the problem of limited power and bandwidth of mobile equipments. However, the previous broadcast scheduling methods can be inefficient in the environment where the user requests change dynamically since they are based on static data requests. Moreover, a high-priority user can wait long for infrequently requested data because they never consider the priority of listeners. In this paper, we propose a new broadcast scheduling method that reflects dynamic changes of user requests using user profiles. It also reflects user priorities to reduce the access time of high-priority users. We evaluate the performance of the proposed method through simulation.