Research On Dynamic Bandwidth Scheduling Technology Of Optical Burst Transport Network

Optical Burst Transport ring Network (OBTN) as a novel all-optical metropolitan area network (MAN) that supports flexible bandwidth granularity of all-optical sub-wavelength switching. Not only can amicably adapt to the explosive growth of bursty data services in communication networks, enabling the future all-optical networks or data centers to meet the demand of large capacity and dynamic bandwidth allocation (DBA). Besides, OBTN also can effectively circumvent the immature development of ultra-high-speed all-optical logic devices, not to mention the poor technology of optical cache. Compared with the conventional WDM-based MAN, OBTN requires only N, rather than N*(N-1) transceivers to achieve fully meshed lightpaths in an N nodes network, avoiding electric field treatment for data packets’transmission and producing incredible cost-efficiency and network scalability.In this dissertation, we focus our in-depth researches on the key technologies of OBTN’s realization, especially for the working mechanism and dynamic bandwidth scheduling techniques, and have made some innovative achievements. The main contributions of the dissertation are as follows:By analyzing the network node architecture of OBTN which equips with Fixed Transmitters and Tunable Receivers (FTTR) or Tunable Transmitters and Tunable Receivers (TTTR) respectively, we design the basic operation mechanism and dynamic resource scheduling scheme. Subsequently, an unordinary contention problem in OBTN which we call "master-penetrated" collisions is fully described. On this basis, the fixed-length timeslot-based dynamic resource scheduling mechanism with centralized control has been proposed, as well as other practical networking constraints.As the major innovation of this dissertation, several feasible and efficient enough DBA algorithms for both FTTR-based and TTTR-based OBTN have been proposed. Each novel DBA algorithm gains burst data confliction-free by dividing the algorithm into OB assignment and timeslot mapping, while the former offers QoS guarantee and fairness between master-penetrated and non-master-penetrated connections; the latter maps OBs into bandwidth map with negligible OB loss by employing our skillful mapping schemes. Furthermore, a prediction DBA algorithm based on AR(n) model has also been proposed for the network scenario that DBA periods are much longer than the ring length. Simulation results show that the designed algorithms can increase the bandwidth utilization with22.9%under no packet loss(for FTTR-based algorithms); while save50%wavelength recourses to achieve considerable network throughput under a uniform distributed network flow(for TTTR-based algorithms) and improve the average packet delay with85%under moderate traffic load(for predictive-based algorithms).Finally, an OBTN simulation platform that supports simulations both for FTTR-based and TTTR-based network scenarios has been built up with OPNET Modeler. Every DBA algorithm can be verified under plenty configuration interface for simulation parameters and unified evaluation criteria for DBA algorithm performance.