A new flexible and enhancing bandwidth utilization burst dropping technique for an OBS network

Optical burst switching (OBS) has been proposed as a competitive hybrid switching technology to support the next generation optical Internet. However, due to their one-way resource reservation mechanism, OBS networks experience high bursts (thus packets) loss rate. In OBS networks, the contention is resolved either by dropping one of the contending bursts or more efficiently by dropping from one of the contending bursts only the parts that overlap with the other bursts. In both situations, only one data source will suffer the data loss in favor to the other. In this paper, a new burst flexible and enhancing bandwidth utilization burst dropping technique has been proposed for contention resolution in optical burst switched networks. When contention occurs, any part of a contending burst could be dropped, instead of only the head or tail of bursts. The proposed dropping scheme makes bandwidth utilization more efficient and flexible. Simulation results show that the proposed dropping scheme performs better than existing burst dropping schemes.     

Burst dropping policies in optical burst switched network

Optical burst switching (OBS) has been proposed as a competitive switching technology to support the next generation optical Internet. However, due to their one-way resource reservation mechanism, OBS networks experience high bursts (thus packets) loss rate. In OBS networks, the contention is resolved either by dropping one of the contending bursts or more efficiently by dropping from one of the contending bursts only the parts that overlap with the other bursts. In both situations, only one data source will suffer the data loss in favor to the other. In this paper, a novel burst dropping policy based on even selection of burst (BDPES) has been proposed in conjunction with an appropriate mechanism to provide differentiated service in order to support the quality of service (QoS) requirements of different applications. In the proposed burst dropping policy, the dropped segments are selected evenly from both contending bursts and the truncated bursts are guaranteed to be larger than the minimum burst-length allowed by the network. Furthermore, the proposed policy is enhanced via a flow control mechanism. Simulation results show that the performance of proposed policy is better than existing burst dropping mechanisms in terms of reducing burst (packets) loss rate.     

A segmentation based channel scheduling scheme for improving channel utilization in OBS networks

Channel scheduling is an important aspect in optical burst switching (OBS) networks. OBS is a promising solution for the future Internet backbone. In OBS network a key issue is data channel scheduling. In this paper we propose a channel scheduling scheme to optimize channel utilization for OBS networks with segmentation. In this paper, we propose an efficient way to organize the void intervals. The channel scheduling method is compared with existing scheduling schemes. Simulation results show that both channel utilization and burst loss ratio performance improved as compared to existing scheduling schemes.     

OBS网络中基于优先级与突发包分割的偏射路由机制

为了有效地降低突发包的丢失率和保证OBS网络中不同优先级业务的服务质量,提出了一种基于优先级与突发包分割的偏射路由机制.当冲突发生时,首先基于突发包的优先级进行"竞争突发包头部分割或者原突发包尾部分割"处理;无冲突部分直接在事先预留的输出数据信道上处理,冲突部分的分割突发包根据参数可调的偏射路由机制被偏射到最佳偏射路径上.仿真结果表明,该机制能够有效地降低整个网络的丢包率和端到端的延时,并且得到高优先级突发包的丢失率和延时低于低优先级突发包.由此可知,基于优先级与突发包分割的偏射路由机制能够有效地解决突发包的冲突问题,从而提高整个OBS网络的性能.     

An optimal burst assembly approach employing traffic shaping (OBATS) for OBS

Optical burst switching (OBS) aims at combining the strengths of packet and circuit switching and is considered as a promising technology for implementing the next generation optical Internet, required to cope with the rapid growth of Internet traffic and the increased deployment of new services. In this paper, an optimal burst assembly approach employing traffic shaping (OBATS) for OBS networks has been proposed in order to improve network performance in terms of reduced blocking probability, congestion control and better utilization of bandwidth. Particularly, the proposed scheme aims at reducing the average delay experienced by the packets during the burstification process in optical burst switched (OBS) networks, for a given average size of the bursts produced. Reducing the packet burstification delay, for a given average burst size, is essential for real-time applications; correspondingly, increasing the average burst size for a given packet burstification delay is important for reducing the number of bursts injected into the network and the associated overhead imposed on the core nodes. Simulation results show that the proposed burst assembly approach gives better network performance in terms of burst drop, resource contention and delay as compared to conventional burst assembly approaches.     

