Priority-based Time Slot Assignment Algorithm for Hierarchical Time Sliced Optical Burst Switched Networks

摘要

Bandwidth-greedy applications are in continuous development. These applications are testing the bandwidth limit of current telecommunication and computer network infrastructures. Optical Burst Switching (OBS) is a promising optical switching technology to meet bandwidth requirements of such applications in the near-future. However, due to lack of matured and cost effective optical equipments, such as optical memories, this technology still suffers from high burst drops ratio as a result of contention in the core node. Many approaches have been proposed and evaluated to address this issue. In this paper, a priority-based time slot assignment algorithm, which we named as Priority-based segmented train algorithm (PSTA) is introduced and analyzed for Hierarchical Time Sliced OBS (HiTSOBS) a newly developed slotted OBS variant. The evaluation aims at comparing the performance of PSTA and that of HiTSOBS in terms of burst loss ratio and delay. Simulation results demonstrate that PSTA outperforms time slot assignment scheme used in HiTSOBS