• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.4
• /
• pp.571-579
• /
• 1990

A dynamic relocation algorithm for non-deterministic process graph in distributed computer systems is proposed. A method is represented for determining the optimal policy for processing a process tree. A general database query request is modelled by a process tree which represent a set of subprocesses together with their precedence relationship. The process allocation model is based on operating cost which is a function fo selection of site for processing operation, data reduction function and file size. By using expected values of parameters for non-deterministic process tree, the process graph and optimal policy that yield minimum operating cost are determined. As process is relocated according to threshold value and new information of parameters after the execution of low level process for non-deterministic process graph, the assigned state that approximate to optiaml solution is obtained. The proposed algorihtm is heuristic By performing algorithm for sample problems, it is shown that the proposed algorithm is good in obtaining optimal solution.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.47
• /
• pp.277-288
• /
• 1998

In this paper, checking out a various problems in the accounting and the allocation of the common cost in the management of apartment in order to find out the right way of the management, I have tried to build a standard management system for the apartment and study the effect expected by the computerizing. To develop the software to computerize the management of the apartment, which is the main task of this paper, I have checked out a various problems and then computerized a standard system to better the unreliable management and somewhat doubtful accounting process and correct the inaccuracy in the allocation of the common cost.

• ETRI Journal
• /
• v.37 no.4
• /
• pp.685-695
• /
• 2015

This paper proposes a novel video delivery scheme that reduces the bandwidth consumption cost from a video server to terminals in Long-Term Evolution networks. This proposed scheme combines optimized hybrid multicast with a segment-based caching strategy for use in environments where the maximum number of multicast channels is limited. The optimized hybrid multicast, allocation of multicast channels, and cache allocation are determined on the basis of a video's request rate, the related video's length, and the variable cost per unit size of a segment belonging to the related video. Performance evaluation results show that the proposed scheme reduces a video's delivery costs. This work is applicable to on-demand TV services that feature asynchronous video content requests.

• Proceedings of the KIEE Conference
• /
• 2001.11b
• /
• pp.424-428
• /
• 2001

The methodologies of power transmission pricing are normally divided into two categories such as marginal cost method and embedded cost allocation method. This paper, first, discusses the possible problems that can occur when the marginal cost method is applied to pricing the transmission services. Next, the paper proposes a method to apply the power flow tracing to the transmission network charge. The result of the power flow tracing method is then used in MW-mile method to charge individual loads for the use of transmission network. Effectiveness of the algorithm is verified by computer simulations.

• International conference on construction engineering and project management
• /
• 2009.05a
• /
• pp.1100-1106
• /
• 2009

General contractors' overhead costs are increasing relative to direct costs. However, it is difficult to apply the traditional activity-based costing directly to the construction site overhead costing because the resource consumption rate per each activity is varied depending on the attributes of activities. The research develops a methodology of hybrid cost allocation system when resources are assigned to cost objects unlike the traditional activity-based costing. The study also develops a database program and demonstrates how it can be applied to the construction projects using a case study.

• Korean Journal of Construction Engineering and Management
• /
• v.8 no.1 s.35
• /
• pp.87-95
• /
• 2007

If construction process operate composing work team by judgment manager's experience, possibility that progress of construction process becomes as inefficient is much. But, If produce optimal proposal of resources allocation, construction cost and duration through simulation at work plan step, work schedule because do quantification efficient operate do on. When plan construction process in this research, resources allocation by change of work team operation change, resources cost loss, total cost, optimal proposal of construction duration tentative plan of numerical formula model that can do simulation propose. Apply and revealed to apartment house framework which horizontal work area of process and vertical work area are composed as is each different construction process to verify proposed numerical formula model. Achieved efficiency than work team's operation results which apply numerical formula model that is presented in this research and enforce simulation is applied in actuality example construction.

• Journal of the Korea Computer Industry Society
• /
• v.7 no.4
• /
• pp.299-308
• /
• 2006

Recently, A method of using the replicated database on a server to get new data without mis sing any information has been being studied in mobile computing environment. So far we ha ye used the Static Replica Allocation(SRA) for the replication which is the method of the replication on the server. This method is to replicate the data on the replica server after $\underline{a}$ moving host is transferred to a cell. Since the network of the SRA is very good, and if there are few moving users, no trouble will happen. But if there is no moving users in a cell, the data will not be shared. Therefore, this paper is about the study of the method of relocation after replicating the data to the cells for the users(User Select Replica Allocation : USRA). We also analyze the access rate and the possibility which are closely related to the moving frequency of the mobile hosts and the numbers of the cells. As a result, We show that the 5% lower access cost and the $2%\sim2.5%$ gains are achieved from the low mobility of the mobile hosts. We also show that t he extension function of USRA reduces the cost by 1.7% and it is influenced by the numbers of the cells.

• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.3
• /
• pp.158-167
• /
• 2017

Internet-based social and interactive video applications have become major constituents of the envisaged applications for next-generation multimedia networks. However, inherently dynamic network conditions, together with varying user expectations, pose many challenges for resource allocation mechanisms for such applications. Yet, in addition to addressing these challenges, service providers must also consider how to mitigate their operational costs (e.g., energy costs, equipment costs) while satisfying the end-user quality of service (QoS) expectations. This paper proposes a heuristic solution to the problem, where the energy incurred by the applications, and the monetary costs associated with the service infrastructure, are minimized while simultaneously maximizing the average end-user QoS. We evaluate the performance of the proposed solution in terms of serving probability, i.e., the likelihood of being able to allocate resources to groups of users, the computation time of the resource allocation process, and the adaptability and sensitivity to dynamic network conditions. The proposed method demonstrates improvements in serving probability of up to 27%, in comparison with greedy resource allocation schemes, and a several-orders-of-magnitude reduction in computation time, compared to the linear programming approach, which significantly reduces the service-interrupted user percentage when operating under variable network conditions.

• Journal of Industrial Convergence
• /
• v.17 no.4
• /
• pp.131-137
• /
• 2019

In infrastructure wireless mesh networks (WMNs), in order to improve mobile users' satisfaction for the given cache hit ratio, we investigate an User centric Cache Allocation (UCA) scheme while reducing cache cost in a mesh router (MR) and expected transmission time (ETT) for content search in cache. To minimize ETT values of mobile users, a genetic algorithm based UCA (GA-UCA) scheme is provided. The goal is to maximize mobile users' satisfaction via our well defined utility, which considers content popularity and the number of mobile users. Finally, through solving optimization problem we show the optimal cache can be allocated for UCA and GA-UCA. Besides, a WMN provider can find the optimal number of mobile users for user centric cache allocation in infrastructure WMNs.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.62 no.11
• /
• pp.1511-1519
• /
• 2013

This paper proposes the allocation method for capacitor-reactor banks in a distribution system with dispersed generators to reduce the installation costs, the maintenance costs and minimize the loss of electrical energy. The expected lifetime and maintenance period of devices with moving parts depends on the total number of operations, which affects the replacement and maintenance period for aging equipment under a limited budget. In this paper, the expected device lifetimes and the maintenance period are included in the formulation, and the optimal operation status of the devices is determined using a genetic algorithm. The optimal numbers and locations for capacitor-reactor banks are determined based on the optimal operation status. Simulation results in a 69-bus distribution system with the dispersed generator show that the proposed technique performs better than conventional methods.