Two Conditions under which WDM Networks are Rearrangeably Nonblocking without Wavelength Interchangers

Any network’s blocking characteristic depends on its path diversity. WDM networks have path diversity in the space division if the network’s topology is rich in alternate routes and in the wavelength division if the network’s links have many wavelengths or can interchange wavelengths at some nodes. This paper shows that this costly wavelength interchange is not needed if the network’s spatial topology is suffi-ciently rich, and shows that this spatial richness is defined by the classic Clos inequalities

Performance and cost analysis of all-optical switching: OBS and OCS

This paper presents a study of performance and cost analysis of optical circuit switching (OCS) and optical burstswitching (OBS) by proposing the clear images of their node architectures and cost formulations. Then, we apply servicelevel agreement (SLA) of the high quality of service application in the terms of network blocking probability and averagenetwork delay to demonstrate OCS and OBS performances, their investment costs, and network dimensioning methodology.Applying SLA to our studies can illustrate the impact of contention resolution and blocking resolution schemes to theperformances and costs of OBS and OCS, accordingly. The simulations illustrate that OBS applying WC gives the bestperformance among all architectures deploying the same offered bandwidth. The investigations also show that WC is a majortechnique contributing high performance gain to both OCS and OBS. Especially for OBS, WC is an important scheme allowingOBS high data grooming property as its performance gain contributing to OBS is much higher than those of OCS. For thecost analysis, OCS is the most economic among all architectures. BA provides the most cost effectiveness among all OBScontention resolution schemes. Lastly, FDL is the least cost effective scheme as it gives little performance enhancement butadds more cost to the network

Design And Analysis Of Effective Routing And Channel Scheduling For Wavelength Division Multiplexing Optical Networks

Optical networking, employing wavelength division multiplexing (WDM), is seen as the technology of the future for the Internet. This dissertation investigates several important problems affecting optical circuit switching (OCS) and optical burst switching (OBS) networks. Novel algorithms and new approaches to improve the performance of these networks through effective routing and channel scheduling are presented. Extensive simulations and analytical modeling have both been used to evaluate the effectiveness of the proposed algorithms in achieving lower blocking probability, better fairness as well as faster switching. The simulation tests were performed over a variety of optical network topologies including the ring and mesh topologies, the U.S. Long-Haul topology, the Abilene high-speed optical network used in Internet 2, the Toronto Metropolitan topology and the European Optical topology. Optical routing protocols previously published in the literature have largely ignored the noise and timing jitter accumulation caused by cascading several wavelength conversions along the lightpath of the data burst. This dissertation has identified and evaluated a new constraint, called the wavelength conversion cascading constraint. According to this constraint, the deployment of wavelength converters in future optical networks will be constrained by a bound on the number of wavelength conversions that a signal can go through when it is switched all-optically from the source to the destination. Extensive simulation results have conclusively demonstrated that the presence of this constraint causes significant performance deterioration in existing routing and wavelength assignment (RWA) algorithms. Higher blocking probability and/or worse fairness have been observed for existing RWA algorithms when the cascading constraint is not ignored. To counteract the negative side effect of the cascading constraint, two constraint-aware routing algorithms are proposed for OCS networks: the desirable greedy algorithm and the weighted adaptive algorithm. The two algorithms perform source routing using link connectivity and the global state information of each wavelength. Extensive comparative simulation results have illustrated that by limiting the negative cascading impact to the minimum extent practicable, the proposed approaches can dramatically decrease the blocking probability for a variety of optical network topologies. The dissertation has developed a suite of three fairness-improving adaptive routing algorithms in OBS networks. The adaptive routing schemes consider the transient link congestion at the moment when bursts arrive and use this information to reduce the overall burst loss probability. The proposed schemes also resolve the intrinsic unfairness defect of existing popular signaling protocols. The extensive simulation results have shown that the proposed schemes generally outperform the popular shortest path routing algorithm and the improvement could be substantial. A two-dimensional Markov chain analytical model has also been developed and used to analyze the burst loss probabilities for symmetrical ring networks. The accuracy of the model has been validated by simulation. Effective proactive routing and preemptive channel scheduling have also been proposed to address the conversion cascading constraint in OBS environments. The proactive routing adapts the fairness-improving adaptive routing mentioned earlier to the environment of cascaded wavelength conversions. On the other hand, the preemptive channel scheduling approach uses a dynamic priority for each burst based on the constraint threshold and the current number of performed wavelength conversions. Empirical results have proved that when the cascading constraint is present, both approaches would not only decrease the burst loss rates greatly, but also improve the transmission fairness among bursts with different hop counts to a large extent