• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.1
• /
• pp.238-256
• /
• 2016

Modern web services have been broadly deployed on the Internet. Most of these services use multi-tier architecture for flexible scaling and software reusability. However, managing the performance of multi-tier web services under dynamic and unpredictable workload, and different resource demands in each tier is a critical problem for a service provider. When offering quality of service assurance with least resource usage costs, web service providers should adopt self-adaptive resource provisioning in each tier. Recently, a number of rule- and model-based approaches have been designed for dynamic resource management in virtualized data centers. This survey investigates the challenges of resource provisioning and provides a competing assessment on the existing approaches. After the evaluation of their benefits and drawbacks, the new research direction to improve the efficiency of resource management and recommendations are introduced.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.24 no.69
• /
• pp.1-12
• /
• 2001

In this paper, the consumable concurred spare parts requirement determination problem of newly procured equipment systems is considered. The problem is formulated as the operational availability maximization problem with any given fund limitation. the that the failure of a part follows a Poisson process and part failure rate is constant in spite of the decrease of number of equipments during operational period, an analytical method is developed to obtain spare part requirements using the generalized Lagrange multipliers method, The numerical examples show that analytic solution is mostly equal to the realistic solution obtained from simulation regardless of assumptions about part failure rate. It is expected that the analytical method developed in the paper can be effectively used to make a budget for provisioning the concurrent spare parts of newly procured equipment system.

• IE interfaces
• /
• v.14 no.3
• /
• pp.286-295
• /
• 2001

This paper addresses the problem of determining the proper level of concurrent spare parts(CSP) for a system consisting of multi-item parts under an available budget constraint. Initial provisioning of spare parts plays a major role in the acquisition of a new equipment system. Therefore, the proper level of spare parts should be on hand to maintain the availability of the system. This paper proposes a new CSP model and solution procedure that determines the proper level of spare parts satisfying the item priority and simultaneously available budget constraint.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1164-1183
• /
• 2019

The rapid development of cloud computing and high requirements of operators requires strong support from the underlying Data Center Networks. Therefore, the effectiveness of using resources in the data center networks becomes a point of concern for operators and material for research. In this paper, we discuss the online virtual-cluster provision problem for multiple tenants with an aim to decide when and where the virtual cluster should be placed in a data center network. Our objective is maximizing the total revenue for the data center networks under the constraints. In order to solve this problem, this paper divides it into two parts: online multi-tenancy scheduling and virtual cluster placement. The first part aims to determine the scheduling orders for the multiple tenants, and the second part aims to determine the locations of virtual machines. We first approach the problem by using the variational inequality model and discuss the existence of the optimal solution. After that, we prove that provisioning virtual clusters for a multi-tenant data center network that maximizes revenue is NP-hard. Due to the complexity of this problem, an efficient heuristic algorithm OMS (Online Multi-tenancy Scheduling) is proposed to solve the online multi-tenancy scheduling problem. We further explore the virtual cluster placement problem based on the OMS and propose a novel algorithm during the virtual machine placement. We evaluate our algorithms through a series of simulations, and the simulations results demonstrate that OMS can significantly increase the efficiency and total revenue for the data centers.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.6 no.2
• /
• pp.81-88
• /
• 2016

Machine-to-Machine (M2M) communication provides each component (machine) with access to Internet, evolving into the IoT technology. IoT is a trend where numbers of devices provide the communication service, using the Internet protocol. As spreading the concept of IoT(Internet of Things), various objects become home information sources. According to the wide spread of various devices, it is difficult to access data on the devices with unified manners. Under this environment, security is a critical element to create various types of application and service. In this paper propose the inter-device authentication and Centralized Remote Security Provisioning framework in Open M2M environment. The results of previous studies in this task is carried out by protecting it with the latest information on M2M / IoT and designed to provide the ultimate goal of future M2M / IoT optimized platform that can be integrated M2M / IoT service security and security model presents the information.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.7
• /
• pp.2325-2349
• /
• 2014

