Design of a fast and resource-efficient fault management system in optical networks to suit real-time multimedia applications

Today\u27s telecommunications networks are relying more and more on optical fibers as their physical medium. Currently the Wavelength Division Multiplexing technology enables hundreds of wavelengths to be multiplexed on a single fiber. Using this technology capacity can be dramatically increased, even to the order of Terabits per second. While WDM technology has given a satisfactory answer to the ever-increasing demand for capacity, there is still a problem which needs to be handled efficiently: survivability. Our proposed fault restoration system optimized between restoration cost and speed. We extended the concept of Forward Equivalence Class (FEC) in Multi Protocol Label switching (MPLS) to our proposed fault restoration system. Speed was found to be in the order of 1 to 3 microseconds using predesigned protection, depending on the configuration of the system. Optimization was done between restoration speed and cost by introducing a priority field in the packet header

Protection and restoration algorithms for WDM optical networks

Currently, Wavelength Division Multiplexing (WDM) optical networks play a major role in supporting the outbreak in demand for high bandwidth networks driven by the Internet. It can be a catastrophe to millions of users if a single optical fiber is somehow cut off from the network, and there is no protection in the design of the logical topology for a restorative mechanism. Many protection and restoration algorithms are needed to prevent, reroute, and/or reconfigure the network from damages in such a situation. In the past few years, many works dealing with these issues have been reported. Those algorithms can be implemented in many ways with several different objective functions such as a minimization of protection path lengths, a minimization of restoration times, a maximization of restored bandwidths, etc. This thesis investigates, analyzes and compares the algorithms that are mainly aimed to guarantee or maximize the amount of remaining bandwidth still working over a damaged network. The parameters considered in this thesis are the routing computation and implementation mechanism, routing characteristics, recovering computation timing, network capacity assignment, and implementing layer. Performance analysis in terms of the restoration efficiency, the hop length, the percentage of bandwidth guaranteed, the network capacity utilization, and the blocking probability is conducted and evaluated

Virtual Topology Design for Minimizing Network Diameter and Average Hop Count in WDM Networks

We design virtual topologies in wavelength division multiplexing (WDM) networks to minimize the network diameter and average hop count, where network diameter refers to the number of hops of the longest shortest path and average hop count is the average number of hops among the shortest paths of all node pairs. Such objectives are important to WDM networks, especially to those with statistical multiplexing mechanisms such as optical burst switching (OBS) and optical packet switching (OPS). By minimizing the network diameter and average hop count, optical packets or bursts will experience less contention loss and smaller delay due to a reduced number of intermediate nodes en route. In this paper, we first formulate an integer linear program (ILP) for optimal design of virtual topologies with minimized network diameter and average hop count. Then, a novel heuristic least weight minimum diameter (LWMD) is proposed to find good solutions efficiently. Based on the virtual topology obtained, we further design two traffic accommodation schemes to provision wavelengths under a given traffic matrix, with guaranteed network diameter and minimized network resource consumption.published_or_final_versio

Providing Survivability In Optical Wdm Mesh Networks Considering Adaptation

Tez (Yüksek Lisans) -- İstanbul Teknik Üniversitesi, Fen Bilimleri Enstitüsü, 2007Thesis (M.Sc.) -- İstanbul Technical University, Institute of Science and Technology, 2007Internet kullanımının artışı ile birlikte, hızla büyüyen bant genişliği isteklerini karşılayabilecek olan optik WDM ağları, gelecekteki en uygun Internet omurgaları haline gelmiştir. Oluşabilecek herhangi bir bağlantı hatası, o bağlantı üzerinden geçen tüm ışık yollarının başarısızlığına yol açabilir. Bu yüzden, optik WDM ağları etkili hata bağışıklığı yöntemlerine ihtiyaç duymaktadır.Optik WDM ağlarındaki hata bağışıklığı problemini etkili bir şekilde giderebilmek için son günlerde bir çok yöntem sunulmuştur. Bu yöntemler arasında paylaşılan yol ile koruma yöntemi etkin kaynak kullanımı sağlayabildiğinden, en umut verici yöntemlerden biri olarak görülmektedir. Bu yöntemde yedek ışık yolları, eğer ilişkili birincil ışık yolları karşılıklı olarak farklı ise yani ortak bağ kullanmıyor iseler, dalga boyu paylaşımı yapabilemekdirler. Bu özelliğinden dolayı paylaşılan yol ile koruma yöntemi, yedek ışık yollarına daha az kaynak ayrılmasını sağlar ve diğer koruma yöntemlerinden daha iyi performans gösterir. Bu çalışmada, bir optik WDM ağına dinamik olarak gelen bağlantı isteklerine cevap verilirken, paylaşılan yol ile koruma ve yeniden yönlendirme özelliğini kullanan etkili bir yöntem geliştirilmiştir. Adaptasyon sağlayan paylaşılan yol ile koruma yöntemi olarak adlandıralan yeni yaklaşım, dinamik trafik akışında yedek yolların yol açtığı fazla kaynak tüketimini azaltmak için zaman içinde ağı yeni durumlara adapte edebilen, etkili yani daha çok isteğe cevap verilebilen bir servis sağlayabilmektedir. Bağlantıların öncelik beklentisine göre yeniden yönlendirme yapma özelliğinden dolayı servis seviyesinde anlaşma sağlayabilen bir yaklaşımdır.WDM optical networks are able to meet the rapid growth of bandwidth demands and are considered to be the most appropriate choice of future Internet backbone. However, the failure of a network component such as a fiber link can lead to the failure of all the lightpaths that traverse the failed link. Therefore, the huge bandwidth of WDM also requires efficient survivability mechanisms. Recently, new techniques have been proposed to efficiently deal with this problem in mesh networks. Among them, shared-path protection is a promising candidate because of its desirable resource efficiency, which is a result from effective backup sharing. Backup paths can share wavelength channels, when their corresponding working paths are mutually diverse. Therefore, shared-path protection can outperform other protection techniques based on the dedicated reservation of backup capacity. In this work, we focus on rerouting feature to design an efficient algorithm, called Adaptable Shared Path Protection (ASPP), for dynamic provisioning of shared-path-protected connections in optical mesh networks employing WDM. In particular, backup-channel capacity reservation in shared-protection causes too much resource consumption parallel to network load. ASPP provides the adaptation of network against dynamic traffic, and decreases blocking probability thanks to rerouting capability of paths. Also, ASPP can present SLA by providing an uninterrupted traffic flow for connection requests come with a high priority.Yüksek LisansM.Sc

