• East Asian mathematical journal
• /
• 제32권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.

• 융합보안논문지
• /
• 제8권4호
• /
• pp.51-56
• /
• 2008

VPN(Virtual Private Network)과 DSL, 케이블과 같은 다이얼업 접속의 조합은 저렴한 비용으로 임대라인 기반의 사설망의 대안이 되고 있다. VPN 장비의 고가용성(High Availability, HA)에 대한 기업의 요구가 증대되고 있다. 본 논문에서 VPN 게이트웨이에서 링크 이중화를 통한 액티브-액티브 방식을 이용해 네트웍 접근성의 고가용성과 네트웍 부하 분산 기법을 제안한다. 네트웍 링크의 고가용성/부하분산은 외부 내트웍 접근을 독립적인 두 개의 라인으로 이중화하는 것으로 달성할 수 있다. 이것은 둘 중 하나의 링크에 문제가 발생하더라도 내부 사용자에게 지속적인 네트웍 접근을 제공할 수 있다. 뿐만 아니라, 네트웍 부하를 두 개의 라인으로 분산시킴으로써 두 배에 가까운 네트웍 대역폭을 제공할 수 있다. 네트웍 링크의 부하 분배를 위해 정적인 알고리즘과 동적인 알고리즘을 제안한다.

• Kyungpook Mathematical Journal
• /
• 제54권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
• /
• 제13권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.

• 대한수학회논문집
• /
• 제39권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
• /
• 제25권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.

• 한국시뮬레이션학회논문지
• /
• 제14권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
• /
• 제6권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)
• /
• 제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.

• 한국통신학회논문지
• /
• 제41권12호
• /
• pp.1793-1800
• /
• 2016

네트워크의 가상화는 최근에 등장한 클라우드 서비스, 데이터 센터 네트워크 등 새로운 서비스를 기존의 네트워크 환경에서 제공하기 위한 하나의 방편으로 인식되고 있다. 본 논문에서는 네트워크 가상화를 위한 가상 네트워크 대응 방안을 가상 노드의 위치, 자원, 가상 링크의 대역폭 요구조건을 고려하면서 효율적인 방안을 제안한다. 제안한 방안은 대응의 우선순위를 대역폭으로 설정하여 대응 가능한 실제 노드들 간의 경로가 존재하는 조합을 발견할 때까지 반복하는 방법을 사용한다. 모의실험 결과 제안한 방안이 가상 네트워크 대응 성공률은 떨어지지 않으면서도 수익률은 높고 실행시간도 빠른 효율적인 방안임을 확인하였다.