Topology overlays for dedicated protection Ethernet LAN services in advanced SONET/SDH networks

The explosion of information technology (IT) services coupled with much-increased personal and scientific computing capabilities has resulted in great demand for more scalable and reliable networking services. Along these lines, carriers have spent large sums to transition their legacy\u27 SONET/SDH voice-based networking infrastructures to better support client-side Ethernet data interfaces, i.e., next-generation SONET/SDH (NGS). In particular, a key addition here has been the new virtual concatenation (VCAT) feature which supports inverse multiplexing to \u27split\u27 larger connection requests in to a series of independently-routed \u27sub-connections\u27. As these improved infrastructures have been deployed, the design of new Ethernet over SONET/SDH (EoS) services has become a key focus area for carriers, i.e., including point-to-point and multi-point services. In light of the above, this thesis focuses on the study of improved multi-point EoS schemes in NGS networks, i.e., to provision robust \u27virtual LAN\u27 capabilities over metro and wide-area domains. Indeed, as services demands grow, survivability considerations are becoming a key concern. Along these lines, the proposed solution develops novel multi-tiered (partial) protection strategies. Specifically, graph-theoretic algorithms are first proposed to interconnect multi-point node groups using bus and minimum spanning tree (MST) overlays. Next, advanced multi-path routing schemes are used to provision and protect these individual overlay connections using the inverse-multiplexing capabilities of NGS. Finally, post-fault restoration features are also added to handle expanded failure conditions, e.g., multiple failures. The performances of the proposed multi-point EoS algorithms developed in this research are gauged using advanced software-based simulation in the OPNET ModelerTM environment. The findings indicate that both the bus and MST overlays give very good performance in terms of request blocking and carried load. However, the MST-based overlays slightly outperform the bus-based overlays as they allow more efficient topology designs. In addition, the incorporation of dynamic load state information in the selection of bus and/or MST overlays is also very beneficial as opposed to just using static hop count state. Furthermore, inverse-multiplexing is highly-effective, yielding notably higher carried loads when coupled with load-balancing sub-connection routing. Finally, results also show that post-fault restoration is also a very effective means of boosting EoS LAN throughputs for partially-protected demands, consistently matching the reliability of full-protection setups.\u2

Virtual Network Embedding with Path-based Latency Guarantees in Elastic Optical Networks

Elastic Optical Network (EON) virtualization has recently emerged as an enabling technology for 5G network slicing. A fundamental problem in EON slicing (known as Virtual Network Embedding (VNE)) is how to efficiently map a virtual network (VN) on a substrate EON characterized by elastic transponders and flexible grid. Since a number of 5G services will have strict latency requirements, the VNE problem in EONs must be solved while guaranteeing latency targets. In existing literature, latency has always been modeled as a constraint applied on the virtual links of the VN. In contrast, we argue in favor of an alternate modeling that constrains the latency of virtual paths. Constraining latency over virtual paths (vs. over virtual links) poses additional modeling and algorithmic challenges to the VNE problem, but allows us to capture end-to-end service requirements. In this thesis, we first model latency in an EON by identifying the different factors that contribute to it. We formulate the VNE problem with latency guarantees as an Integer Linear Program (ILP) and propose a heuristic solution that can scale to large problem instances. We evaluated our proposed solutions using real network topologies and realistic transmission configurations under different scenarios and observed that, for a given VN request, latency constraints can be guaranteed by accepting a modest increase in network resource utilization. Latency constraints instead showed a higher impact on VN blocking ratio in dynamic scenarios

Dynamic wavelength allocation in IP/WDM metro access networks

Ankara : The Department of Electrical and Electronics Engineering and the Institute of Engineering and Science of Bilkent University, 2008.Thesis (Ph.D.) -- Bilkent University, 2008.Includes bibliographical references leaves 132-139.Increasing demand for bandwidth and proliferation of packet based traffic have been causing architectural changes in the communications infrastructure. In this evolution, metro networks face both the capacity and dynamic adaptability constraints. The increase in the access and backbone speeds result in high bandwidth requirements, whereas the popularity of wireless access and limited number of customers in metro area necessitates traffic adaptability. Traditional architecture which has been optimized for carrying circuit-switched connections, is far from meeting these requirements. Recently, several architectures have been proposed for future metro access networks. Nearly all of these solutions support dynamic allocation of bandwidth to follow fluctuations in the traffic demand. However, reconfiguration policies that can be used in this process have not been fully explored yet. In this thesis, dynamic wavelength allocation (DWA) policies for IP/WDM metro access networks with reconfiguration delays are considered. Reconfiguration actions incur a cost since a portion of the capacity becomes idle in the reconfiguration period due to the signalling latencies and tuning times of optical transceivers. Exact formulation of the DWA problem is developed as a Markov Decision Process (MDP) and a new cost function is proposed to attain both throughput efficiency and fairness. For larger problems, a heuristic approach based on first passage probabilities is developed. The performance of the method is evaluated under both stationary and non-stationary traffic conditions. The effects of relevant network and traffic parameters, such as delay and flow size are also discussed. Finally, performance bounds for the DWA methods are derived.Yetginer, EmrePh.D

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