Dynamic threshold-based algorithms for communication networks
A need to use dynamic thresholds arises in various communication networking scenarios under varying traffic conditions. In this thesis, we propose novel dynamic threshold-based algorithms for two different networking problems, namely the problem of burst assembly in Optical Burst Switching (OBS) networks and of bandwidth reservation in connection-oriented networks. Regarding the first problem, we present dynamic threshold-based burst assembly algorithms that attempt to minimize the average burst assembly delay due to burstification process while taking the burst rate constraints into consideration. Using synthetic and real traffic traces, we show that the proposed algorithms perform significantly better than the conventional timer-based schemes. In the second problem, we propose a model-free adaptive hysteresis algorithm for dynamic bandwidth reservation in a connection-oriented network subject to update frequency constraints. The simulation results in various traffic scenarios show that the proposed technique considerably outperforms the existing schemes without requiring any prior traffic information.