Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userResearch on Survivability Strategies of Virtual Network
61
0
0.0
(
0
)
Added by
Subhadeep Sahoo
Publication date
2020
fields
Informatics Engineering
and research's language is
English
Authors
Subhadeep Sahoo
Ask ChatGPT about the research
No Arabic abstract
Virtualization facilitates heterogeneous cloud applications to share the same physical infrastructure with admirable flexibility, while resource efficiency and survivability are critical concerns for virtual network embedding (VNE). As more and more internet applications migrate to the cloud, the resource efficiency and the survivability of VNs, such as single link failure or large-scale disaster survivability, have become crucial issues. Separating the VNE problem into node and link mapping sub-problems without coordination might cause a high embedding cost. This dissertation presents two independent approaches to solve the aforementioned challenges. First, we study two-stage coordinated survivable VNE (SVNE) problem and propose an adaptive path splitting based SVNE (APSS) scheme. We first develop a concise anchor node strategy to restrict the solution space of the candidate substrate nodes, which coordinates node mapping with link mapping to limit the distance spans of the virtual links. Then, we employ an adaptive path splitting policy to provide full protection against single-link failures with partial backup resource, and design an agile frequency slot windows choosing mechanism to mitigate the spectrum fragmentation for link resource efficiency. Simulation results demonstrate that the proposed APSS scheme can achieve satisfactory performance in terms of spectrum utilization and blocking ratio. Second, we propose a synchronous evacuation strategy for VNs with dual virtual machines (VMs) inside a disaster risk zone (DRZ), which suffer higher risks than the VNs with single. The evacuation strategy exploits post-copy technique to sustain the online service alive and enhances synchronous VM migrations to shorten the dual-VM evacuation time. Numerical results show that the proposed strategy can outperform the best-effort scheme in terms of average and total evacuation times of dual-VMs.
rate research
Read More
From biosystem to complex system,the study of life is always an important area. Inspired by hyper-cycle theory about the evolution of non-life system, we study the metabolism, self-replication and mutation behavior in the Internet based on node entity, connection relationship and function subgraph--motif--of network topology. Firstly a framework of complex network evolution is proposed to analyze the birth and death phenomena of Internet topology from January 1998 to August 2013. Then we find the Internet metabolism behavior from angle of node, motif to global topology, i.e. one born node is only added into Internet, subsequently takes part in the local reconstruction activities. Meanwhile there are nodes and motifs death. In process of the local reconstruction, although the Internet system replicates motifs repeatedly by adding or removing actions, the system characteristics and global structure are not destroyed. Statistics about the motif M3 which is a full connectivity subgraph shows that the process of its metabolism is fluctuation that causes mutation of Internet. Furthermore we find that mutation is instinctive reaction of Internet when its influenced from inside or outside environment, such as Internet bubble, social network rising and finance crisis. The behaviors of metabolism, self-replication and mutation of Internet indicate its life characteristic as a complex artificial life. And our work will inspire people to study the life-like phenomena of other complex systems from angle of topology structure.
Network virtualization provides a promising solution to overcome the ossification of current networks, allowing multiple Virtual Network Requests (VNRs) embedded on a common infrastructure. The major challenge in network virtualization is the Virtual Network Embedding (VNE) problem, which is to embed VNRs onto a shared substrate network and known to be $mathcal{NP}$-hard. The topological heterogeneity of VNRs is one important factor hampering the performance of the VNE. However, in many specialized applications and infrastructures, VNRs are of some common structural features $textit{e.g.}$, paths and cycles. To achieve better outcomes, it is thus critical to design dedicated algorithms for these applications and infrastructures by taking into accounting topological characteristics. Besides, paths and cycles are two of the most fundamental topologies that all network structures consist of. Exploiting the characteristics of path and cycle embeddings is vital to tackle the general VNE problem. In this paper, we investigated the path and cycle embedding problems. For path embedding, we proved its $mathcal{NP}$-hardness and inapproximability. Then, by utilizing Multiple Knapsack Problem (MKP) and Multi-Dimensional Knapsack Problem (MDKP), we proposed an efficient and effective MKP-MDKP-based algorithm. For cycle embedding, we proposed a Weighted Directed Auxiliary Graph (WDAG) to develop a polynomial-time algorithm to determine the least-resource-consuming embedding. Numerical results showed our customized algorithms can boost the acceptance ratio and revenue compared to generic embedding algorithms in the literature.
A virtual network (VN) contains a collection of virtual nodes and links assigned to underlying physical resources in a network substrate. VN migration is the process of remapping a VNs logical topology to a new set of physical resources to provide failure recovery, energy savings, or defense against attack. Providing VN migration that is transparent to running applications is a significant challenge. Efficient migration mechanisms are highly dependent on the technology deployed in the physical substrate. Prior work has considered migration in data centers and in the PlanetLab infrastructure. However, there has been little effort targeting an SDN-enabled wide-area networking environment - an important building block of future networking infrastructure. In this work, we are interested in the design, implementation and evaluation of VN migration in GENI as a working example of such a future network. We identify and propose techniques to address key challenges: the dynamic allocation of resources during migration, managing hosts connected to the VN, and flow table migration sequences to minimize packet loss. We find that GENIs virtualization architecture makes transparent and efficient migration challenging. We suggest alternatives that might be adopted in GENI and are worthy of adoption by virtual network providers to facilitate migration.
We study the profit maximization problem of a cognitive virtual network operator in a dynamic network environment. We consider a downlink OFDM communication system with various network dynamics, including dynamic user demands, uncertain sensing spectrum resources, dynamic spectrum prices, and time-varying channel conditions. In addition, heterogenous users and imperfect sensing technology are incorporated to make the network model more realistic. By exploring the special structural of the problem, we develop a low-complexity on-line control policies that determine pricing and resource scheduling without knowing the statistics of dynamic network parameters. We show that the proposed algorithms can achieve arbitrarily close to the optimal profit with a proper trade-off with the queuing delay.
Distributed Virtual Private Networks (dVPNs) are new VPN solutions aiming to solve the trust-privacy concern of a VPNs central authority by leveraging a distributed architecture. In this paper, we first review the existing dVPN ecosystem and debate on its privacy requirements. Then, we present VPN0, a dVPN with strong privacy guarantees and minimal performance impact on its users. VPN0 guarantees that a dVPN node only carries traffic it has whitelisted, without revealing its whitelist or knowing the traffic it tunnels. This is achieved via three main innovations. First, an attestation mechanism which leverages TLS to certify a user visit to a specific domain. Second, a zero knowledge proof to certify that some incoming traffic is authorized, e.g., falls in a nodes whitelist, without disclosing the target domain. Third, a dynamic chain of VPN tunnels to both increase privacy and guarantee service continuation while traffic certification is in place. The paper demonstrates VPN0 functioning when integrated with several production systems, namely BitTorrent DHT and ProtonVPN.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
