Wavelength scheduling algorithms with delayed acceptance for optical burst switching networks

Previously proposed wavelength scheduling algorithms in optical burst switching networks process each reservation request individually and in a greedy manner. In this paper we propose a new family of wavelength scheduling algorithms that process a batch of reservation requests together instead of processing them one by one. When a control burst with a reservation request arrives to a free batch scheduler, the scheduler waits for a small amount of time, called the acceptance delay, before deciding to accept or reject the reservation request. After the acceptance delay has passed, the scheduler processes all the reservation requests that have arrived during the acceptance delay, then it accepts the requests that will maximize the utilization of the wavelength channels. We describe an optimal batch scheduler that serves as an upper bound on the performance of batch scheduling algorithms. Furthermore, we introduce two heuristic batch scheduling algorithms. The performance of the proposed algorithms is evaluated using a discrete-event simulation model. Simulation results suggest that batch schedulers could decrease the blocking probability by 25% compared to the best previously known wavelength scheduling algorithm.

This paper proposes a novel class of wavelength scheduling algorithms in optical burst switching networks. The proposed wavelength scheduling algorithms process a batch of data bursts together instead of processing them one by one. When a control burst with a reservation request arrives to a batch scheduler, the scheduler waits for a small amount of time, called the acceptance delay, before deciding to accept or reject the reservation request. After the acceptance delay has passed, the scheduler processes all the reservation requests that have arrived during the acceptance delay, then it accepts the requests that will maximize the utilization of the wavelength channels. We describe an optimal batch scheduler that serves as an upper bound on the performance of batch scheduling algorithms. Furthermore, we introduce four novel heuristic batch scheduling algorithms. The bursts of the proposed algorithms is evaluated using a discrete-event simulation model. Simulation results suggest that batch schedulers could decrease the blocking probability by 25% compared the best previously known wavelength scheduling algorithm.

In optical burst switching networks, wavelength converters (WCs) of core nodes are used to decrease the burst loss rate. The implementation of the WCs is difficult in the current technology and the cost of WCs is high. So some core nodes may be configured insufficient WCs to reduce the cost in OBS networks. However, many data channel scheduling algorithms do not count the number of WCs and the performance of burst loss rate is not good in the condition of insufficient WCs. To overcome the defect, two novel batch scheduling algorithm with insufficiency of WC are proposed in this paper. The former algorithm improves the WCs’ resource utilization probability to reduce the burst loss rate and the later algorithm saves the WCs’ resource for the incoming bursts to use to improve the burst loss performance. The later algorithm can reduce more burst loss rate with the same number of WCs, compared with the other scheduling algorithms. The simulation results show that the later algorithm is more effective in reducing the burst loss rate with insufficient WCs.

The most important design goal in Optical Burst Switching (OBS) networks is to reduce burst loss resulting from resource contention. Especially, the higher the congestion degree in the network is, the higher the burst loss rate becomes. The burst loss performance can be improved by employing an appropriate congestion control. In this paper, to actively avoid contentions, we propose a dynamic load-aware congestion control scheme that operates based on the highest (called ‘peak load’) of the loads of all links over the path between each pair of ingress and egress nodes in an OBS network. We also propose an algorithm that dynamically determines a load threshold for adjusting burst sending rate, according to the traffic load in a network. Further, a simple signalling method is developed for our proposed congestion control scheme. The proposed scheme aims to (1) reduce the burst loss rate in OBS networks and (2) maintain reasonable throughput and fairness. Simulation results show that the proposed scheme reduces the burst loss rate significantly, compared to existing OBS protocols (with and without congestion control), while maintaining reasonable throughput and fairness. Simulation results also show that our scheme keeps signalling overhead due to congestion control at a low level.

A crucial issue in optical burst switching (OBS) networks is burst loss caused by resource contention. As a result, many methods are currently being proposed to reduce burst loss rate. These methods can be summed up into two categories: burst scheduling algorithms and contention resolutions. Both categories of methods can reduce burst loss rate to a certain degree. However, to make OBS to become a viable solution, the burst loss rate needs to be further reduced. Furthermore, almost all methods ignore the fact that an unfortunately scheduled, locally generated single-hop burst could block a number of future incoming transit bursts, though the burst just travels to its next downstream node. This phenomenon becomes more evident when links are heavily loaded in mesh OBS networks. To eliminate contention caused by single-hop traffic completely, this paper proposes a novel transfer mode called packet calking by differentiating between single-hop traffic from multihop traffic for OBS networks. An analysis model is developed to evaluate the performance of packet calking. Theoretical results are validated through extensive simulations in both ring and mesh networks. These results show that packet calking outperforms the transfer mode without packet calking in terms of burst loss rate and link utilization.

