Burst Blocking Probability Research Articles

Dropping probability reduction in OBS networks: A simple approach

In this paper, we propose and derive a slotted-time model for analyzing the burst blocking probability in Optical Burst Switched (OBS) networks. We evaluated the immediate and delayed signaling reservation schemes. The proposed model compares the performance of both just-in-time (JIT) and just-enough-time (JET) signaling protocols associated with of void/non-void filling link scheduling schemes. It also considers none and limited range wavelength conversions scenarios. Our model is distinguished by being adaptable to different offset-time and burst length distributions. We observed that applying a limited range of wavelength conversion, burst blocking probability is reduced by several orders of magnitudes and yields a better burst delivery ratio compared with full wavelength conversion.

An Approach to Resolving Contention Problem in an Optical Burst Switching WDM Network

We propose to use a new wavelength allocation (WA) scheme with deflection routing, whilst investigating its influence to the optical burst switching (OBS) node performance. To evaluate the burst blocking probability we have developed the analytical and simulation models of an OBS node performing WA scheme in conjunction with the deflection routing. The results obtained from the analytical and simulation models indicate that the WA scheme yields to decrease the deflected burst blocking probability and reduces the cost of OBS node in WDM optical network. Ill. 6, bibl. 7 (in English; summaries in English, Russian and Lithuanian).

Performance Analysis of OCDMA PONs Supporting Multi-Rate Bursty Traffic

Optical Code Division Multiple Access (OCDMA) provides increased security communications with large dedicated bandwidth to end users and simplified network control. We analyse the call-level performance of an OCDMA Passive Optical Network (PON) configuration, which accommodates multiple service-classes with finite traffic source population. The considered user activity is in accordance with the bursty nature of traffic, so that calls may alternate between active (steady transmission of a burst) and passive states (no transmission at all). Parameters related to multiple access interference, additive noise, user activity and number of traffic sources are incorporated to our analysis, which is based on a two-dimensional Markov chain. An approximate recursive formula is derived for efficient calculation of call blocking probability. Furthermore, we determine the burst blocking probability; burst blocking occurs when a burst delays its returning from passive to active state. The accuracy of the model is completely satisfactory and is verified through simulation. Moreover, we reveal the consistency and necessity of the proposed model.

Blocking performance of a burst-outputted model considering different service rates and different output port-selected probabilities in an optical burst switching core node

In an optical burst switching core node, each output port is equipped with a different network interface unit that can provide a specific data rate. Bursts will use different probabilities of select output ports, which is in accordance to the path-length metric-based routing optimal algorithm and wavelength resource situation. Previous studies ignore this issue. We establish a burst-outputted model considering the different service rate of output ports and different port-selected probabilities. We calculate burst-blocking probability and analyze the relationship between service rate and output-port-selected probability in detail.

Analysis of a Buffered Optical Switch with General Interarrival Times

Optical buffering is known to significantly improve the performance of optical packet and burst switched networks and a number of useful analytic models for the case of Poisson traffic have been proposed previously. In this paper, we propose an approximate analytic model for generally distributed arrivals, specifically treating Gamma-distributed interarrival times, and show that the variance of the traffic has a significant impact on performance. The analysis is formulated in terms of virtual traffic flows within the optical switch from which we derive expressions for burst blocking probability, fibre delay line occupancy and mean delay. Emphasis is on approximations, by way of moment-matching techniques, that give good numerical efficiency so that the method can be useful for formulating dimensioning problems for large-scale networks. Numerical solution values from the proposed analysis method are compared with results from a discrete-event simulation of an optical burst switch.

A novel burst-outputted model in an OBS core router

In this paper, the performances of a novel burst-outputted model which based on differentiated probability in an optical burst switching (OBS) core router have been proposed and analyzed. Different from the same probability to select output-port model in previous works, proposed model gives a burst-outputted process with different probabilities, which based on the fact that, output-ports may lead to variable distance with the same destination. The burst blocking probability, the system-passed rate, the average output-port occupied value and the efficiency have been given and discussed.

