Optical Burst Switching Systems Research Articles

Next-Generation OBS Architecture Transforms 5G Networks Powered by Machine Learning, Probabilistic Modeling and Algorithm Optimisation

Next-generation 5G networks require a high-speed, low-latency, and robust communication backbone to support new applications such as IoT, cloud computing, and virtual reality. Optical burst switching (OBS) is a promising method for 5G networks due to its ability to handle high-speed data transit and excellent bandwidth utilisation. Traditional OBS networks, on the other hand, have a high blocking probability, low resource utilisation, and limited scalability. To address these challenges, this work provides a unique OBS design that integrates machine learning, probabilistic modelling, and efficient algorithms. The usage of machine learning-based burst assembly algorithms, which dynamically predict the best resource allocation for each burst based on network conditions and QoS requirements, is a key component of the proposed architecture. A complete simulation analysis is performed using a typical Wavelength Division Multiplexing (WDM) traffic dataset to evaluate the performance of the proposed architecture. The simulation results show that, as compared to standard OBS networks, the suggested architecture reduces the likelihood of obstruction and improves resource utilisation significantly. Furthermore, when compared to previous OBS systems, the suggested design is more efficient at managing dynamic traffic and enables greater scalability. The simulation study's performance tests demonstrate that the suggested architecture has a blocking probability of less than 10-6, a throughput of more than 95%, and a latency of less than 4 milliseconds. These findings show that the suggested OBS design for next-generation 5G networks is both feasible and effective.

Review of contemporary literature on burst assembling and routing strategies in OBS networks

In the course of recent years, a lot of research has been directed in the ranges of optical packet switching and optical burst switching (OBS). This examination has been inspired by the requirement for procedures that are equipped for supporting the requesting prerequisites of developing dynamic high-transfer speed applications in an adaptable and effective way. In this paper we have undertaken the critical and mandatory factors of OBS such as (1) assembling the bursts, (2) routing (3) resource (such as transmission channels) scheduling and (4) burst segmenting for optimal transmission). Consequently the current research is focusing on these both of dissimilar variables of OBS and putting endeavors to contribute ideal ways to assemble, route, schedule or segment. This manuscript reviewed the nomenclature of the Optical Burst Switching Networks where fundamental ideas are examined and the aim is to identify the difficulties and strengths for optical packet and burst switching systems. This audit has been inspired by the requirement for methods that are equipped for supporting the future data transmission necessity of cutting edge applications and administrations of Internet Protocol systems. The authors have examined the fundamental ideas of OBS worldview and laid out issues identified with OBS systems. The future challenges that are still limiting the performance of the present contributions are told subsequently evincing the scope for future research.

Analysis of burst/packet assembly techniques in high-speed optical switching network

In the Optical Burst Switching (OBS) Network, the burst assembly technique is one of the challenging issues in the implementation of the system. It has the influence on the burst characteristic, which gives an impact on the network performance. Burst assembly is the process of assembling incoming data from the higher layer into bursts at the ingress edge node of the OBS network. The burst assembly mechanism must then place these packets into bursts based on some assembly policy. In this paper, the OBS system performance has been observed in simulated 12-node network based on Just-Enough-Time (JET) reservation protocol with various burst assembly techniques under the standard drop policy (DP) and the segmentation policy for contention resolution. The simulation results show that the performance of the proposed Adaptive-Threshold with Fixed Maximum Time Limitation (ATH-FMTL) burst assembly scheme is better than conventional burst assembly schemes in terms of loss probability and average assembly delay. Also, the proposed scheme avoids a sudden increase in the burst size and makes the burst sent out smoother as compared to conventional schemes.

Dynamic Properties of a WDM Switching Module Based on Active Microring Resonators

The switching properties of a resonator consisting of two serially cascaded active microrings (MRs) are reported. The switching is achieved through the variation of the refractive index and the losses of the MRs with current injection, which alters the overall output spectral response. The switch is suitable for optical burst switching systems and metro architectures as it provides fast optical switching in the nanosecond scale with contrast ratio higher than 30 dB for 10-Gb/s intensity modulated signals. The capacity of the switch can be remarkably increased if multiwavelength switching is employed.

Control-Plane Congestion in Optical-Burst-Switched Networks

We examine optical burst switching (OBS) networks with out-of-band header transmission and electronic processing. We present the first detailed analysis of the potential effects of control- plane processing limitations on the overall throughput and latency performance of OBS networks. We present an accurate analytical model that explicitly accounts for the header queuing process in core nodes, and we provide a set of design guidelines for provisioning OBS networks such that the control- plane does not become the throughput bottleneck of the system. We also estimate the minimum end-to-end latency associated with offsets and burst assembly that is required to ensure proper OBS operation. We find that ultrafast header-processing speeds (<100 ns per header) are not required for efficient OBS operation. We show that provisioning a header-offset size that corresponds to a header-processing-queue length of 50 is sufficient for a wide range of practical OBS systems. For a fully meshed network topology, a total end-to-end control latency that is 10 times longer than the duration of a single header- processing duration is required for proper network operation. By contrast, more sparsely connected networks, such as those deployed in the long haul and metro today, may require an average end-to-end control latency that is hundreds of times as large as the header-processing duration.

Comparison analysis of optical burst switched network architectures

Optical burst switching (OBS) is a promising paradigm for the next-generation Internet infrastructure. In this paper, a novel efficient network architecture for OBS has been presented and compared with conventional OBS architectures. To enhance OBS system performance, the architecture employs a novel proposed burst assembly algorithm, fiber delay lines (FDLs) and dynamic route selection technique. A queuing model is used to predict the system behavior for both classless and prioritized traffic. Simple closed-form expressions are obtained for the burst-loss probability of both classless and prioritized traffic. Numerical results show that the proposed architecture provides an accurate fit for the performance of the highest traffic class and lower bounds for the other traffic classes that are tighter than earlier known results.