Enhanced packet routing queuing model in optical burst switching network using queue-based dynamic optical route scheduling

Next-generation high-speed Internet backbone networks will be required to support a broad range of emerging applications which may not only require significant bandwidth, but may also have strict quality of service (QoS) requirements. Furthermore, the traffic from such applications are expected to be highly bursty in nature. For such traffic, the allocation of static fixed-bandwidth circuits may lead to the over-provisioning of bandwidth resources in order to meet QoS requirements. Optical burst switching (OBS) is a promising new technique which attempts to address the problem of efficiently allocating resources for bursty traffic. In OBS, incoming data is assembled into bursts at the edges of the network, and when the burst is ready to be sent, resources in the network are reserved only for the duration of the burst. The reservation of resources is typically made by an out-of-band one-way control message which precedes the burst by some offset time. By reserving resources only for the duration of the burst, a greater degree of utilization may be achieved in the network. This book provides an overview of optical burst switching. Design and research issues involved in the development of OBS networks are discussed, and approaches to providing QoS in OBS networks are presented. Topics include: - Optical burst switching node and network architectures - Burst assembly - Signaling protocols - Contention resolution - Burst scheduling - Quality of service in OBS networks

Since Transmission Control Protocol (TCP) is the dominant protocol on the Internet and optical burst switching (OBS) networks represent the optical transmission solution that can meet future high bandwidth requirements, TCP and OBS networks represent a possible combination for the next-generation Internet. However, a problem with this combination model is that operations at the OBS layer need to be controlled so that false congestion detection at the TCP layer is minimised. Considering the combination of TCP Vegas and OBS, congestion detection at the TCP layer is based on the round-trip time (RTT), where congestion is detected if the current RTT exceeds a given RTTmax. The extra delay may be due to some actual loss, but it may also be due to the extended execution time caused by some OBS layer operations. Therefore, reducing the time of operations at the OBS layer will reduce false congestion detection at the TCP layer. This paper investigates the impact of reducing the buffering time at the ingress node on the false congestion detection rate at the TCP layer. The reduction of the burst buffering time is accomplished by nesting the offset time in the assembly time. The simulation results and analysis show that the transmission efficiency in TCP Vegas over OBS networks is significantly improved; the throughput remains high, and the delivery success rate is significantly increased compared to the conventional buffering mode.

In order to achieve service differentiation, especially loss differentiation, in optical burst switching (OBS) networks, we propose a dynamic fiber delay line (FDL) partitioning algorithm, which divides FDLs into several groups over a feed-forward output buffering architecture. In the proposed scheme, a plurality of traffic classes and FDL groups can be considered, and each FDL group is assigned to traffic classes, so that the target loss probabilities of classes are guaranteed. Also, the optimal number of FDLs for each FDL group by the proposed algorithm is decided in Poisson traffic environments. The extensive simulation results validate the effectiveness of the proposed dynamic FDL partitioning algorithm for the loss differentiation in OBS networks.

In optical burst switching (OBS) networks, when contention occurs at an intermediate node, two or more bursts that are in contention can be dropped because a forwarding path reservation is not made for a burst. This is the reason why one of the critical design issues in OBS networks is finding ways to minimize burst dropping resulting from resource contention. In this paper, we propose a configuration management policy based on an operation cost model developed according to network status information which relates to guaranteeing quality of service (QoS). Also, we develop the criteria for the configuration management by providing the alternate path using bounded range of the sensitivity of this cost model. Finally, throughout the theoretical and experimental analysis, we can obtain that our proposed scheme has good performance in an aspect of blocking rate and outperforms the conventional scheme in complexity as results

In this paper, we investigate the problem of multipath traffic engineering in optical burst switching (OBS) networks. The main goal of this work is to minimize burst loss rate in the network by adaptively balancing the burst traffic among multiple paths based on the measurement and analysis of path congestion. We develop three distributed traffic splitting algorithms by considering the special features of OBS networks. Among these three algorithms, one algorithm considers burst level traffic distribution, and the other two algorithms consider flow level traffic distribution to avoid packet reordering problem. The proposed multipath traffic engineering algorithms achieve significant performance improvement in reducing burst loss probability in a distributed manner in OBS networks. Further, through theoretical analysis and simulations, we show that the proposed algorithms converge quickly on a sudden traffic increase in the network.

