The 3GPP Long Term Evolution (LTE) is considered as a dominant future cellular wireless technology in terms of performance and user experience. With technological advancement of the wireless networks, dependencies and business impact of the mobile network services have increased phenomenally. It is, therefore, crucial to address the issues regarding network infrastructure or service failure. In this thesis, a self-healing solution is presented for the LTE Evolved Packet Core (EPC) with a view to maintaining service continuity in the event of core network elements - the MME and S-GW failures. The core network element failures have significant impact on a larger number of subscribers in comparison to the access network element failures. In the proposed self-healing scheme, the restoration mechanisms and associate failover recovery procedures with regards to service survivability are described in details from the LTE network and protocol perspective. This thesis studies two different self-healing approaches - the centralized active-backup and distributed active-active and conducts simulation for each approach in various failure scenarios. The performances of each of these scenarios are evaluated in terms of service restoration time, throughput, EPS (Evolved Packet System) bearer delay etc. The results show that the proposed self-healing system can ensure service continuity at a certain level if resources are properly provisioned. And in terms of restoration delay, in general, the active-backup configuration performs better than the active-active configuration. The thesis presents analytical and simulation methods to estimate signaling message overhead at the LTE EPC that arises due to the recovery process. It also analyzes the bandwidth requirements of the signaling traffic that is incurred by the other operational procedures of the self-healing scheme and their ramification to the LTE core network. / UOIT

No description available.

No description available.

This thesis work focuses on designing a survivable IP-core network with the minimal investment of spare capacity. A span-oriented spare capacity allocation (SCA) scheme is proposed to satisfy customers' availability requirements in the end-to-end (E2E) sense. The novelty of the proposed SCA scheme is that it meets the E2E availability requirements despite the lack of knowledge of E2E bandwidth by employing protection rings covering all links in the network. Different ring selection methods are presented and also compared from the aspect of network redundancy and LP feasibility which provide more flexibility to the design. The proposed SCA algorithm further minimizes total cost of spare capacity by incorporating partial protection within the proposed architecture. The simulation results show that it can significantly reduce the spare capacity consumption depending on the availability. The proposed SCA scheme also performs better in terms of redundancy than that of two other dominant methods available these days.

This thesis work focuses on designing a survivable IP-core network with the minimal investment of spare capacity. A span-oriented spare capacity allocation (SCA) scheme is proposed to satisfy customers' availability requirements in the end-to-end (E2E) sense. The novelty of the proposed SCA scheme is that it meets the E2E availability requirements despite the lack of knowledge of E2E bandwidth by employing protection rings covering all links in the network. Different ring selection methods are presented and also compared from the aspect of network redundancy and LP feasibility which provide more flexibility to the design. The proposed SCA algorithm further minimizes total cost of spare capacity by incorporating partial protection within the proposed architecture. The simulation results show that it can significantly reduce the spare capacity consumption depending on the availability. The proposed SCA scheme also performs better in terms of redundancy than that of two other dominant methods available these days.

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.

Thesis (M.S.)--Massachusetts Institute of Technology, 2002. / Includes bibliographical references (p. 51.52). Also available online.

Decision makers often present military researchers with a most daunting challenge: to pursue, with some level of prophetic certainty, innovative concepts that will yield increased capabilities during future wars against forecasted threats in not-yet- determined locations. This conundrum is complicated further with the requirement that the proposed technology yield benefit throughout the various strata of military operations. In the maturation of an advanced capability enabled by a technological advancement, a groundbreaking design should simultaneously demonstrate performance overmatch against an envisioned foe while showing that the costs associated with development, procurement, and operation outweigh reverting to an incremental advancement in the conventional means of delivering combat power. This manuscript focuses on the construction and utilization of decision support tools for use by scientists and engineers charged with providing a quantitative evaluation of an advanced ground combat system. The concepts presented focus on the effects and synergy regarding the combat vehicle principal attributes of survivability, lethality, and mobility. Additionally, this study provides a framework for analysis of these attributes when screened at the tactical, operational, and strategic levels of war. These concepts are presented and demonstrated from both the candidate selection (or choice) perspective, and the concept development (or design) perspective. As an example of this approach, this study includes a comparison of conventional powder gun cannonry versus a specific type of electromagnetic launch device known as the railgun. The decision support tools formulated in this dissertation allow the user to distill, at a coarse level of fidelity, the parametric relationships between system survivability, lethality, and mobility for advanced weapon system concepts. The proposed methods are suited for evaluation at the nascent stages of development, when the information normally applied in standard methods is sparse. This general approach may also be valuable in contemporary acquisition strategies employed in urgent fielding efforts, where the immediacy of the problem can benefit from an expedient and efficient method of analyzing the coupled and synergistic effects of implementing a proposed technology. While advantage is typically measured in terms of performance overmatch at the platform level, the broadening of this consideration vertically to higher levels of military command can aid in identifying the competing issues and complementary relationships related to a technical approach. Finally, given the backdrop demonstration for the framework, this manuscript may serve as a brief summary of system fundamentals and design theory for direct fire powder gun cannonry and electromagnetic railguns. / text

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.