Dynamic routing of reliability-differentiated connections in WDM optical networks

Master'sMASTER OF ENGINEERIN

Resource Management in Survivable Multi-Granular Optical Networks

The last decade witnessed a wild growth of the Internet traffic, promoted by bandwidth-hungry applications such as Youtube, P2P, and VoIP. This explosive increase is expected to proceed with an annual rate of 34% in the near future, which leads to a huge challenge to the Internet infrastructure. One foremost solution to this problem is advancing the optical networking and switching, by which abundant bandwidth can be provided in an energy-efficient manner. For instance, with Wavelength Division Multiplexing (WDM) technology, each fiber can carry a mass of wavelengths with bandwidth up to 100 Gbits/s or higher. To keep up with the traffic explosion, however, simply scaling the number of fibers and/or wavelengths per fiber results in the scalability issue in WDM networks. One major motivation of this dissertation is to address this issue in WDM networks with the idea of waveband switching (WBS). This work includes the author\u27s study on multiple aspects of waveband switching: how to address dynamic user demand, how to accommodate static user demand, and how to achieve a survivable WBS network. When combined together, the proposed approaches form a framework that enables an efficient WBS-based Internet in the near future or the middle term. As a long-term solution for the Internet backbone, the Spectrum Sliced Elastic Optical Path (SLICE) Networks recently attract significant interests. SLICE aims to provide abundant bandwidth by managing the spectrum resources as orthogonal sub-carriers, a finer granular than wavelengths of WDM networks. Another important component of this dissertation is the author\u27s timely study on this new frontier: particulary, how to efficiency accommodate the user demand in SLICE networks. We refer to the overall study as the resource management in multi-granular optical networks. In WBS networks, the multi-granularity includes the fiber, waveband, and wavelength. While in SLICE networks, the traffic granularity refers to the fiber, and the variety of the demand size (in terms of number of sub-carriers)

Route recovery schemes for link and node failure and link congestion

Link/Node failure occurs frequently causing service disruption in computer networks. Hardware techniques have been developed to protect the network from Link/Node failure. These techniques work in physical layer, therefore their convergence time is very small. On the other hand, many schemes have been proposed to mitigate the failure influence on the network. These schemes work in upper layers such as the network layer. However, hardware solutions faster than other schemes, but they are expensive. Link/Node failure causes all flows which were using the failed link/node are temporarily interrupted till a new path reestablished. Three recovery algorithms have been proposed that mitigate the changes occur in the network. These changes are link/node failure and link congestion. The algorithms mainly pre-compute a backup next hop for each destination in the network. This path is feasible to accommodate re-routed traffic when a failure occurs without causing congestion or loops. Simulations have been conducted to show the performance of the proposed algorithms using ns2 network simulation tool. The results show fast recovery for all flows were using the link/node failure. Furthermore, the throughput per node also increases due to decrease interruption service time

Survivability stategies in all optical networks.

Thesis (M.Sc.Eng.)-University of KwaZulu-Natal, 2006.Thesis (M.Sc.)-University of KwaZulu-Natal, 2006.Recent advances in fiber optics technology have enabled extremely high-speed transport of different forms of data, on multiple wavelengths of an optical fiber, using Dense Wavelength Division Multiplexing (DWDM). It has now become possible to deploy high-speed, multi-service networks using DWDM technology. As the amount of traffic carried has increased, any single failure can be catastrophic. Survivability becomes indispensable in such networks. Therefore, it is imperative to design networks that can quickly and efficiently recover from failures. Most research to date in survivable optical network design and operation focuses on single link failures, however, the occurrence of multiple-link failures are not uncommon in networks today. Multi-link failure scenarios can arise out of two common situations. First, an arbitrary link may fail in the network, and before that link can be repaired, another link fails, thus creating a multi-link failure sequence. Secondly, it might happen in practice that two distinct physical links may be routed via the same common duct or physical channel. A failure at that shared physical location creates a logical multiple-link failure. In this dissertation, we conduct an intensive study of mechanisms for achieving survivability in optical networks. From the many mechanisms presented in the literature the focus of this work was on protection as a mechanism of survivability. In particular four protection schemes were simulated and their results analyzed to ascertain which protection scheme achieves the best survivability in terms of number of wavelengths recovered for a specific failure scenario. A model network was chosen and the protection schemes were evaluated for both single and multiple link and node failures. As an indicator of the performance of these protection schemes over a period of time average service availability and average loss in traffic for each protection scheme was also simulated. Further simulations were conducted to observe the percentage link and node utilization of each scheme hence allowing us to determine the strain each protection scheme places on network resources when traffic in the network increases. Finally based on these simulation results, recommendations of which protection scheme and under what failure conditions they should be used are made.Recent advances in fiber optics technology have enabled extremely high-speed transpor

Multi-layer survivability in IP-over-WDM networks

Ph.DDOCTOR OF PHILOSOPH