Congestion prevention for reliable OBS

It is known that Internet traffic exhibits a structural self-similarity over a wide range of time scales. Existing performance evaluation studies in optical burst switching (OBS) networks show high contention performance degradation in the nodes under correlated traffic. Due to its buffer-less nature, OBS efficiency can be reduced by resource contention leading to burst loss. Several methods have been proposed to address this problem, most of them relying on reactive mechanisms, which increase the complexity of core nodes, hampering scalability. In this paper to have congestion prevention, an efficient scheme incorporating delayed reservation decision has been proposed which not only offers reduction in resource contention by maintaining the same node complexity as that in general OBS networks with optical buffers but also provides improvement in system's throughput. Simulations show the proposed scheme has better performance than existing schemes in terms of burst loss probability.     

An optimal protection and restoration scheme (OPARS) for optical networks

Protection and restoration are critical network design issues for optical networks since even a single failure for a short duration may result in huge data loss due to the large capacity of optical fibers. However, few studies have been done on these issues for optical burst switching (OBS) networks. Protection and restoration are essential mechanisms for guaranteeing more reliable traffic delivery services. But it is not easy to apply existing mechanisms to optical burst switching (OBS) networks due to its one-way reservation signaling and the statistical burst multiplexing. Thus, to achieve the high transmission performance and reliability simultaneously, unique properties of OBS must be considered in the design of protection scheme. In this paper, an optimal protection and restoration scheme (OPARS) has been introduced that not only optimizes the number of provisioned protection wavelengths adaptively based on the traffic load as well as the quality of service (QoS) requirements of bursts in high speed networks but also minimizes burst loss rates. In addition, the proposed scheme has been used as an efficient contention resolution technique. The simulation results verify that the proposed scheme improve the network resource and channel utilization while guaranteeing the targeted protection reliability and QoS requirements of bursts.     

An Intelligent Segmented Burst Assembly Mechanism in Optical Burst Switching Networks

We focus on the burst assembly mechanism and propose a new intelligent method in which the burst is assembled from several internet protocol （IP） packets in which the number of IP packets is changed according to the traffic load and the burst is segmented into several parts, called the ISOBS mechanism. The average burst assembly time of the ISOBS mechanism decreases as compared with the fixed-assembly-time and fixed-assembly-time-and- length mechanisms. The loss ratio decreases 50% as compared with the general optical burst switching （OBS） mechanism. The last segment can carry high quality of service （QOS） information. We can achieve that the loss ratio of the last segment is almost zero when the traffic load is less than 0.05. When the traffic load is 0.9, the loss ratio of the last segment is 0.0041. The ISOBS can support to transmit different QOS data.     

Performance enhancement of optical burst switched networks

Optical burst switching (OBS) is an optical switching paradigm which offers a good tradeoff between the traditional optical circuit switching (OCS) and optical packet switching (OPS) since it has the relatively easy implementation of the first and the efficient bandwidth utilization of the second. Hence, 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. In an OBS network, burst-loss performance is a critical concern. In OBS, the data-burst transmission is delayed by an offset time (relative to its burst control packet (BCP), or header) and the burst follows its header without waiting for an acknowledgment for resource reservation. Thus, a burst may be lost at an intermediate node due to contention, which is generally resolved according to the local routing and bandwidth information. The routing table maintained in each OBS node is generally pre-computed and fixed to forward the data bursts. Such a static forwarding feature might have limited efficiency to resolve contentions. Moreover, a burst may be lost and the network may be congested when a network element (e.g., fiber link) fails. In this paper, an efficient integrated scheme based on dynamic routing and burst segmentation has been proposed to improve reliability of data transport and network load balancing in optical burst switched networks. Simulation results demonstrate that the proposed approach reduces effectively blocking probability and hence contention. Further, it provides end-to-end throughput performance also. Hence, it establishes an appropriate tradeoff between loss rate and end-to-end throughput.     