Optical networks based on Wavelength Division Multiplexing (WDM) technology show many clear benefits in terms of high capacity, flexibility and low power consumption. All these benefits make WDM networks the preferred choice for today’s and future transports solutions which are strongly driven by a plethora of emerging online services. In such a scenario, capability to provide high capacity during the service provisioning phase is of course very important, but it is not the only requirement that plays a central role. Traffic dynamicity is another essential aspect to consider because in many scenarios, e.g., in the case of real time multimedia services, the connections are expected to be provisioned and torn down quickly and relatively frequently. High traffic dynamicity may put a strain on the network control and management operations (i.e., the overhead due to control message exchange can grow rapidly) that coordinate any provisioning mechanisms. Furthermore, survivability, in the presence of new failure scenarios that goes beyond the single failure assumption, is still of the utmost importance to minimize the network disruptions and data losses. In other words, protection against any possible future failure scenario where multiple faults may struck simultaneously, asks for highly reliable provisioning solutions. The above consideration have a general validity i.e., can be equally applied to any network segment and not just limited to the core part. So, we also address the problem of service provisioning in the access paradigm. Long reach Passive Optical Networks (PONs) are gaining popularity due to their cost, reach, and bandwidth advantages in the access region. In PON, the design of an efficient bandwidth sharing mechanism between multiple subscribers in the upstream direction is crucial. In addition, Long Reach PONs (LR-PONs) introduces additional challenges in terms of packet delay and network throughput, due to their extended reach. It becomes apparent that effective solutions to the connection provisioning problem in both the core and access optical networks with respect to the considerations made above can ensure a truly optimal end-to-end connectivity while making an efficient usage of resources. The first part of this thesis focuses on a control and management framework specifically designed for concurrent resource optimization in WDM-based optical networks in a highly dynamic traffic scenario. The framework and the proposed provisioning strategies are specifically designed with the objective of: (i) allowing for a reduction of the blocking probability and the control overhead in a Path Computation Element (PCE)-based network architecture, (ii)  optimizing resource utilization for a traffic scenario that require services with diverse survivability requirements which are achieved by means of  dedicated and shared path-protection, and (iii) designing provisioning mechanism that guarantees high connection availability levels in Double Link Failures (DLF) scenarios. The presented results show that the proposed dynamic provisioning approach can significantly improve the network blocking performance while making an efficient use of primary/backup resources whenever protection is required by the provisioned services. Furthermore, the proposed DLF schemes show good performance in terms of minimizing disruption periods, and allowing for enhanced network robustness when specific services require high connection availability levels. In the second part of this thesis, we propose efficient resource provisioning strategies for LR-PON. The objective is to optimize the bandwidth allocation in LR-PONs, in particular to: (i) identify the performance limitations associated with traditional (short reach) TDM-PON based Dynamic Bandwidth Allocation (DBA) algorithms when employed in long reach scenarios, and (ii) devise efficient DBA algorithms that can mitigate the performance limitations imposed by an extended reach. Our proposed schemes show noticeable performance gains when compared with conventional DBA algorithms for short-reach PON as well as specifically devised approaches for long reach. / <p>QC 20130520</p>