• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.7
• /
• pp.2649-2666
• /
• 2015

In the dynamic cloud computing environment, to ensure, under the terms of service-level agreements, the maximum efficiency of resource utilization, it is necessary to investigate the online dynamic management of virtual machine resources and their operational application systems/components. In this study, the feasibility and properties of the division of virtual machine resources on the cloud platform, using the virtual machine cluster as the management unit, are investigated. First, the definitions of virtual machine clusters are compared, and our own definitions are presented. Then, the feasibility of division using the virtual machine cluster as the management unit is described, and the isomorphism and reconfigurability of the clusters are proven. Lastly, from the perspectives of clustering and cluster segmentation, the dynamics of virtual machines are described and experimentally compared. This study aims to provide novel methods and approaches to the optimization management of virtual machine resources and the optimization configuration of the parameters of virtual machine resources and their application systems/components in large-scale cloud computing environments.

• Journal of Korea Technology Innovation Society
• /
• v.10 no.4
• /
• pp.808-841
• /
• 2007

Recently some researchers started to discuss the fundamental limitations of geographical innovation clusters. With the rapid development of information and telecommunication technologies, a new concept of virtual innovation cluster is emerging in the advanced countries an alternative to overcome the limitations of geographical clusters. In this context, this study is designed as a pilot study to verify limitations of and issues with geographical innovation cluster through a survey and review the possible application of virtual innovation cluster as an alternative to geographical innovation cluster. Topics covered in this study include; 1) What are the limitations and/or issues with geographical clusters? 2) Can these limitations of and issues with geographical innovation cluster be overcome with virtual innovation cluster? 3) What is the government policy direction to ensure effective utilization of virtual innovation clusters? To answer these questions, this study adopted various research techniques including literature reviews, surveys, case studies, and expert interviews. Especially, a survey was conducted to diagnose the limitations of geographical innovation cluster policy and to understand the possibility of applying virtual innovation clusters. Finally, the significances and limitations of the study are discussed.

• Journal of Information Technology Services
• /
• v.12 no.2
• /
• pp.153-170
• /
• 2013

As global competition of enterprises heats up recently, there is a growing the need to introduce business knowledge platform. Many enterprises work with other partners in a variety of situations and collaboration has emerged as new competitiveness of them. Collaboration improves the performance of members, and besides it has an important bearing on innovation, result, and increased productivity of enterprise. Lots of businesses, locally and abroad, extend the environment of collaboration and try to share business contents efficiently. In addition, they look into ways of invigorating collaboration by providing community tools. Corporations and Governments around the world are pushing smart work to respond effectively to this paradigm change. Smart work provides many types of collaboration and raises the productivity. Various infrastructures should be constructed for activating smart work. Most of all, core technology is to be developed. Virtual Cluster is the space of collaboration corresponding to change in business paradigm. In overseas policy of Virtual Cluster has been already enforced as an alternative to geographical cluster. The establishment and development of collaboration platform through Virtual Cluster can contribute to business competitiveness by smart work.

• 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.

• Journal of Communications and Networks
• /
• v.12 no.4
• /
• pp.358-365
• /
• 2010

We develop a low complexity cooperative diversity protocol for low energy adaptive clustering hierarchy (LEACH) based wireless sensor networks. A cross layer approach is used to obtain spatial diversity in the physical layer. In this paper, a simple modification in clustering algorithm of the LEACH protocol is proposed to exploit virtual multiple-input multiple-output (MIMO) based user cooperation. In lieu of selecting a single cluster-head at network layer, we proposed M cluster-heads in each cluster to obtain a diversity order of M in long distance communication. Due to the broadcast nature of wireless transmission, cluster-heads are able to receive data from sensor nodes at the same time. This fact ensures the synchronization required to implement a virtual MIMO based space time block code (STBC) in cluster-head to sink node transmission. An analytical method to evaluate the energy consumption based on BER curve is presented. Analysis and simulation results show that proposed cooperative LEACH protocol can save a huge amount of energy over LEACH protocol with same data rate, bit error rate, delay and bandwidth requirements. Moreover, this proposal can achieve higher order diversity with improved spectral efficiency compared to other virtual MIMO based protocols.

