A survey of network virtualization

a b s t r a c t Due to the existence of multiple stakeholders with conflicting goals and policies, alterations to the existing Internet architecture are now limited to simple incremental updates; deployment of any new, radically different technology is next to impossible. To fend off this ossification, network virtualization has been propounded as a diversifying attribute of the future inter-networking paradigm. By introducing a plurality of heterogeneous network architectures cohabiting on a shared physical substrate, network virtualization promotes innovations and diversified applications. In this paper, we survey the existing technologies and a wide array of past and state-of-the-art projects on network virtualization followed by a discussion of major challenges in this area

Network virtualization in next-generation cellular networks: a spectrum pooling approach

The hardship of expanding the cellular network market results from the tremendous high cost of mobile infrastructure, i.e. the capital expenditures (CAPEX) and the operational expenditures (OPEX). Spectrum Sharing is one of the proposed solution for the high-cost of scalability of cellular networks. However, most of the proposed spectrum pooling frameworks in the literature are mostly approached from a technical view besides there are no good cost models based on real datasets for quantifying the circumstances under which sharing the spectrum and network resources would be beneficial to mobile operators. In this thesis, by studying different sharing scenarios in a fiber-based backhaul mobile network, we assess the incentives for service providers (SPs) to share spectrum/infrastructure in different cellular market areas/economic areas (CMA/BEAs) with different population density, allocated bandwidth (BW), spectrum bid values and considering different network topologies. Moreover, we look at the technical problem of sharing the spectrum between two SPs sharing the same basestation (BS), yet they have different traffic demand as well as different QoS constraints. We design a resource allocation scheme to provision real-time (RT), non-real-time (NRT) as well as Ultra-reliable Low Latency Communications (URLLC) traffic in a single shared BS scenario such that SPs achieve isolation, fairness and enforce their QoS constraints. Finally, we exploit spectrum pooling to develop an approach for dynamically re-configuring the base stations that survive a disaster and are powered by a microgrid to form a multi-hop mesh network in order to provide local cellular service

Identity Management and Resource Allocation in the Network Virtualization Environment

Due to the existence of multiple stakeholders with conflicting goals and policies, alterations to the existing Internet architecture are now limited to simple incremental updates; deployment of any new, radically different technology is next to impossible. To fend off this ossification, network virtualization has been propounded as a diversifying attribute of the future inter-networking paradigm. In this talk, we provide an overview of the network virtualization environment (NVE) and address two basic problems in this emerging field of networking research. The identity management problem is primarily concerned with ensuring interoperability across heterogeneous identifier spaces for locating and identifying end hosts in different virtual networks. We describe the architectural and the functional components of a novel identity management framework (iMark) that enables end-to-end connectivity across heterogeneous virtual networks in the NVE without revoking their autonomy. The virtual network embedding problem deals with the mapping of virtual nodes and links onto physical network resources. We argue that the separation of the node mapping and the link mapping phases in the existing algorithms considerably reduces the solution space and degrades embedding quality. We propose coordinated node and link mapping to devise two algorithms (D-ViNE and R-ViNE) for the online version of the problem under realistic assumptions and compare their performance with the existing heuristics