Optical Burst Switching Network Data Channel Scheduling Problem

With the development and maturity of WDM technology, it becomes possible to realize all-optical switch in large capacity intermediate nodes of optical networks. Currently there are three methods under investigation: OCS, OBS and OPS, among which OBS (optical burst switching) is most promising because its proper granularity and technological feasibility.Key technologies for OBS networks include: Edge node assembly algorithm, resource reservation mechanism, transmission control protocol, QoS mechanism as well as channel scheduling algorithm. The data channel scheduling algorithm and the network packet loss rate, channel utilization, Qos support many aspects, such as closely related to the merits of its algorithm to the entire network greatly affect the performance, is an important research topic. A good method should be before the arrival of the burst, as far as possible to choose a burst of available channels to reduce the rate of sudden loss of the package, and can effectively support the distinction between business.This paper will introduce the OBS network background, the basic concept and several key technologies, three switching technology will be analyzed and compared, particularly optical burst switching technology will be evaluated. Then in the second chapter on the OBS network structure, detailed in Chapter III of the OBS network of a number of key technologies. The main contribution of this innovation is the fourth chapter - based on the sudden array of available channel algorithm. The final chapter is on the work of the author's summary and outlook.Chapter IV on the main channel of the OBS network algorithm. First on the current two typical channel algorithm: LAUC (Latest available unscheduled channel) algorithm and LAUC-VF (Latest available unscheduled channel-void filling) algorithm. Then discussed the FAFA (First arrival first assignment) algorithm and the priority of re-scheduling algorithm. One, FAFA algorithm is LAUC-VF algorithm improved algorithm, re-scheduling algorithm combines the LAUC and LAUC-VF two typical advantages of the algorithm (high-performance, low packet loss and low complexity)The simulation we compare the performance of several algorithms that the advantages and disadvantages of the various algorithms. On this basis, the first time proposed a sudden array of available channels the concept and suggested that based on the sudden array of available channel algorithm. The search algorithm in only one data channel group circumstances, can achieve the effect of multiple re-scheduling to avoid unexpected packages for a number of search channel group and also to avoid a sudden need to be re-scheduling package at the time because of lack of bias Once again in search channel group which burst was discarded. Simulation of the last papers of the algorithm, and designed for the burst packet establishment of an array of channels available methods and steps.