• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2346-2361
• /
• 2017

A major challenge in cloud infrastructure is the efficient allocation of virtual network elements on top of substrate network elements. Path algebra is a mathematical framework which allows the validation and convergence analysis of the mono-constraint or multi-constraint routing problems independently of the network topology or size. The present study proposes a new heuristic approach based on mathematical framework "paths algebra" to map virtual nodes and links to substrate nodes and paths in cloud. In this approach, we define a measure criterion to rank the substrate nodes, and map the virtual nodes to substrate nodes according to their ranks by using a greedy algorithm. In addition, considering multi-constraint routing in virtual link mapping stage, the used paths algebra framework allows a more flexible and extendable embedding. Obtained results of simulations show appropriate improvement in acceptance ratio of virtual networks and cost incurred by the infrastructure networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3393-3412
• /
• 2017

As a main challenge in network virtualization, virtual network embedding problem is increasingly important and heuristic algorithms are of great interest. Aiming at the problems of poor correlation in node embedding and link embedding, long distance between adjacent virtual nodes and imbalance resource consumption of network components during embedding, we herein propose a two-stage virtual network embedding algorithm NA-PVNM. In node embedding stage, resource requirement and breadth first search algorithm are introduced to sort virtual nodes, and a node fitness function is developed to find the best substrate node. In link embedding stage, a path fitness function is developed to find the best path in which available bandwidth, CPU and path length are considered. Simulation results showed that the proposed algorithm could shorten link embedding distance, increase the acceptance ratio and revenue to cost ratio compared to previously reported algorithms. We also analyzed the impact of position constraint and substrate network attribute on algorithm performance, as well as the utilization of the substrate network resources during embedding via simulation. The results showed that, under the constraint of substrate resource distribution and virtual network requests, the critical factor of improving success ratio is to reduce resource consumption during embedding.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.2914-2935
• /
• 2016

With the increasing popularization of cloud computing, how to reduce physical energy consumption and increase resource utilization while maintaining system performance has become a research hotspot of virtual machine deployment in cloud platform. Although some related researches have been reported to solve this problem, most of them used the traditional heuristic algorithm based on greedy algorithm and only considered effect of single-dimensional resource (CPU or Memory) on energy consumption. With considerations to multi-dimensional resource utilization, this paper analyzed impact of multi-dimensional resources on energy consumption of cloud computation. A multi-dimensional resource constraint that could maintain normal system operation was proposed. Later, a novel virtual machine deployment method (NVMDM) based on improved particle swarm optimization (IPSO) and Euclidean distance was put forward. It deals with problems like how to generate the initial particle swarm through the improved first-fit algorithm based on resource constraint (IFFABRC), how to define measure standard of credibility of individual and global optimal solutions of particles by combining with Bayesian transform, and how to define fitness function of particle swarm according to the multi-dimensional resource constraint relationship. The proposed NVMDM was proved superior to existing heuristic algorithm in developing performances of physical machines. It could improve utilization of CPU, memory, disk and bandwidth effectively and control task execution time of users within the range of resource constraint.

• The KIPS Transactions:PartB
• /
• v.9B no.3
• /
• pp.383-388
• /
• 2002

We developed a spatial parser generator, SPG, which can automatically create a spatial parser if CMG(Constraint Multiset Grammars) grammars for a visual language are provided by the user with GUI(Graphical User Interface). SPG has the following features. (1) The user uses a visual editor to define the grammars of a virtual language and draw the visual language which should be parsed. (2) The user roughly defines CMG grammars in a visual wan at first. Then the user modifies them and defines final grammars. (3) Because SPG has a constraint solver, it maintains constraints in the parsed virtual language according to the grammars.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4144-4165
• /
• 2018

Software-defined networking (SDN) has emerged as a promising technology for network programmability and experiments. In this work, we focus on virtual network embedding in multiple controllers SDN network. In SDN virtualization environment, virtual SDN networks (vSDNs) operate on the shared substrate network and managed by their each controller, the placement and load of controllers affect vSDN embedding process. We consider controller placement, vSDN embedding, controller adjustment as a joint problem, together considering different quality of service (QoS) requirement for users, formulate the problem into mathematical models to minimize the average time delay of control paths, the load imbalance degree of controllers and embedding cost. We propose a heuristic method which places controllers and partitions control domains according to substrate SDN network, embeds different QoS constraint vSDN requests by corresponding algorithms, and migrates switches between control domains to realize load balance of controllers. The simulation results show that the proposed method can satisfy different QoS requirement of tenants, keep load balance between controllers, and work well in the acceptance ratio and revenue to cost ratio for vSDN embedding.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.17 no.10
• /
• pp.2543-2554
• /
• 1993

