72 research outputs found
LOGICAL TOPOLOGY DESIGN FOR SURVIVABILITY IN IP-OVER-WDM NETWORKS
IP-over-WDM networks integrate Wavelength Division Multiplexing (WDM) technology with Internet Protocol (IP) and are widely regarded as the architecture for the next generation high-speed Internet. The problem of designing an IP-over-WDM network can be modeled as an embedding problem in which an IP network is embedded in a WDM network by establishing all optical paths between IP routers in the WDM network. Survivability is considered a vital requirement in such networks, which can be achieved by embedding the IP network in the WDM network in such a way that the IP network stays connected in the presence of failure or failures in the WDM network. Otherwise, some of the IP routers may not be reachable.The problem can be formulated as an Integer Linear Program (ILP), which can be solved optimally but is NP-complete. In this thesis, we have studied and proposed various efficient algorithms that can be used to make IP-over-WDM networks survivable in the presence of a single WDM link (optical fiber cable or cables) failure.First we evaluate an existing approach, named Survivable Mapping Algorithm by Ring Trimming (SMART), which provides survivability for an entire network by successively considering pieces of the network. The evaluation provides much insight into the approach, which allowed us to propose several enhancements. The modified approach with enhancements leads to better performance than the original SMART.We have also proposed a hybrid algorithm that guarantees survivability, if the IP and the WDM networks are at least 2-edge connected. The algorithm uses a combination of proactive (protection) and reactive (restoration) mechanisms to obtain a survivable embedding for any given IP network in any given WDM network.Circuits and cutsets are dual concepts. SMART approach is based on circuits. The question then arises whether there exists a dual methodology based on cutsets. We investigate this question and provide much needed insight. We provide a unified algorithmic framework based on circuits and cutsets. We also provide new methodologies based on cutsets and give a new proof of correctnessof SMART. We also develop a method based on incidence sets that are a special case of cutsets. Noting that for some IP networks a survivable embedding may not exist, the option of adding new IP links is pursued. Comparative evaluations of all the algorithms through extensive simulations are also given in this dissertation
Multi-ring SDH network design over optical mesh networks
Ankara : The Department of Electrical and Electronics Engineering and Sciences of Bilkent University, 2002.Thesis (Master's) -- Bilkent University, 2002.Includes bibliographical references leaves 84-87.The evolution of networks in telecommunications has brought on the
importance of design techniques to obtain survivable and cost-effective transportation
networks. In this thesis, we study Synchronous Digital Hierarchy (SDH) ring design
problem with an interconnected multi-ring architecture overlaid over an optical mesh
network. We decouple the problem into two sub-problems: the first problem is the
SDH ring selection, and the second problem is the mapping of these rings onto the
physical mesh topology. In this structure, the logical topology consists of SDH
Add/Drop Multiplexers (ADMs) and Digital Cross-Connects (DXCs), and the
physical topology consists of Optical Cross-Connects (OXCs).
The ring selection problem is to choose the rings that give minimum inter-ring
traffic in the network. Since inter-ring traffic increases the network cost and
complexity, we aim to minimize the inter-ring traffic. We propose a greedy heuristic
algorithm for this problem that finds a solution subject to the constraint that the
number of nodes on each ring is limited. Numerical results on the ring design problem
are presented for different topologies.
Once the logical topology is obtained, resilient mapping of SDH rings onto the
mesh physical topology is formulated as a Mixed Integer Linear Programming
(MILP) problem. In order to guarantee proper operation of SDH ring protection
against all single failures, each link on an SDH ring must be mapped onto a lightpath
which is link and node disjoint from all other lightpaths comprising the same ring.
The objective of this mapping is to minimize the total fiber cost in the network. We
also apply a post-processing algorithm to eliminate redundant rings. The postprocessing
algorithm is very useful to reduce the cost. We evaluate the performance
of our design algorithm for different networks.Tan, Tuba AkıncılarM.S
Survivability through pre-configured protection in optical mesh networks
Network survivability is a very important issue, especially in optical networks that carry huge amount of traffic. Network failures which may be caused by human errors, malfunctional systems and natural disaster (eg. Earthquakes and lightening storms), have occurred quite frequently and sometimes with unpredictable consequences. Survivability is defined as the ability of the network to maintain the continuity of service against failures of network components. Pre-configuration and dynamic restoration are two schemes for network survivability. For each scheme, survivability algorithms can be applied at either Optical Channel sublayer (Och) known as link-based. Or, Optical Multiplex Section sublayer (OMS) known as path-based. The efficiency of survivability algorithms can be assessed through such criteria as capacity efficiency, restoration time and quality service. Dynamic restoration is more efficient than pre-configuration in terms of capacity resource utilization, but restoration time is longer and 100% service recovery cannot be guaranteed because sufficient spare capacity may not be available at the time of failures. Similarly, path-based survivability offers a high performance scheme for utilizing capacity resource, but restoration time is longer than link based survivability
QoS multicast tree construction in IP/DWDM optical internet by bio-inspired algorithms
Copyright @ Elsevier Ltd. All rights reserved.In this paper, two bio-inspired Quality of Service (QoS) multicast algorithms are proposed in IP over dense wavelength division multiplexing (DWDM) optical Internet. Given a QoS multicast request and the delay interval required by the application, both algorithms are able to find a flexible QoS-based cost suboptimal routing tree. They first construct the multicast trees based on ant colony optimization and artificial immune algorithm, respectively. Then a dedicated wavelength assignment algorithm is proposed to assign wavelengths to the trees aiming to minimize the delay of the wavelength conversion. In both algorithms, multicast routing and wavelength assignment are integrated into a single process. Therefore, they can find the multicast trees on which the least wavelength conversion delay is achieved. Load balance is also considered in both algorithms. Simulation results show that these two bio-inspired algorithms can construct high performance QoS routing trees for multicast applications in IP/DWDM optical Internet.This work was supported in part ny the Program for New Century Excellent Talents in University, the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1, the National Natural Science Foundation of China under Grant no. 60673159 and 70671020, the National High-Tech Reasearch and Development Plan of China under Grant no. 2007AA041201, and the Specialized Research Fund for the Doctoral Program of Higher Education under Grant no. 20070145017
Survivable mesh-network design & optimization to support multiple QoP service classes
Every second, vast amounts of data are transferred over communication systems around the world, and as a result, the demands on optical infrastructures are extending beyond the traditional, ring-based architecture. The range of content and services available from the Internet is increasing, and network operations are constantly under pressure to expand their optical networks in order to keep pace with the ever increasing demand for higher speed and more reliable links
Survivable Virtual Network Embedding in Transport Networks
Network Virtualization (NV) is perceived as an enabling technology for the future Internet and the 5th Generation (5G) of mobile networks. It is becoming increasingly difficult to keep up with emerging applications’ Quality of Service (QoS) requirements in an ossified Internet. NV addresses the current Internet’s ossification problem by allowing the co-existence of multiple Virtual Networks (VNs), each customized to a specific purpose on the shared Internet. NV also facilitates a new business model, namely, Network-as-a-Service (NaaS), which provides a separation between applications and services, and the networks supporting them. 5G mobile network operators have adopted the NaaS model to partition their physical network resources into multiple VNs (also called network slices) and lease them to service providers. Service providers use the leased VNs to offer customized services satisfying specific QoS requirements without any investment in deploying and managing a physical network infrastructure.
The benefits of NV come at additional resource management challenges. A fundamental problem in NV is to efficiently map the virtual nodes and virtual links of a VN to physical nodes and paths, respectively, known as the Virtual Network Embedding (VNE) problem. A VNE that can survive physical resource failures is known as the survivable VNE (SVNE) problem, and has received significant attention recently. In this thesis, we address variants of the SVNE problem with different bandwidth and reliability requirements for transport networks. Specifically, the thesis includes four main contributions. First, a connectivity-aware VNE approach that ensures VN connectivity without bandwidth guarantee in the face of multiple link failures. Second, a joint spare capacity allocation and VNE scheme that provides bandwidth guarantee against link failures by augmenting VNs with necessary spare capacity. Third, a generalized recovery mechanism to re-embed the VNs that are impacted by a physical node failure. Fourth, a reliable VNE scheme with dedicated protection that allows tuning of available bandwidth of a VN during a physical link failure. We show the effectiveness of the proposed SVNE schemes through extensive simulations. We believe that the thesis can set the stage for further research specially in the area of automated failure management for next generation networks
Dynamic Virtual Network Restoration with Optimal Standby Virtual Router Selection
Title form PDF of title page, viewed on September 4, 2015Dissertation advisor: Deep MedhiVitaIncludes bibliographic references (pages 141-157)Thesis (Ph.D.)--School of Computing and Engineering and Department of Mathematics and Statistics. University of Missouri--Kansas City, 2015Network virtualization technologies allow service providers to request partitioned,
QoS guaranteed and fault-tolerant virtual networks provisioned by the substrate network
provider (i.e., physical infrastructure provider). A virtualized networking environment
(VNE) has common features such as partition, flexibility, etc., but fault-tolerance requires
additional efforts to provide survivability against failures on either virtual networks or the
substrate network.
Two common survivability paradigms are protection (proactive) and restoration
(reactive). In the protection scheme, the substrate network provider (SNP) allocates redundant
resources (e.g., nodes, paths, bandwidths, etc) to protect against potential failures
in the VNE. In the restoration scheme, the SNP dynamically allocates resources to restore
the networks, and it usually occurs after the failure is detected.
In this dissertation, we design a restoration scheme that can be dynamically implemented
in a centralized manner by an SNP to achieve survivability against node failures
in the VNE. The proposed restoration scheme is designed to be integrated with a protection
scheme, where the SNP allocates spare virtual routers (VRs) as standbys for the
virtual networks (VN) and they are ready to serve in the restoration scheme after a node
failure has been identified. These standby virtual routers (S-VR) are reserved as a sharedbackup
for any single node failure, and during the restoration procedure, one of the S-VR
will be selected to replace the failed VR. In this work, we present an optimal S-VR selection
approach to simultaneously restore multiple VNs affected by failed VRs, where
these VRs may be affected by failures within themselves or at their substrate host (i.e.,
power outage, hardware failures, maintenance, etc.). Furthermore, the restoration scheme
is embedded into a dynamic reconfiguration scheme (DRS), so that the affected VNs can
be dynamically restored by a centralized virtual network manager (VNM).
We first introduce a dynamic reconfiguration scheme (DRS) against node failures
in a VNE, and then present an experimental study by implementing this DRS over a
realistic VNE using GpENI testbed. For this experimental study, we ran the DRS to
restore one VN with a single-VR failure, and the results showed that with a proper S-VR
selection, the performance of the affected VN could be well restored. Next, we proposed
an Mixed-Integer Linear Programming (MILP) model with dual–goals to optimally select
S-VRs to restore all VNs affected by VR failures while load balancing. We also present a
heuristic algorithm based on the model. By considering a number of factors, we present
numerical studies to show how the optimal selection is affected. The results show that
the proposed heuristic’s performance is close to the optimization model when there were
sufficient standby virtual routers for each virtual network and the substrate nodes have
the capability to support multiple standby virtual routers to be in service simultaneously.
Finally, we present the design of a software-defined resilient VNE with the optimal S-VR
selection model, and discuss a prototype implementation on the GENI testbed.Introduction -- Literature survey -- Dynamic reconfiguration scheme in a VNE -- An experimental study on GpENI-VNI -- Optimal standby virtual router selection model -- Prototype design and implementation on GENI -- Conclusion and future work -- Appendix A. Resource Specification (RSpec) in GENI -- Appendix B. Optimal S-VR Selection Model in AMP
- …