Quality Analysis in Phase Modulated Radio Over Fiber in WDM/DWDM Network

There has been increasing demand for connection setup with a higher quality of service (QoS) in WDM/DWDM networks, especially in fields like radio over fibers, where phase modulation affects the link quality. Hence to meet guaranteed QoS in a phase modulated link, the effects of phase modulation on link quality is very much needed. The link quality is termed as quality factor (Q-factor). The primary objective is to use effectively the connections available to optimize the computed number of connections and reduce the blocked connections but at the same time guarantying QoS as per client’s need. The analysis has been done by taking care of routing and wavelength assignment (RWA) techniques. The performance analysis is presented in terms of blocking probability. This work includes detailed mathematical analysis of how phase modulation affects link Q-factor.Eight bands complimentary inner outer band, four bands complimentary inner outer band, and middle outer band wavelength assignment techniques are used for analysis.Blocking probability versus connection requests, blocking probability versus wavelengths assigned, connections accepted for a given source-destination pair were analyzed for different wavelength assignment techniques

Investigation of the tolerance of wavelength-routed optical networks to traffic load variations.

This thesis focuses on the performance of circuit-switched wavelength-routed optical network with unpredictable traffic pattern variations. This characteristic of optical networks is termed traffic forecast tolerance. First, the increasing volume and heterogeneous nature of data and voice traffic is discussed. The challenges in designing robust optical networks to handle unpredictable traffic statistics are described. Other work relating to the same research issues are discussed. A general methodology to quantify the traffic forecast tolerance of optical networks is presented. A traffic model is proposed to simulate dynamic, non-uniform loads, and used to test wavelength-routed optical networks considering numerous network topologies. The number of wavelengths required and the effect of the routing and wavelength allocation algorithm are investigated. A new method of quantifying the network tolerance is proposed, based on the calculation of the increase in the standard deviation of the blocking probabilities with increasing traffic load non-uniformity. The performance of different networks are calculated and compared. The relationship between physical features of the network topology and traffic forecast tolerance is investigated. A large number of randomly connected networks with different sizes were assessed. It is shown that the average lightpath length and the number of wavelengths required for full interconnection of the nodes in static operation both exhibit a strong correlation with the network tolerance, regardless of the degree of load non-uniformity. Finally, the impact of wavelength conversion on network tolerance is investigated. Wavelength conversion significantly increases the robustness of optical networks to unpredictable traffic variations. In particular, two sparse wavelength conversion schemes are compared and discussed: distributed wavelength conversion and localized wavelength conversion. It is found that the distributed wavelength conversion scheme outperforms localized wavelength conversion scheme, both with uniform loading and in terms of the network tolerance. The results described in this thesis can be used for the analysis and design of reliable WDM optical networks that are robust to future traffic demand variations

Dynamic routing and load balancing in IP-over-WDM networks

Master'sMASTER OF ENGINEERIN

Computation of Dispersion Penalty for the Analysis of WDM Link Quality

The provisioning of light path over WDM/DWDM network is a challenging factor, which depends on various physical layer impairments such as dispersion in fiber. We proposed a light path provisioning mechanism by considering the effect of dispersion in fiber termed as dispersion penalty, which is the prominent effect at high speed WDM network. In the case of non-ideal filter, light path provisioning without considering the physical layer impairments does not satisfy the signal quality guaranteed transmission. In this algorithm, Quality of Service is described in terms of dispersion penalty values with an assumption that the entire client has a requirement of penalty less than 2 Db. Here we have analyzed the degradation in bit rate due to the effect of dispersion. The maximum possible length of fiber is also reduced due to high dispersion in fiber. Dispersion penalty is the increment in the received power to eliminate the effect of some undesirable distortion in optical fiber. Dispersion penalty is calculated in terms of bit rate and band width for each data path. The proposal of dispersion penalty budgeting is to ensure that the optical power reaching the receiver is adequate under all circumstances. The proposed algorithm defines a mechanism for effective light path provisioning by comparing the requirement of client and the available resources of the network

New contention resolution techniques for optical burst switching

Optical burst switching (OBS) is a technology positioned between wavelength routing and optical packet switching that does not require optical buffering or packet-level parsing, and it is more efficient than circuit switching when the sustained traffic volume does not consume a full wavelength. However, several critical issues still need to be solved such as contention resolution without optical buffering which is a key determinant of packet-loss with a significant impact on network performance. Deflection routing is an approach for resolving contention by routing a contending packet to an output port other than the intended output port. In OBS networks, when contention between two bursts cannot be resolved through deflection routing, one of the bursts will be dropped. However, this scheme doesn’t take advantage of all the available resources in resolving contentions. Due to this, the performance of existing deflection routing scheme is not satisfactory. In this thesis, we propose and evaluate three new strategies which aim at resolving contention. We propose a new approach called Backtrack on Deflection Failure, which provides a second chance to blocked bursts when deflection failure occurs. The bursts in this scheme, when blocked, will get an opportunity to backtrack to the previous node and may get routed through any deflection route available at the previous node. Two variants are proposed for handling the backtracking delay involved in this scheme namely: (a) Increase in Initial Offset and (b) Open-Loop Reservation. Furthermore, we propose a third scheme called Bidirectional Reservation on Burst Drop in which bandwidth reservation is made in both the forward and the backward directions simultaneously. This scheme comes into effect only when control bursts get dropped due to bandwidth unavailability. The retransmitted control bursts will have larger offset value and because of this, they will have lower blocking probability than the original bursts. The performance of our schemes and of those proposed in the literature is studied through simulation. The parameters considered in evaluating these schemes are blocking probability, average throughput, and overall link utilization. The results obtained show that our schemes perform significantly better than their standard counterparts