In this paper, the kinematic and dynamic analyses of spatial complex kinematic chain are studied. Through the new method both using the set of identification numbers and applying the DenavitHartenberg link representation method to the spatial complex kinematic chain, the kinematic configuration of the chain is represented. Some link in the part of closed chain being fictitiously cutted, the complex kinematic chain is transformed to the branched chain. The kinematic constraint equations are derived from the constraint conditions which the cutted sections of the link have to satisfy. And the joint variables being partitioned in the independent joint variables and the dependent joint variables, the dependent variables are calculated from the independent variables by using the Newton-Raphson iterative method and the pseudoinverse matrix. The equations of motion are derived under the independent joint variables by using the principle of virtual work. Algorithms for dynamic analysis are presented and simulations are done to verify accuracy and efficiency of the algorithms.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2004.10a
• /
• pp.312-316
• /
• 2004

In this study, a spatial 3-dof haptic mechanism is implemented. The implemented mechanism does not employ the gear transmissions as velocity reducers for all three joints but uses wire-based transmissions, thereby it is able to minimize the frictions significantly. Also, by employing the structure of the four-bar mechanism to drive third joint from close to the base, the mechanism is able to minimize the inertia effect from the third actuator very effectively. Its kinematic analysis such as position and velocity analyses are performed first. Then, its operating software development, hardware implementation, and the related interfaces between a PC and the implemented Haptic device are completed. To evaluate its potential and its performance as a haptic device, a experiment generating a virtual constraint in a operational task space is conducted and preliminary results are discussed.

• Journal of Information Technology Applications and Management
• /
• v.28 no.6
• /
• pp.117-132
• /
• 2021

Based on the core value of the Q&A community, the contribution of knowledge and information has a great impact on users' community evaluation. As a small social group, the relationships and interactions among community members are quickly formed through information technology. As such, the cognitive evaluation of the relationship between community members will have an impact on the intention of information contribution. This research builds on the previous research based on the social exchange theory and establishes a dual model of swift guanxi in examining the relationship between guanxi and continuous knowledge contribution. In the current study, 305 survey questionnaires were used and 249 valid questionnaires were used for analysis. The analysis results are as follows: First, information support has a positive impact on dedication-based swift guanxi. While hypothesis between information support and constraint-based swift guanxi was not be supported. Second, emotional support has a positive impact on the formation of swift guanxi from a dual perspective. Third, the swift guanxi from the dual perspective has a positive impact on the intention of continuous knowledge contribution. Finally, although personal involvement has an adjustment effect, it is a downward adjustment effect, hypotheses are not supported. The current study offers theoretical and practical implications in field of knowledge management, specifically knowledge contribution in the virtual community.

• Journal of the Korean Society for Precision Engineering
• /
• v.33 no.8
• /
• pp.669-681
• /
• 2016

Mechanical designers often make mistakes that result in unwanted over-constraints, causing difficulty in assembly operations and residual stress due to interference among parts. This study is concerned with detection and elimination of over-constraints. Screw theory is a general method that is used for constraint analysis of an assembly and motion analysis of a mechanism. Mechanical assemblies with plane-plane, pin-hole, and pin-slot constraint pairs are analyzed using screw theory to illustrate its utility. As a real-world problem, a ball valve design is analyzed using the same method, and several unwanted over-constraints are detected. Elimination measures are proposed. Nominal dimensions of some parts are adjusted, and dimensions and tolerances of the pins and holes are modified using the virtual condition boundary concept. The revised design is free of over-constraints. General procedure for applying screw theory to constraint analysis is established and demonstrated; it will contribute to improving quality of assembly designs.

• International Journal of Aeronautical and Space Sciences
• /
• v.14 no.1
• /
• pp.67-74
• /
• 2013

Nonlinear guidance law combined with a pseudo pursuit guidance is proposed, to perform stationary target observation mission. Multiple UAVs are considered, with waypoint constraint. The whole guidance is divided into two steps: firstly, waypoint approach, with specified incidence angle; and secondly, loitering around the stationary target. Geometric approach is used to consider the constraint on the waypoint, and a specified phase angle between the loitering UAV and the approaching UAV. In the waypoint approach step, UAVs fly to the waypoint using the pseudo pursuit guidance law. After passing the waypoint, UAVs turn around the target, using a distance error dynamics-based guidance law. Numerical simulations are performed, to verify the performance of the proposed guidance law.