A novel scheme based on minimum delay at the edges for optical burst switching networks

This paper proposes a novel scheme based on minimum delay at the edges (MDE) for optical burst switching (OBS) networks. This scheme is designed to overcome the long delay at the edge nodes of OBS networks. The MDE scheme features simultaneous burst assembly, channel scheduling, and pre-transmission of control packet. It also features estimated setup and explicit release (ESXR) signaling protocol. The MDE scheme can minimize the delay at the edge nodes for data packets, and improve the end-to-end latency performance for OBS networks. In addition, comparing with the conventional scheme, the performances of the MDE scheme are analyzed in this paper.     

An efficient fault localization or detection mechanism for high speed optical networks

Optical burst switching (OBS) has been considered as the gate through which the envisaged world of optical Internet will be conquered by implementing Internet Protocol (IP) software directly over a wavelength-division-multiplexing (WDM) optical layer (IP/WDM). The main feature for designing next generation optical networks is protecting and restoring high capacity WDM networks from the failures. Quick detection, identification and restoration make networks more strong and consistent even though the failures cannot be avoided. Hence, it is necessary to develop fast, efficient and dependable fault localization or detection mechanisms. In this paper, an efficient scheme for OBS networks has been proposed to provide fast restoration of links with minimum delay as well as blocking probability. By simulation results, it is shown that the proposed OBS scheme achieve less blocking probability and delay while getting higher throughput in comparison to conventional schemes.     

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.     

An efficient scheme for optimizing channel utilization in OBS networks

Optical burst switching (OBS) is an emerging technology that allows variable size data bursts to be transported directly over DWDM links. In order to make OBS a viable solution, the wavelength scheduling algorithms need to be able to utilize the available wavelengths efficiently, while being able to operate fast enough to keep up with the burst incoming rate. Unfortunately, horizon scheduling cannot utilize the voids created by previously scheduled bursts, resulting in low bandwidth utilization. To date, Min-SV is the fastest scheduling algorithm that can schedule wavelengths efficiently. However, its complexity is O (log m) and it requires 10 log (m) memory accesses to schedule a single burst. This means that it can take upto several microseconds for each burst request, which is still too slow to make it a practical solution for OBS deployment. In this paper, an efficient scheme has been proposed for optimizing channel utilization in OBS networks. In the proposed approach, a burst is represented by an interval of time. The process of scheduling a number of bursts, thus, turns to be a process of fitting a set of the corresponding time intervals on a channel time line that represents a channel-time resource. By doing so, the scheduling process can be formulated as a combinatorial optimization problem. Then, graph theory is applied to schedule as many non-overlapping intervals as possible onto the channel time line. The underlying concept of the proposed scheduling scheme is that of briefly delaying the scheduling of a burst so that a much better decision can be made about a number of bursts all-together. This scheme is shown, through simulations, to improve performance in terms of burst loss probability, channel utilization, fairness-control and data throughput over existing schemes. Thus the proposed scheme is well suited for high performance networks in terms of reliability.     

Impairment-aware QoS provisioning in dual-header OBS networks

Signal degradation due to physical impairments may result in unacceptable bit-error rates of received signals at the destination. Based on earlier work, we study the impairment-aware quality of service (QoS) provisioning problem in dual-header optical burst switching (OBS) networks that employ two control packets for each data burst. At an OBS node, the proposed algorithm schedule bursts for transmission by searching for available resources using admission control and preemption. The algorithm also verifies signal quality. Simulation results show that this algorithm is effective in providing QoS support in OBS networks while considering physical impairment effects.     

