Resource Allocation Schemes And Performance Evaluation Models For Wavelength Division Multiplexed Optical Networks

Wavelength division multiplexed (WDM) optical networks are rapidly becoming the technology of choice in network infrastructure and next-generation Internet architectures. WDM networks have the potential to provide unprecedented bandwidth, reduce processing cost, achieve protocol transparency, and enable efficient failure handling. This dissertation addresses the important issues of improving the performance and enhancing the reliability of WDM networks as well as modeling and evaluating the performance of these networks. Optical wavelength conversion is one of the emerging WDM enabling technologies that can significantly improve bandwidth utilization in optical networks. A new approach for the sparse placement of full wavelength converters based on the concept of the k-Dominating Set (k-DS) of a graph is presented. The k-DS approach is also extended to the case of limited conversion capability using three scalable and cost-effective switch designs: flexible node-sharing, strict node-sharing and static mapping. Compared to full search algorithms previously proposed in the literature, the K-DS approach has better blocking performance, has better time complexity and avoids the local minimum problem. The performance benefit of the K-DS approach is demonstrated by extensive simulation. Fiber delay line (FDL) is another emerging WDM technology that can be used to obtain limited optical buffering capability. A placement algorithm, k-WDS, for the sparse placement of FDLs at a set of selected nodes in Optical Burst Switching (OBS) networks is proposed. The algorithm can handle both uniform and non-uniform traffic patterns. Extensive performance tests have shown that k-WDS provides more efficient placement of optical fiber delay lines than the well-known approach of placing the resources at nodes with the highest experienced burst loss. Performance results that compare the benefit of using FDLs versus using optical wavelength converters (OWCs) are presented. A new algorithm, A-WDS, for the placement of an arbitrary numbers of FDLs and OWCs is introduced and is evaluated under different non-uniform traffic loads. This dissertation also introduces a new cost-effective optical switch design using FDL and a QoS-enhanced JET (just enough time) protocol suitable for optical burst switched WDM networks. The enhanced JET protocol allows classes of traffic to benefit from FDLs and OWCs while minimizing the end-to-end delay for high priority bursts. Performance evaluation models of WDM networks represent an important research area that has received increased attention. A new analytical model that captures link dependencies in all-optical WDM networks under uniform traffic is presented. The model enables the estimation of connection blocking probabilities more accurately than previously possible. The basic formula of the dependency between two links in this model reflects their degree of adjacency, the degree of connectivity of the nodes composing them and their carried traffic. The usefulness of the model is illustrated by applying it to the sparse wavelength converters placement problem in WDM networks. A lightpath containing converters is divided into smaller sub-paths such that each sub-path is a wavelength continuous path and the nodes shared between these sub-paths are full wavelength conversion capable. The blocking probability of the entire path is obtained by computing the blocking probabilities of the individual sub-paths. The analytical-based sparse placement algorithm is validated by comparing it with its simulation-based counterpart using a number of network topologies. Rapid recovery from failure and high levels of reliability are extremely important in WDM networks. A new Fault Tolerant Path Protection scheme, FTPP, for WDM mesh networks based on the alarming state of network nodes and links is introduced. The results of extensive simulation tests show that FTPP outperforms known path protection schemes in terms of loss of service ratio and network throughput. The simulation tests used a wide range of values for the load intensity, the failure arrival rate and the failure holding time. The FTPP scheme is next extended to the differentiated services model and its connection blocking performance is evaluated. Finally, a QoS-enhanced FTPP (QEFTPP) routing and path protection scheme in WDM networks is presented. QEFTPP uses preemption to minimize the connection blocking percentage for high priority traffic. Extensive simulation results have shown that QEFTPP achieves a clear QoS differentiation among the traffic classes and provides a good overall network performance

Placement of Mode and Wavelength Converters for Throughput Enhancement in Optical Networks

The success of recent experiments to transport data using combined wavelength division multiplexed (WDM) and mode-division multiplexed (MDM) transmission has generated optimism for the attainment of optical networks with unprecedented bandwidth capacity, exceeding the fundamental Shannon capacity limit attained by WDM alone. Optical mode converters and wavelength converters are devices that can be placed in future optical nodes (routers) to prevent or reduce the connection blocking rate and consequently increase network throughput. In this thesis, the specific problem of the placement of mode converters (MC) and mode-wavelength converters (MWC) in combined mode and wavelength division multiplexing (MWDM) networks is investigated. Four previously proposed wavelength converter placement heuristics are extended to handle the placement of MC and MWC in MWDM networks. A simple but effective method for the placement of mode and wavelength converters in MWDM networks is proposed based on ranking the nodes with respect to the volume of received connection requests. The results of extensive simulation tests to evaluate the new method and compare its performance with the performance of the other four heuristics are presented. The thesis provides extensive comparison results among the five converter placement methods using different network topologies and under different network loads. The results demonstrate the effectiveness of the new proposed method in achieving lower blocking rates compared to the other more-complex converter placement heuristics

