• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권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)
• /
• 제10권2호
• /
• pp.522-541
• /
• 2016

Network virtualization provides an effective way to overcome the Internet ossification problem. As one of the main challenges in network virtualization, virtual network embedding refers to mapping multiple virtual networks onto a shared substrate network. However, existing heuristic embedding algorithms evaluate the embedding potential of the nodes simply by the product of different resource attributes, which would result in an unbalanced embedding. Furthermore, ignoring the hops of substrate paths that the virtual links would be mapped onto may restrict the ability of the substrate network to accept additional virtual network requests, and lead to low utilization rate of resource. In this paper, we introduce and extend five node attributes that quantify the embedding potential of the nodes from both the local and global views, and adopt the technique for order preference by similarity ideal solution (TOPSIS) to rank the nodes, aiming at balancing different node attributes to increase the utilization rate of resource. Moreover, we propose a novel two-stage virtual network embedding algorithm, which maps the virtual nodes onto the substrate nodes according to the node ranks, and adopts a shortest path-based algorithm to map the virtual links. Simulation results show that the new algorithm significantly increases the long-term average revenue, the long-term revenue to cost ratio and the acceptance ratio.

• Convergence Security Journal
• /
• 제17권5호
• /
• pp.87-92
• /
• 2017

MANET is a network composed itself because mobile nodes are connected wirelessly. It has been applied to various fields for group communication. However, the dynamic topology by the movement of the nodes causes routing failure frequently because it is difficult to maintain the position information of the nodes participating in the group communication. Also, it has a problem that network performance is decreased due to high overhead for managing information of member nodes. In this paper, we propose a multicast technique using location-based 2-tier virtual group that is flexible and reliable in management of member nodes. The network is composed of cellular zones and the virtual group is constructed using the location information of the nodes in the proposed technique. The virtual group management node is selected to minimize the overhead of location information management for member nodes in the virtual group. In order to improve the reliability for management of member nodes and multicast data transmission, it excludes the gateway node with low transfer rate when setting the route after the packet transmission rate of the member nodes is measured. The excellent performance of the proposed technique can be confirmed through comparative experiments with AMroute method and PAST-DM method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제39B권8호
• /
• pp.491-498
• /
• 2014

Due to the ossification of current Internet, it is hard to accommodate new service requirements. One of the solutions to this problem is network virtualization. In this paper, we propose a heuristic virtual network embedding method for network virtualization. The proposed method checks whether the candidate substrate nodes in the substrate network have the possibility of satisfying virtual link requirements. It gives priority to the virtual nodes and the substrate nodes, and embeds the node with higher priority first. Also, the proposed method tries to cluster the mapped substrate nodes if possible. We evaluate the performance of the proposed method in terms of time complexity and virtual network acceptance rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제41권12호
• /
• pp.1793-1800
• /
• 2016

Network virtualization is considered as an enabling technology to accomodate recently introduced new services such as cloud services and data center networks on top of the existing network environment. In this paper, an efficient virtual network mapping method is proposed which takes account of the location and resource requirements of virtual nodes and the bandwidth requirements of virtual links. The proposed method sets bandwidth as the priority metric for network mapping, and searches for a set of substrate nodes and paths that houses the virtual nodes and virtual links. Through the simulation experiments, it is verified that the proposed method provides better cost to revenue ratio and fast experiment time without degrading success rate of virtual network mapping.

• Proceedings of the KIEE Conference
• /
• 대한전기학회 2003년도 학술회의 논문집 정보 및 제어부문 A
• /
• pp.139-142
• /
• 2003

Location information of individual nodes is useful for routing and some other functions in wireless sensor networks. Each node can use GPS to know its position. However, the GPS service can not be practical to use due to cost efficiency, power, and computing capability. This paper proposes the localization method to make nodes know their location in case of a few nodes knows their position information. The proposed method is named as VALT (Virtual Anchor based Localization using Triangulation method). It uses the virtual anchor concept and calculates the location of individual nodes by means of the triangulation method. This method helps all nodes to determine their position with low cost and high scalability.

• Proceedings of the Korean Information Science Society Conference
• /
• 한국정보과학회 2012년도 한국컴퓨터종합학술대회논문집 Vol.39 No.1(D)
• /
• pp.369-371
• /
• 2012

Wireless sensor networks have taken immense interest in healthcare systems in recent years. One example of it is in an in vivo sensor that is deployed in critical and sensitive healthcare applications like artificial retina, cardiac pacemaker, drug delivery, blood pressure, internal heat calculation, glucosemonitoring etc. In vivo sensor nodes exhibit temperature that may be very dangerous for human tissues. However, existing in vivo thermal aware routing approaches suffer from hotspot creation, delay, and computational complexity. These limitations motivate us toward an in vivo virtual backbone, a small subset of nodes, connected to all other nodes and involved in routing of all nodes, -based solution. A virtual backbone is lightweight and its fault-tolerant version allows in vivo sensor nodes to disconnect hotspot paths and to use alternative paths. We have formulated the problem as m-connected k-dominating set problem with minimum temperature cost in in vivo sensor network. This is a combinatorial optimization problem and we have been motivated to use evolutionary approach to solve the problem.

• Interaction and multiscale mechanics
• /
• 제5권3호
• /
• pp.287-318
• /
• 2012

We apply a partitioned-solution (iterative-staggered) coupling method based on a fixed Eulerian mesh with the level set function to a large-deformation fluid-structure interaction (FSI) problem where a large-deformable thin structure moves in a high-speed flow field, as an airbag does during deployment. This method combines advanced fluid and structure solvers-specifically, the constrained interpolation profile finite element method (CIP-FEM) for fluid Eulerian mesh and large-deformable structural elements for Lagrangian structural mesh. We express the large-deformable interface as a zero isosurface by the level set function, and introduce virtual nodes with level sets and structural normal velocities to generate the level set function according to the large-deformable interfacial geometry and enforce the kinematic condition at the interface. The virtual nodes are located in the direction normal to the structural mesh. It is confirmed that application of the method to unfolded airbag deployment simulation shows the adequacy of the method.

• Journal of the Korea Fashion and Costume Design Association
• /
• 제15권2호
• /
• pp.77-89
• /
• 2013

This study investigated the formation of silhouette and hemline shape of knit flare skirts according to the properties of knit material through virtual clothing with a 3D virtual clothing system called i-Designer of Technoa, thus building a database of the property data of knit material to reduce the number of sample making steps repeated and implemented several times in the process of clothes making. The results would help to estimate a silhouette in advance, offer assistance to the development of original knit wear, and explore ways to provide basic data for the development of the knit industry of the nation. The investigator made 12 kinds of experimental clothes to the angles(width of skirt: $90^{\circ}$ and $180^{\circ}$), gauge(7G, 12G, and 15G), and grain directions(wale and bias direction) of experimental clothes for virtual clothing. The dynamic characteristics of knit skirt samples according to each gauge were measured with the KES-FB system. Draper shapes were analyzed with the sectional shape data of hemline based on i-Designer. As for the measurements of the sectional shape of hemline and the formation of silhouette, the number of nodes, the average height of node mountains and valleys, and the hemline width right and left and before and after increased at the angle of $180^{\circ}$ than $90^{\circ}$. As gauges multiplied, the number of nodes, and silhouette angle dropping. When considering grain directions, the number of nodes and silhouette index increased in the wale direction at the angle of $90^{\circ}$ with the number of nodes and silhouette angle increasing in the wale direction at the angle of $180^{\circ}$.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권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.