A simulative comparison of dynamic multi-path routing algorithms for OBS networks

• Published in: 2016 39th International Conference on Telecommunications and Signal Processing (TSP) pp. 746 - 752
• Main Authors: Khan, Farrukh Zeeshan, Hayat, Muhammad Faisal, Holynski, Tomasz
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.06.2016
• Subjects: Algorithm design and analysis; Dynamic routing; Heuristic algorithms; load balancing; Load modeling; Measurement; network topology; optical burst switching; Optical packet switching; Probabilistic logic; Routing; simulation
• DOI: 10.1109/TSP.2016.7760984

This paper reports extensive simulations of the dynamic routing techniques for optical burst switching (OBS) networks. It gives a summary of the already proposed algorithms and describes more broadly some of them. It introduces also a new one called the Weighted Link Congestion and Frequency (WLCF) algorithm. Our comparative simulations are performed using an in-house developed environment in which all the OBS mechanisms are implemented in detail. Considering various network topologies and traffic scenarios, we show that basically WLCF performs better than other routing strategies in terms of mean burst blocking probability averaged over the whole network, and, thus, increases the overall network throughput.