An efficient routing scheme to reduce packet loss in all optical networks

Optical burst switching (OBS) is a promising technology for the next generation optical Internet. A buffer-less OBS network can be implemented using ordinary optical communication equipment without the need for either wavelength converters or optical memories. However, OBS networks suffer from a relatively high blocking probability, a primary metric of interest, because of contention. In this paper, an efficient deflection routing scheme for buffer-less OBS networks has been proposed in order to reduce blocking probability (Packet loss) caused by Offset Time (OT) and burst contention. Simulation results have shown that the proposed scheme reduces blocking probability effectively and also it maintains a reasonable end-to-end delay for each burst. Thus, it improves the overall network performance by reducing the burst blocking probability effectively.

Performance Analysis of Optical Buffer in an OBS Core Router

Optical burst switching is an novel IP over WDM technique for full-optical switching networks. In this paper, the performances of FDL based optical buffer in an optical burst switching network core router are analyzed. Burst blocking probability, system passing rate, the average ports occupied rate and average queueing delay are evaluated and discussed.

A Novel Deflection Routing Technique to Reduce End-to-end Delay in OBS Networks

Optical burst switching (OBS) is a promising technology for the next generation optical Internet. A buffer-less OBS network can be implemented using ordinary optical communication equipment without the need for either wavelength converters or optical memories. However, OBS networks suffer from a relatively high blocking probability, a primary metric of interest, because of contention. In this paper, an efficient novel deflection routing for buffer-less OBS networks has been proposed in order to reduce losses caused, for example, by Offset Time (OT) & burst contention. Simulation results demonstrate that the proposed approach reduces effectively blocking probability, whereas it maintains a reasonable end-to-end delay for each burst. Hence, it can improve network performance by efficiently reducing the burst blocking probability.

Impairment-aware ordered scheduling in dual-header optical burst switched networks

Optical burst switching (OBS) is a promising technology for bridging the gap between optical wavelength switching and optical packet switching. Optical signal transmission quality is subject to various types of physical impairment introduced by optical fibers, switching elements, or other network components. The signal degradation due to physical impairment may be significant enough such that the bit-error rate of received signals is unacceptably high at the destination, rendering the signal to not usable. In this article, based on earlier study, we study the burst-scheduling problem in OBS networks using two control packets for each data burst, taking into account physical impairment effects. We propose a burst-scheduling algorithm that accommodates incoming bursts by primary path routing, deflection routing, and burst scheduling. We design an admission control mechanism to use network resources efficiently. At an OBS node, the proposed algorithm schedules bursts for transmission by searching for available resources as well as verifying signal quality. Our simulation results demonstrate that the proposed algorithm is effective in terms of reducing the burst-blocking probability.

Physical impairment aware scheduling in optical burst switched networks

Optical burst switching (OBS) presents itself as a promising technology for bridging the gap between optical wavelength switching and optical packet switching. Increasingly, researchers attempt to incorporate more realistic constraints into the design of OBS networks. Optical signal transmission quality is subject to various types of physical impairment introduced by optical fibers, switching equipment, or other network components. The signal degradation due to physical impairments may be significant enough such that the bit-error rate of received signals is unacceptably high at the destination, rendering the signal not usable. In this paper, based on earlier work, we study the burst scheduling problem in OBS networks, taking into account physical impairment effects. We propose three effective burst scheduling algorithms: (1) a JET based Physical Impairment Constrained Algorithm (JETPIC), (2) an Integrated Physical Impairment Constrained Algorithm (IPIC), and (3) an Enhanced Integrated Physical Impairment Constrained Algorithm (EIPIC). At an OBS node, the proposed algorithms schedule bursts for transmission by searching for available resources as well as verifying signal quality. Our simulation results show that the proposed algorithms are effective in terms of reducing the burst blocking probability. In general, algorithm JETPIC outperforms algorithms IPIC and EIPIC in burst blocking probability and average end-to-end delay performance.

Contention minimisation in optical burst-switched networks combining traffic engineering in the wavelength domain and delayed ingress burst scheduling

