Spelling suggestions: "subject:"anetwork virtualization"" "subject:"anetwork virtualizations""
1 |
Analysis of Resource Isolation and Resource Management in Network VirtualizationLindholm, Rickard January 2016 (has links)
Context. Virtualized networks are considered a major advancement in the technology of today, virtualized networks are offering plenty of functional benefits compared to todays dedicated networking elements. The virtualization allows network designers to separate networks and adapting the resources depending on the actual loads in other words, Load Balancing. Virtual networks would enable a minimized downtime for deployment of updates and similar tasks by performing a simple migration and then updating the linking after properly testing and preparing the Virtual Machine with the new software. When this technology is successfully proven to be efficient or evaluated and later adapted to the existing flaws. Virtualized networks will at that point claim the tasks of todays dedicated networking elements. But there are still unknown behaviors and effects of the technology for example, how the scheduler or hypervisor handles the virtual separation since they do share the same physical transmission resources.Objectives. By performing the experiments in this thesis, the hope is to learn about the effects of virtualization and how it performs under stress. By learning about the performance under stress it would also increase the knowledge about the efficiency of network virtualization. The experiments are conducted by creating scripts, using already written programs and systems, adding different loads and measuring the effects, this is documented so that other students and researchers can benefit from the research done in this thesis.Methods. In this thesis 5 different methodologies are performed: Experimental validation, statistical comparative analysis, resource sharing, control theory and literature review. Two systems are compared to previous research by evaluating the statistical results and analyzing them. As mentioned earlier the investigation of this thesis is focusing on how the scheduler executes the resource sharing under stress. The first system which is the control test is designed without any interference and a 5 Mbit/s UDP stream which is going through the system under test and being timestamped on measurement points on both the ingress and the egress, the second experiment involves an interfering load of a 5 Mbit/s UDP stream on the same system under test. Since it is a complex system quite some literature reviewing was done but mostly to gain a understanding and an overview of the different parts of the system and so that some obstacles would be able to be avoided.Results. The statistical comparative analysis of the experiments produced two graphs and two tables containing the coefficient of variance of the two experiments. The graph of the control test produced a graph with a quite even distribution over the time intervals with a coefficient of variance difference to the power of 10−3 and increasing somewhat over the larger time intervals. The second experiment with two virtual machines and an interfering packet stream are more distributed over the 0.0025 seconds and the 0.005 seconds intervals with a larger difference than the control test having a difference to the power of 10−2, showing some signs of a bottleneck in the system.Conclusions. Since the performance of the experiments and also the statistical handling of the data took longer than expected the choice was made to not deploy the system using Open Virtual Switch instead of Linux Bridge, hence there is not any other experiments to compare the performance with. But from referred research under related works the researcher concluded that the difference between Open Virtual Switch and Linux Bridge is small when compared without introducing any load. This is also confirmed on the website of Open Virtual Switch which states that Open Virtual Switch uses the same base as Linux Bridge. Linux Bridge is performing according to the expectations, it is a simple yet powerful tool and the results are confirming the previous research which claims that there are bottlenecks in the system. According to the pre-set requirement for validity for this experiment the difference of the CoV would be greater than to the power of 10−5, the measured difference was to the power of 10−2 which gives support to the theory that there are bottlenecks in the system. In the future it would be interesting to examine more about the effects of different hypervisors, virtualization techniques, packet generators etcetera to tackle these problems. A company that have taken countermeasures is Intel who have developed DPDK which confronts these efficiency problems by tailoring the scheduler towards the specific tasks. The downside of Intel’s DPDK is that it limits the user to Intel processors and removes one of the most important benefits of virtualization, the independence. But Intel have tried to keep it as independent as possible by maintaining DPDK as open source.
|
2 |
Enhancing capabilities of the network data plane using network virtualization and software defined networkingAnwer, Muhammad Bilal 07 January 2016 (has links)
Enhancement of network data-plane functionality is an open problem that has recently
gained momentum. Addition and programmability of new functions inside the network
data-plane to enable high speed, complex network functions with minimum resource
utilization, is main focus of this thesis. In this work, we look at
different levels of the network data-plane design and using network
virtualization and software defined networking we propose data-plane
enhancements to achieve these goals. This thesis is divided into two parts, in first part we take a ground up approach where
we focus our attention at the fast path packet processing. Using hardware and software based network virtualization
we show how hardware and software based network switches can be designed to achieve
above mentioned goals. We then present a switch design to quickly add these
custom fast path packet processors to the network data-plane using software defined networking.
In second part of this thesis we take a top to bottom approach where
we present a programming abstraction for network operators and a network function deployment system for this programming abstraction.
We use network virtualization and software defined networking to introduce new functions inside the network data-plane
while alleviating the network operators of the
deployment details and minimizing the network resource utilization.
|
3 |
Topology-Awareness and Re-optimization Mechanism for Virtual Network EmbeddingButt, Nabeel 06 January 2010 (has links)
Embedding of virtual network (VN) requests on top of a shared physical network poses an intriguing combination of theoretical and practical challenges. Two major problems with the state-of-the-art VN embedding algorithms are their indifference to the underlying substrate topology and their lack of re-optimization mechanisms for already embedded VN requests. We argue that topology-aware embedding together with re-optimization mechanisms can improve the performance of the previous VN embedding algorithms in terms of acceptance ratio and load balancing. The major contributions of this thesis are twofold: (1) we present a mechanism to differentiate among resources based on their importance in the substrate
topology, and (2) we propose a set of algorithms for re-optimizing and
re-embedding initially-rejected VN requests after fixing their bottleneck
requirements. Through extensive simulations, we show that not only our techniques improve the acceptance ratio, but they also provide the added benefit of balancing load better than previous proposals. The metrics we use to validate our techniques are improvement in acceptance ratio, revenue-cost ratio, incurred cost, and distribution of utilization.
|
4 |
Topology-Awareness and Re-optimization Mechanism for Virtual Network EmbeddingButt, Nabeel 06 January 2010 (has links)
Embedding of virtual network (VN) requests on top of a shared physical network poses an intriguing combination of theoretical and practical challenges. Two major problems with the state-of-the-art VN embedding algorithms are their indifference to the underlying substrate topology and their lack of re-optimization mechanisms for already embedded VN requests. We argue that topology-aware embedding together with re-optimization mechanisms can improve the performance of the previous VN embedding algorithms in terms of acceptance ratio and load balancing. The major contributions of this thesis are twofold: (1) we present a mechanism to differentiate among resources based on their importance in the substrate
topology, and (2) we propose a set of algorithms for re-optimizing and
re-embedding initially-rejected VN requests after fixing their bottleneck
requirements. Through extensive simulations, we show that not only our techniques improve the acceptance ratio, but they also provide the added benefit of balancing load better than previous proposals. The metrics we use to validate our techniques are improvement in acceptance ratio, revenue-cost ratio, incurred cost, and distribution of utilization.
|
5 |
Adaptive Management of Virtual Network ResourcesWanis, Bassem January 2015 (has links)
The past few years have witnessed a rapid emergence of large-scale, geographically dispersed, clouds offering in the form of an Infrastructure-as-a-Service (IaaS). The adoption of these services requires the deployment of new networking technologies. This in turn, ensures the performance of the offered cloud services. Network virtualization has been proposed as a key attribute of the future inter-networking paradigm, providing efficient resource management solutions. Among the challenges that need yet to be addressed is the necessity to provide dynamic quality differentiated network services. In addition, it is required to guarantee the availability of network resources in response to workload fluctuations. Finally, it is necessary to periodically re-optimize the resource provisioning to be able to provide efficient resource utilization. These challenges are the motivation behind this work which aimed at developing a novel adaptive resource management model based on network virtualization. First, the proposed work describes a novel Virtual-Network-as-a-Service (VNaaS) model offering differentiated network-aware cloud services, resulting in a guarantee for the quality of the offered applications. This is achieved by enabling the cloud application providers to accurately express their dynamic needs, demand constraints and their network latency tolerance. The proposed work also enables the infrastructure provider to offer Elasticity-as-a-Service (EaaS) for the communication links by estimating and reserving the adequate pool of resources needed to fulfill the network workload fluctuations. This EaaS is offered at differentiated levels according to the hosted applications bandwidth-sensitivity. Finally, the proposed work employs a novel network resource re-optimization technique. The latter efficiently performs rearrangement for the VN portions contributing to the fragmentation of the underlying network. Simulation results demonstrate the effectiveness of the presented work and the significant gains achieved in terms of better adaptive network resource management.
|
6 |
Benchmarking Virtual Network Mapping AlgorithmsZhu, Jin 01 January 2012 (has links) (PDF)
The network architecture of the current Internet cannot accommodate the deployment of novel network-layer protocols. To address this fundamental problem, network virtualization has been proposed, where a single physical infrastructure is shared among different virtual network slices. A key operational problem in network virtualization is the need to allocate physical node and link resources to virtual network requests. While several different virtual network mapping algorithms have been proposed in literature, it is difficult to compare their performance due to differences in the evaluation methods used. In this thesis work, we proposed VNMBench, a virtual network mapping benchmark that provides a set of standardized inputs and evaluation metrics. Using this benchmark, different algorithms can be evaluated and compared objectively. The benchmark model separate into two parts: static model and dynamic model, which operated in fixed and changed mapping process. We present such an evaluation using three existing virtual network mapping algorithms. We compare the evaluation results of our synthetic benchmark with those of actual Emulab requests to show that VNMBench is sufficiently realistic. We believe this work provides an important foundation to quantitatively evaluating the performance of a critical component in the operation of virtual networks.
|
7 |
Design and evaluation of virtual network migration mechanisms on shared substrateLo, Sau Man 07 January 2016 (has links)
The Internet faces well-known challenges in realizing modifications to the core architecture. To help overcome these limitations, the use of network virtualization has been proposed. Network virtualization enables the deployment of novel network architectures and services on existing Internet infrastructure. Virtual networks run over physical networks and use Internet paths and protocols as essentially a link layer in the virtual network. Virtual networks can also share the resources in the physical substrate. Effective use of the underlying substrate network requires intelligent placement of virtual networks so that underlying resources do not incur over-subscription. Because virtual networks can come and go over time, and underlying networks can experience their own dynamic changes, virtual networks need to be migrated---re-mapped to the physical network during active operation---to maintain good performance. While virtual network placement, and to a lesser extent migration, has been studied in the past, little attention has been devoted to designing, deploying, and evaluating migration mechanisms for virtual networks. In this dissertation, we design virtual network migration mechanisms for different substrate platforms and further design a system to mitigate the effects of virtual network migration. In particular this dissertation makes the following contributions:
1. With the goal of minimizing the disruption during a virtual network migration, we design three algorithms for scheduling the sequence of virtual router moves that takes a virtual network from its original placement to its new placement.
2. We design and implement a controller-based architecture for virtual network migration on PlanetLab. This work explores the challenges in implementing virtual network migration on real infrastructure. Recommendations are given for infrastructure that support virtual network migration.
3. We propose and implement a mechanism to mitigate the performance degradation resulting from virtual network migration through transport and application layer collaboration. We utilize a centralized controller to notify the end-systems or the gateways about the time of the virtual network migration such that we prevent packet loss to the application traffic of the end-systems.
|
8 |
Resource Allocation, and Survivability in Network Virtualization EnvironmentsRahman, Muntasir Raihan January 2010 (has links)
Network virtualization can offer more flexibility and better manageability for the future Internet by allowing multiple heterogeneous virtual networks (VN) to coexist on a shared infrastructure provider (InP) network. A major challenge in this respect is the VN embedding problem that deals with the efficient mapping of virtual resources on InP network resources. Previous research focused on heuristic algorithms for the VN embedding problem assuming that the InP network remains operational at all times. In this thesis, we remove that assumption by formulating the survivable virtual network embedding (SVNE) problem and developing baseline policy heuristics and an efficient hybrid policy heuristic to solve it. The hybrid policy is based on a fast re-routing strategy and utilizes a pre-reserved quota for backup on each physical link. Our evaluation results show that our proposed heuristic for SVNE outperforms baseline heuristics in terms of long term business profit for the InP, acceptance ratio, bandwidth efficiency, and response time.
|
9 |
Resource Allocation, and Survivability in Network Virtualization EnvironmentsRahman, Muntasir Raihan January 2010 (has links)
Network virtualization can offer more flexibility and better manageability for the future Internet by allowing multiple heterogeneous virtual networks (VN) to coexist on a shared infrastructure provider (InP) network. A major challenge in this respect is the VN embedding problem that deals with the efficient mapping of virtual resources on InP network resources. Previous research focused on heuristic algorithms for the VN embedding problem assuming that the InP network remains operational at all times. In this thesis, we remove that assumption by formulating the survivable virtual network embedding (SVNE) problem and developing baseline policy heuristics and an efficient hybrid policy heuristic to solve it. The hybrid policy is based on a fast re-routing strategy and utilizes a pre-reserved quota for backup on each physical link. Our evaluation results show that our proposed heuristic for SVNE outperforms baseline heuristics in terms of long term business profit for the InP, acceptance ratio, bandwidth efficiency, and response time.
|
10 |
An Evaluation of SDN Based Network Virtualization TechniquesJanuary 2016 (has links)
abstract: With the software-defined networking trend growing, several network virtualization controllers have been developed in recent years. These controllers, also called network hypervisors, attempt to manage physical SDN based networks so that multiple tenants can safely share the same forwarding plane hardware without risk of being affected by or affecting other tenants. However, many areas remain unexplored by current network hypervisor implementations. This thesis presents and evaluates some of the features offered by network hypervisors, such as full header space availability, isolation, and transparent traffic forwarding capabilities for tenants. Flow setup time and throughput are also measured and compared among different network hypervisors. Three different network hypervisors are evaluated: FlowVisor, VeRTIGO and OpenVirteX. These virtualization tools are assessed with experiments conducted on three different testbeds: an emulated Mininet scenario, a physical single-switch testbed, and also a remote GENI testbed. The results indicate that network hypervisors bring SDN flexibility to network virtualization, making it easier for network administrators to define with precision how the network is sliced and divided among tenants. This increased flexibility, however, may come with the cost of decreased performance, and also brings additional risks of interoperability due to a lack of standardization of virtualization methods. / Dissertation/Thesis / Masters Thesis Engineering 2016
|
Page generated in 0.1143 seconds