An Agent Based Approach for Assignment of Virtual Networks to Substrate Network for Software Defined Networking

2018 ◽  
Author(s):  
Ali Akbar Nasiri ◽  
Farnaz Derakhshan
Keyword(s):  
Software Defined Networking ◽  
Virtual Networks ◽  
Agent Based ◽  
Substrate Network

scholarly journals A Hybrid Reliable Heuristic Mapping Method Based on Survivable Virtual Networks for Network Virtualization

2015 ◽  
Vol 2015 ◽  
pp. 1-8
Author(s):  
Qiang Zhu ◽  
Hui-Qiang Wang ◽  
Guang-Sheng Feng ◽  
Hong-Wu Lv ◽  
Zhen-Dong Wang ◽  
...  
Keyword(s):  
Network Virtualization ◽  
Mapping Method ◽  
Virtual Network ◽  
Virtual Networks ◽  
Ant Colony Optimization Algorithm ◽  
Single Node ◽  
Routing Problem ◽  
Cut Set ◽  
Substrate Network ◽  
Pass Through

The reliable mapping of virtual networks is one of the hot issues in network virtualization researches. Unlike the traditional protection mechanisms based on redundancy and recovery mechanisms, we take the solution of the survivable virtual topology routing problem for reference to ensure that the rest of the mapped virtual networks keeps connected under a single node failure condition in the substrate network, which guarantees the completeness of the virtual network and continuity of services. In order to reduce the cost of the substrate network, a hybrid reliable heuristic mapping method based on survivable virtual networks (Hybrid-RHM-SVN) is proposed. In Hybrid-RHM-SVN, we formulate the reliable mapping problem as an integer linear program. Firstly, we calculate the primary-cut set of the virtual network subgraph where the failed node has been removed. Then, we use the ant colony optimization algorithm to achieve the approximate optimal mapping. The links in primary-cut set should select a substrate path that does not pass through the substrate node corresponding to the virtual node that has been removed first. The simulation results show that the acceptance rate of virtual networks, the average revenue of mapping, and the recovery rate of virtual networks are increased compared with the existing reliable mapping algorithms, respectively.

Software-Defined Networking for Scalable Cloud-based Services to Improve System Performance of Hadoop-based Big Data Applications

2016 ◽  
Vol 8 (2) ◽  
pp. 1-22 ◽  
Author(s):  
Desta Haileselassie Hagos
Keyword(s):  
Big Data ◽  
System Performance ◽  
Dynamic Network ◽  
Software Defined Networking ◽  
Network Control ◽  
Virtual Networks ◽  
Big Data Applications ◽  
New Research ◽  
Cloud Infrastructures ◽  
The Impact

The rapid growth of Cloud Computing has brought with it major new challenges in the automated manageability, dynamic network reconfiguration, provisioning, scalability and flexibility of virtual networks. OpenFlow-enabled Software-Defined Networking (SDN) alleviates these key challenges through the abstraction of lower level functionality that removes the complexities of the underlying hardware by separating the data and control planes. SDN has an efficient, dynamic, automated network management, higher availability and application provisioning through programmable interfaces which are very critical for flexible and scalable cloud-based services. In this study, the author explores broadly useful open technologies and methodologies for applying an OpenFlow-enabled SDN to scalable cloud-based services and a variety of diverse applications. The approach in this paper introduces new research challenges in the design and implementation of advanced techniques for bringing an SDN-enabled components and big data applications into a cloud environment in a dynamic setting. Some of these challenges become pressing concerns to cloud providers when managing virtual networks and data centers, while others complicate the development and deployment of cloud-hosted applications from the perspective of developers and end users. However, the growing demand for manageable, scalable and flexible clouds necessitates that effective solutions to these challenges be found. Hence, through real-world research validation use cases, this paper aims at exploring useful mechanisms for the role and potential of an OpenFlow-enabled SDN and its direct benefit for scalable cloud-based services. Finally, it demonstrates the impact of an OpenFlow-enabled SDN that fully embraces the opportunities and challenges of cloud infrastructures to improve the system performance of Hadoop-based big data applications by utilizing the network control capabilities of an OpenFlow to solve network congestion.

Software-Defined Networking for Scalable Cloud-Based Services to Improve System Performance of Hadoop-Based Big Data Applications

Web Services ◽  
2019 ◽  
pp. 1460-1484
Author(s):  
Desta Haileselassie Hagos
Keyword(s):  
Big Data ◽  
System Performance ◽  
Dynamic Network ◽  
Software Defined Networking ◽  
Network Control ◽  
Virtual Networks ◽  
Big Data Applications ◽  
New Research ◽  
Cloud Infrastructures ◽  
And Control

The rapid growth of Cloud Computing has brought with it major new challenges in the automated manageability, dynamic network reconfiguration, provisioning, scalability and flexibility of virtual networks. OpenFlow-enabled Software-Defined Networking (SDN) alleviates these key challenges through the abstraction of lower level functionality that removes the complexities of the underlying hardware by separating the data and control planes. SDN has an efficient, dynamic, automated network management, higher availability and application provisioning through programmable interfaces which are very critical for flexible and scalable cloud-based services. In this study, the author explores broadly useful open technologies and methodologies for applying an OpenFlow-enabled SDN to scalable cloud-based services and a variety of diverse applications. The approach in this paper introduces new research challenges in the design and implementation of advanced techniques for bringing an SDN-enabled components and big data applications into a cloud environment in a dynamic setting. Some of these challenges become pressing concerns to cloud providers when managing virtual networks and data centers, while others complicate the development and deployment of cloud-hosted applications from the perspective of developers and end users. However, the growing demand for manageable, scalable and flexible clouds necessitates that effective solutions to these challenges be found. Hence, through real-world research validation use cases, this paper aims at exploring useful mechanisms for the role and potential of an OpenFlow-enabled SDN and its direct benefit for scalable cloud-based services. Finally, it demonstrates the impact of an OpenFlow-enabled SDN that fully embraces the opportunities and challenges of cloud infrastructures to improve the system performance of Hadoop-based big data applications by utilizing the network control capabilities of an OpenFlow to solve network congestion.

