Priority-aware optical shared protection: An offline evaluation study

Due to the limitations of physical resources, if a large-scale emulation network environment composed of millions of vertices and edges is constructed by virtualization technology, the whole network topology should be partitioned into a set of subnets. The topology partition is a work of graph partition. The existing topology partition methods have shortcomings, such as low efficiency and poor practicability, especially for large-scale network topology. The emulation network is a kind of complex network and has the characteristics of community structure. Therefore, we proposed LENTP (large-scale emulation network topology partition) based on the community detection with the weight of the vertex similarity for large-scale topology partition. In the first stage, the tree-structured area compression reduces the topology scales significantly to improve partition efficiency. And then, the improved Louvain algorithm is used to topology partitioning and obtain an initial set of subnets with the minimum number of subnets and remote links. Finally, after repartitioning and merging for the initial subnets, the result of subnets is the final topology partition that reaches the optimization objectives with the conditions of the virtual resources. In the experiment, the method is tested in five groups of network topology with different scales. The results demonstrate that LENTP can partition the network topology over 1 000 000 nodes and significantly improve the running-time efficiency of the network topology partition. 

OUP accepted manuscript

Evaluation of the availability and unavailability of optical connections is necessary for WDM optical networks to make efficient use of optical resources. Network providers will not be welling to upgrade their current protection plans unless these protection strategies are carefully investigated, providing them with optimal tradeoffs between the required protection degree and the corresponding cost. In this paper, a mathematical model based on the combinatorial and probability theories is developed to evaluate the availability and unavailability of protected optical connections in WDM networks employing M:N dedicated protection. This model works with any number of working and protected paths. Several numerical tests have been performed and their results are presented to investigate the availability and unavailability degrees for different number of working and protection paths. Moreover, we use Monte-Carlo simulation to verify the correctness of our mathematical model. Simulation results confirm not only the correctness of the proposed model but also its potential accuracy. The proposed analytical model provides an efficient tool for network providers to assess the anticipated improvement in the network availability by upgrading their survivability schemes to higher protection classes.

Availability study of M: N automatic protection switching scheme in WDM networks

Survivable services oriented protection level-aware virtual network embedding

The emerging MPLS-TP standard defines new and important recovery requirements for networks deployed with the MPLS technology. MPLS provides several facilities to support protection, but many parameters such as holding and setup priorities as well as the amount of spare capacity must be configured in order to achieve the desired protection level. In this direction, this paper proposes a state-based availability model to help the design of shared-mesh protection schemes for packed-switched paths deployed using MPLS technology. The steady-state probabilities of failure-states in a network can be determined using the MTBF and MTTR of the physical links and other components. Based on this information, the state-based model determines the impact of each failure-state on the availability of all protected paths transported by the network. Using our model, we propose a backup resource planning algorithm that computes the minimum spare capacity required to achieve the desired availability of all protected paths, as well as the strategy for assigning priorities to the backup paths.

A state-based availability model to shared mesh protection in MPLS-TP networks with preemption support

Priority-enabled optical shared protection: An online efficiency evaluation study

The rapid deployment of cloud computing service needs a robust and efficient virtualization layer between the application and the physical hardware. Network Virtualization, which allows the co-existence of various logical networks on shared physical infrastructure, is an important technique to face this challenge. The optimal mapping of virtual resource to physical resource is a major issue in network virtualization. This problem, called virtual network embedding (VNE), has been well explored in the context of one physical domain, which is in practice operated by a single infrastructure provider (InP). However, with the rapid growing of cloud computing services, quite a number of VNs have to be established across multi-domain. For multi-domain VNE, infrastructure providers can no longer just solve their own single domain VNE problem, but have to cooperate to build the whole VN. Therefore, new challenge arises for the multi-domain VNE, compared to traditional single domain VNE. The existing investigations on this problem mainly focus on decomposing a VN to sub VN for each domain, but few attention has been paid to the joint relation between intra-domain and inter-domain (peering) links. In this paper, we propose a multi-domain link mapping framework which combines the intra and peering link mapping so as to optimize the overall resource utilization. Our approach is easy to be deployed since it is based on current Internet architecture. Evaluation shows that our approach, brings improvements related to existing methods.

A Cloud-Oriented Algorithm for Virtual Network Embedding over Multi-Domain

Network virtualization allows the co-existing of logical networks (virtual networks) on physical network (substrate networks). Virtual Network (VN) reliability is a critical problem for end-users and service providers. It aims to ensure service continuity even upon failure. As more and more VNs are created over substrate networks (SN), the failure of a single SN component may lead to the failure of many VNs. Thus, the VN reliability issue is becoming more and more critical. VN reliability can be enhanced in two ways: (1) by failure recovery (post-failure) with protection and/or restoration methods; (2) by failure avoidance with the selection of most reliable components at the network topology setting phase. Traditional virtual network embedding (VNE) methods have mainly focused on bandwidth optimization. In this paper, we focus on the reliability issue. We propose VNE methods which take into account the failure probability of SN components with a failure-avoidance approach, in order to minimize the VN failure probability. Our heuristics are based on the use of Steiner Minimal Tree (SMT). Simulations results confirm that our heuristics provide better reliability against traditional VNE with bandwidth as sole target, and, in case of failure of a SN component, reduce the number of affected VNs.

A failure avoidance oriented approach for virtual network reliability enhancement

Network virtualization allows to establishing multiple independent logical networks through resource sharing of the underlying substrate network To ensure optimal deployment of virtual networks, one has to find an effective mapping between logical resources claimed by the virtual networks and the physical resources belonging to the substrate network This mapping problem, called VNE (Virtual Network Embedding), is NP complete, and is extensively treated in the literature To ensure service continuity even after a failure, the virtual networks must implement protection One of the major issues and challenges is to optimize the resources allocated in the substrate network for the purpose of the protection of virtual networks In this paper, we first present the main VNE approaches and the traditional network protection schemes We then provide a synthetic and critical analysis of methods to protect virtual networks

Survivable Virtual Network Embedding with resource sharing and optimization

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

Ken Chen

Author Tools

Chat about Author