论文信息 - Performance Analysis of Particle Swarm Optimization Based Routing Algorithm in Optical Burst Switching Networks

Performance Analysis of Particle Swarm Optimization Based Routing Algorithm in Optical Burst Switching Networks

Abstract Optical burst switching (OBS) has been regarded as the next generation optical switching technology. In this paper, the routing problem based on particle swarm optimization (PSO) algorithm in OBS has been studies and analyzed. Simulation results indicate that, the PSO based routing algorithm will optimal than the conversional shortest path first algorithm in space cost and calculation cost. Conclusions have certain theoretical significances for the improvement of OBS routing protocols.

Rui Hou | Junle Yu

[1] Song Xu,et al. Smoothing Method for Minimax Problems , 2001, Comput. Optim. Appl..

[2] Imtiaz Ahmad,et al. Particle swarm optimization for task assignment problem , 2002, Microprocess. Microsystems.

[3] M Reyes Sierra,et al. Multi-Objective Particle Swarm Optimizers: A Survey of the State-of-the-Art , 2006 .

[4] Peng-Yeng Yin,et al. A hybrid particle swarm optimization algorithm for optimal task assignment in distributed systems , 2006, Comput. Stand. Interfaces.

[5] Chunming Qiao,et al. Optical burst switching (OBS) - a new paradigm for an Optical Internet^{1} , 1999, J. High Speed Networks.

[6] SuKyoung Lee,et al. Contention-based limited deflection routing protocol in optical burst-switched networks , 2005, IEEE Journal on Selected Areas in Communications.

[7] M. M. Paassen,et al. Optimization of Flexible Approach Trajectories Using a Genetic Algorithm , 2006 .