Network Load Based Analysis of Blocking Probability in WDM Network

Arrangement of expansible quality of service (QoS) attestation on wavelength division multiplexing (WDM) is a crucial and perplexing problem of the cutting threshold internet. From the essential performance parameters the blocking probability (BP) computation is a QoS adept in WDM network. This method of BP computation in a wavelength routed optical network (WRON) is presented, keep in mind that blocking-probability computation used only to a network that is remain same where, traffic demands arrive, wait for a convinced time, and finally dispense, so that the total traffic intensity for a time is same i.e. remain unchanged. For an active optical network (AON), despite the fact we lag behind that traffic loads will reach, wait for a fixed time, and afterword dispense, same we taken into account that the normalized intensity of traffic existing of a network is going to increase gradually with time as the number of users receiving on the typical network and also growth in their networking essentials towards large bandwidth uses, extended holding time uses, etc. Hence, blocking probability computation try not to use meanwhile traffic is not fixed. Otherwise, we have to take into account of "exhaustion probability," having a time duration, lastly we anticipated that the network is to run into capacity exhaust. The realization traffic distribution of network performs to achieve an exact blocking performance. So the BP for each available link having a shortest path or having a large weight in a sorted order taken into account, in the network the connection and node relation for the traffic between each link is dependant. The usefulness of this technique is to be applicable in low load region, exact, faster compare to other techniques. Furthermore, this technique is more useful to calculate the estimation of blocking probability per node as well as for the network

Improving Routing Efficiency, Fairness, Differentiated Servises And Throughput In Optical Networks

Wavelength division multiplexed (WDM) optical networks are rapidly becoming the technology of choice in next-generation Internet architectures. This dissertation addresses the important issues of improving four aspects of optical networks, namely, routing efficiency, fairness, differentiated quality of service (QoS) and throughput. A new approach for implementing efficient routing and wavelength assignment in WDM networks is proposed and evaluated. In this approach, the state of a multiple-fiber link is represented by a compact bitmap computed as the logical union of the bitmaps of the free wavelengths in the fibers of this link. A modified Dijkstra\u27s shortest path algorithm and a wavelength assignment algorithm are developed using fast logical operations on the bitmap representation. In optical burst switched (OBS) networks, the burst dropping probability increases as the number of hops in the lightpath of the burst increases. Two schemes are proposed and evaluated to alleviate this unfairness. The two schemes have simple logic, and alleviate the beat-down unfairness problem without negatively impacting the overall throughput of the system. Two similar schemes to provide differentiated services in OBS networks are introduced. A new scheme to improve the fairness of OBS networks based on burst preemption is presented. The scheme uses carefully designed constraints to avoid excessive wasted channel reservations, reduce cascaded useless preemptions, and maintain healthy throughput levels. A new scheme to improve the throughput of OBS networks based on burst preemption is presented. An analytical model is developed to compute the throughput of the network for the special case when the network has a ring topology and the preemption weight is based solely on burst size. The analytical model is quite accurate and gives results close to those obtained by simulation. Finally, a preemption-based scheme for the concurrent improvement of throughput and burst fairness in OBS networks is proposed and evaluated. The scheme uses a preemption weight consisting of two terms: the first term is a function of the size of the burst and the second term is the product of the hop count times the length of the lightpath of the burst

Comparative Analysis of Routing and Wavelength Assignment Algorithms used

Abstract: This study aims at highlighting the Routing and Wavelength Assignment (RWA) problems in WDM Optical networks and describes the Routing Algorithms and their performance comparison. Since routing decisions play an important role in evaluating the blocking performance of a network it is critical to choose a wavelength assignment scheme that should take into account its compatibility with the chosen routing protocol in addition to its blocking performance. This study presents problems in Wavelength Assignment, describes various Routing schemes and different approaches to solve both the static and the dynamic RWA problems. RWA algorithms' role is to assign a light-path (a route and a wavelength) to incoming calls in a network. RWA algorithms block calls if a continuous wavelength from source to destination cannot be found (wavelength blocking), thus degrading the performance of All Optical Networks, by call blocking. The failure of RWA algorithm to find an available wavelength on all links from source to destination causes congestion resulting in packet loss. This study examines the RWA algorithms and their problems in WDM Optical networks. The various measures taken to improve the blocking performance of WDM optical networks are also studied. We compared the performance of two wavelength assignment schemes, the Random wavelength assignment and the First-Fit wavelength assignment scheme via simulation. It was observed that the Random wavelength assignment algorithm performs well under low load, while for high load First Fit algorithm performs better