Blocking and delay performance for differential output-ports choosing probability scheme applied optical burst switching network

Differential output-ports choosing probability (DOCP) scheme is a novel traffic outputting model for core router in optical burst switching (OBS) network. In this paper, we provide an analytical model for studying the performance of traffic blocking and delay in DOCP-applied OBS network. We first evaluate blocking probabilities using DOCP and confirm it by simulation. Then, in optical buffer-equipped OBS core router, we consider the average delay time for buffered traffic and the average total traffic queueing length in core router. The knowledge of delay performance is useful for the optical buffer architecture configuration in differential traffic scenario. Several results indicate that, under the same load condition, the blocking probabilities and the delay time will change along with the changeable ports choosing probability and the ratio between different length bursts in the OBS system.

Edge node buffer usage in optical burst switching networks

Optical Burst Switching (OBS) combines the benefits of Optical Packet Switching and Optical Circuit Switching technologies to provide an efficient, yet cost effective, method for data transmission in an all-optical, bufferless, core network. While most studies on OBS has concentrated on the core OBS network, we contribute new studies for the buffer requirement of an OBS edge node. The buffer usage for OBS systems only arises in the edge nodes since they contain an array of assemblers which combines electronic data with a common destination into an OBS burst stream for transmission in an all-optical bufferless core network. Specifically, we present two analytical results for buffer usage in an OBS edge node: one for Poisson traffic and the other for self-similar traffic input. The results show that the aggregated traffic from many assemblers inherits the characteristics of the source input traffic. This means that the output traffic approaches Poisson if the input traffic is Poisson, and the output traffic remains self-similar if the input is self-similar. These results lead to the following important design issues when dimensioning buffer requirements in an OBS edge node: if the traffic input is Poisson, the M/G/m model is the model to use for obtaining the upper bound on buffer usage in an OBS edge node; and for the case of self-similar traffic, Brichet’s method can be used to provide the upper and lower bound.

Performance analysis of differential output ports choosing probabilities for multiclass traffic in optical burst switching networks

We present an analytical model to study the multiclass-traffic-based optical burst switching system. In contrast with the previous on-off burst arrival process model, which is based on a single class of traffic and depends on just one probability of bursts to choose output ports, in our scheme we evaluate the blocking probability for multiclass bursts at the core router, which chooses output ports depending on differential probability, and we give some useful discussion for the design of real optical burst switching networks.

An Accurate Model for Evaluating Blocking Probabilities in Multi-Class OBS Systems

This letter presents an analytical model that can be used to evaluate the blocking probability of each service class in a multi-class optical burst-switching network. The model allows, for the first time, the evaluation of blocking probabilities in optical burst switching (OBS) systems with arbitrary burst-length distributions and arbitrary offsets. This includes OBS systems in which the mean burst length of each class is different. Such systems do not follow the conservation law and cannot, therefore, be analyzed using previously published OBS models. For an OBS system with two classes, an offered load of 10/sup -3/, and a 1:5 ratio of high-priority to low-priority traffic, we show that our model accurately predicts the blocking probability for each class, whereas predictions from previously published models that assume conservation disagree with the simulation results by as much as 75%.

Design of wavelength converting switches for optical burst switching

Optical burst switching (OBS) is an experimental network technology that enables the construction of very high-capacity routers, using optical data paths and electronic control. In this paper, we study wavelength converting switches using tunable lasers and wavelength grating routers, that are suitable for use in OBS systems and evaluate their performance. We show how the routing problem for these switches can be formulated as a combinatorial puzzle or game, in which the design of the game board corresponds to the pattern of permutation used at the input sections of the switch. We use this to show how the permutation pattern affects the performance of the switch, and to facilitate the design of permutation patterns that yield the best performance. We give upper bounds on the number of different wavelength channels that can be routed through such switches (regardless of the permutation pattern), and show that for 2/spl times/2 switches, there is a simple permutation pattern that achieves these bounds. For larger switches, randomized permutation patterns produce the best results. We study the performance of optical burst switches using wavelength converting switches based on several different permutation patterns. We also present a novel routing algorithm called the most available wavelength assignment and evaluate its benefits in improving the switch throughput. Our results show that for a typical configuration, the switch with the best permutation pattern has more than 87% of the throughput of a fully nonblocking switch.

An asymptotically optimal greedy algorithm for large optical burst switching systems

As the number of wavelengths in OBS systems increases, the utilization achievable for a given blocking probability can be made to approach 100%. This paper shows that this property applies to a wavelength allocation algorithm of greedy type. Another property of this rule, one shared by most other wavelength assignment algorithms, is that, since lost traffic tends to occur near destinations, where the resource usage wasted by such traffic is large, very low blocking probabilities are important for efficient operation. To help identify regions of low blocking probability, we derive an asymptotically exact condition for zero blocking probabilities; it has a form reminiscent of the stability condition of the M/G/1 queue.

Aggressive resource reservation for OBS systems

The aggressive reservation strategy in optical burst switching systems is investigated. A success probability - driven algorithm and a bandwidth-utilisation-driven algorithm are proposed to facilitate the authors' recently proposed forward resource reservation transmission scheme. The principles and the theoretical analysis of these two algorithms are presented and, their performance is compared with respect to the reservation success probability and the bandwidth usage efficiency. Simulation results have validated the algorithms and the analysis.