Particle swarm optimization for routing and wavelength assignment in next generation WDM networks.

PhDAll-optical Wave Division Multiplexed (WDM) networking is a promising technology for long-haul backbone and large metropolitan optical networks in order to meet the non-diminishing bandwidth demands of future applications and services. Examples could include archival and recovery of data to/from Storage Area Networks (i.e. for banks), High bandwidth medical imaging (for remote operations), High Definition (HD) digital broadcast and streaming over the Internet, distributed orchestrated computing, and peak-demand short-term connectivity for Access Network providers and wireless network operators for backhaul surges. One desirable feature is fast and automatic provisioning. Connection (lightpath) provisioning in optically switched networks requires both route computation and a single wavelength to be assigned for the lightpath. This is called Routing and Wavelength Assignment (RWA). RWA can be classified as static RWA and dynamic RWA. Static RWA is an NP-hard (non-polynomial time hard) optimisation task. Dynamic RWA is even more challenging as connection requests arrive dynamically, on-the-fly and have random connection holding times. Traditionally, global-optimum mathematical search schemes like integer linear programming and graph colouring are used to find an optimal solution for NP-hard problems. However such schemes become unusable for connection provisioning in a dynamic environment, due to the computational complexity and time required to undertake the search. To perform dynamic provisioning, different heuristic and stochastic techniques are used. Particle Swarm Optimisation (PSO) is a population-based global optimisation scheme that belongs to the class of evolutionary search algorithms and has successfully been used to solve many NP-hard optimisation problems in both static and dynamic environments. In this thesis, a novel PSO based scheme is proposed to solve the static RWA case, which can achieve optimal/near-optimal solution. In order to reduce the risk of premature convergence of the swarm and to avoid selecting local optima, a search scheme is proposed to solve the static RWA, based on the position of swarm‘s global best particle and personal best position of each particle. To solve dynamic RWA problem, a PSO based scheme is proposed which can provision a connection within a fraction of a second. This feature is crucial to provisioning services like bandwidth on demand connectivity. To improve the convergence speed of the swarm towards an optimal/near-optimal solution, a novel chaotic factor is introduced into the PSO algorithm, i.e. CPSO, which helps the swarm reach a relatively good solution in fewer iterations. Experimental results for PSO/CPSO based dynamic RWA algorithms show that the proposed schemes perform better compared to other evolutionary techniques like genetic algorithms, ant colony optimization. This is both in terms of quality of solution and computation time. The proposed schemes also show significant improvements in blocking probability performance compared to traditional dynamic RWA schemes like SP-FF and SP-MU algorithms

Management of Spectral Resources in Elastic Optical Networks

Recent developments in the area of mobile technologies, data center networks, cloud computing and social networks have triggered the growth of a wide range of network applications. The data rate of these applications also vary from a few megabits per second (Mbps) to several Gigabits per second (Gbps), thereby increasing the burden on the Inter- net. To support this growth in Internet data traffic, one foremost solution is to utilize the advancements in optical networks. With technology such as wavelength division multiplexing (WDM) networks, bandwidth upto 100 Gbps can be exploited from the optical fiber in an energy efficient manner. However, WDM networks are not efficient when the traffic demands vary frequently. Elastic Optical Networks (EONs) or Spectrum Sliced Elastic Optical Path Networks (SLICE) or Flex-Grid has been recently proposed as a long-term solution to handle the ever-increasing data traffic and the diverse demand range. EONs provide abundant bandwidth by managing the spectrum resources as fine-granular orthogonal sub-carriers that makes it suitable to accommodate varying traffic demands. However, the Routing and Spectrum Allocation (RSA) algorithm in EONs has to follow additional constraints while allocating sub-carriers to demands. These constraints increase the complexity of RSA in EONs and also, make EONs prone to the fragmentation of spectral resources, thereby decreasing the spectral efficiency. The major objective of this dissertation is to study the problem of spectrum allocation in EONs under various network conditions. With this objective, this dissertation presents the author\u27s study and research on multiple aspects of spectrum allocation in EONs: how to allocate sub-carriers to the traffic demands, how to accommodate traffic demands that varies with time, how to minimize the fragmentation of spectral resources and how to efficiently integrate the predictability of user demands for spectrum assignment. Another important contribution of this dissertation is the application of EONs as one of the substrate technologies for network virtualization

QoS for the selection of OVPN connection and wavelength assignmen

Optical networking is a promising solution to the increasing bandwidth requirements of today’s communication networks. The never-ending challenge is to look for the technology which improve network capacity, consistency and cost. So QoS for the optical virtual private network (OVPN) using wavelength-division multiplexing (WDM) is having an important role in telecommunication application. In this work, we propose a centralized OVPN control manager. The network can be defined by various network and physical layer parameters. Further these parameters are used by optical virtual private network control manager for the calculation of Q-factor of OVPN connections. Then among them it selects an OVPN connection which is best in quality so that it will satisfy the requirement of client which is attached to the network. In the network , the network layer parameters and the physical layer parameters have impact on quality of connection. This is known as physical layer impairments constraints. The effect of physical layer impairments can be analyzed .It is important to consider the process, which provide network and physical layer impairment information to OVPN control manager. In this we discuss about the improvement in blocking probability by using routing by proposed algorithm, the shortest path algorithm and wavelength assignment