Search

Today, large amounts of data, growing from terabytes to petabytes, need to be transferred across the globe in a timely manner. To accommodate this efficiently, network operators are augmenting their networks to 100 Gbps links and beyond. The spectrum-sliced elastic optical path network (SLICE) architecture enables accommodation of variable-rate data traffic in a highly spectrum-efficient manner. The blocking in SLICE networks observed in literature is much lower than on traditional fixed grid WDM networks. Still, the current routing and spectrum allocation (RSA) algorithms have potential for blocking performance improvements. To increase the spectral efficiency, we introduce a concept called routing, spectrum, and segment allocation (RSSA). We propose several novel continuous and non-continuous time heuristics based on the concept of RSSA. We consider dynamic advance reservation traffic requests over SLICE networks and evaluate the performance of the proposed RSSA heuristics. Through extensive simulations, we observe that our continuous-time, non-contiguous spectrum RSSA heuristics outperform existing heuristics in terms of both blocking probability and spectral utilization.

We investigate the problem of provisioning light-paths for dynamic advance reservation (AR) requests in all-optical wavelength division multiplexed networks. We propose a two-phase novel routing, slot, and wavelength assignment (RWSA) technique called Non-Continuous Single-Slot Advance Reservation (NC-SSAR). We propose two NC-SSAR heuristics, one with only lightpath segmentation (SEG-NC-SSAR) and the other with lightpath segmentation and lightpath switching (LPS-NC-SSAR). We briefly discuss three baseline RWSA heuristics and compare them with the proposed heuristics. Through extensive simulations, we show that the proposed NC-SSAR heuristics can solve the RWSA problem more effectively and efficiently by providing significantly lower blocking and reducing the overall signaling in the network by minimizing the number of lightpath switches, compared to the baseline RWSA heuristics.1

In this paper we investigate the problem of provisioning dynamic anycast holding-time-aware (HTA) lightpaths in all-optical wavelength division multiplexed (WDM) networks. We employ a technique called lightpath switching (LPS) wherein the data transmission may begin on one lightpath and switch to a different lightpath at a later time. We propose two heuristics to solve the anycast routing and wavelength assignment (RWA) problem: anycast with continuous segment (ACS) and anycast with lightpath switching (ALPS). We first compare the performance of ACS to ALPS and observe that ALPS achieves better blocking than ACS. Furthermore, we also compare the performance of these two anycast RWA algorithms to the traditional unicast RWA algorithm. We show that the anycast RWA algorithms presented here significantly out-perform the traditional unicast RWA algorithms.

In this paper we investigate the problem of provisioning lightpaths for dynamic advance reservation (AR) requests in all-optical wavelength division multiplexed (WDM) networks. We propose a novel routing, slot, and wavelength assignment (RSWA) technique called single-slot advance reservation (SSAR) which takes a two phase approach, namely request provisioning phase (RPP) and request allocation phase (RAP).We compare the performance of this algorithm with a recently proposed baseline RSWA heuristic: all-slots advance reservation (ASAR) under no constraints on request duration and book-ahead times. We show that blocking in SSAR is only due to capacity constraint and simulation results show significant improvement over ASAR heuristic. Moreover SSAR has a very simple control structure, as described in detail in this paper.

Current scientific data applications require advanced network provisioning systems to support the transport of large volumes of data. Due to the availability of diverse computing and Grid clusters, these applications can benefit from anycasting capabilities. In contrast to unicasting, anycast routing allows the selection of a node from a group of candidate destinations. This new means of communication allows for greater routing flexibility and better network resource consumption. However, current provisioning systems do not provide fully compliant anycast implementations. In this paper, we extend ESnet’s OSCARS virtual circuit provisioning system with anycast routing capabilities to support destination-agnostic applications on single- and multi-domain network scenarios. The proposed implementation significantly improves provisioning success over the native unicast implementation in compliance with the existing OSCARS framework.