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.     

United assembly algorithm for optical burst switching

Optical burst switching (OBS) is a promising optical switching technology. The burst assembly algorithm controls burst assembly, which significantly impacts performance of OBS network. This paper provides a new assembly algorithm, united assembly algorithm, which has more practicability than conventional algorithms. In addition, some factors impacting selections of parameters of this algorithm are discussed and the performance of this algorithm is studied by computer simulation.     

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).     

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.     

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

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

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.     

A new prediction method at the edge of optical burst switching network

To achieve lower assembly delay at optical burst switching edge node, this paper proposes an approach called current weight length prediction (CWLP) to improve existing estimate mechanism in burst assembly.is introduced to make a dynamic tradeoff between the current and past traffic under different offset time.Simulation results show that CWLP can achieve a significant improvement in terms of traffic estimation in various offset time and offered load.     

A novel differentiated services supporting scheme for optical burst switched networks

In this letter, we analyze the drawback of tail-dropping contention resolution in optical burst switched networks. Once contention occurs, we adopt modified head-dropping policy to resolve contention. This policy drops the head of the contending burst only if the overlapping region of the two bursts is less than the whole contending burst size, otherwise drops the whole contending burst. In order to have a better support of differentiated service, a new burst assembly policy, namely, Priority-based proportional mixed burst assembly, is proposed. Simulation results show that the proposed scheme performs very well in terms of performance metrics such as the times of contention and packet loss probability.     

Hybrid approach for loss recovery mechanism in OBS networks

This letter reports a study of a hybrid burst assembly and a hybrid burst loss recovery scheme （delay-based burst assembly and hybrid loss recovery （DBAHLR）） which selectively employs proactive or reactive loss recovery techniques depending on the classification of traffic into short term and long term, respectively. Traffic prediction and segregation of optical burst switching network flows into the long term and short term are conducted based on predicted link holding times using the hidden Markov model （HMM）. The hybrid burst assembly implemented in DBAHLR uses a consecutive average-based burst assembly to handle jitter reduction necessary in real-time applications, with variations in burst sizes due to the non-monotonic nature of the average delay handled by additional burst length thresholding. This dynamic hybrid approach based on HMM prediction provides overall a lower blocking probability and delay and more throughput when compared with forward segment redundancy mechanism or purely HMM prediction-based adaptive burst sizing and wavelength allocation （HMM-TP）.     

Design of assembly control algorithm based on burst-size feedback for optical burst switching network

A novel assembly control algorithm named burst-size feedback adaptive assembly period （BFAAP） is proposed. The major difference between BFAAP and other similar adaptive assembly algorithms is that the control curve of BFAAP is dynamically adjusted according to the feedback of outgoing burst size. BFAAP is compared with two typical algorithms fixed assembly period （FAP） and min-burst length max- assembly period （MBMAP） in simulation in terms of burst size distribution and assembly period. Moreover, the transmission control protocol （TCP） performance over BFAAP is also considered and simulated.     

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.     

Investigations on burst length in optical burst switched networks

In this paper, we investigate the performance of optical burst switched networks for erbium-doped fiber amplifiers (EDFAs) and semiconductor optical amplifiers (SOAs). We show that EDFAs are more suitable for burst switching as compared to SOAs. We further investigate the burst length for 18, 24.6 and 55 km optical switched network. It is observed that burst length should neither be very small nor very large. If the burst length is small, throughput will be less, and if the burst length is very large, delay will be very large. This is due to higher wait times incurred when packets are formed into larger bursts causing additional overall delay. It is observed that performance decreases up to a small burst length of 1500 μs, which is the minimum burst length required for the creation of the burst. Once this burst is created, there is significant improvement in the quality factor up to 3000 μs. After this burst length, the performance again degrades. Hence the burst length can be optimized for the best quality factor in optical burst switched networks. We further show that by increasing EDFA gain, the quality deteriorates as increasing the EDFA gain results in increased levels of additive phase noise, which can further induce nonlinearities.     

