No description available.

No description available.

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.

Due to the tremendous growth of traffic volume caused by both exponential increase of number of Internet users and continual emergence of new bandwidth demanding applications, high capacity networks are required in order to satisfactorily handle the extremely large amount of traffic. Hence, optical fiber communication is the key technology for the network infrastructure. This thesis addresses design, analysis and simulation of access and core networks targeting important research problems, which need to be tackled for the effective realization of next generation optical networks. Among different fiber access architectures, passive optical network (PON) is considered as the most promising alternative for the last mile connection due to its relatively low cost and resource efficiency. The inherent bursty nature of the user generated traffic results in dynamically changing bandwidth demand on per subscriber basis. In addition, access networks are required to support differentiated quality of service and accommodate multiple service providers. To address these problems we proposed three novel scheduling algorithms to efficiently realize dynamic bandwidth allocation in PON, along with guaranteeing both the priority and fairness of the differentiated services among multiple users and/or service providers. Meanwhile, because of the increasing significance of reliable access to network services, an efficient fault management mechanism needs to be provided in PON. In addition, access networks are very cost sensitive and the cost of protection should be kept as low as possible. Therefore, we proposed three novel cost-effective protection architectures keeping in mind that reliability requirement in access networks should be satisfied at the minimal cost. Regarding the optical core networks, replacing electronic routers with all-optical switching nodes can offer significant advantages in realizing high capacity networks. Because of the technological limitations for realizing all-optical nodes, the focus is put on the ingenious architecture design. Therefore, we contributed on novel switching node architectures for optical circuit and packet switching networks. Furthermore, we addressed different aspects of routing and wavelength assignment (RWA) problem, which is an important and hard task to be solved in wavelength routed networks. First, we proposed an approach based on the information summary protocol to reduce the large amount of control overhead needed for dissemination of the link state information in the case of adaptive routing. In addition, transparency in optical networks may cause vulnerability to physical layer attacks. To target this critical security related issue, we proposed an RWA solution to minimize the possible reachability of a jamming attack. Finally, in order to evaluate our ideas we developed two tailor-made simulators based on discrete event driven system for the detailed studies of PON and switched optical networks. Moreover, the proposed tabu search heuristic for our RWA solution was implemented in C++. / QC 20100707

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.

A datacenter hosts hundreds of thousands of servers and a huge amount of bandwidth is required to accommodate communication between thousands of servers. Several packet switched based datacenter architectures are proposed to cater the high bandwidth requirement using multilayer network topologies, however at the cost of increased network complexity and high power consumption. In recent years, the focus has shifted from packet switching to optical circuit switching to build the data center networks as it can support on demand connectivity and high bit rates with low power consumption. On the other hand, with the advent of Software Defined Networking (SDN) and Network Function Virtualization (NFV), the role of datacenters has become more crucial. It has increased the need of dynamicity and flexibility within a datacenter adding more complexity to datacenter networking. With NFV, service chaining can be achieved in a datacenter where virtualized network functions (VNFs) running on commodity servers in a datacenter are instantiated/terminated dynamically. A datacenter also needs to cater large capacity requirement as service chaining involves steering of large aggregated flows. Use of optical circuit switching in data center networks is quite promising to meet such dynamic and high capacity traffic requirements. In this thesis work, a novel and modular optical data center network (DCN) architecture that uses multi-directional wavelength switches (MD-WSS) is introduced. VNF service chaining use case is considered for evaluation of this DCN and the end-to-end service chaining problem is formulated as three inter-connected sub-problems: multiplexing of VNF service chains, VNFs placement in the datacenter and routing and wavelength assignment. This thesis presents integer linear programming (ILP) formulation and heuristics for solving these problems, and numerically evaluate them. / Ett datacenter inrymmer hundratusentals servrar och en stor mängd bandbredd krävs för att skicka data mellan tusentals servrar. Flera datacenter baserade på paketförmedlande arkitekturer föreslås för att tillgodose kravet på hög bandbredd med hjälp av flerskiktsnätverkstopologier, men på bekostnad av ökad komplexitet i nätverken och hög energiförbrukning. Under de senaste åren har fokus skiftat från paketförmedling till optisk kretsomkoppling for att bygga datacenternätverk som kan stödja på-begäran-anslutningar och höga bithastigheter med låg strömförbrukning. Å andra sidan, med tillkomsten av Software Defined Networking (SDN) och nätverksfunktionen Virtualisering (NFV), har betydelsen av datacenter blivit mer avgörande. Det har ökat behovet av dynamik och flexibilitet inom ett datacenter, vilket leder till storre komplexitet i datacenternätverken. Med NFV kan tjänstekedjor åstadkommas i ett datacenter, där virtualiserade nätverksfunktioner (VNFs) som körs på servrar i ett datacenter kan instansieras och avslutas dynamiskt. Ett datacenter måste också tillgodose kravet på stor kapacitet eftersom tjänstekedjan innebär styrning av stora aggregerade flöden. Användningen av optisk kretsomkoppling i datacenternätverk ser ganska lovande ut for att uppfylla sådana trafikkrav dynamik och hög kapacitet. I detta examensarbete, har en ny och modulär optisk datacenternätverksarkitektur (DCN) som använder flerriktningvåglängdsswitchar (MD-WSS) införs. Ett användningsfall av VNF-tjänstekedjor noga övervägd för utvärdering av denna DCN och end-to-end-servicekedjans problem formuleras som tre sammankopplade delproblem: multiplexering av VNF-servicekedjor, VNF placering i datacentret och routing och våglängd uppdrag. Denna avhandling presenterar heltalsprogrammering (ILP) formulering och heuristik för att lösa dessa problem och numeriskt utvärdera dem.