• 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 Korean Society of Industrial and Systems Engineering
• /
• v.22 no.50
• /
• pp.23-32
• /
• 1999

Reliability and maintainability allocation in the analysis of the system's design, with the objective of planning and installing the individual components in such a way that the system performance is achieved. This paper has been made to solve an important task in reliability management of manufacturing systems within the general objective being to increase productivity while maintaining costs low. Thus, the purpose of this paper is to provide an analytical approach to determine an optimal reliability and maintainability allocation, trading off among system performance and parts investment costs. Two important considerations will be addressed in this regard : (ⅰ) determine the reliability and maintainability allocation of parts which maximizes a given production index, having fixed the total cost of investments ; and (ⅱ) determine the reliability and maintainability allocation which minimizes the total cost of investments, having fixed a minimum acceptable level of productivity. The procedure proposed in this paper is able to provide to managers and designers useful indications on the reliability and maintainability characteristics of parts in series -parallel systems. And this heuristic model is a decision support tool for contractors who are involved in large scale design projects such as ship and aircraft design. Numerical examples prove that an approximate expression of the average throughput rate is sufficiently accurate to be used in a numerical optimization method.

• Journal of Korea Port Economic Association
• /
• v.24 no.3
• /
• pp.23-35
• /
• 2008

The purpose of this paper is to suggest a rational cost allocation method that is efficient and fair. Cost allocation by taking cooperative game theory shows fair allocation considering marginal cost by ship type. Current berth occupancy charging method can not recover quay construction costs. Because it levies charges according to berthing time and tonnage of ships without considering the recovery of quay construction costs. And there are also cross subsidies among ships. This paper suggests the cost allocation method of cooperative game theory as a fair and efficient method.

• Journal of Korea Society of Industrial Information Systems
• /
• v.20 no.4
• /
• pp.111-126
• /
• 2015

Currently, many enterprises are trying to allocate the investment costs and risks through collaboration, and strengthen their competitiveness by sharing their resources and gains. Intercorporate sharing economy, a type of intercorporate collaboration, refers to the economic activity to share the idle resources of enterprises and enhance their efficiency. For a successful intercorporate economy with the participation of various stakeholders, there is a need to establish the clear allocation method of gains. Accordingly, this study suggested three methods-the MST method that can apply transaction cost incurred when forming a coalition for sharing economy; the average of transaction cost incurred by each participant, and the Shapley Value application method for the transaction cost incurred between the participants. In addition, this study also suggested gain allocation methods such as the "Equal distribution of gain" method, a gain allocation method based on the Cooperative Game Theory, the the "Proportional distribution of gain" method, and the Shapley Value method that takes in consideration the transaction costs.

• Journal of the Korea Society for Simulation
• /
• v.23 no.4
• /
• pp.51-64
• /
• 2014

Small and medium Enterprises (SMEs), which have a manufacturing method of small quantity batch production produce goods using a general-purpose equipment and attached auxiliary tools. Many previous studies have focused on finding the effective resource allocations for improving the firms' productivity. It is very important for SMEs to keep costs low in assigning jobs to each resource, because they should meet the future uncertain demand of consumers under the limited budget. Using the concept of salvage cost, this paper proposes how to effectively allocate the tasks to main resources in the production process. The salvage cost is defined that purchasing cost minus decrease in value by workload, the method considering this is expected to reduce total purchasing costs during business period. To validate the effect of the proposed method, we proceed the real case study targeting on S company, PCB manufacturer to compare purchase amounts and its costs between the allocation proposed based salvage cost and current allocation method of current S company. As a results, In short-term (3 year) business period, salvage allocation have remarkable superior outcome to existing method, but gradually have cancelled out the effects in long-term (8 year) plans. Unlike the cycle allocation method, there exists the idle-equipments in allocation based salvage value. we additionally analyze the profits with respect to rental strategy of them during business period.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.8
• /
• pp.1825-1842
• /
• 2013

Rapid growth of the IT industry has led to significant energy consumption in the last decade. Data centers swallow an enormous amount of electrical energy and have high operating costs and carbon dioxide excretions. In response to this, the dynamic consolidation of virtual machines (VMs) allows for efficient resource management and reduces power consumption through the live migration of VMs in the hosts. Moreover, each client typically has a service level agreement (SLA), this leads to stipulations in dealing with energy-performance trade-offs, as aggressive consolidation may lead to performance degradation beyond the negotiation. In this paper we propose a heuristic based resource allocation of VM selection and a VM allocation approach that aims to minimize the total energy consumption and operating costs while meeting the client-level SLA. Our experiment results demonstrate significant enhancements in cloud providers' profit and energy savings while improving the SLA at a certain level.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1998.10a
• /
• pp.731-740
• /
• 1998

This paper discusses a brcriterion approachto sequencing with time/cost trade-offs. The first problem is to minimize the total flow time and the maximum tardiness. And second is to the maximum tardiness and resource allocation costs. This approach , which produces an efficient frontier of possible schedules, has the advantage that it does not require the sequencing criteria to be measurable in the same units as the resource allocation cost. The basic single machine model is used to treat a class of problems in which the sequencing objective is to minimize the maximum completion penalty. It is further assumed that resource allocation costs can be represented by linear time/cost function.

• Journal of Korea Society of Industrial Information Systems
• /
• v.4 no.2
• /
• pp.81-87
• /
• 1999

This paper discusses a bicriterion approach to sequencing with time/cost trade-offs. The first problem is to minimize the total flow time and the maximum tardiness. And second is to the maximum tardiness and resource allocation costs. This approach, which produces an efficient flintier of possible schedules, has the advantage that it does not require the sequencing criteria to be measurable in the same units as the m allocation cost. The basic single machine model is used to treat a class of problems in which the sequencing objective is to minimize the maximum completion penalty. It is further assumed that resource allocation costs can be represented by linear time/cost function.

• Journal of Arbitration Studies
• /
• v.31 no.4
• /
• pp.3-27
• /
• 2021

Recent Discussions on Third-Party Funding (TPF) in the forums of UNCITRAL, ICSID, and ICC are making different levels of progress towards finalizing the rules. However, they also have similarities in dealing with legal issues related to TPF, such as definitions, disclosure, allocation of costs, and security for costs. International treaty tribunals have dealt with TPF issues, too. When it comes to the standing of funded claimants, the tribunal in Ambiente v. Argentina did not accept the argument that claimants were controlled by the TPF provider. Concerning the scope of the disclosure, the tribunal in Tennant v. Canada ordered the disclosure of the TPF arrangement. As for the allocation of costs, the tribunal in Kardassopoulos v. Georgia noted that there is no reason why a TPF agreement should be treated differently than an insurance contract. Regarding the security for costs, the tribunal in South American Silver v. Bolivia considered the mere existence of a third-party funder as not an exclusive factor to determine costs in the earlier stage of the proceedings. Lastly, relating to TPF as a ground for annulment, the tribunal in Teinver v. Argentina declined the respondent's argument that the TPF agreement was the vehicle of fraud.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.11a
• /
• pp.305-308
• /
• 2003

It is widely used that a network termination rate is calculated by using a Long Run Incremental Costing model. Interconnection Order issued Ministry of Information and Communication in Korea on December 2002 has declared that termination charges of local, national, payphone, and mobile calls are going to be determined by LRIC costing models after 2004. There are lots of preceding researches on a fixed network costing model for applying to LRIC method but on a mobile network not pretty much of them. Besides, Most important basis of current calculation models for termination charges are access costs to connect subscribers to network such as a local loop. In this paper, we look into being of access costs in mobile network and show the applicable standards for cost allocation of access costs in implementing LRIC costing model.