TCP在光突发交换试验网络中性能的实验研究

在光突发交换试验网络中对TCP的性能进行了实验研究.首先研究了丢包对网络性能的影响,表明突发包丢失将导致TCP吞吐量的快速下降,并且丢包率越高,可用的TCP传输带宽越窄.然后分别详细研究了OBS试验网络中的延时损伤和报文段关联增益,以及对TCP传输性能的影响.最后综合考虑这些因素.实验结果表明,在本OBS试验网络中存在一个不随丢包率变化的最优化突发包组装时间250us使得可用TCP带宽最大化.为了最大限度地提高TCP的传输性能,组包时间应该选择等于或稍大于这个最优值.     

光突发交换边缘路由器性能分析

本文详细分析了各种因素对光突发交换边缘路由器的性能的影响.结果显示,不同服务等级的时延要求可以通过控制组装的最大时延得以保证;不同等级数据包长的大范围变动会导致信道分配的不公平性;边缘节点越多,丢包率越高;在总输出容量一定的情况下,增加输出数据信道数可以在获得低的丢包率的同时达到较高的通道利用率,但随着边缘节点数的增加,增加输出信道数对丢包率的改善作用下降.     

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.     

OBS网络中一种基于优先级和门限的偏射路由算法

为了解决偏射算法在偏射控制上的问题,提出了一种基于优先级和门限的偏射路由算法.该算法采用丢弃少量偏射的高优先级分割突发数据包来保证偏射路由上低优先级非偏射突发数据包的QoS.当冲突发生时,分割偏射优先级低的突发数据包,从而保护高优先级突发数据包|在偏射路由上,通过启用偏射检测函数来判断是允许偏射的分割突发数据包抢占资源或是丢弃偏射的分割突发数据包.仿真结果表明,虽然该算法增加了少量的端到端的传输时延,但这种算法可以很好地控制偏射突发对网络偏射路由上正常流量的影响,并且能够有效地降低整个网络的丢包率,很好地保护高优先级突发数据包的完整性.故这种方法能够有效地提高OBS网络的性能.     

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 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.     

一种适用于光突发交换的区分型资源预留机制

将边缘结点突发汇聚算法与核心结点资源预留机制有机结合,提出了一种适用于光突发交换的区分型资源预留机制.引入“突发流”的概念,在边缘结点采用基于线性预测的突发汇聚算法将输入IP分组汇聚为单个突发或突发流;在核心结点引入“搭载请求”的思想,对单个突发和突发流采用不同的资源预留方案.仿真结果表明区分型资源预留机制可以明显改善光突发交换网络的丢失性能.     

Contention reduction and service differentiation in OBS networks

Optical burst switching (OBS) has been proposed to be a competitive switching technology for wavelength division networks (WDM) networks. In this switching technique, single burst loss due to contention influences loss of multiple data. Thus, burst loss ratio (BLR) is the main deciding factor for determining the performance of an OBS network. Also, inefficient data channel scheduling algorithm causes burst loss in OBS. In addition to this, the same service to all model of the current Internet is inadequate for the diverse quality of service expectations of Internet applications and users. In this paper, an efficient technique is proposed in which data burst is assembled from several Internet protocol (IP) packets in such a manner that the number of IP packets is changed according to the traffic load. In the proposed scheme, the burst is segmented because the segment located at the end of the contended burst has a greater chance of surviving contention (as the dropped segments are those at the beginning of the contending burst). Thus, the most important (or higher priority) information is enveloped in the last segmented. Further to prevent resource wastage due to over admitting of bursts, the proposed scheme is extended by admission control test for an output link without a fiber delay line (FDL) buffer. Also, modified latest available unscheduled channel with void filling (LAUC-VF) scheduling algorithm utilizing MPLS has been used to provide a scalable and manageable architecture for service differentiation (DiffServ) in IP networks. Simulation results demonstrate that the proposed technique has reduced burst loss rate and better quality of service (QoS) performance in comparison to existing techniques.