• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.1
• /
• pp.35-54
• /
• 1995

Routing in ATM network is set up by combination of both virtual path routing and virtual channel routing. While virtual channel is similar concept to virtual circuit of data networks, virtual path is a special concept which is not used in traditional data networks. Virtual path can rearrange in structure and size by simply changing virtual path routing tables and giving the network the capability to eash allocate network resources according to the demand needs. This paper provides reconfiguration models of virtual path network which give the bandwidth of link and the routing path for each traffic class. The reconfiguration models are network optimization problems of multicommodity network flow type. The numerical examples are also included.

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

• Journal of Digital Convergence
• /
• v.12 no.8
• /
• pp.309-319
• /
• 2014

Virtual Network service is a key characteristics of future Internet which is debate internationally. There are two kinds of network virtualization technologies considered lately: network functions virtualization and virtual network approaches. Several national wide research networks including US's GENI project have experimented technologies for future Internet and in particular network virtualization is one of key issues. Representative Korean research network, KREONET, is working on deploying virtual network framework as a preliminary for future Ineternet using the virtualization model of SDN/OpenFlow which is typical network model of future Internet. This paper proposes a stepwise model to bring virtual network services in KREONET. Firstly, we requirements of KREONET users' virtual network service and network resource management and network deploying virtual network. Finally, we verify the adequacy of our virtual network model for KREONET.

• Journal of Communications and Networks
• /
• v.14 no.3
• /
• pp.319-335
• /
• 2012

In this study, we design an applicable model enabling internet protocol television (IPTV) service providers to use a virtual network (VN) for IPTV service delivery. The model addresses the guaranteed service delivery, cost effectiveness, flexible control, and scalable network infrastructure limitations of backbone or IP overlay-based content networks. There are two major challenges involved in this research: i) The design of an efficient, cost effective, and reliable virtual network topology (VNT) for IPTV service delivery and the handling of a VN allocation failure by infrastructure providers (InPs) and ii) the proper approach to reduce the cost of VNT recontruction and reallocation caused by VNT allocation failure. Therefore, in this study, we design a more reliable virtual network topology for solving a single virtual node, virtual link, or video server failure. We develop a novel optimization objective and an efficient VN construction algorithm for building the proposed topology. In addition, we address the VN allocation failure problem by proposing VNT decomposition and reconstruction algorithms. Various simulations are conducted to verify the effectiveness of the proposed VNT, as well as that of the associated construction, decomposition, and reconstruction algorithms in terms of reliability and efficiency. The simulation results are compared with the findings of existing works, and an improvement in performance is observed.

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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.11
• /
• pp.2764-2783
• /
• 2012

Network virtualization supports future Internet environments and cloud computing. Virtualization can mitigate many hardware restrictions and provide variable network topologies to support variable cloud services. Owing to several advantages such as low cost, high flexibility, and better manageability, virtualization has been widely adopted for use in network virtualization platforms. Among the many issues related to cloud computing, to achieve a suitable cloud service quality we specifically focus on network and performance isolation schemes, which ensure the integrity and QoS of each virtual cloud network. In this study, we suggest a virtual network platform that uses Xen-based virtualization, and implement multiple virtualized networks to provide variable cloud services on a physical network. In addition, we describe the isolation of virtual networks by assigning a different virtualized network ID (VLAN ID) to each network to ensure the integrity of the service contents. We also provide a method for efficiently isolating the performance of each virtual network in terms of network bandwidth. Our performance isolation method supports multiple virtual networks with different levels of service quality.

• 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.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.8 no.1
• /
• pp.145-164
• /
• 2014

Network virtualization provides a promising tool to allow multiple heterogeneous virtual networks to run on a shared substrate network simultaneously. A long-standing challenge in network virtualization is the Virtual Network Embedding (VNE) problem: how to embed virtual networks onto specific physical nodes and links in the substrate network effectively. Recent research presents several heuristic algorithms that only consider single topological attribute of networks, which may lead to decreased utilization of resources. In this paper, we introduce six complementary characteristics that reflect different topological attributes, and propose three topology-aware VNE algorithms by leveraging the respective advantages of different characteristics. In addition, a new KS-core decomposition algorithm based on two characteristics is devised to better disentangle the hierarchical topological structure of virtual networks. Due to the overall consideration of topological attributes of substrate and virtual networks by using multiple characteristics, our study better coordinates node and link embedding. Extensive simulations demonstrate that our proposed algorithms improve the long-term average revenue, acceptance ratio, and revenue/cost ratio compared to previous algorithms.