The Optical burst switching (OBS) networks have been attracting much consideration as a promising approach to build the next generation optical Internet. Aggregating the burst in the OBS networks from the high priority traffic will increase the average of the loss of its packets. However, the ratio of the high priority traffic (e.g. real-time traffic) in the burst is a very important factor for reducing the data loss, and ensuring the fairness between network traffic types. This paper introduces a statistical study based on the significant difference between the traffics to find the fairness ratio for the high priority traffic packets against the low priority traffic packets inside the data burst with various network traffic loads. The results show an improvement in the OBS quality of service (QoS) performance and the high priority traffic packets fairness ratio inside the data burst is 50 to 60%, 30 to 40%, and 10 to 20% for high, normal, and low traffic loads, respectively.

This paper studies the blocking performance of optical burst switching (OBS) networks using a sequential office control (SOC) state-independent deflection routing policy. We show that unprotected deflection routing may destabilize OBS resulting in higher blocking probabilities than if bursts were not deflected but simply blocked. This study was motivated by the well-known destabilizing effect that alternative routing has on circuit switching in classical telephony networks. We propose two forms of protection to guard against destabilization: 1) wavelength reservation, which is analogous to trunk reservation in circuit switching; and, 2) preemptive priority, which is a new form of protection where bursts that have not been deflected are given preemptive priority over bursts that have been deflected. Our main contribution is a one-moment reduced-load approximation to evaluate the blocking performance of OBS networks using deflection routing protected by either wavelength reservation or preemptive priority. Our reduced-load approximation relies on the usual assumptions of link independence and Poisson distributed link arrivals. We quantify the error admitted in making these two assumptions via simulation. Using our reduced-load approximation, we evaluate the blocking performance of protected and unprotected deflection routing in several randomly generated networks. The chief conclusion of our study is that deflection routing in OBS should be given some form of protection to avoid destabilization resulting from upward load variations, and in terms of blocking performance, preemptive priority is the best form of protection for OBS. We use simulation to verify that our conclusions remain valid for a realistic traffic scenario.

Parallel Optical Burst Switching (POBS) is a variant of Optical Burst Switching (OBS) which is proposed as a new optical switching strategy for Ultra-Dense Wavelength Division Multiplexing (U-DWDM) to support the enormous bandwidth demand of the next generation Internet. As opposed to OBS, POBS transmits bursts in two dimensions: the wavelength dimension and the time dimension. POBS network uses an one-way resource reservation mechanism to set up the resources for each data burst transmission. The use of this mechanism may cause bursts to contend for the same resources at the same time at core (intermediate) nodes of the network. Therefore, the performance of POBS networks depends on the contention resolution policies to reach acceptable levels for bandwidth usage. These policies may increase both the cost and complexities of the core nodes in POBS networks. Most literatures on OBS networks apply contention resolution at the core nodes based on reactive strategies that are activated after contention takes place in core nodes. This study proposes the use of a proactive contention resolution technique at ingress nodes of POBS network as well as reactive contention resolution technique at core nodes for reducing the probability of burst drop in the network in order to increase the performance of the network. The simulation results show that the use of POBS network with the proposed Reactive Odd/Even Node ID Wavelength Assignment Technique (POBS-ROENIDWAT) shows a better performance in terms of reduced data loss rate and increased throughput compared to the performances of both POBS network with Sequential Wavelength Assignment Technique (POBS-SWAT) and OBS network with Burst Segmentation (OBS-BS).

There is a growing demand for OBS (optical burst switching) networks, which is based on the concept of providing switching of data bursts without any intermediate switching and O/E/O conversions. The OBS technology is very economical and flexible to create new definitions for networking processes. OBS networks can also help in creating several types of new services which involve more bandwidth usage. The present research paper focuses on the OBS network and its benefits. The major problems of burst contention and congestion control using OBS networks are addressed in this research. In this paper, a possible solution to burst contention and congestion control is presented by the use of an algorithm, called BAT algorithm. The multi-objective optimisation problem is solved using a multi-objective BAT algorithm (MOBA). The proposed algorithm presented effective results to maximise the traffic demand, burst loss ratio minimisation, and reduction in overall burst block probability.