A QoS-Guanranteed Scheduling Algorithm with High Throughput for Edge Nodes of Optical Burst Switching Networks

A scheduling algorithm for the edge nodes of optical burst switching (OBS) networks is proposed to guarantee the delay re quirement of services with different CoS (Class of Service) and provide lower burst loss ratio at the same time. The performance of edge nodes based on the proposed algorithm is presented.     

A new burst assembly technique for supporting QoS in optical burst switching networks

This letter proposes a new burst assembly technique for supporting QoS in optical burst switching (OBS) networks. It consists of the adaptive-threshold burst assembly mechanism and QoS-based random offset-time scheme. The assembly mechanism, which is fit well to multi-class burst assembly, not only matches with IP QoS mechanism based on packet classification, and also utilizes fairly and efficiently assembly capacity. Based on token-bucket model and burst segment selective discard (BSSD), the offset-time scheme can smooth the traffic to support OBS QoS. The simulation results show that the technique can improve the performance in terms of packet loss probability (PLP).     

一种光突发交换网络中降低填充开销的突发组装算法(英文)

针对光突发交换(OBS)网络现有组装算法在输入业务量较小时组装填充开销较大的性能缺陷,提出了一种新的突发组装算法,称之为BPRA算法.该组装算法通过改变突发生成时间,在不增加端到端时延的条件下利用偏置时间来延长突发组装时间,从而可以有效降低填充空闲比特的数目.同时提出一个近似分析模型来计算空闲比特填充概率.分析和仿真结果表明BPRA算法可以明显降低组装填充开销.     

A maximum-efficiency-first multi-path route selection strategy for optical burst switching networks

In this paper, the impact of a path selection on other existing paths in optical burst switching (OBS) networks is studied by analyzing the contention among different traffic streams and the interaction between the route selection and traffic load balance. The results show that there exists a mutual reinforcement interaction among the traffic load of a path, the path burst loss ratio and the contention ability of the path when burst loss ratio based multi-path selection strategies are adopted, which may increase the unbalance of traffic and lead to severe congestion further. A maximum-efficiency-first multi-path selection strategy, which considers the performance of the burst flows and the impact of a path selection on existing OBS paths at the same time by a combined metric of route efficiency, is proposed to maximize the utility of the burst flows and minimize the increment of lost throughput on the path. The performance of the proposed multi-path selection strategy is evaluated through simulation. The results show that the presented strategy obviously outperforms the least burst loss ratio strategy and shortest path first strategy in terms of the burst loss ratio in the practical unbalanced background traffic, especially when the network is heavily loaded.     

一种新的光突发交换网络信令协议与分析

提出了一种新的光突发交换网络信令协议,即DSH区分服务混合信令.根据实时（电路仿真）业务和非实时（数据）业务对QoS的不同要求分别采用TAW和JET信令控制协议,尤其是对TAW信令做了相应改进,使之更适合于OBS网络承载电路仿真业务.利用电路仿真业务发出的呼叫请求,在端到端的波长通道中建立虚通路,并在整个呼叫持续过程中保持虚通路的连接,这样可以保证电路仿真业务的端到端时延最小并避免信息丢失.通过理论分析和系统仿真,研究了DSH混合信令的性能及其对波长利用率和实时业务呼损率的影响.     

Performance analysis of an improved burst-outputted model for an OBS core router

Differentiated probability outputted scheme (DPOS) is an improved burst-outputted paradigm in optical burst switching (OBS) core routers. In this paper, the blocking performance for multi-priority traffic in a DPOS applied OBS core router with limited buffers has been analyzed and discussed firstly. Several simulation results indicted that DPOS had a better performance in blocking than the outputted model presented in the previous work had. Besides, our proposed scheduling mechanism can supported the quality-of-service (QoS) efficiently for OBS networks.