Network virtualization technology plays a key role in cloud computing, which serves as an effective approach for provisioning a flexible and highly adaptable shared substrate network to satisfy the demands of various applications or services. Recently, the problem of mapping a virtual network (VN) onto a substrate network has been addressed by various algorithms. However, these algorithms are typically efficient for unicast service-oriented virtual networks, and generally not applicable to multicast service-oriented virtual networks (MVNs). Furthermore, the survivable MVN mapping (SMVNM) problem that considers the survivability of MVN has not been studied and is also the focus of this work. In this research, we discuss SMVNM problem under regional failures in the substrate network and propose an efficient algorithm for solving this problem. We first propose a framework and formulate the SMVNM problem with the objective of minimizing mapping cost by using mixed integer linear programming. Then we design an efficient heuristic to solve this problem and introduce several optimizations to achieve the better mapping solutions. We validate and evaluate our framework and algorithms by conducting extensive simulations on different realistic networks under various scenarios, and by comparing with existing approaches. Our simulation experiments and results show that our approach outperforms existing solutions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.11
• /
• pp.3584-3602
• /
• 2022

NFV realizes flexible and rapid software deployment and management of network functions in the cloud network, and provides network services in the form of chained virtual network functions (VNFs). However, using VNFs to provide quality guaranteed services is still a challenge because of the inherent difficulty in intelligently scaling VNFs to handle traffic fluctuations. Most existing works scale VNFs with fixed-capacity instances, that is they take instances of the same size and determine a suitable deployment location without considering the cloud network resource distribution. This paper proposes a traffic forecasted assisted proactive VNF scaling approach, and it adopts the instance capacity adaptive to the node resource. We first model the VNF scaling as integer quadratic programming and then propose a proactive adaptive VNF scaling (PAVS) approach. The approach employs an efficient traffic forecasting method based on LSTM to predict the upcoming traffic demands. With the obtained traffic demands, we design a resource-aware new VNF instance deployment algorithm to scale out under-provisioning VNFs and a redundant VNF instance management mechanism to scale in over-provisioning VNFs. Trace-driven simulation demonstrates that our proposed approach can respond to traffic fluctuation in advance and reduce the total cost significantly.

• Journal of Applied Reliability
• /
• v.12 no.3
• /
• pp.225-238
• /
• 2012

In this paper determined is the quantity of repairable concurrent spare parts(CSP) of a new equipment system to maximize the operational availability under budget constraint and cannibalization allowed. When a part fails, the part is replaced and the failed part is repaired for later use while cannibalization is allowed. The failure of a part is assumed to follow a Poisson process and the availability in CSP is defined. The solution procedure consists of two parts. Firstly, a mathematical model is developed under the assumption that the failure rate is constant during the CSP period and cannibalization is not allowed. Secondly, proposed is a simulation search procedure which improves the heuristic solution to the near optimal solution in a reasonable amount of time under the assumption that the cannibalization is allowed.

• Journal of Applied Reliability
• /
• v.2 no.2
• /
• pp.85-97
• /
• 2002

In this paper, partially repairable concurrent spare parts requirement determination problem of newly procured equipment systems is considered. “partially repairable” means that a portion of damaged parts can be recover their function and reused after repairs. A mathematical model is derived for making an CSP requirement determination subject to the constraint of satisfying any given operational availability limitation. We assume that the failure of a part follows a Poisson process and the repair time has an exponential distribution. Using the generalized Lagrange multipliers method, the solution procedure is derived.

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

In this paper, we propose an Aggregate Fairness Maker (ARM) required for an Edge router to improve fairness of throughput among the flows of Assured Service in DiffServ with different round trip time (RTT) and we propose a user flow Three Color Marker (uf-TCM) as a flow marker that marks packets from the flow as green, yellow, or red. A yellow packet is the packet that consumes loss token in uf-TCM as well as that is demoted green packet in AM due to disobey the aggregate traffic profile. The proposed AFH promotes yellow packet to green packet or demotes green packet to yellow packet through the fair method without per-flow management, and it improves the feirness of throughput among the flows as well as link utilization. A yellow packet and a red packet have the same drop precedence at Core Router in our scheme. So we can use the RIO buffer management scheme. We evaluated the performance of our proposed AFM and the REDP Marker that was proposed to improve fairness without per-flow management. Simulation results show that, compared with the REDP marker, proposed AFM can improve performance of throughput fairness among the flows with different RTT and link utilization under the over-provisioning, exact-provisioning, and under-provisioning network environments at Multiple DiffServ domains as well as at Single DiffServ domain.