• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.70-80
• /
• 2004

In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the IETF(Internet Engineering Task Force) is considering the deployment of active queue management techniques such as RED(Random Early Detection). But, RED configuration has been a problem since its first proposal. This problem is that proposed configuration is only good for the particular traffic conditions studied, but may have detrimental effects if used in other conditions. While active queue management in routers and gateways can potentially reduce packet loss rates in the Internet, this paper has demonstrated the inherent weakness of current techniques and shows that they are unstable for tile various traffic conditions. The inherent problem with these queue management algorithms is that they all use static parameter setting. In this paper, in order to solve this problem, a new active queue management algorithm called SQM(Stabilized Queue Management) is proposed. This paper shows that it is easy to parameterize SQM algorithm to perform well under different congestion scenarios. This algorithm can effectively reduce packet loss while maintaining high link utilizations and is good for the various traffic conditions.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.14 no.4
• /
• pp.897-905
• /
• 1994

Project Informations Classification System (PICS) can be utilized as a springboard for advanced construction management techniques because it marries informations to networks and maintains a disciplined cost control. The present study attempts to develop a PICS which can be applied in construction management techniques. The frame work largely consists of the three parts such as: (i) development of the tentative Work Breakdown Structure with three divisions, facility calssifications, functional classifications and work classifications, covering the whole areas of civil works, (ii) development of the integrated informations system including the other informations in cost estimating and network scheduling, (iii) construction of relational database system for computer application. The system suggested in the study is found useful for the systematic and uniform management of construction works in the various stages.

• Journal of the Korea Society for Simulation
• /
• v.15 no.3
• /
• pp.1-9
• /
• 2006

As an effective solution to resolve complex computing problems and to handle geographically dispersed data sets, grid computing has been noticed. Grid computing separates an application to several parts and executes on heterogeneous computing platforms simultaneously. The most important problem in grid computing environments is to manage grid resources and to schedule grid resources. This paper proposes a grid transaction network model that is applicable for resource management and scheduling in grid computing environment and presents a grid resource bidding algorithm for grid users and grid resource providers. Using DEVSJAVA modeling and simulation, this paper evaluates usefulness and efficiency of the proposed model.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.21 no.11
• /
• pp.1311-1317
• /
• 2010

In this paper, for a uplink space division multiple access system named cooperative spatial multiplexing(CSM), radio resource management(RRM) algorithms are proposed based on sharing uplink channel information among a serving base station(BS) and interfering BSs in a uplink coordinated wireless communication system. A constrained maximum transmit power algorithm is proposed for mobile station(MS) to limit uplink inter-cell interference(ICI). And joint scheduling algorithm among coordinated BSs is proposed to enhance uplink capacity through ICI mitigation by using channel information from interfering BSs. It is shown that the proposed RRM algorithm provides a considerable uplink capacity enhancement by effective ICI mitigation only with moderate complexity.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.139-142
• /
• 2000

Excessive inventories result from poor scheduling, planning, and controls, and the converse is also same. With adequate inventories, supplies can transport products to customers in time without excessive delivering cost. So efficient inventory control is vital for successful logistics management operation. In terms of mass discount retailers such as Wal-Mart, Carrefour, E-Mart, and so on, they require the high-quality services such as a small-amount and a high-frequency delivery because of having small warehouse and wanting possess much more various goods. In the opposite, manufactures ask mass discount retailer to delivery more lots of goods because of reducing the number of deliveries. It goes without saying that both wish to prevent stockout(lack of inventories). Usually, mass discount retailers have the power more than manufactures. This paper proposed how to manage inventory and how many to order in view of the TPLC and supplier. We considered the economic order quantity models for multiple items so as to prevent urgent deliveries as possible as. And the tradeoff stockout costs and delivering costs.

• Management Science and Financial Engineering
• /
• v.22 no.1
• /
• pp.5-12
• /
• 2016

