Pre-planned optical burst switched routing strategies considering the streamline effect

Abstract

Optical burst switching is a promising paradigm for the next IP over optical network backbones. However, due to its bufferless nature, it can be highly affected by burst contention. Several methods have been proposed to address this problem, most of them without considering a phenomenon unique to optical burst switched networks called streamline effect. Most of the reported studies also assume the existence of total wavelength conversion capacity on all nodes, presently a very expensive and somewhat unrealistic configuration, and additionally, the contention resolution schemes adopted increase in the complexity of the core nodes, hampering scalability. In this study, we present a traffic engineering approach for path selection with the objective of minimizing the contention considering the streamline effect and using only topological information. The main idea is to balance the traffic across the network in order to prevent congestion while keeping simple the architecture of the core nodes and without incurring into link state dissemination penalties. We propose and evaluate the path selection strategies in both networks with full wavelength conversion capability and networks with imposed wavelength continuity constraint. Results show that our strategies can outperform the traditionally used shortest path routing.

New Burst Assembly and Scheduling Technique for Optical Burst Switching Networks

“…The algorithms effectively consider the strong correlations among the multiple bursts and employ the proposed interval graphs and min-cost circular flow techniques to achieve optimized network performance in terms of data loss rate in the network. Barradas and Medeiros (2010) have proposed four path selection strategies to prevent congestion. The first two addressed contentions in networks that assume total wavelength conversion capability including the streamline effect in a relaxed way.…”

Simulation Model for OBS Contention Avoidance Routing Strategies

“…One of these strategies, entitled Streamline-Based Preplanned Routing with no Pre-determined Paths (SBPR-nPP) was recently published in [14] and, as an example, its ILP formalization will be succinctly presented next. The solution of this ILP problem will be used to drive source routing decisions on the second stage of this simulation methodology.…”

An Intrinsic TE Approach for End-to-End QoS Provisioning in OBS Networks Using Static Load-Balanced Routing Strategies

“…For the first part, the K most link disjoint shortest paths are determined. For the second part the following three optimization strategies for contention avoidance have been calculated: the minimize Maximum Congested Link (MCL), based on the idea that the more a certain link is included in the chosen paths for source-destination pairs, the highest the blocking probability can be [13]; the minimize Maximum End-to-end Congested (MEC) path, based on the idea that blocking may occur at any link traversed by a burst along the path [13]; and one Streamline Based Pre-planned Routing (SBPR) strategy [14] considering the streamline effect, a reported phenomenon unique to OBS networks wherein bursts traveling in a common link are streamlined and do not contend with each other until they diverge [15]. Mathematical formulations for these routing strategies will be presented in Section 4.…”

“…The algorithms presented here (already proposed as ongoing research work in [13,14]) are discussed together for the first time in the context of the QoS provisioning technologies. In addition, the issue of complexity is also addressed for the first time in this article, providing comparative information concerning the sizes of the instances of the ILP problems, as well as the computation times involved in their resolution.…”