Migration of IP Routing Points for Distributed Virtual Routing using Binary PSO

In this paper, we propose a method for the dynamic migration of the IP routing points using binary particle swarm optimization (PSO) in distributed Virtual LAN environments. Virtual LAN (VLAN) is a virtualization technique of datalink layer and can construct arbitrary logical networks on top of a physical network. However, VLAN often causes much redundant traffic due to mismatch between the topology of the logical network and that of the underlying physical network. We will show that the proposed method can adaptively select the routing points dynamically according to the observed traffic patterns and thus reduce the redundant traffic. Finally, we will evaluate the proposed method using the simulation environment.

[1]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[2]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[3]  Riccardo Poli,et al.  Analysis of the publications on the applications of particle swarm optimisation , 2008 .

[4]  Gerry Dozier,et al.  Adapting Particle Swarm Optimizationto Dynamic Environments , 2001 .

[5]  David A. Maltz,et al.  Towards Systematic Design of Enterprise Networks , 2008, IEEE/ACM Transactions on Networking.

[6]  Maurice Clerc,et al.  The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..

[7]  Nan Zhang,et al.  Characterizing VLAN usage in an operational network , 2007, INM '07.

[8]  Pin Luarn,et al.  A discrete version of particle swarm optimization for flowshop scheduling problems , 2007, Comput. Oper. Res..

[9]  J. Kennedy,et al.  Population structure and particle swarm performance , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).