• The KIPS Transactions:PartC
• /
• v.11C no.4
• /
• pp.555-562
• /
• 2004

We consider differentiated bandwidth allocation for a piconet in short-range wireless personal network systems : Bluetooth. Since bandwidth requirements nay vary among applications/services, and/or it may change over time, it is important to decide how to allocate limited resources to various service classes to meet their service requirements. We propose a simple and efficient bandwidth allocation mechanism which meets bandwidth requirements of various service types while saving power consumption by a Power saying mode, i.e., sniff node. We compare our proposed mechanism with a conventional (weighted) round-robin polling scheme and show that it achieves significant improvement of hroughput, delay, and power consumption.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.4
• /
• pp.17-29
• /
• 1999

This paper presents a high level synthesis method targeting low power consumption for data-dominated CMOS circuits (e.g., DSP). The high level synthesis is divided into three basic tasks: scheduling, resource and register allocation. For lower power scheduling, we increase the possibility of reusing an input operand of functional units. For a scheduled data flow graph, a compatibility graph for register and resource allocation is formed, and then a special weighted network is then constructed from the compatibility graph and the minimum cost flow algorithm is performed on the network to obtain the minimum power consumption data path assignment. The formulated problem is then solved optimally in polynomial time. This method reduces both the switching activity and the capacitance in synthesized data path. Experimental results show 15% power reduction in benchmark circuits.

• Journal of Digital Convergence
• /
• v.10 no.4
• /
• pp.251-256
• /
• 2012

In this paper, we addressed the problem of upstream bandwidth in EPONs. We presented a wavelength division EPON supporting QoS in the differentiated services framework. It was shown that the bandwidth allocation by priority scheduling, under our assumptions for traffic behavior, will result in an unexpected behavior for high priority class and we suggested the use of weighted priority scheduling to alleviate this problem. Our wavelength division EPON supporting QoS allocates effectively and fairly bandwidths and wavelengths between ONUs in the differentiated services framework. Moreover, we showed better performance in terms of average and maximum end-to-end delay, as well as network throughput, utilization compared with some other algorithms. We used simulation experiments to study the performance and validate the effectiveness of the proposed network and algorithm.

• Industrial Engineering and Management Systems
• /
• v.4 no.1
• /
• pp.23-35
• /
• 2005

This paper aims to develop a practical finite capacity MRP (FCMRP) system based on the needs of an automotive parts manufacturing company in Thailand. The approach includes a linear goal programming model to determine the optimal start time of each operation to minimize the sum of penalty points incurred by exceeding the goals of total earliness, total tardiness, and average flow-time considering the finite capacity of all work centers and precedence of operations. Important factors of the proposed FCMRP system are penalty weights and dispatching rules. Effects of these factors on the performance measures are statistically analyzed based on a real situation of an auto-part factory. Statistical results show that the dispatching rules and penalty weights have significant effects on the performance measures. The proposed FCMRP system offers a good tradeoff between conflicting performance measures and results in the best weighted average performance measures when compared to conventional forward and forward-backward finite capacity scheduling systems.

• Journal of Korea Multimedia Society
• /
• v.17 no.12
• /
• pp.1453-1460
• /
• 2014

WFQ (Weighted Fair Queuing) provides not only fairness among traffic flows in using bandwidth but also guarantees the Quality of Service (QoS) that individual flow requires, which is why it has been applied to the resource reservation protocol (RSVP)-capable router. The RSVP allocates an enough resource to satisfy both the rate and end-to-end delay requirements of the flow in the condition of no packet loss, and the WFQ scheduler guarantees those QoS requirements with the allocated resource. In practice, however, most QoS-guaranteed services allow a degree of packet loss, especially from 0.1% to 3% for Voice over IP. This paper discovers that the packet loss rate of each traffic flow is determined by only its time-stamp adjustment value, and then enhances the WFQ to provide a differentiated packet loss guarantee under general traffic conditions in terms of both traffic characteristics and QoS requirements. The performance evaluation showed that the proposed WFQ could increase the utilization of bandwidth by 8~11%.

• Journal of Astronomy and Space Sciences
• /
• v.18 no.3
• /
• pp.209-218
• /
• 2001