A strategy for minimising the probability of contention in optical burst-switching (OBS) networks, by combining traffic engineering in the wavelength domain with delayed burst scheduling at the ingress nodes, has been proposed. The implementation of this strategy only requires an increase on the processing and electronic buffering capacities of the ingress nodes, while avoiding the use of complex and expensive optical buffers at the core nodes. The performance evaluation study has shown that the proposed strategy outperforms the burst-scheduling strategies described in the literature by several orders of magnitude, in terms of burst-blocking probability. Moreover, the performance improvements have been shown to depend on the average offered traffic load, number of wavelengths per link and maximum delay allowed at the ingress nodes.

An efficient admission control mechanism for optical burst-switched networks

This article proposes the load-level-based admission control (LLAC) mechanism in order to provide service differentiation for optical burst-switched networks. The LLAC mechanism admits bursts of a given service class according to the network load and a class-associated parameter. Based on this parameter, called load level, the proposed mechanism differentiates the burst blocking probability experienced by each service class. We develop an analytical model for the proposed mechanism and evaluate its performance for different configurations through mathematical analysis. The results show that the load-level-based mechanism reduces the blocking probability of high-priority bursts by two orders of magnitude or more depending on the analyzed scenario. In addition, compared to other similar mechanisms, the load-level-based mechanism effectively differentiates the services in all analyzed configurations, requires less states in optical burst switching (OBS) nodes, and does not suffer from priority inversion.

Modelling and performance evaluation of optical burst switched node with deflection routing and dynamic wavelength allocation

In this paper the effect of dynamic wavelength allocation (DWA) scheme implementation to the OBS node performance is investigated. We have developed the mathematical model of an OBS node in order to evaluate the burst blocking probability. It is proposed to allocate a part of total wavelength capacity to be used by deflected bursts only. The results obtained from the model show that if the number of allocated wavelengths is dynamically adapted to the deflected burst traffic intensity, the total blocking probability and deflected burst blocking probability significantly decrease. Concerning to the hardware requirements the implementation of deflection routing needs the limited optical FDL buffer incorporation, to provide the deflected burst with the extra offset time. Also, control logic for burst scheduler needs to be upgraded to perform the dynamic wavelength allocation for deflected bursts. .

On Achieving the Optimal Performance of FDL Buffers Using Burst Assembly

This letter proposes a new dynamic burst length adjustment mechanism to achieve optimal performance of fiber delay line (FDL) buffers in optical burst switching networks. Our results show that burst blocking probability at an optical node with a fixed length FDL buffer can be kept at minimum under changing traffic conditions using the proposed mechanism.

Exploring node light-splitting capability for burst grooming in optical burst switched networks

Optical burst switching (OBS) is a switching concept which lies between optical circuit switching and optical packet switching. Both node switching time and burst size can impact the resource efficiency of an OBS network. To increase resource utilization, burst grooming has been proposed where numerous data bursts are coalesced to form a larger burst that will be switched as one unit in order to reduce the resource waste and switching penalty. In this article, assuming burst grooming can only be realized at edge nodes, we study the burst grooming problem where sub-bursts originating from the same source may be groomed together regardless of their destinations under certain conditions. We explore the capability that core nodes can split incoming light signals to support multicast to achieve more efficient burst grooming. Specifically, core nodes can transmit the groomed burst to multiple downstream nodes if the sub-bursts in the groomed burst have different destinations. The groomed burst will traverse a tree which spans the source and all the destinations of the sub-bursts in the groomed burst. The destination egress nodes recognize, de-burstify, and drop the sub-bursts destined to these nodes, i.e., the sub-bursts destined to these egress nodes are removed from the groomed burst. At the same time, the remaining sub-bursts may be groomed with sub-bursts at these egress nodes subject to burst grooming criteria. We propose two effective burst grooming algorithms, (1) a no over-routing waste approach (NoORW); and (2) a minimum relative total resource ratio approach (MinRTRR). Our simulation results have shown that the proposed algorithms are effective in terms of the burst blocking probability, the average burst end-to-end delay, the number of sub-bursts per groomed burst, as well as the resource waste.

