Contention avoidance using dual-fuzzy assembly threshold algorithm in optical burst switching networks

To avoid burst contention efficiently,on the basis of feedback-based source flow-rate control(SFC) strategy,a novel fuzzy-control-based assembly algorithm,called dual-fuzzy assembly threshold(DFAT),is proposed in an optical burst switching network.In our algorithm,according to the variations of burst assembly period and the interarrival of burst control packet,the traffic states of edge-switching nodes and core-switching nodes are first obtained.Then,the assembly threshold of bursts is set dynamically in order to operate the source traffic management from the information of traffic states.The performance of DFAT algorithm on burst loss probability is evaluated,and simulation results show that,compared with conventional assembly algorithms,the proposed scheme can constrain the birth of burst contention efficiently,when being a heavy load state of network.

Implementation of Efficient Burst Assembly Algorithm with Traffic Prediction

This paper reports on the implementation of efficient burst assembly algorithms and traffic prediction. The ultimate goal is to propose a new burst assembly algorithm which is based on time-burst length （hybrid） threshold with traffic prediction to reduce burst assembly delay in OBS （Optical Burst Switching） networks. Research has shown that traffic always change from time to time, hence, any measure that is put in place should be able to adapt to such changes. With our implemented burst assembly algorithm, the traffic rate is predicted and the predicted rate is used to dynamically adjust the burst assembly length. This work further investigates the impact of the proposed algorithm on traffic self similarity.

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

Burst Assembly Schemes and Performance Evaluation in Optical Burst Switching Networks

Several proposed assemble algorithms for Optical Burst Switching (OBS) network is described, and the feature relative merits is discussed and analyzed in this paper. The authors propose an assembly mechanism FAT where time threshold is fluctuating randomly to reduce continuous blocking rate. With network simulation, the basic performance of these assembly schemes is compared and analyzed. The results show that burst loss ratio and assembly delay of the proposed FAT mechanism is better than that of exist assemble mechanism.

Priority-Based Mixed Assembly Supporting Differentiated Service for Optical Burst Switched Networks

In order to have a better support of differentiated service, we propose Priority-based mixed burst assembly, in which packets of different priorities are assembled in a burst with an assigned proportion, and the priorities are lined in an ascending order in a burst from head to tail. Simulation results show that the proposed scheme performs very well in terms of latency and packet loss probability.