Spare capacity modelling and its applications in survivable iP-over-optical networks

As the interest in IP-over-optical networks are becoming the preferred core network architecture, survivability has emerged as a major concern for network service providers; a result of the potentially huge traffic volumes that will be supported by optical infrastructure. Therefore, implementing recovery strategies is critical. In addition to the traditional recovery schemes based around protection and restoration mechanisms, pre-allocated restoration represents a potential candidate to effect and maintain network resilience under failure conditions. Preallocated restoration technique is particularly interesting because it provides a trade-off in terms of recovery performance and resources between protection and restoration schemes. In this paper, the pre-allocated restoration performance is investigated under single and dual-link failures considering a distributed GMPLSbased IP/WDM mesh network. Two load-based spare capacity optimisation methods are proposed in this paper; Local Spare Capacity Optimisation (LSCO) and Global Spare Capacity Optimisation (GSCO)

Priority based dynamic lightpath allocation in WDM networks.

Internet development generates new bandwidth requirement every day. Optical networks employing WDM (wavelength division multiplexing) technology can provide high capacity, low error rate and low delay. They are considered to be future backbone networks. Since WDM networks usually operate in a high speed, network failure (such as fiber cut), even for a short term, can cause huge data lost. So design robust WDM network to survive faults is a crucial issue in WDM networks. This thesis introduces a new and efficient MILP (Mixed Integer Linear Programming) formulation to solve dynamic lightpath allocation problem in survivable WDM networks, using both shared and dedicated path protection. The formulation defines multiple levels of service to further improve resource utilization. Dijkstra\u27s shortest path algorithm is used to pre-compute up to 3 alternative routes between any node pair, so as to limit the lightpath routing problem within up to 3 routes instead of whole network-wide. This way can shorten the solution time of MILP formulation; make it acceptable for practical size network. Extensive experiments carried out on a number of networks show this new MILP formulation can improve performance and is feasible for real-life network. Source: Masters Abstracts International, Volume: 43-01, page: 0249. Adviser: Arunita Jaekel. Thesis (M.Sc.)--University of Windsor (Canada), 2004

Resource Allocation in Survivable WDM Networks Under a Sliding Scheduled Traffic Model

In recent years there has been an increasing number of applications that require periodic use of lightpaths at predefined time intervals, such as database backup and on-line classes. A new traffic model, referred to as the scheduled traffic model, has been proposed to handle such scheduled lightpath demands. In this thesis we present two new integer linear program ( ILP) formulations for the more general sliding scheduled traffic model, where the setup and teardown times may vary within a specified range. We consider both wavelength convertible networks and networks without wavelength conversion capability. Our ILP formulations jointly optimize the problem of scheduling the demands ( in time) and allocating resources for the scheduled lightpaths. Simulation results show that our formulations are able to generate optimal solutions for practical sized networks. For larger networks, we have proposed a fast two-step heuristic to solve the demand scheduling problem and the RWA problem separately

Service level agreement framework for differentiated survivability in GMPLS-based IP-over-optical networks

In the next generation optical internet, GMPLS based IP-over-optical networks, ISPs will be required to support a wide variety of applications each having their own requirements. These requirements are contracted by means of the SLA. This paper describes a recovery framework that may be included in the SLA contract between ISP and customers in order to provide the required level of survivability. A key concern with such a recovery framework is how to present the different survivability alternatives including recovery techniques, failure scenario and layered integration into a transparent manner for customers. In this paper, two issues are investigated. First, the performance of the recovery framework when applying a proposed mapping procedure as an admission control mechanism in the edge router considering a smart-edge simple-core GMPLS-based IP/WDM network is considered. The second issue pertains to the performance of a pre-allocated restoration and its ability to provide protected connections under different failure scenarios

Resource Allocation for Periodic Traffic Demands in WDM Networks

Recent research has clearly established that holding-time-aware routing and wavelength assignment (RWA) schemes lead to significant improvements in resource utilization for scheduled traffic. By exploiting the knowledge of the demand holding times, this thesis proposes new traffic grooming techniques to achieve more efficient resource utilization with the goal of minimizing resources such as bandwidth, wavelength channels, transceivers, and energy consumption. This thesis also introduces a new model, the segmented sliding window model, where a demand may be decomposed into two or more components and each component can be sent separately. This technique is suitable for applications where continuous data transmission is not strictly required such as large file transfers for grid computing. Integer linear program (ILP) formulations and an efficient heuristic are put forward for resource allocation under the proposed segmented sliding window model. It is shown that the proposed model can lead to significantly higher throughput, even over existing holding-time-aware models

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

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)

Optimization of WDM Optical Networks

Optical network, with its enormous data carrying capability, has become the obvious choice for today\u27s high speed communication networks. Wavelength Division Multiplexing (WDM) technology and Traffic Grooming techniques enable us to efficiently exploit the huge bandwidth capacity of optical fibers. Wide area translucent networks use sparse placement of regenerators to overcome the physical impairments and wavelength constraints introduced by all optical (transparent) networks, and achieve a performance level close to fully switched (opaque) networks at a much lesser network cost. In this dissertation we discuss our research on several issues on the optimal design of optical networks, including optimal traffic grooming in WDM optical networks, optimal regenerator placement problem (RRP) in translucent networks, dynamic lightpath allocation and dynamic survivable lightpath allocation in translucent networks and static lightpath allocation in translucent networks. With extensive simulation experiments, we have established the effectiveness and efficiencies of our proposed algorithms