Service Differentiation Scheme Using Two Horizons for Horizon Based OBS Networks

We propose a service differentiation scheme for optical burst switching (OBS) with the scheduling algorithm Horizon. In the proposed scheme, in addition to the latest horizon used in the conventional Horizon, we introduce the second latest horizon and use them for reservation preemption. Burst priority order is perfectly guaranteed according to the burst class information informed by its control packet if the arrival time of the burst is later than the second latest horizon and earlier than the latest horizon. Since the extra offset time is no longer needed for service differentiation, the burst blocking probability and the data latency will be reduced. We assume a multi-hop network with ring topology where bursts traverse five intermediate nodes, and evaluate the performance in terms of the end-to-end and hop-by-hop burst blocking probabilities. Simulation results show that the proposed scheme can achieve service differentiation with smaller blocking probability than the extra-offset-time-based scheme with Horizon. Furthermore, we show that the proposed scheme preserves service differentiation even in multi-hop environments.

Blocking probability of a preemption-based bandwidth-allocation scheme for service differentiation in OBS networks

For the next generation optical Internet, optical burst switching (OBS) is considered as a promising solution to exploit the capacity provided by wavelength-division-multiplexing technology. In this paper, the authors analyze preemption-based bandwidth-allocation (PBA) scheme for supporting service differentiation in OBS networks. They first propose the mathematical analysis of burst blocking probability (BBP) for a general case of probabilistic wavelength-preemption algorithm. The BBP of a new arrival burst for a K-channel N-class system is presented. They then apply this model to PBA. The results of analytical loss model are investigated and compared with simulations. The simulation results validate their analytical model and show that a BBP can be controlled for different service classes with the PBA scheme

The study of QoS guarantee in the optical burst switching internet backbone

Optical switching technology can be categorized into optical circuit switching (OCS), optical packet switching (OPS) and optical burst switching (OBS). OCS is suitable for large amounts of data transmission; however, the channel utilization is inefficient when the traffic flows are intermittent. OPS can be easily adapted to any higher layer and is suitable for bursty traffic, but it requires a highly complex technology and optical buffer. The new switching paradigm, OBS, can provide higher bandwidth utilization and meanwhile avoid the complexity in OPS technology. In this paper, we investigate how the quality of service (QoS) can be guaranteed and reliable transmission can be supported in the OBS-based Internet backbone. We propose the adjustable-time-counter-based (ATCB) burst assembly and the non-real time packet retransmission mechanisms and apply them in the ingress router of the OBS Internet backbone to guarantee the quality of real time applications and lossless requirement of non-real time services. Moreover, traffic shaped is performed for real time packets in the egress router so that the real time property is preserved with a low jitter. Simulation results show that the burst blocking probability using the ATCB burst assembly is improved, compared with the time-counter-based (TCB) and burst-length-threshold-based (BLTB) mechanisms. The delay, loss and jitter of real time service conform to the QoS requirement. Meanwhile, the delay of non-real time service also falls in the acceptable range.

An efficient preemption-based channel scheduling algorithm for service differentiation in OBS networks

Optical burst switching (OBS) is a promising switching technology for realization of an economical optical Internet. Quality-of-service (QoS) support is an important challenging issue of OBS networks, and a number of schemes have been proposed. However, the existing schemes have some limitations, such as QoS performance degradation, low wavelength utilization, and high implemental complexity. This paper proposes a bufferless preemption-based channel scheduling algorithm for service differentiation in OBS networks, which combines a preemption channel selection algorithm and a channel partitioning algorithm. The proposed preemption channel selection algorithm minimizes the length of preempted bursts to improve channel efficiency, and the channel partitioning algorithm controls the degree of service differentiation between service classes with low implemental complexity. An analytical model is derived and simulations are conducted to evaluate the performance. The results showed that the proposed scheme can improve channel efficiency and effectively provide controllable service differentiation for multi-class traffic in terms of the burst blocking probability and end-to-end throughput.