Management and Control of Scalable and Resilient Next-Generation Optical Networks

Two research topics in next-generation optical networks with wavelength-division multiplexing (WDM) technologies were investigated: (1) scalability of network management and control, and (2) resilience/reliability of networks upon faults and attacks. In scalable network management, the scalability of management information for inter-domain light-path assessment was studied. The light-path assessment was formulated as a decision problem based on decision theory and probabilistic graphical models. It was found that partial information available can provide the desired performance, i.e., a small percentage of erroneous decisions can be traded off to achieve a large saving in the amount of management information. In network resilience under malicious attacks, the resilience of all-optical networks under in-band crosstalk attacks was investigated with probabilistic graphical models. Graphical models provide an explicit view of the spatial dependencies in attack propagation, as well as computationally efficient approaches, e.g., sum-product algorithm, for studying network resilience. With the proposed cross-layer model of attack propagation, key factors that affect the resilience of the network from the physical layer and the network layer were identified. In addition, analytical results on network resilience were obtained for typical topologies including ring, star, and mesh-torus networks. In network performance upon failures, traffic-based network reliability was systematically studied. First a uniform deterministic traffic at the network layer was adopted to analyze the impacts of network topology, failure dependency, and failure protection on network reliability. Then a random network layer traffic model with Poisson arrivals was applied to further investigate the effect of network layer traffic distributions on network reliability. Finally, asymptotic results of network reliability metrics with respect to arrival rate were obtained for typical network topologies under heavy load regime. The main contributions of the thesis include: (1) fundamental understandings of scalable management and resilience of next-generation optical networks with WDM technologies; and (2) the innovative application of probabilistic graphical models, an emerging approach in machine learning, to the research of communication networks.Ph.D.Committee Chair: Ji, Chuanyi; Committee Member: Chang, Gee-Kung; Committee Member: McLaughlin, Steven; Committee Member: Ralph, Stephen; Committee Member: Zegura, Elle

Stochastische Analyse und lernbasierte Algorithmen zur Ressourcenbereitstellung in optischen Netzwerken

