• East Asian mathematical journal
• /
• v.32 no.5
• /
• pp.767-774
• /
• 2016

Manturov inroduced the parity bracket polynomial by using a parity of virtual knots, which is an extension of Jones-Kauffman polynomial. We extend Manturov's result to virtual links, so that we obtain the parity bracket polynomial for virtual links and give some examples.

• Convergence Security Journal
• /
• v.8 no.4
• /
• pp.51-56
• /
• 2008

A combination of VPNs and dial-up access, such as DSL and Cable, usually provides the cost-effective solution as the substitution of private networks on high-cost leased line. The business demand for high availability has increased with VPN spreading. This paper presents the schemes for a high availability of network access and a load balancing of network traffic in VPN gateways by using multiple links or multihoming capability based on active-active approach. The high availability and load balancing of network links can be achieved by duplicating external network access into multiple independent links. This can provide a continuous network connection to internal users even if one of the links is failed. Moreover, it can provide twice network bandwidth by distributing the traffic into the links. Static and dynamic algorithms are proposed as the load balancing algorithms.

• Kyungpook Mathematical Journal
• /
• v.54 no.4
• /
• pp.639-653
• /
• 2014

In [9], Kauffman introduced virtual knot theory and generalized many classical knot invariants to virtual ones. For example, he extended the Jones polynomials $V_K(t)$ of classical links to the f-polynomials $f_K(A)$ of virtual links by using bracket polynomials. In [4], M. Goussarov, M. Polyak and O. Viro introduced finite type invariants of virtual knots. In this paper, we give a necessary condition for a virtual knot invariant to be of finite type by using $t(a_1,{\cdots},a_m)$-sequences of virtual knots. Then we show that the higher derivatives $f_K^{(n)}(a)$ of the f-polynomial $f_K(A)$ of a virtual knot K at any point a are not of finite type unless $n{\leq}1$ and a = 1.

• Journal of Information Technology Applications and Management
• /
• v.13 no.4
• /
• pp.167-180
• /
• 2006

Websites in the Internet are uncontrollable domain and various contents in websites lead people's activities and thoughts and new business paradigms for the future. These phenomena are from expanding the social network based on the endless growth of information technology. Websites are composed with many of links and communicating and expanding their virtual area by links, inbound, outbound, onsite, and of offsite links. Research and practice in digital information on the web have focused on finding and measuring artifacts, factors and attributes of web structure and contents from the perspective that information is a resource and property of products and services. Websites links is one of the core artifacts for understanding the virtual area. This study identifies the role of web link structure and webpage keyword as artifacts and examines their relationships by webpage rank by a minimal hub as performance in the business websites that are serving tourism information. Discovering relationships of links provides managerial insights on organizations virtual activities and systematic understandings about digitalized organizational information in the information use environment.

• Communications of the Korean Mathematical Society
• /
• v.39 no.1
• /
• pp.247-257
• /
• 2024

We use the structure of skew braces to enhance the biquandle counting invariant for virtual knots and links for finite biquandles defined from skew braces. We introduce two new invariants: a single-variable polynomial using skew brace ideals and a two-variable polynomial using the skew brace group structures. We provide examples to show that the new invariants are not determined by the counting invariant and hence are proper enhancements.

• East Asian mathematical journal
• /
• v.25 no.4
• /
• pp.487-494
• /
• 2009

We show that if two virtual link diagrams which are normal are equivalent under generalized Reidemeister moves, then they are equivalent under generalized Reidemeister moves preserving the normality of diagrams.

• Journal of the Korea Society for Simulation
• /
• v.14 no.1
• /
• pp.43-53
• /
• 2005

We developed the module of the software that robot designers can perform their work faster and more easily. The parametric modeler is founded on the virtual robot design program. The virtual robot design program is the powerful software which may be used to solve various problems of robot kinematics and dynamics. The parametric modeler in the software we developed is that all the positions of joints and links are changed automatically when the designer changes one joint or one link in the robot system. Without parametric method, robot-designers must change all the positions of connected joints and links. It might become time-consuming. However, it is very efficient for designers to use the method of batch-processing in performing design-changes of robot-links using the parametric modeler.

• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.1
• /
• pp.60-65
• /
• 2017

Network virtualization enables us to make efficient use of resources in a physical network by embedding multiple virtual networks in the physical network. In this paper, we develop a prototype of a virtual network embedding system. Our system consists of OpenStack, which is an open source cloud service platform, and shell scripts. Because OpenStack does not provide a quality of service control function, we realize bandwidth reservation for virtual links by making use of the ingress policing function of Open vSwitch, which is a virtual switch used in OpenStack. The shell scripts in our system automatically construct the required virtual network on the physical network using the OpenStack command-line interface, and they reserve bandwidth for virtual links using the Open vSwitch command. Experimental evaluation confirms that our system constructs the requested virtual network and appropriately allocates node and link resources to it.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.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.