• The Journal of Korea Robotics Society
• /
• v.6 no.3
• /
• pp.237-246
• /
• 2011

Robots have been used in many fields due to its performance improvement and variety of its functionality, to the extent which robots can replace human tasks. Individual feature and better performance of robots are expected and required to be created. As their performances and functions have increased, systems have gotten more complicated. Multi mobile robots can perform complex tasks with simple robot system and algorithm. But multi mobile robots face much more complex driving problem than singular driving. To solve the problem, in this study, driving algorithm based on the energy method is applied to the individual robot in a group. This makes a cluster be in a formation automatically and suggests a cluster the automatic driving method so that they stably arrive at the target. The energy method mentioned above is applying attractive force and repulsive force to a special target, other robots or obstacles. This creates the potential energy, and the robot is controlled to drive in the direction of decreasing energy, which basically satisfies lyapunov function. Through this method, a cluster robot is able to create a formation and stably arrives at its target.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6C
• /
• pp.544-561
• /
• 2002

In this paper, we propose a new hybrid type of the routing protocol (Virtual Cluster-based Routing Protocol: VCRP) for mobile ad-hoc networks, based on a virtual cluster, which is defined as a narrow-sense network to exchange the basic information related to the routing among the adjacent nodes. This particular approach combines advantage of proactive routing protocol (PRP), which immediately provides the route collecting the network-wide topological and metric information, with that of reactive routing protocol, which relies on the route query packet to collect the route information on its way to the destination without exchanging any information between nodes. Furthermore, it also provides the back-up route as a byproduct, along with the optimal route, which leads to the VCBRP (Virtual Cluster-based Routing Protocol with Backup Route) establishing the alternative route immediately after a network topology is changed due to degradation of link quality and terminal mobility, Our simulation studies have shown that the proposed routing protocols are robust against dynamics of network topology while improving the performances of packet transfer delay, link failure ratio, and throughput over those of the existing routing protocols without much compromising the control overhead efficiency.

• Journal of Korea Multimedia Society
• /
• v.7 no.8
• /
• pp.1097-1106
• /
• 2004

The typical web cluster architecture consists of replicated real servers and a virtual server that routes client requests among the real servers. In this paper, we proposed an efficient dynamic load distribution method with load prediction for the web cluster systems. The virtual server transmit status request message to real servers in other to get load states. However the load states dose not accurate during load distribution, thus the virtual server predict the load status of real servers and assign a request of the client to the minimum loaded real server. The proposed distribution methods works not related to partial breakdown of real servers, thus the system works with high availability. We also show that the proposed distribution method preserve scalable property and improve the throughput through a set of simulations.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.4
• /
• pp.21-26
• /
• 2008

A method for processing huge airborne laser scanned data using parallel computing and virtual grid is proposed and the method is tested by generating raster DSM(Digital Surface Model) with IDW(Inverse Distance Weighting). Parallelism is involved for fast interpolation of huge point data and virtual grid is adopted for enhancing searching efficiency of irregularly distributed point data. Processing time was checked for the method using cluster constituted of one master node and six slave nodes, resulting in efficiency near to 1 and load scalability property. Also large data which cannot be processed with a sole system was processed with cluster system.

• Journal of information and communication convergence engineering
• /
• v.17 no.3
• /
• pp.185-190
• /
• 2019

The explosive growth of data traffic and services has created cost challenges for networks. Studies have attempted to effectively apply network slicing in fifth generation networks to provide high speed, low latency, and various compatible services. However, in network slicing using mixed-integer linear programming, the operation count increases exponentially with the number of physical servers and virtual network functions (VNFs) to be allocated. Therefore, we propose an efficient slice allocation method based on cluster technology, comprising the following three steps: i) clustering physical servers; ii) selecting an appropriate cluster to allocate a VNF; iii) selecting an appropriate physical server for VNF allocation. Solver runtimes of the existing and proposed methods are compared, under similar settings, with respect to intra-slice isolation. The results show that solver runtime decreases, by approximately 30% on average, with an increase in the number of physical servers within the cluster in the presence of intra-slice isolation.