Survivable Mapping of Virtual Networks onto a Shared Substrate Network

2013 ◽  
pp. 325-343
Author(s):  
Vishal Anand
Keyword(s):  
Performance Metrics ◽  
Heuristic Algorithms ◽  
Network Virtualization ◽  
Future Internet ◽  
Mixed Integer ◽  
Virtual Networks ◽  
Future Internet Architecture ◽  
Computing Services ◽  
Underlying Network ◽  
Substrate Network

The virtualization of both servers and substrate networks will enable the future Internet architecture to support a variety of Cloud computing services and architectures, and prevent its ossification. Since multiple virtual networks (VN) or virtual infrastructure (VI) and services now share the resources of the same underlying network in a network virtualization environment, it is important that efficient techniques are developed for the mapping of the VNs onto the substrate network. Furthermore, due to the sharing of resources, the survivable design of VNs is also very important, since now even small failures in the substrate network will cause the disruption of a large number of VNs that may be mapped on to the substrate network. In this work, the author studies the problem of survivable virtual network mapping (SVNM) and first formulates the problem using mixed integer linear programming (MILP). The author then devises two kinds of algorithms for solving the SVNM problem efficiently: (1) Lagrangian relaxation-based algorithms including LR-SVNM-M and LR-SVNM-D and (2) Heuristic algorithms including H-SVNM-D and H-SVNM-M. The author then compares the performance of the algorithms with other VI mapping algorithms under various performance metrics using simulation. The simulation results and analysis show that the algorithms can be used to balance the tradeoff between time efficiency and mapping cost.

Constructing Power-Aware Multicast Virtual Networks

2011 ◽  
Vol 308-310 ◽  
pp. 1728-1731
Author(s):  
Ning Qi ◽  
Bin Qiang Wang ◽  
Bo Yuan ◽  
Bo Zhang
Keyword(s):  
Power Consumption ◽  
Greedy Algorithm ◽  
General Public ◽  
Research Community ◽  
Virtual Networks ◽  
Virtual Topology ◽  
Construction Problem ◽  
Construction Algorithm ◽  
Substrate Network

Power consumption of Internet is becoming more and more a sensible problem, which is of interest for both the research community and the general public. In this paper we have formally defined the power-aware multicast VN construction problem and setup an ILP model whose objective is to find a virtual topology on top of substrate network fulfilling all restrictions, while the power consumption of construction is minimized. In order to address the problem efficiently we develop a greedy algorithm: PMVNMH. The efficiency of the power-aware construction algorithm is evaluated by emulation experiment.

Assignment of Virtual Networks to Substrate Network for Software Defined Networks

2018 ◽  
Vol 8 (4) ◽  
pp. 29-48
Author(s):  
Ali Akbar Nasiri ◽  
Farnaz Derakhshan
Keyword(s):  
Virtual Network ◽  
Management Service ◽  
Virtual Network Embedding ◽  
Virtual Networks ◽  
Network Embedding ◽  
Network Resources ◽  
Central Controller ◽  
Network Controller ◽  
Physical Resources ◽  
Substrate Network

Assigning multiple virtual network resources to physical network resources, called virtual network embedding (VNE), is known to be non-deterministic polynomial-time hard (NP-hard) problem. Currently software-defined networking (SDN) is gaining popularity in enterprise networks to improve the customizability and flexibility in network management service and reduced operational cost. A central controller in SDNs is an important factor that we need to take care of when we want to assign virtual networks to physical resources. In this work, we address virtual network embedding problems for SDNs. Indeed, our objective is to propose a method to assign virtual networks in the substrate network with minimum physical resources, and also minimizing delays between the virtual network controller and the switches in the virtual network. Our proposed algorithm considers the link and node constraints such as CPU and bandwidth constraints which is necessary to consider when we try to solve virtual network embedding problems.

scholarly journals Virtual Network Embedding Based on Security Level with VNF Placement

2019 ◽  
Vol 2019 ◽  
pp. 1-11 ◽  
Author(s):  
Dhanu Dwiardhika ◽  
Takuji Tachibana
Keyword(s):  
Network Security ◽  
Virtual Network ◽  
Security Level ◽  
Virtual Network Embedding ◽  
Virtual Networks ◽  
Network Embedding ◽  
Numerical Examples ◽  
Substrate Network ◽  
The Cost

In this paper, in order to embed virtual networks by considering network security, we propose a virtual network embedding based on security level with VNF placement. In this method, virtual networks are embedded in a substrate network by considering security and some security VNFs are placed in order to increase the security level of substrate networks. By using our proposed method, many virtual networks can be embedded by considering security level. As a result, the reward can be increased and the cost of placing VNFs is not increased so much. We evaluate the performance of our proposed method with simulation. The performance of this method is compared with the performance of a method that places VNFs randomly and the performance of a method without placing VNFs. From numerical examples, we investigate the effectiveness of this method. In numerical examples, we show that the proposed method is effective in embedding virtual networks by considering network security.

A New Robust Heuristic for Assigning Substrate Network Resources to Virtual Networks

2014 ◽  
Author(s):  
Sarah Kareche ◽  
Sylvain Ductor ◽  
Zahia Guessoum ◽  
Mohamed Mezghiche
Keyword(s):  
Virtual Networks ◽  
Network Resources ◽  
Substrate Network
Sign in / Sign up

Export Citation Format

Share Document