The unprecedented growth in Internet traffic has driven the innovations in provisioning of optical resources as per the need of bandwidth demands such that the resource utilization and spectrum efficiency could be maximized. With the advent of the next generation flexible optical transponders and switches, the flexible-grid-based elastic optical network (EON) is foreseen as an alternative to the widely deployed fixed-grid-based wavelength division multiplexing networks. At the same time, the flexible resource provisioning also raises new challenges for EONs. One such challenge is the spectrum fragmentation. As network traffic varies over time, spectrum gets fragmented due to the setting up and tearing down of non-uniform bandwidth requests over aligned (i.e., continuous) and adjacent (i.e., contiguous) spectrum slices, which leads to a non-optimal spectrum allocation, and generally results in higher blocking probability and lower spectrum utilization in EONs. To address this issue, the allocation and reallocation of optical resources are required to be modeled accurately, and managed efficiently and intelligently. The modeling of routing and spectrum allocation in EONs with the spectrum contiguity and spectrum continuity constraints is well-investigated, but existing models do not consider the fragmentation issue resulted by these constraints and non-uniform bandwidth demands. This thesis addresses this issue and considers both the constraints to computing exact blocking probabilities in EONs with and without spectrum conversion, and with spectrum reallocation (known as defragmentation) for the first time using the Markovian approach. As the exact network models are not scalable with respect to the network size and capacity, this thesis proposes load-independent and load-dependent approximate models to compute approximate blocking probabilities in EONs. Results show that the connection blocking due to fragmentation can be reduced by using a spectrum conversion or a defragmentation approach, but it can not be eliminated in a mesh network topology. This thesis also deals with the important network resource provisioning task in EONs. To this end, it first presents algorithmic solutions to efficiently allocate and reallocate spectrum resources using the fragmentation factor along spectral, time, and spatial dimensions. Furthermore, this thesis highlights the role of machine learning techniques in alleviating issues in static provisioning of optical resources, and presents two use-cases: handling time-varying traffic in optical data center networks, and reducing energy consumption and allocating spectrum proportionately to traffic classes in fiber-wireless networks.Die flexible Nutzung des Spektrums bringt in Elastischen Optischen Netze (EON) neue Herausforderungen mit sich, z.B., die Fragmentierung des Spektrums. Die Fragmentierung entsteht dadurch, dass die Netzwerkverkehrslast sich im Laufe der Zeit ändert und so wird das Spektrum aufgrund des Verbindungsaufbaus und -abbaus fragmentiert. Das für eine Verbindung notwendige Spektrum wird durch aufeinander folgende (kontinuierliche) und benachbarte (zusammenhängende) Spektrumsabschnitte (Slots) gebildet. Dies führt nach den zahlreichen Reservierungen und Freisetzungen des Spektrums zu einer nicht optimalen Zuordnung, die in einer höheren Blockierungs-wahrscheinlichkeit der neuen Verbindungsanfragen und einer geringeren Auslastung von EONs resultiert. Um dieses Problem zu lösen, müssen die Zuweisung und Neuzuordnung des Spektrums in EONs genau modelliert und effizient sowie intelligent verwaltet werden. Diese Arbeit beschäftigt sich mit dem Fragmentierungsproblem und berücksichtigt dabei die beiden Einschränkungen: Kontiguität und Kontinuität. Unter diesen Annahmen wurden analytische Modelle zur Berechnung einer exakten Blockierungswahrscheinlichkeit in EONs mit und ohne Spektrumskonvertierung erarbeitet. Außerdem umfasst diese Arbeit eine Analyse der Blockierungswahrscheinlichkeit im Falle einer Neuzuordnung des Sprektrums (Defragmentierung). Diese Blockierungsanalyse wird zum ersten Mal mit Hilfe der Markov-Modelle durchgeführt. Da die exakten analytischen Modelle hinsichtlich der Netzwerkgröße und -kapazität nicht skalierbar sind, werden in dieser Dissertation verkehrslastunabhängige und verkehrslastabhängige Approximationsmodelle vorgestellt. Diese Modelle bieten eine Näherung der Blockierungswahrscheinlichkeiten in EONs. Die Ergebnisse zeigen, dass die Blockierungswahrscheinlichkeit einer Verbindung aufgrund von einer Fragmentierung des Spektrums durch die Verwendung einer Spektrumkonvertierung oder eines Defragmentierungsverfahrens verringert werden kann. Eine effiziente Bereitstellung der optischen Netzwerkressourcen ist eine wichtige Aufgabe von EONs. Deswegen befasst sich diese Arbeit mit algorithmischen Lösungen, die Spektrumressource mithilfe des Fragmentierungsfaktors von Spektral-, Zeit- und räumlichen Dimension effizient zuweisen und neu zuordnen. Darüber hinaus wird die Rolle des maschinellen Lernens (ML) für eine verbesserte Bereitstellung der optischen Ressourcen untersucht und das ML basierte Verfahren mit der statischen Ressourcenzuweisung verglichen. Dabei werden zwei Anwendungsbeispiele vorgestellt und analysiert: der Umgang mit einer zeitveränderlichen Verkehrslast in optischen Rechenzentrumsnetzen, und eine Verringerung des Energieverbrauchs und die Zuweisung des Spektrums proportional zu Verkehrsklassen in kombinierten Glasfaser-Funknetzwerken

A Multi-Objective ILP Formulation for RWA Problem in WDM Networks

All-optical networks employing Wavelength Division Multiplexing (WDM) technique will be the backbone of next generation Internet. In WDM optical networks, each fiber link is logically divided into multiple non-interfering, circuit-switched communication channels known as avelength channels and are identified by the length of the wave.Routing and Wavelength Assignment (RWA) problem is a classical problem in WDM networks. It is further divided into two subproblems: (i) Routing, and (ii)Wavelength Assignment. Routing subproblem finds a route fromsource to destination.Wavelength Assignment subproblem assigns a wavelength to the route established byrouting subproblem. The RWA problem is combinatorial by its nature and belongs to a class of dicult combinatorial optimization problems. The optimal solution to the RWA problem is found to be NP-complete and thus suited to heuristic approaches. RWAproblem is reported in the current literature as an integer linear programming problem (ILP) that typically optimizes a single objective, either minimizes the number amplifiers, the network load or maximizes the number of connections while satisfying power constraints. In this work, we formulated the RWA problem as a multi objective ILP problem. Our primary concern is to establish a loop free lightpath that is immune to signal distortion and crosstalk. An attempt is made to obtain a feasible solution using genetic algorithm (GA). The parameters considered for optimization are congestion among the individual lightpath requests, connection set up time, the number of intermediate hops traversed and the number of fibers used to honor the established connection requests. We onsidered ARPANET (Advanced Research Project Agency NETwork) and NSFNET (National Science Foundation NETwork) for our simulation