Global exposure time distribution through all-sky survey, one of main science missions of KAISTSAT-1, has been simulated. Exposure time distribution has its minimum on the celestial equator and increases with moving to polar regions according to the present mission operation scenario. SAA (South Atlantic Anomaly) and the moon can make further decreases of exposure time around the celestial equator Effects of SAA on all-sky survey exposure time can be compensated with a simple observational scheduling, orbit exchange between orbits allocated to all-sky survey passing through the SAA region and ones allocated to upper atmosphere observations not affected by SAA. It, however, seems that present exposure time distribution is not adequate for the concrete study of the evolution of interstellar medium. A scheme for active time allocation is needed for redistribution of exposure times weighted around the celestial poles, and additional studies on the advanced mission operation and the observational scheduling are also needed.

• Journal of the Society of Naval Architects of Korea
• /
• v.54 no.2
• /
• pp.102-112
• /
• 2017

Many studies on dynamic positioning control algorithms using fixed feedback gains have been carried out to improve station keeping performance of dynamically positioned vessels. However, the control algorithms have disadvantages in that it can not cope with changes in environmental disturbances and response characteristics of vessels motion in real time. In this paper, the Fuzzy Gain Scheduling - PID(FGS - PID) control algorithm that can tune PID gains in real time was proposed. The FGS - PID controller that consists of fuzzy system and a PID controller uses weighted values of PID gains from fuzzy system and fixed PID gains from Ziegler - Nichols method to tune final PID gains in real time. Firstly, FGS - PID controller, control allocation algorithm, FPSO and environmental disturbances were modeled using Matlab/Simulink to evaluate station keeping performance of the proposed control algorithm. In addition, simulations that keep positions and a heading angle of vessel with wind, wave, current disturbances were carried out. From simulation results, the FGS - PID controller was confirmed to have better performances of keeping positions and a heading angle and consuming power than those of the PID controller. As a consequence, the proposed FGS - PID controller in this paper was validated to have more effectiveness to keep position and heading angle than that of PID controller.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.4
• /
• pp.238-247
• /
• 2018

This paper considers the problem of scheduling loading and unloading operations of a crane in a railway terminal motivated from rail-road container transshipment operations at Uiwang Inland Container Depot (ICD). Unlike previous studies only considering the total handling time of containers, this paper considers a bi-criteria objective of minimizing the weighted sum of the total handling time and tenant service time. The tenant service time is an important criterion in terms of terminal tenants who are private logistics companies in charge of moving containers from/to the terminal using their trucks. In the rail-road container shipment yard, the tenant service time of a tenant can be defined by a time difference between beginning and finishing loading and unloading operations of a crane. Thus, finding a set of sequences and time of the crane operations becomes a crucial decision issue in the problem. The problem is formulated as a nonlinear program which is improved by linearizing a nonlinear constraint in the model. This paper develops a genetic algorithm to solve the problem and performs a case study on the Uiwang ICD terminal. Computational experiment results show that the genetic algorithm shows better performance than commercial optimization solvers. Operational implications in terms of tenants are drawn through sensitivity analyses.

• ETRI Journal
• /
• v.29 no.3
• /
• pp.329-335
• /
• 2007

This paper considers a timeslot assignment problem in an interactive satellite multimedia (ISM) system with digital video broadcast-return channel via satellite (DVB-RCS). The timeslot assignment problem is formulated as a binary integer programming to maximize the overall weighted throughput and is shown to be NP-hard. Thus, three real-time heuristic algorithms including ratio-based, packet-size (PS)-based, and transmission gain (TG)-based are derived, and some computational experiments are made. Considering the results, the ratio-based heuristic algorithm is demonstrated to be the most effective and efficient. We propose adapting the ratio-based heuristic algorithm to the timeslot assignment problem to greatly improve the ISM system utilization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.12
• /
• pp.2410-2418
• /
• 2015

In this paper, we consider the femto users and their mutual interference as graph elements, nodes and weighted edges, respectively. The total bandwidth is divided into a number of resource blocks (RBs) and these are assigned to the femto user equipment (FUEs) using a graph coloring algorithm. In addition, resources blocks are assigned to the femto users to avoid inter-cell interference. The proposed scheme is compared with the traditional scheduling schemes in terms of throughput and fairness and performance improvement is achieved by exploiting the graph coloring scheme.