We consider a time-cost tradeoff problem with multiple milestones under a chain precedence graph. In the problem, some penalty occurs unless a milestone is completed before its appointed date. This can be avoided through compressing the processing time of the jobs with additional costs. We describe the compression cost as the convex or the concave function. The objective is to minimize the sum of the total penalty cost and the total compression cost. It has been known that the problems with the concave and the convex cost functions for the compression are NP-hard and polynomially solvable, respectively. Thus, we consider the special cases such that the cost functions or maximal compression amounts of each job are identical. When the cost functions are convex, we show that the problem with the identical costs functions can be solved in strongly polynomial time. When the cost functions are concave, we show that the problem remains NP-hard even if the cost functions are identical, and develop the strongly polynomial approach for the case with the identical maximal compression amounts.

• Management Science and Financial Engineering
• /
• v.17 no.1
• /
• pp.79-94
• /
• 2011

Team orienteering, an extension of single-competitor orienteering, is the problem of determining multiple paths from a starting node to a finishing node for a given allowed time or distance limit fixed for each of the paths with the objective of maximizing the total collected score. Each path is through a subset of nodes, each of which has an associated score. The team orienteering problem has many applications such as home fuel delivery, college football players recruiting, service technicians scheduling, military operations, etc. Unlike existing optimal and heuristic algorithms often leading to heavy computation, this paper suggests two types of priority rule based heuristics-serial and parallel ones-that are especially suitable for practically large-sized problems. In the proposed heuristics, all nodes are listed in an order using a priority rule and then the paths are constructed according to this order. To show the performances of the heuristics, computational experiments were done on the small-to-medium sized benchmark instances and randomly generated large sized test instances, and the results show that some of the heuristics give reasonable quality solutions within very short computation time.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• autumn
• /
• pp.257-260
• /
• 2001

Buffers, on which much research is being done, are being used as a means to alleviate impacts in processes. Impacts occur from variation which is caused by uncertainty. Current buffers just accept variation as it comes and have just been used as a means to reduce impact. The purpose of this research try to understand the assorted variations which arise from limited resources and information and then we present a division of buffers as the way to overcome these variations. Through the process of dividing buffers into screening buffers, pulling buffers, shielding buffers, and working buffers, we try to make the process more compact, eliminate unnecessary reduction, speed up the decision making process by excluding excessive information, and improve the reliability of work.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.64 no.3
• /
• pp.393-398
• /
• 2015

City or Community-scale Energy Management System(CEMS) is used to reduce the total energy consumed in the city by arranging the energy resources efficiently at the planning stage and controlling them economically at the operating stage. Of the operational functions of the CEMS, generation forecasting of renewable energy resources is an essential feature for the effective supply scheduling. This is because it can develop daily operating schedules of controllable generators in the city (e.g. diesel turbine, micro-gas turbine, ESS, CHP and so on) in order to minimize the inflow of the external power supply system, considering the amount of power generated by the uncontrollable renewable energy resources. This paper is written to introduce numerical models for photo-voltaic power generation prediction based on the weather forecasting information. Unlike the conventional methods using the average radiation or average utilization rate, the proposed models are developed for CEMS applications using the realtime weather forecast information provided by the National Weather Service.

• IE interfaces
• /
• v.10 no.3
• /
• pp.75-93
• /
• 1997

Unlike individual applications, it is extremely hard to obtain user requirements for group systems, since there exists very complicated dynamics in group. This may result in spreading a great amount of products with a broad range of contents. Thus, this study presents a comparative analysis of groupware products. As a result, these products have been categorized into three areas which include cooperation/document management systems, collaborative writing systems, and decision-making/meeting systems. While the systems reviewed here focus on the cooperation/document management systems, the other two areas will be dealt in details in part Ⅱ. The first area ends up with two large categories such as proprietary groupware products and intranet groupware products. However, it has been observed that there is a natural convergence between these two categories. Consequently, the comparative analysis has been performed in terms of functions provided on the two categories and a combined category. Each group of the functions has been divided into three parts which consist of basic functions, quasi-basic functions, and others. Such a decision has been made based on the frequency rate of the functions provided in the products. With a more strict rule, the basic functions comprise electronic mail, sanction, bulletin board, document management, scheduling, security, Web browser, and Internet connectivity. This study also provides a framework for integrated functional model of groupware systems. The basic functions are merged into the model. However, the model is so flexible that it can partially include the quasi-functions in addition to the basic functions. In the future, it is expected that a large number of products will stem from the modification of the functional model.